{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"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":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"DM1","name":"Aggregate boundaries","shortDescription":{"text":"Aggregate boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/DM1"},{"id":"DM2","name":"Strongly-typed ids","shortDescription":{"text":"Strongly-typed ids"},"helpUri":"https://codehealth.canine.dev/dimensions/DM2"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM5","name":"Encapsulated state","shortDescription":{"text":"Encapsulated state"},"helpUri":"https://codehealth.canine.dev/dimensions/DM5"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P11","name":"BDD / executable specs","shortDescription":{"text":"BDD / executable specs"},"helpUri":"https://codehealth.canine.dev/dimensions/P11"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::event_loop::run_event_loop (cyclomatic 847): codewhale_tui::tui::ui::event_loop::run_event_loop has cyclomatic complexity 847 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"126cb26ebeedac5839e591bd3812a2279ee928cfd78cddc20206c2d1c140ac1a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::handlers::handle_view_events (cyclomatic 245): codewhale_tui::tui::ui::handlers::handle_view_events has cyclomatic complexity 245 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/tui/src/tui/ui/handlers.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8e067ac444e3f56b11148c5a654443dda6bbfa1a37faa47d23f69ae6ae1dcc"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::monitor_turn (cyclomatic 217): RuntimeThreadManager::monitor_turn has cyclomatic complexity 217 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16827}}}],"partialFingerprints":{"codehealthFindingId/v1":"e608a989859a810ab47f752e1b18f176c397b2061c120eda8c70c7f90d5090d0"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_command_result_inner (cyclomatic 212): codewhale_tui::tui::ui::apply::apply_command_result_inner has cyclomatic complexity 212 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/tui/src/tui/ui/apply.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0acddb84222cc00b99064c73d4d9327b085d30478cc4b8949a18f008ee60fb"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::config::apply_env_overrides_unlocked (cyclomatic 188): codewhale_runtime::config::apply_env_overrides_unlocked has cyclomatic complexity 188 (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/runtime/src/config.rs"},"region":{"startLine":8267}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee7d8e1b83468c44bae9ab1d0be31284b7bdd053f86a268a96c584fe92b3354"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::config_main_host::set_config_value (cyclomatic 178): codewhale_tui::commands::config_main_host::set_config_value has cyclomatic complexity 178 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/tui/src/commands/config_main_host.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c89ffaf8505b41409afc7a92b9f41f1970049ae5b237299a72905a95081a70"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::exec_agent::run_exec_agent (cyclomatic 152): codewhale_app_server::exec_agent::run_exec_agent has cyclomatic complexity 152 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/app-server/src/exec_agent.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a04be297a6257aff93526cc5c3f1df6a9bc5bfa0e5d3ad403a81e973297978"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::run_doctor (cyclomatic 146): codewhale_tui::run_doctor has cyclomatic complexity 146 (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/tui/src/lib.rs"},"region":{"startLine":5300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1150067ed671e8a4f667f5bc915b994256156de76f277b3e491c751348b558e8"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderPickerView::handle_key (cyclomatic 136): ProviderPickerView::handle_key has cyclomatic complexity 136 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/tui/src/tui/provider_picker.rs"},"region":{"startLine":4856}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccebd306f8b00b97d09c1d42bf6bb2843a80c48ba43ad40e3a862669e0ebb551"}},{"ruleId":"D1","level":"warning","message":{"text":"BashTool::execute (cyclomatic 125): BashTool::execute has cyclomatic complexity 125 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/src/tools/shell.rs"},"region":{"startLine":6110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dbee4753603d9f6f33df36bdc477d0a6c7e7c50d2dff54bd0248dc4f33c01f"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::run_model_step (cyclomatic 123): Engine::run_model_step has cyclomatic complexity 123 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/src/core/engine/turn_loop/model_step.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38349b8b274db1c13e6d138f79816d47e359987ef71630725e042eb507f6b15"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::render_latex_to_string (cyclomatic 123): codewhale_tui::tui::history::latex_render::render_latex_to_string has cyclomatic complexity 123 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/tui/src/tui/history/latex_render.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bff5708453d81fbdc5929af5c2c33c65f35db011c1890a3706ba0aeeb47b2f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::plan_tool_calls (cyclomatic 120): Engine::plan_tool_calls has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"81465850d67d316b7498820959f833d1952ef2363471662ca87e3b81a5eacef5"}},{"ruleId":"D1","level":"warning","message":{"text":"evidence.analyzeEvidence (cyclomatic 113): evidence.analyzeEvidence has cyclomatic complexity 113 (threshold 15). Of this number, 97 points are the body\u0027s own statements and 16 belong to 9 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/evidence.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf0be12f6e9ab34d74f3b26e47ecc5fd8456370a3f5b2087ead05610833e6dd"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::run_owned (cyclomatic 111): Engine::run_owned has cyclomatic complexity 111 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/src/core/engine.rs"},"region":{"startLine":3888}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a387ab94969ff6b4d8eabb7ce3656007a2e32f33545daa09b6eb4578f14b9f5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::reasoning_effort::apply_reasoning_effort (cyclomatic 108): codewhale_engine::client::reasoning_effort::apply_reasoning_effort has cyclomatic complexity 108 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/reasoning_effort.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"79911fc7745f3f18f2bbe9917d7a8d8e5f25fdc19ba395032ffe01a028b2b569"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::config_main_host::show_single_setting (cyclomatic 104): codewhale_tui::commands::config_main_host::show_single_setting has cyclomatic complexity 104 (threshold 15). Of this number, 87 points are the body\u0027s own statements and 17 belong to 3 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/tui/src/commands/config_main_host.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b4ff105ef9372d639a6c288386061a2475bd7c565ed54d7d4f78e652c04ede"}},{"ruleId":"D1","level":"warning","message":{"text":"route.POST (cyclomatic 101): route.POST has cyclomatic complexity 101 (threshold 15). Of this number, 76 points are the body\u0027s own statements and 25 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/post/route.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95f37e6a3b7fb5d3736689748a51b1bd31725c5284acafbd521becfaf7ac8b4"}},{"ruleId":"D1","level":"warning","message":{"text":"scene.createOcean (cyclomatic 99): scene.createOcean has cyclomatic complexity 99 (threshold 15). Most of this is not in the body itself: 3 of the 99 points are its own statements and the rest belongs to 27 function items inside it that branch (a function literal at line 152, a function literal at line 173, buildColors, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/scene.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc18d25a0c68e8950bc6dc8773cdb0a13d74d409504bdc1219b119b3137583e"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::start_turn_with_narrowing (cyclomatic 96): RuntimeThreadManager::start_turn_with_narrowing has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13895}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e466c8ae6dfba87b516751e3f4b2ddffa93b13d9cd42b8874129d77b9a96cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Expander::expand (cyclomatic 96): Expander::expand has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/execpolicy/src/shell_expand.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb38b35033b99bd848b084c1a410ecc0807cb7ae570283c70896528ab0f6d9d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::run (cyclomatic 94): codewhale_cli::run has cyclomatic complexity 94 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/cli/src/lib.rs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"429112878657d82830fd87afb5cc2d76ca4c9b9ec30c0a98bf9de742834cb48a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::run_async_main_dispatch (cyclomatic 92): codewhale_tui::run_async_main_dispatch has cyclomatic complexity 92 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/tui/src/lib.rs"},"region":{"startLine":2715}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca664fbbd591e7da607d7f6c354ae9bef449e645a97e2b754243d4de9385944"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::computer::run (cyclomatic 89): codewhale_account_cli::computer::run has cyclomatic complexity 89 (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/account-cli/src/computer.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d452aabf24d3d3ab049a3c8e40b5584d55a3eccf5ec888962ea9dd6058f4dc15"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::owner::run_world (cyclomatic 87): codewhale_tui::tui::pet_watch::owner::run_world has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/owner.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3262e7ed19379aab377f0fe021fc9ce05a530f39246aace3d7a1afc5c88978ae"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::handle_admitted_operation (cyclomatic 82): Engine::handle_admitted_operation has cyclomatic complexity 82 (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/engine/src/core/engine.rs"},"region":{"startLine":6815}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c8276489841933ba9ddee4f7ced1e4cefe08c2cee744a69df4a2bd825346ec"}},{"ruleId":"D1","level":"warning","message":{"text":"PetEngineTelemetry.observe (cyclomatic 81): PetEngineTelemetry.observe has cyclomatic complexity 81 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own 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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd0ac7c02d4c63bb87744ef0825eafcbb4e52bea1ed7a2f28298f8784d28cf5"}},{"ruleId":"D1","level":"warning","message":{"text":"PetEngineTelemetry.observe (cyclomatic 81): PetEngineTelemetry.observe has cyclomatic complexity 81 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30b5b4fe27f6fab92ef3dc26a260dd5619c6fa5025ca96c934c1f1a978acf7e"}},{"ruleId":"D1","level":"warning","message":{"text":"PetEngineTelemetry.observe (cyclomatic 81): PetEngineTelemetry.observe has cyclomatic complexity 81 (threshold 15). Of this number, 74 points are the body\u0027s own statements and 7 belong to 4 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-engine.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89f045fd5876595069c40194a97aab7e1091c8a49213f01505f091014b6a415"}},{"ruleId":"D1","level":"warning","message":{"text":"install.httpRequest (cyclomatic 79): install.httpRequest has cyclomatic complexity 79 (threshold 15). Most of this is not in the body itself: 7 of the 79 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 547, 592, 668, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"492059ea103ea9b5cb41dc5afa18a8e0e77517db2edcbb3c0beee30c1b29ca21"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::mouse_ui::handle_mouse_event (cyclomatic 78): codewhale_tui::tui::mouse_ui::handle_mouse_event has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/mouse_ui.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7360f036c69a11f4db41fa77adbf7c319b66a60ab56487946c792046b68554"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.restore (cyclomatic 77): PetWorld.restore has cyclomatic complexity 77 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 15 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36c067122c99f50533b96839d7574b48b787dedabe9e47d0299756ca4bfe116"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.restore (cyclomatic 77): PetWorld.restore has cyclomatic complexity 77 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 15 belong to 5 function items inside it that branch. 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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3ded23ebdc7bacd4447c92da37fbba0e14c529224649c6ac5c5f1ee955aac7"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.restore (cyclomatic 77): PetWorld.restore has cyclomatic complexity 77 (threshold 15). Of this number, 62 points are the body\u0027s own statements and 15 belong to 5 function items inside it that branch. 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":"pet/src/core/pet-world.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d3a16de88737605ef65095211b6a54277a0ca0551b1d891eeea4c3a73d2b86"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::execute_planned_tools (cyclomatic 76): Engine::execute_planned_tools has cyclomatic complexity 76 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":2747}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae1f920d18d4ae05375eb3f09ca3de1e5b23a6a3137604f82c95ddf74fd6f269"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::setup::constitution_ratification_text (cyclomatic 74): codewhale_tui::tui::setup::constitution_ratification_text has cyclomatic complexity 74 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/tui/src/tui/setup/mod.rs"},"region":{"startLine":4412}}}],"partialFingerprints":{"codehealthFindingId/v1":"789d804d73be9169fad8ea83a196aff87676059a54e02bf719b6d8680775e5d1"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::mcp_http::fetch (cyclomatic 73): codewhale_engine::extension_host::mcp_http::fetch has cyclomatic complexity 73 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp_http.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9737a19dac40ffe678e4b420fba0ca9f61386f2e947ec1890b1555074b0c098c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::frame::render (cyclomatic 73): codewhale_tui::tui::ui::frame::render has cyclomatic complexity 73 (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/tui/src/tui/ui/frame.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9f8f957daeafbd53528326bf0c517eaa9694e64853db6cebbac83ccce3ea6a"}},{"ruleId":"D1","level":"warning","message":{"text":"facts-publish.validateSource (cyclomatic 73): facts-publish.validateSource has cyclomatic complexity 73 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 38 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd8d794012a042b84943c6e79fc2ae8da1a101ba20c564be8f79b7a95f33c86"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::update_thread_under_history_guard (cyclomatic 72): RuntimeThreadManager::update_thread_under_history_guard has cyclomatic complexity 72 (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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":9120}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34fc0c75a515f431baa792230ab258b770b98ab3a8a84bb6cb00588753133bb"}},{"ruleId":"D1","level":"warning","message":{"text":"App::new_with_plugin_registry (cyclomatic 72): App::new_with_plugin_registry has cyclomatic complexity 72 (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/tui/src/tui/app/init.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df5df0def4da9ce22e23383d7fed41b5dad3d82b582082ef1a81c90e2cb9e5c"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::observe (cyclomatic 72): (anonymous)::observe has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a16828c9efedba123696019798528c202ac8389e9a38acc1a40e29f0f518d5"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::observe (cyclomatic 72): (anonymous)::observe has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"3140711c27aa29971064e8d5f066bc3987bfe3368d53e272b5d6cca2e8fb6a34"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhaleClient::handle_responses_stream (cyclomatic 71): CodewhaleClient::handle_responses_stream has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/src/client/responses.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"990fef5fe087ebe135c408d27d0bb1b391b4dea7a888415b28015a673f2ed45e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::chat::build_chat_messages_with_reasoning (cyclomatic 71): codewhale_engine::client::chat::build_chat_messages_with_reasoning has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/src/client/chat.rs"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfb81c66ffda950b89d46b121e313e7d7dddb002dd1937ce494f92bbd723392"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::underwater::launch_empty_state (cyclomatic 71): codewhale_tui::tui::underwater::launch_empty_state has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/tui/src/tui/underwater.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9fd8da152f7713245a8ed99c46879bdfb7cf429941671260714ad8d832c26a"}},{"ruleId":"D1","level":"warning","message":{"text":"ShellBinding::matches (cyclomatic 70): ShellBinding::matches has cyclomatic complexity 70 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/shell_key_routing.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"528ebf7b89e28fa9b9ec1b471a37010940911071bf1ab8330fccc87cf57d81ea"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings::set (cyclomatic 68): Settings::set has cyclomatic complexity 68 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"642398aa44d4020bbeb5ab843f21c9922954b5ed065bb09abb826266b43128b3"}},{"ruleId":"D1","level":"warning","message":{"text":"pet-telemetry.compilePetTelemetry (cyclomatic 66): pet-telemetry.compilePetTelemetry has cyclomatic complexity 66 (threshold 15). Of this number, 60 points are the body\u0027s own statements and 6 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-telemetry.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbc13cbc5d583391b2101e48ca4a43258883ee677fcaff8243ca6d06e5b9c7a"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::process_stream (cyclomatic 65): Engine::process_stream has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4903}}}],"partialFingerprints":{"codehealthFindingId/v1":"ababffbb51564eea509778eb5f56cb4a8cc0cf4efbd7511c676510015da8279f"}},{"ruleId":"D1","level":"warning","message":{"text":"app.applyRuntimeEvent (cyclomatic 65): app.applyRuntimeEvent has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa2d1282eb5dcb321e51a91c6f590760ded706cef2b9902feae359cb9f041bc"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.validateBatch (cyclomatic 65): schema.validateBatch has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85d0a49874919124309bb7bcfe257d2db33b3706ccbce79dafae9366dd1776d"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogOffering::complete_facts (cyclomatic 64): CatalogOffering::complete_facts has cyclomatic complexity 64 (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/config/src/catalog.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2881b09fca48214be231d3a4fd0799a45be97fe8aa7c904b2f58e8d0a2a7f96"}},{"ruleId":"D1","level":"warning","message":{"text":"SubAgentManager::prepare_background_with_assignment_options (cyclomatic 64): SubAgentManager::prepare_background_with_assignment_options has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":9652}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b0827098a9de78eadd0c9a072f5099ea050e96db9b95f42cfe1803a6092ad5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::engine::drive_child_actor (cyclomatic 64): codewhale_engine::tools::subagent::engine::drive_child_actor has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffb92ea34d7bebf69aa7ad07f3e47468508cf65f6026ad11beb98f40c32c54a"}},{"ruleId":"D1","level":"warning","message":{"text":"SetupWizardView::handle_key (cyclomatic 62): SetupWizardView::handle_key has cyclomatic complexity 62 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/tui/src/tui/setup/mod.rs"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a4b5f877a0ea828190facb623471eb7112ac0cd68fc3a4d1bb48c5ac9c7203"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposerWidget::render (cyclomatic 62): ComposerWidget::render has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef77fe6cdf7b2eb422c00521f159590deea6b68fd47575df656e7f0cc4010f61"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::live::run (cyclomatic 62): codewhale_tui::tui::pet_watch::live::run has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/live.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"82975d6ea623926e7d4a8c6eed1f61c94127928a96c3b45e4b37d2d13c45560c"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::build_turn_tool_registry_and_catalog (cyclomatic 61): Engine::build_turn_tool_registry_and_catalog has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/engine/src/core/engine.rs"},"region":{"startLine":6212}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d74059e267cbd044355d99675fa155e06ca0941ea8d8d382841fa4a5541f09b"}},{"ruleId":"D1","level":"warning","message":{"text":"explorer.RatatuiExplorer (cyclomatic 61): explorer.RatatuiExplorer has cyclomatic complexity 61 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 26 belong to 17 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/ratatui/explorer.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b57a6faf50ae7d19056d9315678cb972d10085dafbe2f5d8b8b7f3fc11d507"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::compilePetTelemetry (cyclomatic 61): (anonymous)::compilePetTelemetry has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bece4cfa65752e74a68b0ac96ab2b0a3de3040130b4f9e0594e3b4c5141eaf"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::compilePetTelemetry (cyclomatic 61): (anonymous)::compilePetTelemetry has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own 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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e833536396e4aee3184acbb45421e44acc60b62ff786de3d0d31746c52fa69"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::resolve_active_route_api_key (cyclomatic 60): Config::resolve_active_route_api_key has cyclomatic complexity 60 (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/runtime/src/config.rs"},"region":{"startLine":6315}}}],"partialFingerprints":{"codehealthFindingId/v1":"607a16641a4268a0d3b567820224697384ce510adcd9289b0be2065fe541d6f9"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhaleRuntimeTrace.append (cyclomatic 60): CodewhaleRuntimeTrace.append has cyclomatic complexity 60 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"e620dab00d37104b0cadda3c730ddcd166973cbef779d98e90d3d1aa14ed6b93"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::restore (cyclomatic 60): (anonymous)::restore has cyclomatic complexity 60 (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b72aa5266efe68da06fcc584200c6147db06bf27a98b4c451ef4b25e0fdc37"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::makeFrame (cyclomatic 60): (anonymous)::makeFrame has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0a0202b771ca591918f746e625fdd54a5284ebe054fd348f35520b599391a1"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::restore (cyclomatic 60): (anonymous)::restore has cyclomatic complexity 60 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b993b3e72b63d5918b23170a429aa6eb2e40a7f5a73adc556f5cd7a85a79112"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::makeFrame (cyclomatic 60): (anonymous)::makeFrame has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53bd05463468e7b927a77e5484c54e47ee7af4ff8f4170fdad9dcfba03da186"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::execute_tool_admitted (cyclomatic 59): Engine::execute_tool_admitted has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_execution.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cfd23e8ef68ff0b97b278d560ba7a7cb377e97887f2727f5658b958ebb9e88"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::run_agents (cyclomatic 57): codewhale_account_cli::run_agents has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f6a07d187be4fe93613876de640e1af1382fc8b09b80c0406ddb63f91794e1"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::tool_routing::handle_tool_call_complete (cyclomatic 57): codewhale_tui::tui::tool_routing::handle_tool_call_complete has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/tool_routing.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"74765f3c4de8876dd43bdbeaedbffb1b676747974abbe02fb13bc539aabc1223"}},{"ruleId":"D1","level":"warning","message":{"text":"index.streamTurnEvents (cyclomatic 56): index.streamTurnEvents has cyclomatic complexity 56 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f07644bb27e642e1a3633510a5779ff9aa274f8f53918c8a5959064b27adb3"}},{"ruleId":"D1","level":"warning","message":{"text":"report-funnel.buildFunnelReport (cyclomatic 56): report-funnel.buildFunnelReport has cyclomatic complexity 56 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/scripts/report-funnel.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"052a4a51b1184b6fb3f992d6694c08e97ed0fbedf83e4d28188fff875c5bea59"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::prepare_model_step (cyclomatic 55): Engine::prepare_model_step has cyclomatic complexity 55 (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/engine/src/core/engine/turn_loop/preparation.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"01760e7f4994bf7f1dbf8fd335a60666071bc80b047cee8cb35f87b95cfc8088"}},{"ruleId":"D1","level":"warning","message":{"text":"PagerView::handle_key (cyclomatic 55): PagerView::handle_key has cyclomatic complexity 55 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fc2d0b0c8305f58c943c236f8dc6c1b3059bbc6bca67aa0833f9d76eb5d0a9"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::input::handle_mouse (cyclomatic 55): codewhale_tui::tui::work_surface::input::handle_mouse has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/input.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ffc515ccca2bd844bc1c7c45861aa0f7176a8b0d34571d41b911afd96f5e87"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigToml::resolve_runtime_options_with_secrets (cyclomatic 54): ConfigToml::resolve_runtime_options_with_secrets has cyclomatic complexity 54 (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/config/src/config_resolve.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"712d806082415eb3a22a2c4350fd247696ec84eb073701bc386eb0f87030de95"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::handlers::handle_mcp_ui_action (cyclomatic 54): codewhale_tui::tui::ui::handlers::handle_mcp_ui_action has cyclomatic complexity 54 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3d6012b719c4c1e61678d487c56798ab7d9394814aa77b6ff4c9c7dc6386c9"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.makeFrame (cyclomatic 54): PetWorld.makeFrame has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"308f7f9f6c9003b79c0a89c8dc4304ba0fa683a002e1624edafb051db6807175"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.makeFrame (cyclomatic 54): PetWorld.makeFrame has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4135ec67537f525f5e0df3458fd33c8837583020b1475af5546b0e709a8e10d"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.makeFrame (cyclomatic 54): PetWorld.makeFrame has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-world.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb50c0386af1f9ce23779b79dee60895a361c7ff8b494b0dd808c6dcf5e739ef"}},{"ruleId":"D1","level":"warning","message":{"text":"merch-storefront.MerchCheckout (cyclomatic 54): merch-storefront.MerchCheckout has cyclomatic complexity 54 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 38 belong to 7 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-storefront.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a58d64bd8a15f34e1504068a5a75404bee29074e505f31cc71114f11c7b147"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::provider_readiness::credential_state_for_provider (cyclomatic 53): codewhale_engine::provider_readiness::credential_state_for_provider has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_readiness.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d6fb33e2b8f3227a39240e747f6097f1447a0e8bb4166a541b9fb1d46f2b56"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginManifest::validate_mcp_servers (cyclomatic 53): PluginManifest::validate_mcp_servers has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54f32a68d7699eb8d3d2bbb6d20ee9ca07ba312803a7025637b15c4d59b03fb"}},{"ruleId":"D1","level":"warning","message":{"text":"parseProviderDescriptors (cyclomatic 53): parseProviderDescriptors has cyclomatic complexity 53 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 1 belongs to 6 function literals inside it that branch. 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":"web/lib/provider-descriptors.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"436584f34964ab0f88960ebdb73376b05d8f582af739094b076026f699809588"}},{"ruleId":"D1","level":"warning","message":{"text":"docs-search.DocsSearch (cyclomatic 52): docs-search.DocsSearch has cyclomatic complexity 52 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 32 belong to 14 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"429e9a491089ccd59219b551e445d0d473695f7ccd1ab67cb5f12ffea46cc30f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::receipts::assemble (cyclomatic 51): codewhale_engine::receipts::assemble has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"28771a5f5245c8f54e160e798c645d1d9c0e002ba33592474a599af6dbd02dc8"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigView::render_settings_shell (cyclomatic 51): ConfigView::render_settings_shell has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dce432e02969b26cd8a8a2805a96e9f5418001e04a9ad29674b0f42ee1a7f7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::widgets::slash_completion_hints_for_plugins (cyclomatic 51): codewhale_tui::tui::widgets::slash_completion_hints_for_plugins has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a68cfe2bf3a3dd472a16c18a6b2c8dfbc8b4a49a15aa13a788a7f94818ff1f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::thread_history::mutate_in_owner (cyclomatic 50): codewhale_app_server::runtime_api::thread_history::mutate_in_owner has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4462ff65eda73f763ffa56b0fd21cc0147155ec97211f8d2c30bf028f3307ff"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::seed_thread_from_messages_with_history_operation (cyclomatic 50): RuntimeThreadManager::seed_thread_from_messages_with_history_operation has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11649}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2df9f7f64daac6473d3f5c2331705923b1b2ac11bd1ccebebcf6488ee4ca9f5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::run_mcp_command (cyclomatic 50): codewhale_tui::run_mcp_command has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":13157}}}],"partialFingerprints":{"codehealthFindingId/v1":"117c88eb9c3be37847b960c0da17b2fb7b63d59b1d18767d869468dc61082b62"}},{"ruleId":"D1","level":"warning","message":{"text":"lib.validateBridgeConfig (cyclomatic 49): lib.validateBridgeConfig has cyclomatic complexity 49 (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":"integrations/telegram-bridge/src/lib.mjs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"00208b1d39b292cd5372d150d742791a43f633aabaefea6b9ec0baa858f5889e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::remote_control::relay_worker (cyclomatic 48): codewhale_app_server::remote_control::relay_worker has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":3451}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfecff7191740e0c68366a9dfb3c231d902f4394fab96a283c2236befeb0722"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderPickerView::render_list (cyclomatic 48): ProviderPickerView::render_list has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5b5046378819c54b5b8f2db48e3aac2c3bf17fea1964903b9ed8fd1973f3a9"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::event_loop::run_tui (cyclomatic 47): codewhale_tui::tui::ui::event_loop::run_tui has cyclomatic complexity 47 (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/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee92cb3207fb437f482b0c1e7ea90eb46b7dba8c18a5b1cd694ae3f2440542d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::run_inline_repl_phase (cyclomatic 46): Engine::run_inline_repl_phase has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/inline_repl.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e5144e4cb7ef13139053498764c7f8d2933fbe4c8741965d3bfdf0a7e28da3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::run_review (cyclomatic 46): codewhale_tui::run_review has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":11313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0900436d6bec24bb214fd9ca50c6a029b6d4cf00be412f3dbf900bac6729acc2"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::model::ordered_rows (cyclomatic 46): codewhale_tui::tui::work_surface::model::ordered_rows has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/model.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9a7e707d8c0646b2d7e92bf548830925d3539ee5209f95a239d0b2b55d22bd"}},{"ruleId":"D1","level":"warning","message":{"text":"lib.validateBridgeConfig (cyclomatic 46): lib.validateBridgeConfig has cyclomatic complexity 46 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"517313d17d574464e60962980d4f2b8a62b48bbd3b19c731549d314bf2876350"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale.fromCodewhaleSession (cyclomatic 46): codewhale.fromCodewhaleSession has cyclomatic complexity 46 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0522ef0949e146b302028a2e057e6a16b88488ad9679f2f457cf2d1ccf26a4a6"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.validateEvent (cyclomatic 46): schema.validateEvent has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed917227a6c3d6801e87f550b7363079d8a39d6688f6690d3e1d489980f6f35"}},{"ruleId":"D1","level":"warning","message":{"text":"parseModelCatalog (cyclomatic 46): parseModelCatalog has cyclomatic complexity 46 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 16 belong to 4 function items inside it that branch. 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":"web/lib/model-catalog.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e325d378d0cbc5c70d80ecc554c183df02ce8c69d623a6b2ec29f37c3ba27f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::jobs::create_thread_job (cyclomatic 45): codewhale_app_server::runtime_api::jobs::create_thread_job has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/jobs.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48a8311bb63194a2091d033d60edd92ee66f98bc8616ea11086dffde454a966"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionsView::render (cyclomatic 45): ExtensionsView::render has cyclomatic complexity 45 (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/tui/src/tui/views/extensions.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2196229d640a550ac526f0988d77480c9390e83570417971b1ea1ee7bfaa80"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_workflow::redaction::redact_for_disclosure (cyclomatic 45): codewhale_workflow::redaction::redact_for_disclosure has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/redaction.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"557acd2f294edaae4444207ce3d1d0b2291cdb6ad7aecf2846ee4bb31eb836b5"}},{"ruleId":"D1","level":"warning","message":{"text":"pet-runtime.followRuntime (cyclomatic 45): pet-runtime.followRuntime has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 13 of the 45 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 32, 43). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-runtime.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4715dc76793496dffebe25bcade9f8efba132bc42879c00d01d7a7efba1d99e"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhaleClient::build_anthropic_wire_body (cyclomatic 44): CodewhaleClient::build_anthropic_wire_body has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63c18f00bdf9a97f1ec321ab2920e36dc8e58f0e82cd950c121c9041762d791"}},{"ruleId":"D1","level":"warning","message":{"text":"SubAgentStoreAuthority::merge_publish (cyclomatic 44): SubAgentStoreAuthority::merge_publish has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":13776}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd09df8b532d982d23fa899857dfb16c23c27311698d5fec5d8fd8ecabb19996"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::project_context::project_instruction_sources_with_settings (cyclomatic 44): codewhale_engine::project_context::project_instruction_sources_with_settings has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f833d29cb83a3f43e72509b584b5eaf614535cf8cc4fa5b7672fda0a1ef7361"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_sanitize::redact::redact_line (cyclomatic 44): codewhale_sanitize::redact::redact_line has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"00149601d445293741a232706b14c5d111914cba3b1d1d13a76cf105d99f3a06"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::run_fleet_command (cyclomatic 44): codewhale_tui::run_fleet_command has cyclomatic complexity 44 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 18 belong to 5 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/tui/src/lib.rs"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e29df5363c1f1deca07c014d672f18ab8440f6237075735e293741e4e483710"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_config::cloud_facts::verify::verify_envelope (cyclomatic 43): codewhale_config::cloud_facts::verify::verify_envelope has cyclomatic complexity 43 (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/config/src/cloud_facts/verify.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa2f0ebe7aee15e3e671ed584a4bdf7f13ae20551352462bd42e796a92631cb4"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::continue_model_step (cyclomatic 43): Engine::continue_model_step has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/continuation.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eb9f1cd3e81f755a6d25040aabd1a0bf6cd8e351acd600e0f9a594e4517299"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::work_graph::validate::check_structural (cyclomatic 43): codewhale_engine::work_graph::validate::check_structural has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/validate.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d5ca4f287d554098218bc9ce7373430786873b7e08913d5a4fe2256430c3c5"}},{"ruleId":"D1","level":"warning","message":{"text":"MfjsValidationState::validate_schema (cyclomatic 43): MfjsValidationState::validate_schema has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/schema_sanitize.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6316f3d21089db19b1e8bfa90dd550694261cb0d160219c1f7a5f18a88952d"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::projectDotField (cyclomatic 43): (anonymous)::projectDotField has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e6261cf843f948987486ee16a50c0755d034aba371274a2cebbb504cca00257"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::projectDotField (cyclomatic 43): (anonymous)::projectDotField has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b2f14d4a849e7000a65e828b890215a5da2557bcd35b989f0fdec10adcfaf9"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::run_config_command (cyclomatic 42): codewhale_cli::run_config_command 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/cli/src/lib.rs"},"region":{"startLine":5509}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3a3848e301eafd9d99b1f5a9fd79eb8941e816acc217151ac70281565fc69b"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewedCatalog::validate (cyclomatic 42): ReviewedCatalog::validate has cyclomatic complexity 42 (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/config/src/catalog/reviewed.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"01eaaddd3c5cf81b47d93ce93112e57cc490b59cdb1165c920c3c7a94553873c"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhaleClient::handle_chat_completion_stream (cyclomatic 42): CodewhaleClient::handle_chat_completion_stream 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/engine/src/client/chat.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d91d809eb26729ed0473b3651426c06579f37068efafeb5c0b5b72ea6ee0ab6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_palette::user_theme::apply_colors (cyclomatic 42): codewhale_palette::user_theme::apply_colors has cyclomatic complexity 42 (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/palette/src/user_theme.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64a065e3534a1c1ab541290ae0802a03420e9774a2e42a9bdee9985a8764eea"}},{"ruleId":"D1","level":"warning","message":{"text":"compiled-hosts.parseCatalog (cyclomatic 42): compiled-hosts.parseCatalog 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":"npm/codewhale/scripts/compiled-hosts.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2550d29bdb6d9501364c06afb94ea25e2c9594220f6bc9b586f1521912e7d886"}},{"ruleId":"D1","level":"warning","message":{"text":"ingest.importTrace (cyclomatic 42): ingest.importTrace has cyclomatic complexity 42 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 18 belong to 5 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d60bed14d0997aaba29135f5a64a6abd048e75dcbdd958176e879470b9193a2"}},{"ruleId":"D1","level":"warning","message":{"text":"cloud-facts.verifyEnvelope (cyclomatic 41): cloud-facts.verifyEnvelope 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":"web/lib/cloud-facts.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87917cae719153dc4cc0c3953e2b776a932abbaacee1273c784c19d36463ec1"}},{"ruleId":"D1","level":"warning","message":{"text":"product-usage.validateEnvelope (cyclomatic 41): product-usage.validateEnvelope 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":"web/lib/telemetry/product-usage.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dd2eeec3f005dddc13a3216577f316e06268fc4ceb8e54e4eaf586fd1217af"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::set_config (cyclomatic 40): codewhale_app_server::runtime_api::set_config has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":13569}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83d28c3e62e1ee6fdd5ad92c8fe2cb4a257e55ad3742fe513c6568e96f1f7fe"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_config::model_normalization::normalize_model_for_provider (cyclomatic 40): codewhale_config::model_normalization::normalize_model_for_provider has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/model_normalization.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"019431815c4e82de9fabf4291d621fbac9a646372b186f8460fb5e10d71c8a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::config::normalize_model_config (cyclomatic 40): codewhale_runtime::config::normalize_model_config has cyclomatic complexity 40 (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/runtime/src/config.rs"},"region":{"startLine":8979}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb9ba5852e30dc5506cc7d77b9c81955dab31773cbb0beffc18d832eb4f82d6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::config::credential_resolve::resolve_credential_source_with (cyclomatic 40): codewhale_runtime::config::credential_resolve::resolve_credential_source_with has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config/credential_resolve.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63853e0e78068dfa5dccdb176b48fe46d97f600bdabe95ba9160a9a88e2963f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skill_install::frontmatter::parse_frontmatter (cyclomatic 40): codewhale_skill_install::frontmatter::parse_frontmatter has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/frontmatter.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"479175bea73fd9dbf4073e4c33cea2e9c68808230a14d7d7c6085797d819fc93"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericToolCell::lines_with_mode_and_locale (cyclomatic 40): GenericToolCell::lines_with_mode_and_locale has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a77e1d1ff7753df190a054eebcadfd5dbf9b29b72c6f1fa3ef974a201d7bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelPickerView::handle_key (cyclomatic 40): ModelPickerView::handle_key has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":4273}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc892caac5507dfa3aa64b15ae4dd48e8b03d9651063fa35555f562563567dfc"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatWidget::new_with_ocean_elapsed (cyclomatic 40): ChatWidget::new_with_ocean_elapsed has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6163b87087c2b36a2949e53af8247d0cf68dfb58374c668c87e62995b3debca"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::remote_control_bridge::drain_remote_control_events (cyclomatic 40): codewhale_tui::tui::ui::remote_control_bridge::drain_remote_control_events has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/remote_control_bridge.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"58853d1afc6a4565952289fe2ab77247d301ac1fbac628dad9b2e5cc837dd135"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSim.restore (cyclomatic 40): PetSim.restore has cyclomatic complexity 40 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 9 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec539c0d290d99d5042004331cae8fd4ceebe557361817107408cdadf518262b"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSim.restore (cyclomatic 40): PetSim.restore has cyclomatic complexity 40 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 9 belong to 5 function items inside it that branch. 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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"2586d453179da39568f8ed9e533059f9e13a70dd0d08e50397ba9919ba0340e4"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSim.restore (cyclomatic 40): PetSim.restore has cyclomatic complexity 40 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 9 belong to 5 function items inside it that branch. 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":"pet/src/core/pet-sim.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0560c5ca849332930d7b233fa635099f70005e044ce3637ffac6ce5dd22348e"}},{"ruleId":"D1","level":"warning","message":{"text":"dot-field.projectDotField (cyclomatic 40): dot-field.projectDotField has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/dot-field.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5bad44215092af4d5791edae8fa5aaac94e30230fb9029d750fc77b7c83ef5"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::activity (cyclomatic 40): (anonymous)::activity has cyclomatic complexity 40 (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bda837cea4944d2cc335e497df7f2559759ad2d14fa2d88beee7e6938841ae"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::activity (cyclomatic 40): (anonymous)::activity has cyclomatic complexity 40 (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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3938b69be7d8005e2dffa8d070b7e805d809665efd13e8e8e87a56425c2a2ff"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::plugin_index::get_plugin_index (cyclomatic 39): codewhale_app_server::runtime_api::plugin_index::get_plugin_index has cyclomatic complexity 39 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plugin_index.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e76034e8a8f00a6d748e85d8cb282cf67c68edd7b8d77f1808cbaf7044c05d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::stdio::dispatch_stdio_request_with_writer (cyclomatic 39): codewhale_app_server::stdio::dispatch_stdio_request_with_writer has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/stdio.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb55bbd7167b6c8f22a5c4a4daeaf00aff04c0a8764f9e3e14756e3d2286445a"}},{"ruleId":"D1","level":"warning","message":{"text":"Broker::authorize_frame (cyclomatic 39): Broker::authorize_frame has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"4564ba34cee809b72a916365393f3a111f8930f759d3e54504b3e7d403849f75"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::route_engine_events (cyclomatic 39): RuntimeThreadManager::route_engine_events has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":15694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d289e0045dd3c36d7c21bb4bb8627ae770877f50befa2bc9562bd626e636a77b"}},{"ruleId":"D1","level":"warning","message":{"text":"HotbarSetupView::handle_key (cyclomatic 39): HotbarSetupView::handle_key has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/setup.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba45d761e6decbab71dfec35016cfc883bb90f1327bf3c577f007837c6e225a"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetSetupView::handle_key (cyclomatic 39): FleetSetupView::handle_key has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"4521ad81d544e4dfa5bbe754412f7919f6de114512dd9140aeef43ab8b59698f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatWidget::new_with_ocean_elapsed (cyclomatic 39): ChatWidget::new_with_ocean_elapsed has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/transcript_legacy.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c2226c41d74b83ece7dc8feadbcf60448c04c321de562478c3cabc7afe934f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::render::render (cyclomatic 39): codewhale_tui::tui::work_surface::render::render has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7ea0d20a8cb11aee017b0fa5d0d2f2feaa1a0e6ec8903869e9cf43f7a8e9b4"}},{"ruleId":"D1","level":"warning","message":{"text":"PetEngineTelemetry.activity (cyclomatic 39): PetEngineTelemetry.activity has cyclomatic complexity 39 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"29492edd86ee8a2ac3de51afaa2dde0fc00e64bcd658e3fc3cb7b2426b256427"}},{"ruleId":"D1","level":"warning","message":{"text":"PetEngineTelemetry.activity (cyclomatic 39): PetEngineTelemetry.activity has cyclomatic complexity 39 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3501ec7251fcd8e02c035143a961450b9356f43ecd946c58ac4261ad744ef3"}},{"ruleId":"D1","level":"warning","message":{"text":"PetEngineTelemetry.activity (cyclomatic 39): PetEngineTelemetry.activity has cyclomatic complexity 39 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-engine.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7338742ef5bd5b74564b74923dc9a4bdd21611abeeb8de0c6bf1157c1de08b0a"}},{"ruleId":"D1","level":"warning","message":{"text":"facts-publish.verifyEnvelope (cyclomatic 39): facts-publish.verifyEnvelope has cyclomatic complexity 39 (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":"web/scripts/facts-publish.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"863a608722420caf1b78591c3256b3def05935c44ad2f1838b679984e8d870e5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::registry::gc::plan (cyclomatic 38): codewhale_plugins::registry::gc::plan has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry/gc.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab24649302316b8db19764d6bb63c979cb8db889c396b98e5b83fa6a03006b1"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::full::render (cyclomatic 38): codewhale_tui::tui::pet_watch::full::render has cyclomatic complexity 38 (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/tui/src/tui/pet_watch/full.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d4e1db3d77051b640d0cc62e0d0a4357b5d215bf0fd2f8534c132f63413dab"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelInventory::from_config_scoped (cyclomatic 37): ModelInventory::from_config_scoped 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/engine/src/model_inventory.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8644440fc201855e9776423c043d94ea4471eef445907a07b9183a1850fa53b2"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::review_core::render_review_summary (cyclomatic 37): codewhale_engine::tools::review_core::render_review_summary 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/engine/src/tools/review_core.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f829d04536f6e6540e0b4d7f26a71275c696f9354ba52a8f94dec29aa3fe8ff0"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::review_core::run_review_core (cyclomatic 37): codewhale_engine::tools::review_core::run_review_core 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/engine/src/tools/review_core.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea2890847e37e33707a1ccc20d98365a7b981754e102bb9508029157f089792"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::dsh::native_composition_files (cyclomatic 37): codewhale_plugins::install::dsh::native_composition_files has cyclomatic complexity 37 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78ef9513cbb74f0e37f985054853b1094717bb82057cb518895264c7702b0c4"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationEditor::key (cyclomatic 37): AutomationEditor::key 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/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dd37db682a4c0dde099e5f8773fd865fbf1c74d84764ff0793f9cd1c879229"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ambient_life::build_frame_marks (cyclomatic 37): codewhale_tui::tui::ambient_life::build_frame_marks 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/tui/src/tui/ambient_life.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f892252ecb4c7dcf52c62d4df490281213fb5e0bda4fbecb6e41b02776a7fbf"}},{"ruleId":"D1","level":"warning","message":{"text":"DingTalkBridge.handle (cyclomatic 37): DingTalkBridge.handle has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1ff2b75f8aa9a815e22ea9022a85c18987f9ab765857340e9323f4322b1600"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::run_auth_command_with_secrets_and_runtime (cyclomatic 36): codewhale_cli::run_auth_command_with_secrets_and_runtime has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":4993}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b35ac7fd8b6d8443229dca5b415fbe0d0effc53879d0b6f197d05af26aecc3"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhaleClient::prepare_outbound_request_body (cyclomatic 36): CodewhaleClient::prepare_outbound_request_body has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":3261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b50c2f2c5baa29c2809acd6bbb6a0eb959d69133288107f8dd9b6e0e4f56ba3"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetManager::drive_executor_tick (cyclomatic 36): FleetManager::drive_executor_tick has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c147918f9ec9b078c30dae083121fd9062ee94ce1460d3f8c1c94b33694432af"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionManager::remove_session (cyclomatic 36): SessionManager::remove_session has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":6237}}}],"partialFingerprints":{"codehealthFindingId/v1":"66090277ce7dbfc57008910bf8bf2e4fdf36ff5a554c3bfcd761dff49bd668df"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::fleet::ledger::apply_record (cyclomatic 36): codewhale_engine::fleet::ledger::apply_record has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee6c1923d67ef612b737ed5bf1d16bf271464e7304784368c6f9a057ba8eff1"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::provider_lake::runtime_catalog_resolver_for_identity (cyclomatic 36): codewhale_engine::provider_lake::runtime_catalog_resolver_for_identity has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84c6390f8a4c07bfbf75d8bee1869f3311fa718026488cd40556e6ddb511871"}},{"ruleId":"D1","level":"warning","message":{"text":"Expander::record (cyclomatic 36): Expander::record has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/shell_expand.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf86e357de24c4530f81b8eadbc28076c3b9cb622dfb8eea1fff4fda424601f7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::lex_readonly_command (cyclomatic 36): codewhale_execpolicy::command_safety::lex_readonly_command has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_execpolicy::command_safety::readonly_options_are_allowed (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bcc5a1ff10449d4ee356bbc99929e14f8ed7e047331f7f88c944e51dad9907"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::dsh::convert_package (cyclomatic 36): codewhale_plugins::install::dsh::convert_package has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":2983}}}],"partialFingerprints":{"codehealthFindingId/v1":"022fc2cc9e3beb65a936bb0878813ed9053b80f522e26362c02324a1f2223278"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::marketplace::parsers::codewhale::parse_codewhale_entry (cyclomatic 36): codewhale_plugins::marketplace::parsers::codewhale::parse_codewhale_entry has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/codewhale.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bf491b223cdb30e2f70cd0c9c3f4b8df6ea04d71d9da037f37365884121600"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelPickerView::render_pane (cyclomatic 36): ModelPickerView::render_pane has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"391158f0e324d8a62decf80a12b0c2cb65026d0c1960f717f9abfbb7b4780b8f"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::render (cyclomatic 36): Renderer::render has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/graphics.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc2153b3a7afb7dde9bf5875986ddfdab45a26b1ed97f022cd7b6804d4c40ff"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::assign_default_sections (cyclomatic 36): codewhale_tui::tui::model_picker::assign_default_sections has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7d2b46c4d23bb6c638eafe49a7bf5ffe0c513904bf50d90f33b3446c39e9ee"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::render_picker_model_hint (cyclomatic 36): codewhale_tui::tui::model_picker::render_picker_model_hint has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":4015}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b47f28586afe449fd22aef7a317fd22db9b8e811ac3b6299e1d0c3b9aa9bc8c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::views::extensions::mcp_model (cyclomatic 36): codewhale_tui::tui::views::extensions::mcp_model has cyclomatic complexity 36 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/extensions.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a971d350dbad610b6024381cd22b7bc41c94d3d5daa096e8f29b2347ed09938c"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_mobile.html.eventText (cyclomatic 36): runtime_mobile.html.eventText has cyclomatic complexity 36 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_mobile.html"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d225e45fa60ced0f8cd7dade3f414ea820a90b904223aef7f85ef95b24ad0174"}},{"ruleId":"D1","level":"warning","message":{"text":"index.flushOutputs (cyclomatic 36): index.flushOutputs has cyclomatic complexity 36 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 17 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec03cd14ed122b87dc8a4a12d265907712d5cd5adc15ae969f0aee87e0bade9"}},{"ruleId":"D1","level":"warning","message":{"text":"render-released-capture.applySgr (cyclomatic 36): render-released-capture.applySgr has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-released-capture.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf60cc30858bfbd8cb8512a4cf17c44b9e8adb9feb5625776334ceb419f388ac"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::get_settings_schema (cyclomatic 35): codewhale_app_server::runtime_api::get_settings_schema has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":14056}}}],"partialFingerprints":{"codehealthFindingId/v1":"b443f2c93144585da52fdd701246a06e3446779324a5e39a968c53c983ab7e95"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::metrics::read_audit_log (cyclomatic 35): codewhale_cli::metrics::read_audit_log 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/cli/src/metrics.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54b58185d7f90ac04493dc8d156fbc88344b97d6ec32b1649c8acc63293dab8"}},{"ruleId":"D1","level":"warning","message":{"text":"CoreCalls::serve_subagent (cyclomatic 35): CoreCalls::serve_subagent has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a393c8bafc5967ecc576b04c0b53279c9b478a1abcccf76f4e3c552f7736b944"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::recover_interrupted_state (cyclomatic 35): RuntimeThreadManager::recover_interrupted_state 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":19264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2045893e02003c48618273bdda68d95893588de783a85d0067a03662c6d1a65"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::responses::convert_messages_to_responses_input (cyclomatic 35): codewhale_engine::client::responses::convert_messages_to_responses_input 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/engine/src/client/responses.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"73604a8b4df94eb4d3b8a266d7dde722bfbd26806a36024441113dd5fc96939e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::memory::memory::memory (cyclomatic 35): codewhale_tui::commands::groups::memory::memory::memory has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/memory/memory.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"69cac05853ae97cca040c2ab954f983aefe4a899a7eaf37af4af54ab90b01f9c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::history::history_cells_from_message_with_results (cyclomatic 35): codewhale_tui::tui::history::history_cells_from_message_with_results 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/tui/src/tui/history.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"f868d03b8d23bfd56633a6b3a9dbfabd9a1e535d469e026df505b01bf2549b73"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_model_picker_choice (cyclomatic 35): codewhale_tui::tui::ui::apply::apply_model_picker_choice has cyclomatic complexity 35 (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/tui/src/tui/ui/apply.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1261c3f53218fdb6d11717a40d5cff55afdea7ff22f6f80f7801771c6df77db"}},{"ruleId":"D1","level":"warning","message":{"text":"PetHost.restart (cyclomatic 35): PetHost.restart 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":"pet/swift/PetHost.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"891fba99dad1549492eb37b5b04ff02842cab2a3c8e5c30abcc633d6d6fa3013"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_mobile.html.noteTurnUsage (cyclomatic 35): runtime_mobile.html.noteTurnUsage has cyclomatic complexity 35 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_mobile.html"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b0b00fc027d930070ea4606ae82b2d067cfef53d52f6d0233f4aeddd919ad2"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatView.handleStreamEvent (cyclomatic 35): ChatView.handleStreamEvent has cyclomatic complexity 35 (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":"extensions/vscode/src/chat.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c65d18997c1e2eabe6e9deaf6cafd9c1d8b77d8f21623b64e8e7b362a30b1d"}},{"ruleId":"D1","level":"warning","message":{"text":"WebRunTool::execute (cyclomatic 34): WebRunTool::execute has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64009785e2ca486f412732fafb5e0f3d80f4a3a13c369f5027f008714615cf7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::chat::parse_sse_chunk_with_reasoning_style (cyclomatic 34): codewhale_engine::client::chat::parse_sse_chunk_with_reasoning_style has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":4185}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aac2ebc38c6e3095f0f1b94c1ef3fce5c6be5344cb29f5dacb4f85f3b455756"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::run_subagent_task_inner (cyclomatic 34): codewhale_engine::tools::subagent::run_subagent_task_inner has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":17045}}}],"partialFingerprints":{"codehealthFindingId/v1":"69fd39c85af8d4e3806580381b74ba4e635ee0488c015751843f650b98f16549"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecPolicyEngine::check (cyclomatic 34): ExecPolicyEngine::check has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/lib.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"5134868ccab3ae523586e323eb8407480bc37197fee88dfae6858942180ea2bb"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::command_heads (cyclomatic 34): codewhale_execpolicy::shell_expand::command_heads has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/shell_expand.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c42466d3b8b7efa321c9f196c16f360924aeef75e67218aba19815aa82e897d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::dsh::parse_yaml (cyclomatic 34): codewhale_plugins::install::dsh::parse_yaml has cyclomatic complexity 34 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 15 belong to 2 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/plugins/src/install/dsh.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c41e2cbc633bca131ae7fd2c622b34d81dcbd2351fd476e8b1ac0f5de37ba1"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::project (cyclomatic 34): Connection::project has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/runtime.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16c78b3640adfef9d2fce92c988c1e8f45f5fabd389145fbb3cbb82220e9cac"}},{"ruleId":"D1","level":"warning","message":{"text":"TranscriptViewCache::ensure_iter (cyclomatic 34): TranscriptViewCache::ensure_iter has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/transcript.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a96e7d9b12d194a94c929b53436f50e58a2d66ef843eb49867a6ffa0e3e4ce"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowPanel::apply_event (cyclomatic 34): WorkflowPanel::apply_event has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"105c2166606868a35159a724dc53f0c81e67b2f5794b9aa006948abc51cbc2d4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui_kit::diff_render::wrap_parts (cyclomatic 34): codewhale_tui_kit::diff_render::wrap_parts has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12556945c936a05e355cc388744227b885be48dcba5679516645368402e17d6"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControlController::try_next_event (cyclomatic 33): RemoteControlController::try_next_event has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"522103bdad13baee5cfd7c33f2f1f84aa5cf16308bf4b3466955440f61efdf72"}},{"ruleId":"D1","level":"warning","message":{"text":"RouteResolver::scope_selector (cyclomatic 33): RouteResolver::scope_selector has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/route/resolver.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb80f94c7ccaf65f33e84368382992225adefa27fcd942413a90165b43f5bb8"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::new_admitted_with_subagent_manager (cyclomatic 33): Engine::new_admitted_with_subagent_manager has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31344c6d5f291c15d9db60add719604760868f0b4f6b17779c2f714ed1eaf71"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::registry::enforce_tool_authority (cyclomatic 33): codewhale_engine::tools::registry::enforce_tool_authority has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"81abc94437c1d61c6072ae5e654ef9d6bf6bcd810a8c5e4553116063c98ab173"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_memory::run (cyclomatic 33): codewhale_memory::run has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/memory/src/main.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3778fa632ac2e16036824f85ab62325727b8798d80c694b98701df5cdb343a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::validate (cyclomatic 33): Config::validate has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9892a16eaf3f0924687d5797dbb73d54a98ca02c8f1a11f3a1dc33554321d5"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandContextBundle::contexts (cyclomatic 33): CommandContextBundle::contexts has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_tui::commands::contract::key_to_message_id (cyclomatic 109) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":5089}}}],"partialFingerprints":{"codehealthFindingId/v1":"add0bd8c79697181c57ca2f59c46c3aeea57a05fd06c3bbe8caa33b25ac45ab1"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelPickerView::render_route (cyclomatic 33): ModelPickerView::render_route has cyclomatic complexity 33 (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/tui/src/tui/model_picker.rs"},"region":{"startLine":4546}}}],"partialFingerprints":{"codehealthFindingId/v1":"acde45912aa7ad39e4e2b5f21f00bb6b8b0d3523d06385439fa01a352204938f"}},{"ruleId":"D1","level":"warning","message":{"text":"PagerView::render (cyclomatic 33): PagerView::render has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce9eb5a9ed0e8df4b131bc72595378cd7c44ec0b0048e13a04aaf3cfb630431"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionPickerView::handle_key (cyclomatic 33): SessionPickerView::handle_key has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f80e81a0bf97ebc51de87971748f16c684d7462e2b898132a5d75ff7a3c19e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::config::config (cyclomatic 33): codewhale_tui::commands::groups::config::config::config has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/config.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea8ff9443221c5028be5532b6e1d63e35043beee45978b37065aa6a3f89c4e3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::utility::mcp::mcp (cyclomatic 33): codewhale_tui::commands::groups::utility::mcp::mcp has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/utility/mcp.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ce655e8b549a0899157256e7b6482e802c5f4733fdc8062a68ea4852b4607d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::event_loop::apply_engine_session_projection (cyclomatic 33): codewhale_tui::tui::ui::event_loop::apply_engine_session_projection has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca60ff49d1d82f138174459a0070e19e1a701abe57bd446f81348a47253b796"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::frame::info_segments (cyclomatic 33): codewhale_tui::tui::ui::frame::info_segments has cyclomatic complexity 33 (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/tui/src/tui/ui/frame.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"804fbcb9b18f545d88e8ac00ae39912c8981a2dfa828067b583f5d655bdb2bc0"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::buildPyramid (cyclomatic 33): (anonymous)::buildPyramid has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5433f4c2e9d4d8d3d86e2fa61852498ef3eb461f07e1fab2e5c91f9ff7c39f43"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::buildPyramid (cyclomatic 33): (anonymous)::buildPyramid has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c5c427d979b363fa8bea0101927f64d47ff4cc01241ca5397625a92e17dbbc"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::patch_undo_workspace_files_impl (cyclomatic 32): codewhale_app_server::runtime_api::patch_undo_workspace_files_impl has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":9629}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb7f9e7007f2bb0d318641bcdc3878ecb7c397b08bc10348687e7994694b05b"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::execute_tools_with_nested_gate (cyclomatic 32): Engine::execute_tools_with_nested_gate has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be791aca6b92f0658d74d129ba722be43363b66d6a18c2897409f4c16c3ba38"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskManager::run_task (cyclomatic 32): TaskManager::run_task has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5383c75b5cfbb8c6602aa3895d2e3d0ce49e542e7879e8c47987fee7e34f269"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::fleet::identity::resolve_member_in_profiles (cyclomatic 32): codewhale_engine::fleet::identity::resolve_member_in_profiles has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/identity.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"13297b2eee6902e8274a3477a2c29e108fda37d90826f4a78bf4beb83407c52a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::spawn_subagent_from_input (cyclomatic 32): codewhale_engine::tools::subagent::spawn_subagent_from_input has cyclomatic complexity 32 (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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":15581}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e5d66c9ae6fa4e7a2b018bb024d089a12cd483b87cf5efcc1be878c1845bb1"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::dsh::parse_comparator_token (cyclomatic 32): codewhale_plugins::install::dsh::parse_comparator_token has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"5325419a4b8d932bf0ab5b65ffc9e806b1fd598dcbaff291b851773a51989949"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecCell::render_with_locale (cyclomatic 32): ExecCell::render_with_locale has cyclomatic complexity 32 (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/tui/src/tui/history.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e53ea713bc38b521036b5c753c6579def898d23bee668048c08b0a8d5429782"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationEditor::render_field (cyclomatic 32): AutomationEditor::render_field has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb25eae101608547fca692e647c1ef60ecac13caa1b211d6e12e95cfa7405e6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::config_main_host::set_subagents_config_value (cyclomatic 32): codewhale_tui::commands::config_main_host::set_subagents_config_value has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_main_host.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edad50755ac173c95426658c0f11df1b8a3eebe4eabcd4d04a6c32710f29dc5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::skills::skills::list_skills (cyclomatic 32): codewhale_tui::commands::groups::skills::skills::list_skills has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/skills/skills.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"3780953da356032098eef1acc78ffd345156f61d9880be1aa67e3746633267d1"}},{"ruleId":"D1","level":"warning","message":{"text":"index.streamTurnEvents (cyclomatic 32): index.streamTurnEvents has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ffb386ac32d179f904448c9aa8f36ec20bfe9c4da80f1d5354016a0454dabd"}},{"ruleId":"D1","level":"warning","message":{"text":"mobile-menu.MobileMenu (cyclomatic 32): mobile-menu.MobileMenu has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 8 of the 32 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 100, a function literal at line 79, a function literal at line 49, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/mobile-menu.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"170492f9dd8a26a127a9b972cffec499da2799d3bb91d3ec62da0b043f1c6302"}},{"ruleId":"D1","level":"warning","message":{"text":"facts.isRepoFacts (cyclomatic 32): facts.isRepoFacts has cyclomatic complexity 32 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbcfc03664a3cb30cb71cf3d4c2da2eaf35183f37d1f89f996badee81fd76dd"}},{"ruleId":"D1","level":"warning","message":{"text":"createStreamConnector.connectStream (cyclomatic 32): createStreamConnector.connectStream has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 13 of the 32 points are its own statements and the rest belongs to 10 function items inside it that branch (onerror, a function literal at line 562, onopen, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2be9bebf5a9eebeb8aaccce3b350c052f310555cc8790442ed6288c24d8e788"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::work::quote (cyclomatic 31): codewhale_account_cli::work::quote has cyclomatic complexity 31 (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/account-cli/src/work.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dc94c4f9d70dd75207f41934761f5758f95fe82856ecf94eca13b8a6963376"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::stdio::run_stdio_loop (cyclomatic 31): codewhale_app_server::stdio::run_stdio_loop 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/app-server/src/stdio.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"51096d7974acea8fe0132f0f17a9c105bd7abe13fe06175941b9ff5e3acc12a2"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::update::run_update (cyclomatic 31): codewhale_cli::update::run_update 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/cli/src/update.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1158e8c80509a402f6f6ff0b1e21a5ecce1b6ca90e22b05f1215f27665ce27dc"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::build_request_manifest (cyclomatic 31): Engine::build_request_manifest has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/preview.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d20cbaa6ac85579652e804114bb64bd41fee0079b4e24053bc7209f805aa2e"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::async_subagent_wake_op (cyclomatic 31): RuntimeThreadManager::async_subagent_wake_op 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6693}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dad7baca8bc3562b656a475776cab0a4b24237d99476aec384de6d0780b0eb"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::settle_claimed_turn_failure (cyclomatic 31): RuntimeThreadManager::settle_claimed_turn_failure 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12693}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5bcc435d6e437d9393be4406f7121445c3a0dacb8b321b8ea80f28ee3a55df"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadStore::visit_diagnostic_records (cyclomatic 31): RuntimeThreadStore::visit_diagnostic_records 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/engine/src/runtime_threads.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5db0bb931a083dc5b79a499472d5fab118ad1b8740d003916814adb60ffe885"}},{"ruleId":"D1","level":"warning","message":{"text":"CoordinationLedger::validate_replay (cyclomatic 31): CoordinationLedger::validate_replay 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/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d0aeca553e46960ce9d892d8a553a61d883781eb63faca7db85affdb442415"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::compaction::create_summary (cyclomatic 31): codewhale_engine::compaction::create_summary 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/engine/src/compaction.rs"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5680148616a71c1e1191b83c78242264e2de0e7711194333e07966bc6fdb5e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_network::fetch (cyclomatic 31): codewhale_engine::extension_host::dsh_network::fetch 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/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"120a118fb8ab907dfef22b353576f12d8f2d603233ad68a819e8630d45976edf"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::analyze_command (cyclomatic 31): codewhale_execpolicy::command_safety::analyze_command has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_execpolicy::command_safety::readonly_options_are_allowed (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d908b3bef337fe24d08d8de3bd2038fd38a0feb9eee5db1bec647f7820253c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::split_ansi_c_shell_words (cyclomatic 31): codewhale_execpolicy::shell_expand::split_ansi_c_shell_words 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/execpolicy/src/shell_expand.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"86815136829ce6be54bb9086ca6adc92fd937c2012c59472058fd8c278a12d37"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::default_model (cyclomatic 31): Config::default_model has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":5419}}}],"partialFingerprints":{"codehealthFindingId/v1":"9594f0d9d6aef3712b961e6634f82183003cd97d21108e6a3dd2205556ce5b69"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoryCell::lines_with_options_folded (cyclomatic 31): HistoryCell::lines_with_options_folded has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d4a10cea77430419878bd235d5daa9d6ec7cb349b5f5ad8cdf8d924f4842cc"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderPickerView::handle_mouse (cyclomatic 31): ProviderPickerView::handle_mouse has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":5431}}}],"partialFingerprints":{"codehealthFindingId/v1":"219407883fe781aa8584418d306a6cfd8f9e32f682624458bfd681a16c0edbc2"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetDetailView::handle_key (cyclomatic 31): FleetDetailView::handle_key has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c35c1bd59189bf6fdae3d32ec4c2a5945f02c2dd7be00acffa96ef9389dc25"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowPanel::from_run_json (cyclomatic 31): WorkflowPanel::from_run_json 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/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcba5fffd6757af10b2996772baade7218827ae94d782b563b128c00fb315b7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::agent_details::project_agent_details (cyclomatic 31): codewhale_tui::tui::agent_details::project_agent_details has cyclomatic complexity 31 (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/tui/src/tui/agent_details.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"50290507cf171f636edfe0a71e035e071014c2ef11485da6b4e456ac4bb87242"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::input::handle_key (cyclomatic 31): codewhale_tui::tui::work_surface::input::handle_key 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/tui/src/tui/work_surface/input.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f5ebc298562c20943528d2abbe50a4f8c08e1d3df66b64c521671d36dde849"}},{"ruleId":"D1","level":"warning","message":{"text":"app.createStreamConnector.connectStream (cyclomatic 31): app.createStreamConnector.connectStream has cyclomatic complexity 31 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 15 belong to 8 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b11b91e1f20e3e2b376c59ef2bd0c5d827e0b339d512ebb7f8c5ff6661a5256"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::fromRecording (cyclomatic 31): (anonymous)::fromRecording has cyclomatic complexity 31 (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"8454534e3ac58e484ce18c50f782b06e1aa8e5c778823fb48747ead87fc57065"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::fromRecording (cyclomatic 31): (anonymous)::fromRecording has cyclomatic complexity 31 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbaab97e65a609915fbadc84ea6171c047e4566fd1997f14aea0d6e7a8ea88d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::work::write_work_result (cyclomatic 30): codewhale_account_cli::work::write_work_result has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/work.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"747a80f0c7a2d2f071729015cec84b5b5deaf0ce7e7f6777fb9a7b5d4dffa1f7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::metrics::print_human (cyclomatic 30): codewhale_cli::metrics::print_human has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d502958980ee18684ff21b9af0e940f11be69ffcd13841cd9609cc32ee922363"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogOffering::retain_fact_sources (cyclomatic 30): CatalogOffering::retain_fact_sources has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/catalog.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bec01921fdceb920e78c4ffba1a0d176e0e50eb1b531ecdc064846951f6cca"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::recover_context_overflow (cyclomatic 30): Engine::recover_context_overflow 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/engine/src/core/engine/compaction.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b358724b0b83eb0b91563529c81be32a2f1cf99c894074c50ca5db241e7a1a7"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::gate_nested_call (cyclomatic 30): Engine::gate_nested_call has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8507c4083b211a8cfcfd49066ab3fa31d7a4701cc913028a718e5a89030038b7"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetManager::reconcile_coordination_worker_statuses (cyclomatic 30): FleetManager::reconcile_coordination_worker_statuses 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/engine/src/fleet/manager.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"88253210d4cc29e71a5dc6eba6b8b91f4e0403b697f74348b40b43dfc053b330"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::pricing::audit_turn_cost_for_provider_on_endpoint_for_identity_at (cyclomatic 30): codewhale_engine::pricing::audit_turn_cost_for_provider_on_endpoint_for_identity_at has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/pricing.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcc626597362fe99cc12983e6d7b2e62adcd18bb67864287fba533b7b8ae709"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::task_manager::drive_engine_turn (cyclomatic 30): codewhale_engine::task_manager::drive_engine_turn 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/engine/src/task_manager.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dc9acecc22b26b0bdef10a3e75f2bf3d65fbbf4f178287620fd20822c20527"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::approval_summary::approval_summary_in (cyclomatic 30): codewhale_engine::tools::approval_summary::approval_summary_in has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/approval_summary.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a418cdbe54afe3f0e7e6a2d52c444366835b0d8fee94e6a68c8ba38a3cccdae"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::parse_spawn_request (cyclomatic 30): codewhale_engine::tools::subagent::parse_spawn_request has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":18678}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda480039c61ce13b6b590e73c0e0cae64ae3cbfa19c2bfc12bd3675e206bfd9"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::workflow::run_workflow_vm (cyclomatic 30): codewhale_engine::tools::workflow::run_workflow_vm 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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe04871d1e0468d7ef10ac3bbf1ffc8a36da51d3f6187d531c68468420d604b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::safe_command_arguments_are_read_only (cyclomatic 30): codewhale_execpolicy::command_safety::safe_command_arguments_are_read_only has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_execpolicy::command_safety::readonly_options_are_allowed (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":2575}}}],"partialFingerprints":{"codehealthFindingId/v1":"72817bc61b6bea807ad888c4fcea04557e1aa4b7ef46f530b278d5f30286bcf4"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigView::handle_editing_key (cyclomatic 30): ConfigView::handle_editing_key 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/tui/src/tui/views/mod.rs"},"region":{"startLine":3635}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a28989b6b30fa2596ff3cb7b97c72b8ea53621317b3f73f75d4f46670b8725"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ambient_life::paint_marks (cyclomatic 30): codewhale_tui::tui::ambient_life::paint_marks 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/tui/src/tui/ambient_life.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"207e0f427f327d530250fbb1891199ea5a7d333987e3128c90dbded3f59c1fa3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::find_math_end (cyclomatic 30): codewhale_tui::tui::history::latex_render::find_math_end 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_tui::tui::history::latex_render::append_superscript (cyclomatic 42) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6799ea5b64d9280b6688e67593d8c81e321ed6fafb1cd256e313cdd3a7e5e5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui_kit::markdown_render::parse_inline_spans (cyclomatic 30): codewhale_tui_kit::markdown_render::parse_inline_spans 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/tui-kit/src/markdown_render.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"499fdd5f93fa1c0bcf016d899d3e4ee85107e90e2af3aa900359f41346cefe59"}},{"ruleId":"D1","level":"warning","message":{"text":"index.streamTurnEvents (cyclomatic 30): index.streamTurnEvents 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":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"539aaf35274fcb89e2b752616edb0f584977e815e642bd3829191d72c917d685"}},{"ruleId":"D1","level":"warning","message":{"text":"signal.buildPyramid (cyclomatic 30): signal.buildPyramid 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":"pet/src/core/signal.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dec3847e0483597cb67e721be3a682094703ffdda331b194787a0f895e101f1"}},{"ruleId":"D1","level":"warning","message":{"text":"report-contribution-cohorts.contributionCohorts (cyclomatic 30): report-contribution-cohorts.contributionCohorts 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":"telemetry-ingest/scripts/report-contribution-cohorts.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5207e8d8e0f28fa0a5be15f586226c05121e85d50192179fc377d0c709909a"}},{"ruleId":"D1","level":"warning","message":{"text":"merch-interest.MerchInterest (cyclomatic 30): merch-interest.MerchInterest has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 7 of the 30 points are its own statements and the rest belongs to 7 function items inside it that branch (join, a function literal at line 35, a function literal at line 71, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-interest.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f17bac290f9753086e0d915e54c106a63056a910344ea00e0a739f81fce86"}},{"ruleId":"D1","level":"warning","message":{"text":"model.reviewedRoute (cyclomatic 30): model.reviewedRoute has cyclomatic complexity 30 (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":"web/lib/merch/model.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"868f72bb6fe0b5d0d9fc6767c3d8b4adb850f327e2edfa267db922f6646ec005"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::stream_turn (cyclomatic 29): codewhale_app_server::runtime_api::stream_turn 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/app-server/src/runtime_api.rs"},"region":{"startLine":11259}}}],"partialFingerprints":{"codehealthFindingId/v1":"022d2e37e994ef2035393ef02281868d2b44878a23e6b7ac4e508e9e3c176eed"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::thread_control::handle_owned (cyclomatic 29): codewhale_app_server::thread_control::handle_owned 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/app-server/src/thread_control.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"b047d29dccd4ab977881141a682ef99bb25b345a359c08758707f24499868a9f"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderLivePricingQuote::pricing_for_route (cyclomatic 29): ProviderLivePricingQuote::pricing_for_route has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e21250bea517df329fdde9cebd0b1712b979512942794ac33a13caecd15a2f"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeOptions::merge (cyclomatic 29): RuntimeOptions::merge has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_options.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b712effb454c27901520959490c95f7fb7e36d8efe770b83dbab054ae95f765"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewTool::execute (cyclomatic 29): ReviewTool::execute 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/engine/src/tools/review.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed13783ecad3c86a5d382e24b970baa7da8178f8d24b8434bfb19bedab032e3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::summary::build_summary (cyclomatic 29): codewhale_plugins::install::summary::build_summary 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/plugins/src/install/summary.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"155e3d9dda065184d3a972da793008de229830b0ab4da3114237104acfe48d4d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::config::pet (cyclomatic 29): codewhale_tui::commands::groups::config::config::pet 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/tui/src/commands/groups/config/config.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fbdfbc063a819ee2153c1006ed66901ada942f1ad9e79c69b31ff166dc51d3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_goal_snapshot_to_app (cyclomatic 29): codewhale_tui::tui::ui::apply::apply_goal_snapshot_to_app has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"693e5fe54180c4b9d1a52baee5b53cc5f0804e8b11e5204362ebec604119bcf1"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::task_projection::refresh_active_task_panel (cyclomatic 29): codewhale_tui::tui::ui::task_projection::refresh_active_task_panel has cyclomatic complexity 29 (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/tui/src/tui/ui/task_projection.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaec45594d2716cdf90ee4feb9b14173c637344ab587577716c7ee53f4c9afb"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.fromRecording (cyclomatic 29): PetWorld.fromRecording has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"678965846f179efa4d2ca63fc9bc8c12bc19bb7658e2a79734968e69e134e609"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.fromRecording (cyclomatic 29): PetWorld.fromRecording has cyclomatic complexity 29 (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff01bf609567fa8b020b3e714c837042c5c1a3c6d52f38adafc497bf1a2d4f8"}},{"ruleId":"D1","level":"warning","message":{"text":"pet-sim.gaitTarget (cyclomatic 29): pet-sim.gaitTarget 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":"pet/src/core/pet-sim.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f26f2d826a2c6d7b2ecddea90e06f6b9d1c3d843a262cb1837aefebd37cf42"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.fromRecording (cyclomatic 29): PetWorld.fromRecording has cyclomatic complexity 29 (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":"pet/src/core/pet-world.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99ec1dc42931957e1876745e72243d3bcef3fd5d1b7a5d90c9e557216ea3e2e"}},{"ruleId":"D1","level":"warning","message":{"text":"facts-publish.main (cyclomatic 29): facts-publish.main 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":"web/scripts/facts-publish.mjs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb6f0eede06093d1623be9263e525dd1a1c866a665a7835dda591e6484260f5"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::gaitTarget (cyclomatic 29): (anonymous)::gaitTarget 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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"332f424c3f38c1b6e141059821f0c9aa938cc1d9cc91723d7776eab1667181fe"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::gaitTarget (cyclomatic 29): (anonymous)::gaitTarget 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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca15e9d26bdbb948436a72ae3fa3de489cb269653a545a6c8ba875aba31889d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::run_with (cyclomatic 28): codewhale_account_cli::run_with has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb594adc8fb3892ab66bf1e25f051eeaecd40ea700049aa4de040801068a1ca"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptRun::project_event (cyclomatic 28): PromptRun::project_event 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/app-server/src/acp_server/runtime.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bb8e6a52f8812726daeb0b7ee9f21b3842ff4115def8846d41da4e96390eda"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::remote_control::parse_remote_command (cyclomatic 28): codewhale_app_server::remote_control::parse_remote_command 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/app-server/src/remote_control.rs"},"region":{"startLine":4628}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3222d4531686dc6c8143b643ed380f522ba5ca01634dd272c6b15fe36038b97"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::worktree_remove (cyclomatic 28): codewhale_app_server::runtime_api::git::worktree_remove 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/app-server/src/runtime_api/git.rs"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"79644bafc75afaed68781c0f1a156ffd1f88d9c323e81575c45f79b56f436502"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::ty (cyclomatic 28): Builder::ty 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/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4118293a0851da802199ba7ecb3cc74dc9d31c3abcab78fa52f5d227ddd0ff"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::update::uninstall::remove (cyclomatic 28): codewhale_cli::update::uninstall::remove 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/cli/src/update/uninstall.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dd5c15b29aad4d9f31e7d6c4dc85d02ac8f270eb7925f24088f2de827822ef"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigToml::set_value (cyclomatic 28): ConfigToml::set_value has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_resolve.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fa886281edc48770b5c56e45cb5205229653a23109fb9077eca57bfa22c98b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_config::cloud_facts::scope::scoped_view (cyclomatic 28): codewhale_config::cloud_facts::scope::scoped_view 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/config/src/cloud_facts/scope.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cabced9994f67de39371cbe0c29048faa4432e80cbb444d8dd3ba3d8bde0897f"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::run_auto_compaction (cyclomatic 28): Engine::run_auto_compaction 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/engine/src/core/engine/compaction.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"682d7c3265f6e728abd12a46475fb44395dca93d0f34139b629be329c1d22c75"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::next_run_input (cyclomatic 28): Engine::next_run_input 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/engine/src/core/engine.rs"},"region":{"startLine":3634}}}],"partialFingerprints":{"codehealthFindingId/v1":"52792f6bff6fc655a5f21c60ef1e6d89983493da491c67e6f68add099fdb444c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::mcp_http::read (cyclomatic 28): codewhale_engine::extension_host::mcp_http::read 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/engine/src/extension_host/mcp_http.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fffc586e0d0a5226832493be9b664752e39a31c843cef1c08a1acc57b466a3c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::approval_summary::mcp_summary (cyclomatic 28): codewhale_engine::tools::approval_summary::mcp_summary has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/approval_summary.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78cf934eecacd2a2a5e8e4df7f6999136c5d0d856a46c43f01c13a92f603e5e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_palette::adapt::adapt_fg_for_theme (cyclomatic 28): codewhale_palette::adapt::adapt_fg_for_theme has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e578a94c69310f10e5e64d3c104a63a9009549a5a8536d7df1a66277c980a75"}},{"ruleId":"D1","level":"warning","message":{"text":"Components::walk (cyclomatic 28): Components::walk 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/plugins/src/install/dsh.rs"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac74a67864db1c75ca6e94587de93c42b2fdf84915517c03e09b429073e8708"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::agent_plugin::validate_mcp_server_json (cyclomatic 28): codewhale_plugins::agent_plugin::validate_mcp_server_json 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/plugins/src/agent_plugin.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d4ea7a2debcdaad6132c09742adebeb92f1540c867093ec5916660ddd2e882"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::file_mention::stabilize_screenshot_references (cyclomatic 28): codewhale_tui::tui::file_mention::stabilize_screenshot_references 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/tui/src/tui/file_mention.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef5ba53fd9a02a21b93534a6d19b7d0278c550345b47d3012d044de9418e95a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::mouse_ui::handle_composer_mouse (cyclomatic 28): codewhale_tui::tui::mouse_ui::handle_composer_mouse 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/tui/src/tui/mouse_ui.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3db797b3b1f53f5b29291dff33097cd0785c619e533748428feef2f504beca"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::tick (cyclomatic 28): codewhale_tui::tui::pet_watch::tick 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/tui/src/tui/pet_watch/mod.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6902321d9708125167146cda1f219229b8dad75ae2a7f61baa669ab204de97"}},{"ruleId":"D1","level":"warning","message":{"text":"extension.activate (cyclomatic 28): extension.activate has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 3 of the 28 points are its own statements and the rest belongs to 9 function items inside it that branch (checkAndRefreshRuntime, a function literal at line 151, a function literal at line 170, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/extension.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac4f5425c4a8374abe0d9a168569b302b9fdae39dfe6546101e384767b06e61"}},{"ruleId":"D1","level":"warning","message":{"text":"DingTalkBridge.consume (cyclomatic 28): DingTalkBridge.consume has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to one function literal inside it that branches (line 307). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c38de31f77a2e01bd4156133b7e1db057581a1488e165898583afc461349bb2"}},{"ruleId":"D1","level":"warning","message":{"text":"pet-recorder.createPetRecorder (cyclomatic 28): pet-recorder.createPetRecorder 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":"pet/scripts/lib/pet-recorder.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cf741a30dbd3eb95f82f4f8cbbc11586a71c8763fff24e23e16ae8811c300c"}},{"ruleId":"D1","level":"warning","message":{"text":"capabilities.parseReleaseBaseline (cyclomatic 28): capabilities.parseReleaseBaseline has cyclomatic complexity 28 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 10 belong to 3 function literals inside it that branch. 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":"web/lib/capabilities.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7f4276673ffc5001c47dd2fa5fbcab8aa464eae093374d8fe58f158ef1696e"}},{"ruleId":"D1","level":"warning","message":{"text":"computer-use-release.releaseAssets (cyclomatic 28): computer-use-release.releaseAssets has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/computer-use-release.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d576e30969478d42f97a079134798a1fc3693bc96160145c2d2fb856eb3d67d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::daemon_socket::attach (cyclomatic 27): codewhale_app_server::daemon_socket::attach has cyclomatic complexity 27 (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/app-server/src/daemon_socket.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c38cdaa83b57bf0ade7c896e9f2dedc744e7a7bffac2078b26144e0825f360"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::run_http_server (cyclomatic 27): codewhale_app_server::runtime_api::run_http_server 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/app-server/src/runtime_api.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbb2d5b37ed2e312d0e234652a99fe6d5065a1e8f30b447b31b6df335da3697"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::replay_live_thread_events (cyclomatic 27): codewhale_app_server::runtime_api::replay_live_thread_events has cyclomatic complexity 27 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9830d627fa748ef421001e517eae371fd6101f4db16722f9db5ae7585dd3a8c5"}},{"ruleId":"D1","level":"warning","message":{"text":"RouteResolver::resolve_scoped (cyclomatic 27): RouteResolver::resolve_scoped has cyclomatic complexity 27 (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/config/src/route/resolver.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ddcd450ef917c8c6260f2f011dc9f0796ec6f916abb0de9b6ffde2f7332f03"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetFile::validate (cyclomatic 27): FleetFile::validate 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/engine/src/fleet/store.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2befefb2a46fb23bc37c43ce544f86dbb7c9b064884a3064a1a3e619d97d3f"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::prepare_fork_from_cutoff (cyclomatic 27): RuntimeThreadManager::prepare_fork_from_cutoff 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf430fae6768aa1d57e8bd78c23b944d1b087c5a227b611e40651177beee1a7"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::ensure_engine_loaded (cyclomatic 27): RuntimeThreadManager::ensure_engine_loaded 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":15184}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5879487bc66cf9a915d61d6e3e6458144bc64ce4f9a497c8c5e98be1d24b6c"}},{"ruleId":"D1","level":"warning","message":{"text":"SubAgentManager::cleanup_inner (cyclomatic 27): SubAgentManager::cleanup_inner has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":11113}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d7c4eaf877942d230547477a51867c8f6b2230fb0a911664bb22d47ceb44b2"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::catalog_delta_from_models_body (cyclomatic 27): codewhale_engine::client::catalog_delta_from_models_body 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/engine/src/client.rs"},"region":{"startLine":6195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2fad0c8b9993128b67c511af85c1fc2043c50b3bc18c5c615c5964ec84f929"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::receipts::tally (cyclomatic 27): codewhale_engine::receipts::tally has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"a528063b02fe97b8486a29091ac14255f827f1fd45a4f502a13d9fc7987af200"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::push_ansi_c_escape (cyclomatic 27): codewhale_execpolicy::shell_expand::push_ansi_c_escape 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/execpolicy/src/shell_expand.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"3832e4e1b137a115a127e827d5242cbe9ecdee78b481e929fc69c6e431dbfb49"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_release::installs::classify (cyclomatic 27): codewhale_release::installs::classify has cyclomatic complexity 27 (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/release/src/installs.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cfae7d3fed17d8cc1d68ffb7e8117a27b6c01d2b54d6efc42022c2e13fddb4"}},{"ruleId":"D1","level":"warning","message":{"text":"HelpView::handle_key (cyclomatic 27): HelpView::handle_key has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/help.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4986c1259fed93e7584cfb23331865ab1e9fb2b5cdde92ef21aebdf01675a6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::merge_project_config_with_approval_baseline (cyclomatic 27): codewhale_tui::merge_project_config_with_approval_baseline has cyclomatic complexity 27 (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/tui/src/lib.rs"},"region":{"startLine":14262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b546a646154cf21c818dcc39a21b622015c6f0f854f83b9981255556a4cfc3e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::effective_picker_metadata_with_codex (cyclomatic 27): codewhale_tui::tui::model_picker::effective_picker_metadata_with_codex has cyclomatic complexity 27 (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/tui/src/tui/model_picker.rs"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aea4598639e743b267a6de577281f1566c362fd20a87fdba241d65a5bb84503"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::runtime::run (cyclomatic 27): codewhale_tui::tui::pet_watch::runtime::run 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/tui/src/tui/pet_watch/runtime.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff33bbdb1c844682011e193e39d0969472664804dbfdffdf8a2848dabebe223"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_loaded_session_with_goal (cyclomatic 27): codewhale_tui::tui::ui::apply::apply_loaded_session_with_goal 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/tui/src/tui/ui/apply.rs"},"region":{"startLine":4552}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f9f0a413135476ce2064718987bdb08560bb535ed6d99552789026ec13e2f3"}},{"ruleId":"D1","level":"warning","message":{"text":"admin-client.AdminClient (cyclomatic 27): admin-client.AdminClient has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 7 of the 27 points are its own statements and the rest belongs to 4 function items inside it that branch (handleAction, a function literal at line 71, a function literal at line 156, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/admin/admin-client.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1693201958222be1cf5db3a75d4d882a70fd7307f5a3dca379bfb3440b3e315f"}},{"ruleId":"D1","level":"warning","message":{"text":"operator.operatorAction (cyclomatic 27): operator.operatorAction 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":"web/lib/merch/operator.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bc3f4716167d60cad13730739fd9aedf4ad48ca13920401a97a372e3c51361"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::restore (cyclomatic 27): (anonymous)::restore has cyclomatic complexity 27 (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"43df3dde10ca7213c5dfbe7564493a5d123ef38a6f888a0056182631050aaaa4"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::restore (cyclomatic 27): (anonymous)::restore has cyclomatic complexity 27 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"04af4ea0c08b200e9298d86da61065d5d95928a09fe582ddf6950bd5e2100bd6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::turns::message_native_thread (cyclomatic 26): codewhale_app_server::turns::message_native_thread has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/turns.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c113dd7f4f8d7effba8d0065afa89eae60912db15ae93a9c78c73eef5ae36f93"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_commands::debug::cache_format::format_cache_calls (cyclomatic 26): codewhale_commands::debug::cache_format::format_cache_calls has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache_format.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"6747912bd369c238617036931ce32e194e17f273589e429404b403ae500058b9"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_config::responses_dialect_data::parse (cyclomatic 26): codewhale_config::responses_dialect_data::parse has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_config::responses_dialect_data::variant (cyclomatic 50) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/responses_dialect_data.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53ab308cb79fde128aa6108cbb1133bdc4e66c86daba67860be3504ad7d0228"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::await_tool_approval (cyclomatic 26): Engine::await_tool_approval has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/approval.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5def7b57a616b9d73a34f45557b28528cc028d7cd42227222f1649cdf20bec5"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::run_tool_batch_phase (cyclomatic 26): Engine::run_tool_batch_phase has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/tool_batch.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"da20fb11a7cb8c1a23fbcfec706417fbeb4aed97bc464a77bf82b30d95f57c39"}},{"ruleId":"D1","level":"warning","message":{"text":"ReasoningEffort::normalize_for_route_identity (cyclomatic 26): ReasoningEffort::normalize_for_route_identity has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/reasoning_preference.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecae2ad9dc626a9f973fad93b7784502db0a62a4a66f83cb86d729c72c9f0c8"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateGoalTool::execute (cyclomatic 26): UpdateGoalTool::execute has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/goal.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7786282a2a4b2d64c06563f0e0e71249d2dc6cca696379989d2cfecdb7ea1ed"}},{"ruleId":"D1","level":"warning","message":{"text":"CoordinationLedger::register_claim_in_scope (cyclomatic 26): CoordinationLedger::register_claim_in_scope has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e41dfe41a52dd522a3c5c853ace7d338c9fddaee542de7f66438bd268e2fd2f"}},{"ruleId":"D1","level":"warning","message":{"text":"SubAgentManager::with_store_transaction (cyclomatic 26): SubAgentManager::with_store_transaction has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":5999}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c31e5e12796b7ed78d94742a33497197998a090c40ca26052e97707d2f7bf71"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::hooks::executor::sanitize_hook_denial_reason (cyclomatic 26): codewhale_engine::hooks::executor::sanitize_hook_denial_reason has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4d9a07e4d5a8719984ecd6ec09784f4df3b041ee3faf16a52a3925080307ab"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::github::host::run (cyclomatic 26): codewhale_engine::tools::github::host::run has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/host.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a46cbc7dcb7bdbbeface5298960db5139bc75053ca640672bed9687f5b40166"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::web_search::run_scrape_search_with_endpoints (cyclomatic 26): codewhale_engine::tools::web_search::run_scrape_search_with_endpoints has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbde49f4b3f723a284ba7027180aae33eba081000f7d885427ed8345d2dca20b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::read_substitution (cyclomatic 26): codewhale_execpolicy::shell_expand::read_substitution has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/shell_expand.rs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"faea96e258c54fbfb5b7d39088fa78fa9c16d2235cc1d0d095fe58771881cf9a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_palette::adapt::adapt_fg_for_light_palette (cyclomatic 26): codewhale_palette::adapt::adapt_fg_for_light_palette has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cd0e06e6f3969162175432e02ada24e9e14d165a9d0c816b8ef93e79df069c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::agent_plugin::parse_claude_plugin_json (cyclomatic 26): codewhale_plugins::agent_plugin::parse_claude_plugin_json has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/agent_plugin.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b04aed33245aa7184d9f3e44c3ef19322ea1978b5e623e918385b32202ef0fb"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillRegistry::discover_recursive (cyclomatic 26): SkillRegistry::discover_recursive has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/lib.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d96fad5a6e49a58ce6c6de4415266ad0044801751e9b5725edd82d91a150b6c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionsView::handle_key (cyclomatic 26): ExtensionsView::handle_key has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/extensions.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0f3b8fbe77e94c2275c3bef37dc14dbd51916ffcfe81155dbe83517b944ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetDetailView::render_overview (cyclomatic 26): FleetDetailView::render_overview has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd594b50a5a18c566ee0d9d544d5a001265ee53f4e381d4b3ee771778a4b81b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::prepare_mounted_session (cyclomatic 26): codewhale_tui::prepare_mounted_session has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":10911}}}],"partialFingerprints":{"codehealthFindingId/v1":"3519b64d403e2b55509729aaa040d0479fd17fbe838faf9b81428ce550d2a930"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::contract::debug_operations::plan_undo_range (cyclomatic 26): codewhale_tui::commands::contract::debug_operations::plan_undo_range has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/debug_operations.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f7636c48c62c21e4b9056075f24b14a0826c005f77a26c552bed8fb0e3aa0a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::conformance::mcp::server::answer (cyclomatic 26): codewhale_tui::conformance::mcp::server::answer has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/conformance/mcp/server.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ef59778172165c4142112e5c6013352fc8924e8f9f6d5acdfc3c6404c76bf1"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::provider_routes::switch_provider_inner (cyclomatic 26): codewhale_tui::tui::ui::provider_routes::switch_provider_inner has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/provider_routes.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5727dec2074aa7a4c1adf5869c65b541563388a1f44a6a59e8594839646ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::widgets::agent_card::apply_to_delegate (cyclomatic 26): codewhale_tui::tui::widgets::agent_card::apply_to_delegate has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/agent_card.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edb4714413c7984b93d86fc874c2c1d4a3c579385178da195880661e887af9e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::terminal::render (cyclomatic 26): codewhale_tui::tui::work_surface::terminal::render has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ab28ddec2d91521f66a52ebcb337ecbe517ec178c3f4f199280249448b2c55"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui_kit::diff_render::render_diff_into (cyclomatic 26): codewhale_tui_kit::diff_render::render_diff_into has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c6cace5e6cbc39d72743c72052a251d46e3786d8addf73ef567ac293588482"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSharedHabitat.body (cyclomatic 26): PetSharedHabitat.body has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetShared.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdbf204031c75faf162b93b7c850be1787714b14bb72b3b2a999f52e9889149"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSim.swift.gaitTarget (cyclomatic 26): PetSim.swift.gaitTarget has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetSim.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f333bac5287fe6fb3c395f4ac9932dce75442a4dac94742dbc9edc565642e239"}},{"ruleId":"D1","level":"warning","message":{"text":"qr.penalty (cyclomatic 26): qr.penalty has cyclomatic complexity 26 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"82daf307b8c94a93c381f8ddda6501c0d870f0c74b7ca01356bced0f796a3cae"}},{"ruleId":"D1","level":"warning","message":{"text":"install.withRetry (cyclomatic 26): install.withRetry has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"f646b39c4160eac3513813b14f98fd2ed8f6dd959b60112038367ddb774ab408"}},{"ruleId":"D1","level":"warning","message":{"text":"pet-recorder.createPetRecorder.append (cyclomatic 26): pet-recorder.createPetRecorder.append has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-recorder.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f17b7e1ad6e311e775916c6060657c2aa667ee01488f9021f37007ae865a7d"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountClient::connect_models_with_cancel (cyclomatic 25): AccountClient::connect_models_with_cancel has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/session.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e682da0654dbd21840786cf1743cfc72c705b1f1fae9d333840cab42a0ab498"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::audit_skill_api (cyclomatic 25): codewhale_app_server::runtime_api::audit_skill_api has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":6732}}}],"partialFingerprints":{"codehealthFindingId/v1":"331de0c143a2ef48e07a8a4edd91d4fb34145c5c2a675be29895f9bc66e790f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::union (cyclomatic 25): Builder::union has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"6060a57e55c7009182f0938caf891789fef2a639d43c8a3f9c80fc7a8a1eadb4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::apply_tui_env (cyclomatic 25): codewhale_cli::apply_tui_env has cyclomatic complexity 25 (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/cli/src/lib.rs"},"region":{"startLine":6738}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f91bd891282db28999eceb3344d4186353ebd8934a56713977071a29cb338f3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_config::legacy_root::plan_scope (cyclomatic 25): codewhale_config::legacy_root::plan_scope has cyclomatic complexity 25 (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/config/src/legacy_root.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"63eef3aff4f9ddc9a17aef39706d7af26853d382ef9bfe4e30fbf9e4e891f5bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::run_turn (cyclomatic 25): Engine::run_turn has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae63c7ddf64fe4f70f6ce95cee881c22c927fc3d9273f9d355a9b74dd6462577"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecAgentEvents::next (cyclomatic 25): ExecAgentEvents::next has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/exec_events.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b49c2bb368eb0a3d6e63e530e8b4e55b96bdb2d8da44410eb8c9017b94ea67"}},{"ruleId":"D1","level":"warning","message":{"text":"HostProcess::spawn (cyclomatic 25): HostProcess::spawn has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d7a3863563aab1d5f67c5f74724ee34880be61d289589941fcd2b02b641757"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::apply_external_update (cyclomatic 25): RuntimeThreadManager::apply_external_update has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3e0a948c356ee9071d7de120cd90f75c7637545b6a0def5f7bf71954709a4f"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::create_thread_with_reserved_id (cyclomatic 25): RuntimeThreadManager::create_thread_with_reserved_id has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7876}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08744157c0fa02596a950325fd360043e4bbaab9877c22620f984bff408c5dd"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::aggregate_usage (cyclomatic 25): RuntimeThreadManager::aggregate_usage has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":8561}}}],"partialFingerprints":{"codehealthFindingId/v1":"132a22782a9f84c32fa0691b2db45d6bd107d75b18ea10d2bee537f7d56cabc1"}},{"ruleId":"D1","level":"warning","message":{"text":"SubAgentManager::record_worker_source_admitted (cyclomatic 25): SubAgentManager::record_worker_source_admitted has cyclomatic complexity 25 (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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":7632}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a95f014ef10f3c0ed4879bd94e1402de3054391c3ad0bf98b9cec1f7a1a4658"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::responses::build_responses_wire_body (cyclomatic 25): codewhale_engine::client::responses::build_responses_wire_body has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/responses.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"85675f2e8594478e13f43260335ef9bd24badf31b6fff89dd2c6729b5ea5797d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::windows::edit_acl (cyclomatic 25): codewhale_engine::extension_host::windows::edit_acl has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ebb8174cd77c965e1fea1a78cb58bfdbdaa3932f678444998a30a36dccab09"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::session_image_prune::prune_clipboard_images (cyclomatic 25): codewhale_engine::session_image_prune::prune_clipboard_images has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_image_prune.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bb368cdbd28e54ad1090bc248c69a384a76524a9cbbe455f6dacbf160742c7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::workflow::bounded_run_record_value (cyclomatic 25): codewhale_engine::tools::workflow::bounded_run_record_value has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f587c86d66031fbeb241b6b4b443f6a1c5aec0197400660b12444649b9e1f2fe"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_error_taxonomy::classify_error_message (cyclomatic 25): codewhale_error_taxonomy::classify_error_message has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/error-taxonomy/src/lib.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa25e8078ada9aa8f313e75f5d841ed74b1e498cf3fc16bc4b2890b63e81f76"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_palette::adapt::nearest_ansi16 (cyclomatic 25): codewhale_palette::adapt::nearest_ansi16 has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"954e710929785454be941df624912b37783463bc09b5b187737c106038c348d3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::dsh::presets::contained_module (cyclomatic 25): codewhale_plugins::install::dsh::presets::contained_module has cyclomatic complexity 25 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh/presets.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f014f1ca4bb6439f62162bf29cdec7011bf55e10563f4791e06adba0f9dc58c"}},{"ruleId":"D1","level":"warning","message":{"text":"App::announce_settled_workflows (cyclomatic 25): App::announce_settled_workflows has cyclomatic complexity 25 (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/tui/src/tui/app.rs"},"region":{"startLine":6686}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec99016edaebc478fa187aeb29de0b2bfcf12718d999502a42b03add7be9583"}},{"ruleId":"D1","level":"warning","message":{"text":"ExploringCell::render_with_locale (cyclomatic 25): ExploringCell::render_with_locale has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"505c35d7b40827eef3ce908898b0636ea5caf175b47f73c1ff18949a417092a0"}},{"ruleId":"D1","level":"warning","message":{"text":"LiveTranscriptOverlay::handle_key (cyclomatic 25): LiveTranscriptOverlay::handle_key has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/live_transcript.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"7587d518e93cfd5eb815797fc59339df4d52b30d07f8abaa38a7977b5499f8fc"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::session::export::parse_request (cyclomatic 25): codewhale_tui::commands::groups::session::export::parse_request has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/export.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2af8a160da5432fe6fc0b25007f3cae545cee61b68e36e3662b608bc43812f3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ambient_life::pet_sim::gait_target (cyclomatic 25): codewhale_tui::tui::ambient_life::pet_sim::gait_target has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ambient_life/pet_sim.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96f74013c302d0310b17ee8e0d17fd47c2f55066cfa3293c1f689544f265907"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::history::tool_output::output_projection (cyclomatic 25): codewhale_tui::tui::history::tool_output::output_projection has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/tool_output.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acac9b48e4c358ffab448230fcc458a5cc94e7669a607d36149890dc1145787"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::tool_routing::handle_tool_call_started (cyclomatic 25): codewhale_tui::tui::tool_routing::handle_tool_call_started has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/tool_routing.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e9bc7d9d20a8cdee82feb7f603fa9a08209de1fe911b249ffefb7f1da2598e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_workflow::redaction::redact_assignment_segment_at (cyclomatic 25): codewhale_workflow::redaction::redact_assignment_segment_at has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/redaction.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93198abdfea5901478479991da93d22ab47afb79ef5d20dc43e9600e0e801e2"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_workflow::redaction::redact_structured_token (cyclomatic 25): codewhale_workflow::redaction::redact_structured_token has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/redaction.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"180f658201f9c55163a4d998cfa1eca7f55330e3e4b5ca83eaf8d528a0474325"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_workflow_js::vm::line_leading_export_default (cyclomatic 25): codewhale_workflow_js::vm::line_leading_export_default has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/vm.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9d2065fad0267080908bd6ce9beb0f8e8f2b963a6395b5c5b82e58d3017285"}},{"ruleId":"D1","level":"warning","message":{"text":"PetScore.voices (cyclomatic 25): PetScore.voices has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c9c69613e567a0a1b88d632d864edb30ebea800a2a44e649971b21f2175ef1"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatView.handleWebviewMessage (cyclomatic 25): ChatView.handleWebviewMessage has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc21714b1bb9eafeebba23fda355bada2cf45c3b8374678cd13655fd919aca23"}},{"ruleId":"D1","level":"warning","message":{"text":"PetScore.voices (cyclomatic 25): PetScore.voices 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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b09eb56fc7ec5c5139bdff5002d641353a90ebd87f50930fc2879739b33c47"}},{"ruleId":"D1","level":"warning","message":{"text":"PetScore.voices (cyclomatic 25): PetScore.voices 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":"pet/src/core/pet-audio.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"301043f47e29b623b18addc57fb85baa76f7a186ce0c10cf4bc6ab2179ac4558"}},{"ruleId":"D1","level":"warning","message":{"text":"draft-claim-lock.applyDraftLock (cyclomatic 25): draft-claim-lock.applyDraftLock 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":"web/lib/draft-claim-lock.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee7e9749190c5f272c6eb26dfacae0818ca37c05311ad99b7186c1fb3436c54"}},{"ruleId":"D1","level":"warning","message":{"text":"repo-activity.readRepoActivity (cyclomatic 25): repo-activity.readRepoActivity has cyclomatic complexity 25 (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":"web/lib/repo-activity.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a77990d248ea9613a5b1eaf6f5ac685025e8fdda7ee203d68d8e6ea8b11e6e0"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::voices (cyclomatic 25): (anonymous)::voices 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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"629f13dd4eac4e290f254298aa43ea20436454f09f3a448618bc4bb613d938d7"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::voices (cyclomatic 25): (anonymous)::voices has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adbe4fa2d8d18b5ff04d22b80d1f73e342ab10478e466a087f89882fc03c1ae"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::work::launch (cyclomatic 24): codewhale_account_cli::work::launch has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/work.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f04960cc493c6110f97bc6ad329327cffefcdb8c4826f60caa22d84db5346e7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::validated_patch (cyclomatic 24): codewhale_app_server::runtime_api::git::validated_patch has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e778506b8a03ce919bb8f87cc8192e156c20c62b47df73537ecf0122591691"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::run_model_command (cyclomatic 24): codewhale_cli::run_model_command 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/cli/src/lib.rs"},"region":{"startLine":6018}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dadfee906532e93a7af5145eb71f9a53857bd147b9afe0060b74607af6cfe97"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::config_bundles::prepare_import (cyclomatic 24): codewhale_cli::config_bundles::prepare_import has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/config_bundles.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"25155a31a53b9af9a6d3c057937e9c98d4df29a6dd9f3f4ca4bd5b3b6f66f58f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_commands::diagnostics_reports::receipts::action_phrase (cyclomatic 24): codewhale_commands::diagnostics_reports::receipts::action_phrase 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/commands/src/diagnostics_reports/receipts.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"910a9bc9257132de98823f04684d19a91fe63f4a9a3c6957349e45133c1a8998"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationSchedule::next_after_in_timezone (cyclomatic 24): AutomationSchedule::next_after_in_timezone 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/engine/src/automation_manager.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"01430826385f75c1b50b40e4abb3afae29ae69a5488816e816344c73874c8864"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationManager::update_automation_unlocked (cyclomatic 24): AutomationManager::update_automation_unlocked has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"be46f9ad4667c94b916e24307e44cf1c542191043916b90616530c1f506a6d30"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhaleClient::handle_responses_message (cyclomatic 24): CodewhaleClient::handle_responses_message 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/engine/src/client/responses.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3a54a7adbe2268bbb920ddff06f869335ee7d7c882d3e35f0051bf9f0b2705"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionHostManager::activate_owner (cyclomatic 24): ExtensionHostManager::activate_owner 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/engine/src/extension_host/mod.rs"},"region":{"startLine":2462}}}],"partialFingerprints":{"codehealthFindingId/v1":"63057914039008995429716e20d7d3ab00be30dc0f925e5f1f57faccea545b19"}},{"ruleId":"D1","level":"warning","message":{"text":"LlmError::from_http_response_with_retry_hints (cyclomatic 24): LlmError::from_http_response_with_retry_hints has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/llm_client/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e30eb5892741ba4946d8e1b3b136c10fed12b4ca5bb524d1933e7f02f1cd353"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionCostSnapshot::project_usage_record_inner (cyclomatic 24): SessionCostSnapshot::project_usage_record_inner has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8a80b805d9b0b77cba22a2d15255670f5955e2cee2384d4168afd9b929978c"}},{"ruleId":"D1","level":"warning","message":{"text":"EditFileTool::execute (cyclomatic 24): EditFileTool::execute has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"05aa4d934544c78c1f41d2e86ae8356be434cd1cf16d9547deddffa4e6a4f1b2"}},{"ruleId":"D1","level":"warning","message":{"text":"TextInspection::push_line (cyclomatic 24): TextInspection::push_line has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc7b324cfe9630d2869a9325fd88b8c9b7ff71436ba45e1c56f28bce399ff22"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::core::authority::auto_review::deterministic_fallback (cyclomatic 24): codewhale_engine::core::authority::auto_review::deterministic_fallback 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/engine/src/core/authority/auto_review.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"e628eb54b4ff4baff7e5a0f9ffb0b7441526182377fcaaa789c764203d6a984a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::core::authority::auto_review::shell_command_credential_uploads (cyclomatic 24): codewhale_engine::core::authority::auto_review::shell_command_credential_uploads 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/engine/src/core/authority/auto_review.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0806fdbdde5b25c2bd97da4293e3ad7a55af4d2ea78f60095486f1fb7507a8e5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::core::authority::auto_review::windows_session_runtime_risk_scoped (cyclomatic 24): codewhale_engine::core::authority::auto_review::windows_session_runtime_risk_scoped has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/authority/auto_review.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e40f3a73a79c5ea3de43d3c3af5911747b518285929f69b5cd131f13c5e4e4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::route_runtime::classify_provider_route_preflight_next_step (cyclomatic 24): codewhale_engine::route_runtime::classify_provider_route_preflight_next_step has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_runtime.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"979257946dd49f56d52fe9cd8084dfed13f210c6116dfaaa6a56918cc873f8fd"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::tool_result_retrieval::resolve_spillover_reference (cyclomatic 24): codewhale_engine::tools::tool_result_retrieval::resolve_spillover_reference 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/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"314ebe8d6dde016277e38fe8094272b16ee87c0c1ab6fa384d5048cd7f16ef0d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::verifier::run_gate (cyclomatic 24): codewhale_engine::tools::verifier::run_gate 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/engine/src/tools/verifier.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"387532f73c7a75d93253248dc394a8c2590fea097df015de4393468d23f1dc19"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::web::extract::html_attribute_value (cyclomatic 24): codewhale_engine::tools::web::extract::html_attribute_value 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/engine/src/tools/web/extract.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc41ac233960f13816cc7872bf07a20975de1d357ef10ab9183a6285e676237e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::work_graph::reducer::apply_pure (cyclomatic 24): codewhale_engine::work_graph::reducer::apply_pure 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/engine/src/work_graph/reducer.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c252a186ce943f8eb2268641cab131f9d2610aa6a2809fe906777f952cf38c0"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_palette::adapt::adapt_fg_for_solarized_light_palette (cyclomatic 24): codewhale_palette::adapt::adapt_fg_for_solarized_light_palette has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"897d455873c785951091c531190f337709f3be407b10008a7676a18ee98595ca"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skill_install::install::sync_one_skill (cyclomatic 24): codewhale_skill_install::install::sync_one_skill 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/skill-install/src/install.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f9d425ae6833fa22da8491eba5c922c937e737eaed5a242c16f57dfe003baa"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skill_install::install::scan_tarball_entries (cyclomatic 24): codewhale_skill_install::install::scan_tarball_entries 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/skill-install/src/install.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f370be76ccbb807ae20ac7053d7cdb2940127bf7af1c1fa93f97f404872d8271"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skills::render_skills_block_with_configured_root (cyclomatic 24): codewhale_skills::render_skills_block_with_configured_root 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/skills/src/lib.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db6d3597f8542154797c2e37b4a4c0a671b85f6b64eec56a591d9cbdcf92081"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderDashboardRow::from_config_with_provider_id (cyclomatic 24): ProviderDashboardRow::from_config_with_provider_id has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: ProviderPickerView::render (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ded7b17f52c11470051822e0d3a93d74971706ced05cf00a1a229357202341"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigView::render (cyclomatic 24): ConfigView::render 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/tui/src/tui/views/mod.rs"},"region":{"startLine":4467}}}],"partialFingerprints":{"codehealthFindingId/v1":"5099cf9f611af08ffc78bf0df3260154bac8a123b738455539efddd1b6c02da8"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::underwater::handle_launch_composer_key (cyclomatic 24): codewhale_tui::tui::underwater::handle_launch_composer_key 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/tui/src/tui/underwater.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d49a697b2433c7b444708bc6d2531f9015a7d1f360225c773a335fc6f8b59ab"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSimKt.gaitTarget (cyclomatic 24): PetSimKt.gaitTarget 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":"pet/android/PetSim.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9d12ada579fedae2234c16555fd71a89baee24578e0f8fe8cb8354bd8cc78f"}},{"ruleId":"D1","level":"warning","message":{"text":"qr.makeMatrix (cyclomatic 24): qr.makeMatrix has cyclomatic complexity 24 (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":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77f3129bc89404d97656e3af7e115cc285905bb68b89f9e1366e78693df310b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.monitorLoop (cyclomatic 24): index.monitorLoop has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"04991919b090e1a688f352808a63974184905f513b3f5bcc96a1c2a0ffa0d83d"}},{"ruleId":"D1","level":"warning","message":{"text":"workflowReceiptPresentation (cyclomatic 24): workflowReceiptPresentation has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"befe0b21f5a39bc54858af4666e058f287f2cf71550de95e8168778f446ec0a9"}},{"ruleId":"D1","level":"warning","message":{"text":"PromptRun::project_turn (cyclomatic 23): PromptRun::project_turn 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/app-server/src/acp_server/runtime.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3230b3696df1c16e948cdfb31e732557b1aeaf9dc62753368e74cd48e00de758"}},{"ruleId":"D1","level":"warning","message":{"text":"AcpServer::history_updates (cyclomatic 23): AcpServer::history_updates 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/app-server/src/acp_server.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaea00f4f18ca6c43e26d604ee0693998f6602dc469e8c14a1c6da48af2c891"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeChatPrompt::validate_shape (cyclomatic 23): RuntimeChatPrompt::validate_shape has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b4cd38a5a4026ccbae6b12640ca6ea7ecafe62f4e106e0e5caf27037306d36"}},{"ruleId":"D1","level":"warning","message":{"text":"Collector::finish (cyclomatic 23): Collector::finish 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/cli/src/metrics/stats.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"2693f04cfad58a548499dd132a3f3f147067158def6f5cd5951808aa983e9d6f"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetLedger::finalize_task_attempt_with_tail_if_leased (cyclomatic 23): FleetLedger::finalize_task_attempt_with_tail_if_leased has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_engine::fleet::ledger::privacy_bounded_worker_payload (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"9294561e8dca1de9d06507ded3ae33d428bf08ea6859e034ccdf7ad937ea0e20"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetRoster::load_with_personal_dir_and_plugins (cyclomatic 23): FleetRoster::load_with_personal_dir_and_plugins has cyclomatic complexity 23 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4779616081f3fb054598bfd3593ff5726821ba70f0f821f3a46018b99fbe6f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"McpPool::call_tool_with_decision (cyclomatic 23): McpPool::call_tool_with_decision has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":6582}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec48ab9e5a18510596255734d9c00c8f28fe3a89d70a62ad2e598bb8189e045f"}},{"ruleId":"D1","level":"warning","message":{"text":"UserInputRequest::validate_response (cyclomatic 23): UserInputRequest::validate_response 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/engine/src/tools/user_input.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b381e110fde42d7504c49c6751b1073e0de9035eec5b476cd023f8c0628e75b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::build_default_headers (cyclomatic 23): codewhale_engine::client::build_default_headers has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cee7c84e21fa4d2559409168abf7ae1e430e3843b570f830627bb1f3bb177d5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::system_one::valid_decision_response (cyclomatic 23): codewhale_engine::client::system_one::valid_decision_response 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/engine/src/client/system_one.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a59ea7a6f9c08373e639d8dc05763184d7c4434bcf625bc5c7fb1be69e84f5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::core::authority::auto_review::upload_values (cyclomatic 23): codewhale_engine::core::authority::auto_review::upload_values 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/engine/src/core/authority/auto_review.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fc079a9c2e05462c0b7b20e98330a6641202dbcf8cef3e7e51ef91f799388b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::supervisor::native_runtime_libraries (cyclomatic 23): codewhale_engine::extension_host::supervisor::native_runtime_libraries 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/engine/src/extension_host/supervisor.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3743170654e305e955d74a4d45aceb7c27590dc0cfa7704f6fa64e489f526ff"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::llm_client::rate_limit::provider_error (cyclomatic 23): codewhale_engine::llm_client::rate_limit::provider_error has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/llm_client/rate_limit.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e943fe8315f2418d73261730c6a10e7a013b72f1500cc27e5b261ef60f1ba6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::review_triage::triage_review (cyclomatic 23): codewhale_engine::tools::review_triage::triage_review 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/engine/src/tools/review_triage.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"db87d9bdbbc612380adb882b35c457c55f65534322549b169099dc396f3c545b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::search::visit_files_recursive (cyclomatic 23): codewhale_engine::tools::search::visit_files_recursive 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/engine/src/tools/search.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae10587b6ec05fefaa1c1c098199994d7c878e4905d0cc2f8964918e5f1f173f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::spawn_workflow_task (cyclomatic 23): codewhale_engine::tools::subagent::spawn_workflow_task has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":16215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f561ec6a8f5ce03335d73b09e40275295449c2470476e091bd23ae58e783aa8"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::delivery::explicit_change_paths (cyclomatic 23): codewhale_engine::tools::subagent::delivery::explicit_change_paths 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/engine/src/tools/subagent/delivery.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a04da3fa7a4118b9e9c5009c421822c83c4e06f4a738564a96bcce39c49581"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::lifecycle::compact_row (cyclomatic 23): codewhale_engine::tools::subagent::lifecycle::compact_row 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/engine/src/tools/subagent/lifecycle.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"425167178cabd4e0eb3d9c4b52cad69b8fadb01c739a3564969ce1a4fc7c6da1"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::workflow::report::render_run_report (cyclomatic 23): codewhale_engine::tools::workflow::report::render_run_report 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/engine/src/tools/workflow/report.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7278964af2bdacea815f3bd5bb489e298bac246e9239b596876ad7f0b7aa2515"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_palette::adapt::adapt_bg_for_grayscale_palette (cyclomatic 23): codewhale_palette::adapt::adapt_bg_for_grayscale_palette has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f9befb66190308124cb5d7e0d1f351fb68342e22416785d43f7eeebdd5426e"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginInstallSource::parse (cyclomatic 23): PluginInstallSource::parse 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/plugins/src/install/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b846a687ee9f33e958f6f37ab75f057b8aeadcbcd72e142889d6f71059e104"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginRegistry::apply_state (cyclomatic 23): PluginRegistry::apply_state 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/plugins/src/registry.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94450099a2f74ef451887efa6f7e847768d68d0f9634c7b4daff2998a5d565d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::dsh::admit_host_compatibility (cyclomatic 23): codewhale_plugins::install::dsh::admit_host_compatibility 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/plugins/src/install/dsh.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f761ad3eaaa08c59a695e3342323adb3fdc106820c155db1a9cb25c3da3b0409"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::registry::stage_bundle (cyclomatic 23): codewhale_plugins::registry::stage_bundle 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/plugins/src/registry.rs"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f01911aa15fc8d3865a8e2503950601ec3c6edef8790863ecee771e80053c1f7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_sanitize::sanitize::strip_ansi_impl (cyclomatic 23): codewhale_sanitize::sanitize::strip_ansi_impl has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/sanitize.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbf8d5bc9867f4bf63b8cb84037bdc3d29c685d0860831499e039ae4c1eb25d"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountLoginView::render (cyclomatic 23): AccountLoginView::render has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/account_login.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb66daf3fb4dde437dcbceea90f28c8516e9d9b22b7904e2fcddcb1713249f82"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetListView::render_rows (cyclomatic 23): FleetListView::render_rows 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/tui/src/tui/views/fleet_list.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"06be2a9ec3396d0f3175ae751760e0c0a1dc7c0f2fbcb41e2ae59d2cdde193c1"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigView::handle_key (cyclomatic 23): ConfigView::handle_key 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/tui/src/tui/views/mod.rs"},"region":{"startLine":4237}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7e5989e7df4aa7d746a323314a5e2bba204932f9e46ac23ab9d40717d427ea"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigView::handle_mouse (cyclomatic 23): ConfigView::handle_mouse 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/tui/src/tui/views/mod.rs"},"region":{"startLine":4335}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c76d7b21e5c641fa1b073705c84367dbcdf3ff0f363d67ac0d640a8bfa53f4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::config::workbar (cyclomatic 23): codewhale_tui::commands::groups::config::config::workbar 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/tui/src/commands/groups/config/config.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"99d4a6f6231c1e1b50b266c95cd39bbb3bb9139e37f79aa5a70ecaf24ee87033"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::core::core::model (cyclomatic 23): codewhale_tui::commands::groups::core::core::model 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/tui/src/commands/groups/core/core.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2a78ad55e3cd1f3826064728632306ccaf179a8dd689817ea91a0973dbd71c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::render_tank (cyclomatic 23): codewhale_tui::tui::pet_watch::render_tank 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/tui/src/tui/pet_watch/mod.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c77d4aa2a3f0d0c28c4cd1b0896bbc4fb098f4f9d77397e38763952515cb49"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::subagent_routing::handle_subagent_mailbox_for_turn (cyclomatic 23): codewhale_tui::tui::subagent_routing::handle_subagent_mailbox_for_turn 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/tui/src/tui/subagent_routing.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dba0a4711f102e707dbca8442fb48b66bb1e0e204c3b85ba1aab586faf9d99c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::underwater::launch_fit (cyclomatic 23): codewhale_tui::tui::underwater::launch_fit 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/tui/src/tui/underwater.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cdd4193c8f56ed2f1c1bf0fb41290ce46e2de9274cd70055522277541c5573"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::views::canonical_config_choice (cyclomatic 23): codewhale_tui::tui::views::canonical_config_choice 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/tui/src/tui/views/mod.rs"},"region":{"startLine":4080}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9be521e8597695d519723c808596c46cf8cb7416b366fd733168ac2b270b77"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui_kit::markdown_render::render_line_with_links_tagged (cyclomatic 23): codewhale_tui_kit::markdown_render::render_line_with_links_tagged 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/tui-kit/src/markdown_render.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ced8568dcdcd06c6828a9e60a73da39d6612bd6bd90e3033bfab5cd4a49b66e"}},{"ruleId":"D1","level":"warning","message":{"text":"app.applySnapshot (cyclomatic 23): app.applySnapshot 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/app-server/src/runtime_web/app.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62f60985b2ad05c68dd17bcee65e8580f5832d73498ace442056e2b3bc4742f"}},{"ruleId":"D1","level":"warning","message":{"text":"app.startBrowserClient::loadNewThreadModels (cyclomatic 23): app.startBrowserClient::loadNewThreadModels has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: 2 other methods here (app.startBrowserClient::updateItemNode, app.startBrowserClient::renderUserInput) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"4960903fb31bc430a37194b9931bec6f53135ae4ac8bcdbcafc1fbdb0c5baba1"}},{"ruleId":"D1","level":"warning","message":{"text":"ingest.categoryFor (cyclomatic 23): ingest.categoryFor has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8d4e7227e870ec031699ee2d773740f15442a2c573576a73ab5682df57959b"}},{"ruleId":"D1","level":"warning","message":{"text":"pet-audio.renderPetPCM (cyclomatic 23): pet-audio.renderPetPCM has cyclomatic complexity 23 (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":"pet/src/core/pet-audio.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"581a8ccaf6a8751eafc96be96a485a3ad03bd33bff82319f603f0b669fbc5217"}},{"ruleId":"D1","level":"warning","message":{"text":"page.HomePage (cyclomatic 23): page.HomePage has cyclomatic complexity 23 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 5 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/page.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6531eb58fe59f530dbca50ae568fdf138f1c5ad544555529930694da210248c"}},{"ruleId":"D1","level":"warning","message":{"text":"release-updates.ReleaseUpdates (cyclomatic 23): release-updates.ReleaseUpdates has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 3 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 48, 59, 102, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/release-updates.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a648a3e563e62e5e04af267ad31ed5913ffc4f78ed677de7162c299c5774d783"}},{"ruleId":"D1","level":"warning","message":{"text":"interest.handleAdminMerchInterest (cyclomatic 23): interest.handleAdminMerchInterest has cyclomatic complexity 23 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/interest.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc59b72d50cd49d9afc76fcdc3470e4092f9a36d983f987ab92fef0362f14bf9"}},{"ruleId":"D1","level":"warning","message":{"text":"check-runtime-routes.runtimeRouteInventory (cyclomatic 23): check-runtime-routes.runtimeRouteInventory 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":"web/scripts/check-runtime-routes.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9719bde3c7f1fdcbaaedf27b6aab14bb3adf20742d79ebeac1ba1a25de85591a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::renderPetPCM (cyclomatic 23): (anonymous)::renderPetPCM has cyclomatic complexity 23 (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"1551fdf39c2c0480ff7904399114183a84d2e663821dc21b43dbb9924a236ff0"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::renderPetPCM (cyclomatic 23): (anonymous)::renderPetPCM has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb020a947943a2cbbd34622c5841d91635883e36ac4c4259b69ddcb5d3836490"}},{"ruleId":"D1","level":"warning","message":{"text":"runTurn (cyclomatic 23): runTurn has cyclomatic complexity 23 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 4 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f30b847036fc57e62eb96e2dd910b6ca81bd5f31b749c7ad9ee8e5f02657f66"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::exec_agent::persist_exec_session (cyclomatic 22): codewhale_app_server::exec_agent::persist_exec_session 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/app-server/src/exec_agent.rs"},"region":{"startLine":3366}}}],"partialFingerprints":{"codehealthFindingId/v1":"600fed8eae133703a7b885694eda17d67853bc813af78b5561c671cc9e70b5f0"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::thread_history::import_into_owner (cyclomatic 22): codewhale_app_server::runtime_api::thread_history::import_into_owner 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/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d575b9ce8cd34489255aa588b66bc3c8c5e47a83739788e7cf859dc277239508"}},{"ruleId":"D1","level":"warning","message":{"text":"MoneyUsage::add (cyclomatic 22): MoneyUsage::add 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/cli/src/metrics/stats.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"49584f5318982e94f1af02d7e03125a7c9b1500b59b9c8c03831944f0522c49a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cloud_facts::refresh_using (cyclomatic 22): codewhale_cloud_facts::refresh_using 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/cloud-facts/src/lib.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5429bb881ecdfc11ffbd79926e769419d68c061736e3973e9e39163d3c94dc6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_config::catalog::configured::validate_configured_models (cyclomatic 22): codewhale_config::catalog::configured::validate_configured_models 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/config/src/catalog/configured.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a521acd9c4edd49f812e042a37d333bd853a11bc4c4e6384c4011c2353f0a18"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationSchedule::parse_rrule (cyclomatic 22): AutomationSchedule::parse_rrule 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/engine/src/automation_manager.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6ed043425f52afd2aa0a4420792253e7b543bb6e3a112290c60eaf24b97733"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::process_tool_results (cyclomatic 22): Engine::process_tool_results 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/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4521}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8d8828fe4ee2c0538f57badc0274d62299d624bde0de15a2aca0b8cef9589a"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::wait_for_named_mcp_boot (cyclomatic 22): Engine::wait_for_named_mcp_boot 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/engine/src/core/engine.rs"},"region":{"startLine":9220}}}],"partialFingerprints":{"codehealthFindingId/v1":"71fb31ffb23f991b3c4d7a3382d96341b8122659356b9fa0ff6cfc08f36c7cff"}},{"ruleId":"D1","level":"warning","message":{"text":"Events::host_request (cyclomatic 22): Events::host_request 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/engine/src/extension_host/mod.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc095205a5b82ea41b3e94f7967e88c04fc21edbe3ae3e465dd5a119a1cfb72"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionHostManager::reconcile_with_policy (cyclomatic 22): ExtensionHostManager::reconcile_with_policy 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/engine/src/extension_host/mod.rs"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7549b3da564a414144a92562f855d346d470138ec02ce7f172e7999ce99b80d"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::start_external_turn (cyclomatic 22): RuntimeThreadManager::start_external_turn 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/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26ad733da903f8669d6ca4d78e13bcc5e325707d2b09129e89ce992e2520bfc"}},{"ruleId":"D1","level":"warning","message":{"text":"RlmTool::execute_eval (cyclomatic 22): RlmTool::execute_eval has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/rlm.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"3615fd9433f22633d45595a9bcdd5921a0f861936123880d26b3c551d25ef51d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::monitor_host (cyclomatic 22): codewhale_engine::extension_host::monitor_host 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/engine/src/extension_host/mod.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c4385e60588a24554af47523aedf310ce85f81d589e24e5bacc9428ad1c7f6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::pricing::audit_turn_cost_for_route_on_endpoint_for_identity_at (cyclomatic 22): codewhale_engine::pricing::audit_turn_cost_for_route_on_endpoint_for_identity_at has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: UnpricedReason::from_label (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/pricing.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db8ffed34dc56bc492c5b29395ddd55a3067e9429e543fda0fa6d38ad80a490"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::provider_lake::update_provider_catalog (cyclomatic 22): codewhale_engine::provider_lake::update_provider_catalog has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a5db94f74e9eb8ae17a1c6ca48830fb17121c5e2f408fae70742582e2bd0e6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::session_secret_scrub::session_files (cyclomatic 22): codewhale_engine::session_secret_scrub::session_files 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/engine/src/session_secret_scrub.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"97718031706399c7c28fbc431e5b91d45bc9580d5f61aa0555f028e131a78b31"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::task_manager::ingest_runtime_event (cyclomatic 22): codewhale_engine::task_manager::ingest_runtime_event 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/engine/src/task_manager.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef31d5c31467f95a2ed86d8869422579ad1d1ab416433af419f6ab803776a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::approval_cache::push_canonical_json_at (cyclomatic 22): codewhale_engine::tools::approval_cache::push_canonical_json_at 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/engine/src/tools/approval_cache.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a2f21fe5977f84449b157f2c384b736aef283213f8dfcfacdcec42ff809bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::file_search::search_files (cyclomatic 22): codewhale_engine::tools::file_search::search_files 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/engine/src/tools/file_search.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bba8eee0b409294964cbd050335c6627414de40671a17ba8fea094e1ee4a57"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::read_media::process_media_file (cyclomatic 22): codewhale_engine::tools::read_media::process_media_file has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/read_media.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c383788a189df949c9a2174c4038651473a21e0ac9d4c969cdf405b843a2662"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::bind_spawn_model_route (cyclomatic 22): codewhale_engine::tools::subagent::bind_spawn_model_route has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":19982}}}],"partialFingerprints":{"codehealthFindingId/v1":"c135fff26af28a61cc303652300cc14eee11037518ff6fc9e9b7ad5f8b3d0b67"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::tool_result_retrieval::stream_evidence (cyclomatic 22): codewhale_engine::tools::tool_result_retrieval::stream_evidence 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/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26bcb69c4854d4e7593e7ec3611eac002547d34faf2aa51da3e50398c20ab97"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::work_graph::model::constrained_effective_reasoning_for_route (cyclomatic 22): codewhale_engine::work_graph::model::constrained_effective_reasoning_for_route 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/engine/src/work_graph/model.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e64ed586e684b1d042fc15960f274d89885d85ab18b37c4d6e9b9a8111910f5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::shell_input (cyclomatic 22): codewhale_execpolicy::shell_expand::shell_input 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/execpolicy/src/shell_expand.rs"},"region":{"startLine":2389}}}],"partialFingerprints":{"codehealthFindingId/v1":"717bfa68a2a78afb98b1daaad663528d71caa3c32a13ec4d07def7f6b71bb503"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_notify::delivery::notify_with_sinks (cyclomatic 22): codewhale_notify::delivery::notify_with_sinks 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/notify/src/delivery.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbb8fc21569521ed8f973b4783ab4588971806ed3be8d571646188eec997283"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::providers::validate_declarations (cyclomatic 22): codewhale_plugins::providers::validate_declarations 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/plugins/src/providers.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6025caa93690c798038275898c1d6d4d151f34d1e60588e449a0a0701789bce"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::runtime_preset_blocker (cyclomatic 22): Config::runtime_preset_blocker 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3388}}}],"partialFingerprints":{"codehealthFindingId/v1":"285fbee7e2c20ad9505e643919ecebd6b087b92e5c9b2754e421cbdd5100c380"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skill_install::install::extract_entries (cyclomatic 22): codewhale_skill_install::install::extract_entries 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/skill-install/src/install.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7285662360c64e45397c96ecdea0499f35c93d8a6e459fa21aa6f0d7e04e599c"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetSetupView::render (cyclomatic 22): FleetSetupView::render 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/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"393a388f2a28838ef0cfe04dc6892e288fdc180d944cd4b86794fdeb7fc4b9aa"}},{"ruleId":"D1","level":"warning","message":{"text":"ApprovalWidget::build_inline_parts (cyclomatic 22): ApprovalWidget::build_inline_parts 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/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"07706d646042bcc3b16e8a92cf221a1e5047460a390f7a99177e9a4c02ee7bf8"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::app::composer::raw_mouse_report_keep_mask (cyclomatic 22): codewhale_tui::tui::app::composer::raw_mouse_report_keep_mask 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/tui/src/tui/app/composer.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3aff50cc438a4909ea0fb560a65c1900adda2b7b20cb294fdc514c7aac48611"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::mouse_ui::apply_context_menu_action (cyclomatic 22): codewhale_tui::tui::mouse_ui::apply_context_menu_action 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/tui/src/tui/mouse_ui.rs"},"region":{"startLine":1735}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bb7534b11f9bd0bb30ecea13ae17db9ee48bc88bdd8010879f7be736c8f8db"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::subagent_routing::record_agent_current_activity (cyclomatic 22): codewhale_tui::tui::subagent_routing::record_agent_current_activity 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/tui/src/tui/subagent_routing.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e63170edc41bcc0f3e0c99ab121c3ef23438d6e67c036a926bcefe012923190"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::subagent_routing::format_task_detail (cyclomatic 22): codewhale_tui::tui::subagent_routing::format_task_detail 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/tui/src/tui/subagent_routing.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"211e5b2db25df85af623f5db6631727c291839668e8d6c23d44b976fbe021fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::terminal::poll (cyclomatic 22): codewhale_tui::tui::work_surface::terminal::poll 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/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b50c24893184f4b8862e8a669135c4fc7c1bb3737c3df47b0a7fab710e7831"}},{"ruleId":"D1","level":"warning","message":{"text":"app.collectProviderModelPages (cyclomatic 22): app.collectProviderModelPages 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/app-server/src/runtime_web/app.mjs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc02936ca99089ccc1566434ba3ea4d8ea3fd498f47fa47676c120bd15cff9a"}},{"ruleId":"D1","level":"warning","message":{"text":"lib.admitTurn (cyclomatic 22): lib.admitTurn 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":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"832f292e7db878e3ed35a06d9b902d5e0271bfdfa9d607d4fa3604ef7fe8de6b"}},{"ruleId":"D1","level":"warning","message":{"text":"computer-use-release.receiptQualifiedRelease (cyclomatic 22): computer-use-release.receiptQualifiedRelease has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/computer-use-release.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dc953de6a78f14218f0d06d1a25aa0e6a25041435c908db7268065fbfafdf2"}},{"ruleId":"D1","level":"warning","message":{"text":"facts-lib.deriveLatestPublishedRelease (cyclomatic 22): facts-lib.deriveLatestPublishedRelease has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-lib.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"617b0cd9b30ca39df7c3b37de398555e30cbf0124068d55993b6c05c4572bcd3"}},{"ruleId":"D1","level":"warning","message":{"text":"facts-lib.deriveFeatures.features (cyclomatic 22): facts-lib.deriveFeatures.features has cyclomatic complexity 22 (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":"web/scripts/facts-lib.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"273d532eb6029d4ce732b8f49a9de59ce948744b73c3b7006604f9b00c0b2cb7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::run_computer_files (cyclomatic 21): codewhale_account_cli::run_computer_files has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9a2e37f8e183033350850c45bd34a4ff61bee346c5f24144521eee825ac6a4"}},{"ruleId":"D1","level":"warning","message":{"text":"ClientParser::feed (cyclomatic 21): ClientParser::feed 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/app-server/src/runtime_api/computer_display.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a92b3988e38d32f38a275db57bb8682cf617edc46a3c07beb2962dced72d223"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeChatRelayHost::apply_prompt (cyclomatic 21): RuntimeChatRelayHost::apply_prompt 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/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ef3f4e706fa0b74e8409b0d56a2055d18e4af1cefc1d37d454d8570b92f077"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::check_preconditions (cyclomatic 21): codewhale_app_server::runtime_api::git::check_preconditions 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/app-server/src/runtime_api/git.rs"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"996ecefe0780c2cc426d956cd90dc2ccfa8baf7e7618a10dffba997f55cfbb95"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::run_lane_command (cyclomatic 21): codewhale_cli::run_lane_command 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/cli/src/lib.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0c908d54cdaae79c3653f79ff05b65bb7860f4fef2ad4cc38fa42a481f276d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::metrics::read_session_file (cyclomatic 21): codewhale_cli::metrics::read_session_file 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/cli/src/metrics.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f84da011974e9682440bc22484750f6e02f72411a3013532592c9c982b8473"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::metrics::stats::collect (cyclomatic 21): codewhale_cli::metrics::stats::collect 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/cli/src/metrics/stats.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d1655183cc7e12054dbdaaf5445f000500652d0d645b46f0e146b764975a24"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::update::apply_staged_at_start (cyclomatic 21): codewhale_cli::update::apply_staged_at_start 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/cli/src/update.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafe888917086622f19f52c41ac03e6015add1a05e9cc24ff93e7ac11a7552d7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_command_contract::metrics::build_groups (cyclomatic 21): codewhale_command_contract::metrics::build_groups 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/command-contract/src/metrics.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd95e96c9ea040668d07052094a101b3b30b61a35fdca5ba15aaa0568f70badd"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigToml::unset_value (cyclomatic 21): ConfigToml::unset_value 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/config/src/config_resolve.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1618ca10b07a980b967734cfee91cc97ca004f30777601d18e5ae4769f1e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"NameStakes::from_tool_name (cyclomatic 21): NameStakes::from_tool_name has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/authority/auto_review.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"358c686a4c8bb892978c696bd09f97a34f18501cc85ffa88c691ed96ef3642b5"}},{"ruleId":"D1","level":"warning","message":{"text":"RawDacl::from_storage (cyclomatic 21): RawDacl::from_storage 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/engine/src/extension_host/windows.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"9525497b9afb112f7b1f7fa296f86ce4715b67f1862d2516e03c64af5dbf449a"}},{"ruleId":"D1","level":"warning","message":{"text":"HookExecutor::execute_sync_legacy (cyclomatic 21): HookExecutor::execute_sync_legacy 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/engine/src/hooks/executor.rs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0eb01cccbce583dac7579b05790a255673bdd7621cecd21e06641811629419a"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::lookup_turn_operation_projection (cyclomatic 21): RuntimeThreadManager::lookup_turn_operation_projection 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3177ec4e5c9cafb48e8479fdc0c1809c6520fcdda6b720d7ef2f0365f9cd5d6b"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadStore::checkpoint_tail (cyclomatic 21): RuntimeThreadStore::checkpoint_tail 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/engine/src/runtime_threads.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"5293ba7126588b0913a18638a2bab5a18c6d7d328fcb00d8627d3b66a64bdf9a"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionManager::load_session_snapshot_with_limit (cyclomatic 21): SessionManager::load_session_snapshot_with_limit 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/engine/src/session_manager.rs"},"region":{"startLine":5379}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa37fc2020dab13f5d9564512cbb724382799542df16f07410bde00cc3da3984"}},{"ruleId":"D1","level":"warning","message":{"text":"SubAgentWorkflowDriver::spawn_task_admitted (cyclomatic 21): SubAgentWorkflowDriver::spawn_task_admitted 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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":4779}}}],"partialFingerprints":{"codehealthFindingId/v1":"381d9642283a595008155f66cf1c0d8503626004a9d9943926c6baef7e27c112"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::configured_model_bound_secret_values_with (cyclomatic 21): codewhale_engine::client::configured_model_bound_secret_values_with 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/engine/src/client.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cc0669f5130d544edd617e1cc667c27f54f9a84508c1aca73b1edd6b680a74"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::provider_native_search::parse_responses_search (cyclomatic 21): codewhale_engine::client::provider_native_search::parse_responses_search 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/engine/src/client/provider_native_search.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fa9706b54ee2dd92aa11126e6c8f0173d4cf8865f433f1ae2299c96e015368"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::mcp_http::serve (cyclomatic 21): codewhale_engine::extension_host::mcp_http::serve 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/engine/src/extension_host/mcp_http.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5e90fb2cf48b057591416976249359cbc972ff87d71bf7be2b3aa8fe69c053"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::fleet::control::execute_fleet_control_with (cyclomatic 21): codewhale_engine::fleet::control::execute_fleet_control_with 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/engine/src/fleet/control.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcc5014dc6799413cc60a4fe59b99fa6a9a420307d8198e857d149d98fefc35"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::prompts::guard_instruction_prefix (cyclomatic 21): codewhale_engine::prompts::guard_instruction_prefix 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/engine/src/prompts.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c1387eb9052ef2ba1f100e332edcd11f07fc5f7d465f182e53cae2697fa684"}},{"ruleId":"D1","level":"warning","message":{"text":"LspManager::semantic_locations (cyclomatic 21): LspManager::semantic_locations 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/lsp/src/lib.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f5edd80f7d2c2568e0d978d7492574d148b042fc3ec7548433f90af57fe945"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_memory::policy::validate_draft (cyclomatic 21): codewhale_memory::policy::validate_draft 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/memory/src/policy.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"959a6f48aee12f158d936bfd23fa6bb603abbd901e5ca787338bc7930aae6c3f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_models::schema_sanitize::sanitize_for_kimi (cyclomatic 21): codewhale_models::schema_sanitize::sanitize_for_kimi 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/models/src/schema_sanitize.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"34728cefdc79135d31a9c755c8761a498ade02111658a70d64ba239cf201c11e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_palette::adapt::adapt_fg_for_grayscale_palette (cyclomatic 21): codewhale_palette::adapt::adapt_fg_for_grayscale_palette 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/palette/src/adapt.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"289ae5d494f226b2df2dcd2eeb86c588e08eee26011bb993a596799988f42f5d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::config_persistence::migrate_legacy_route_preferences (cyclomatic 21): codewhale_runtime::config_persistence::migrate_legacy_route_preferences 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/runtime/src/config_persistence.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"cadcbc8e2aa0d67affff22fdfd511f368f1703028beaf607b9c2563563440924"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::session_diagnostics::classify_session_failure (cyclomatic 21): codewhale_runtime::session_diagnostics::classify_session_failure 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/runtime/src/session_diagnostics.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c10024daedd05124cbb9c0231c196910487579d7c54ec05de50b20ef19bed0"}},{"ruleId":"D1","level":"warning","message":{"text":"DebugDiagnosticsAdapter::cache_telemetry (cyclomatic 21): DebugDiagnosticsAdapter::cache_telemetry has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/debug_diagnostics.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1e19e11e4816067f416ee366443d44051aa7728daef1aef67c9ec598f8a3e3"}},{"ruleId":"D1","level":"warning","message":{"text":"ApprovalView::handle_key (cyclomatic 21): ApprovalView::handle_key has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval/view.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a576970a57effb24780abb43398cd5b5f4432af965d4874e5ab02fa9e74e306b"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputRowStream::push (cyclomatic 21): OutputRowStream::push 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/tui/src/tui/history/tool_output.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2a73797115123c4d2cce65c67756f257d230d9109c9e54a96747ddf8c7c549"}},{"ruleId":"D1","level":"warning","message":{"text":"GenericToolCell::try_render_as_workflow (cyclomatic 21): GenericToolCell::try_render_as_workflow 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/tui/src/tui/history.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e807eb8d1ae2a2ce52e86ab78cbe3c6bac5e298417d356f6289e64f3ae3187"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelPickerView::ensure_projection (cyclomatic 21): ModelPickerView::ensure_projection 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/tui/src/tui/model_picker.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"645e1394afe19e7c28df20c32bf15ce00748a8183dc118844e03f32374ac331c"}},{"ruleId":"D1","level":"warning","message":{"text":"PendingState::absorb_publication (cyclomatic 21): PendingState::absorb_publication 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/tui/src/tui/persistence_actor.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31fe3a76bd9fa47ef5c6a8d02056ac7f4af3ed90b45af9524b05780acf78107"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderPickerView::render_key_entry (cyclomatic 21): ProviderPickerView::render_key_entry 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. This is NOT this file\u0027s highest cyclomatic complexity: ProviderPickerView::render (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":3799}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7d70c5420e1b37536fb4de0188db597ebd9b2d4b300852ccff8a71af8e35a7"}},{"ruleId":"D1","level":"warning","message":{"text":"ApprovalWidget::body_facts (cyclomatic 21): ApprovalWidget::body_facts 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/tui/src/tui/widgets/mod.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbf663a8fe9147d0aa00b89291ef945bac9c22522e3654bd2796ad949286a9a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::doctor_session_recovery_report (cyclomatic 21): codewhale_tui::doctor_session_recovery_report 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/tui/src/lib.rs"},"region":{"startLine":7101}}}],"partialFingerprints":{"codehealthFindingId/v1":"473dcf6bac193d0c33397907a6355bb4c5fd58b664a2a02bc871e046be01f5d5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::integrations::dsh::compute_status (cyclomatic 21): codewhale_tui::integrations::dsh::compute_status 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/tui/src/integrations/dsh/mod.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c89781b34975fcdf258ae5079f870124ff9b8b14091b26b991d6a68c3568cd"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::full::needs (cyclomatic 21): codewhale_tui::tui::pet_watch::full::needs 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/tui/src/tui/pet_watch/full.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"455f8709bb1c47524430778d8d1e13711d3994c714207fcfdb7f60539756a011"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSharedClient.poll (cyclomatic 21): PetSharedClient.poll 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":"pet/android/src/main/kotlin/codewhale/pet/PetSharedClient.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61d6c383b191a728c27d2475007c234a8d09339018288ed2fe6e084563a7b15"}},{"ruleId":"D1","level":"warning","message":{"text":"PetViewModel.handle (cyclomatic 21): PetViewModel.handle 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":"pet/android/src/main/kotlin/codewhale/pet/PetViewModel.kt"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7219f0e9a23226e1b52ddc5b08504b750abe984e5a0437291d4b70b7ced82ce4"}},{"ruleId":"D1","level":"warning","message":{"text":"runtime_mobile.html.openThreadEvents (cyclomatic 21): runtime_mobile.html.openThreadEvents has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 887, 900, 927, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_mobile.html"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d5fb5e23f6f7f582538fdc054bd6e486b94e84e6a3592a63a94805e16a28b5"}},{"ruleId":"D1","level":"warning","message":{"text":"app.answersForUserInput (cyclomatic 21): app.answersForUserInput has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"322bc77d5cf41caf4cdd5b6ff7a5b4264cbdfa4cec939419abd38106ce7b2ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"markdown.renderMarkdown (cyclomatic 21): markdown.renderMarkdown 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":"extensions/vscode/src/markdown.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9592bed355c284e346b9cbf9929ff58168fa07463e0163d4cfffac54a23c2fc"}},{"ruleId":"D1","level":"warning","message":{"text":"lib.readSse (cyclomatic 21): lib.readSse 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":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"05dc6aed6aeadf5cea43d1009ceaa805669f5eb10efee5d45fe0f0f545d8c100"}},{"ruleId":"D1","level":"warning","message":{"text":"facts.isPublishedRelease (cyclomatic 21): facts.isPublishedRelease has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f85c2ea5df2a5db8f764cf2cc63e6f470659fa32a4ee41383619c82c5bb780"}},{"ruleId":"D1","level":"warning","message":{"text":"compare-deployed-facts.main (cyclomatic 21): compare-deployed-facts.main 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":"web/scripts/compare-deployed-facts.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"069c04b491d290aae24c8ceba5315fd479826816af29ad08b3c8ce54a587e9ec"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::work::assign (cyclomatic 20): codewhale_account_cli::work::assign 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/account-cli/src/work.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6fe5441ec1b5bab2d69724e4f15d09d01657c0565a8ab22c24b0fb780dd123"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::apply_write_request_to_config (cyclomatic 20): codewhale_app_server::runtime_api::apply_write_request_to_config has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":8119}}}],"partialFingerprints":{"codehealthFindingId/v1":"10149dfb501805563efea3e31c154695288d4765a1f509a7c1957a54486363e5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::update::compiled_host::prepare (cyclomatic 20): codewhale_cli::update::compiled_host::prepare 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/cli/src/update/compiled_host.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"9200255305de6c62b18048b000c9d9296c4f5466a0e767799d0b2d898b838da8"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_commands::diagnostics_reports::receipts::totals_line (cyclomatic 20): codewhale_commands::diagnostics_reports::receipts::totals_line has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/diagnostics_reports/receipts.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e2810269c9fec60dbf5a0be280b036ecd7be1100998db505ec41ad772f5dad"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigToml::list_values (cyclomatic 20): ConfigToml::list_values has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_resolve.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f688a4379bc54a5356b272ec2410f5d4e85d0bd1659f876abc1308340e256c1"}},{"ruleId":"D1","level":"warning","message":{"text":"NotificationConfigUpdate::parse (cyclomatic 20): NotificationConfigUpdate::parse has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/notifications.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b295f2c83741b1302f10c173e79e2f3e81b303939e17b34f5a4f792715bcd161"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhaleClient::handle_anthropic_stream (cyclomatic 20): CodewhaleClient::handle_anthropic_stream 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/engine/src/client/anthropic.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2dc36cbaafad402b5f37c846f442345fbe12c9238ec105e6dce76f9b502227"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::handle_set_goal_status (cyclomatic 20): Engine::handle_set_goal_status 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/engine/src/core/engine.rs"},"region":{"startLine":6046}}}],"partialFingerprints":{"codehealthFindingId/v1":"38274fffa2f243005b6dc3d8e9e490f1e8d2026a039d0277e433167115d78a2d"}},{"ruleId":"D1","level":"warning","message":{"text":"OwnerRegistry::register_command (cyclomatic 20): OwnerRegistry::register_command has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"3896bc8e8053ff6c1bb2dd8d353c033406faea9102cc0a9198a6d0340b66ddde"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionOffer::from_session_result (cyclomatic 20): SessionOffer::from_session_result 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/engine/src/fleet/acp.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc244d82cb19ddcb0a93465e8da3c99f4a8414019d12858c11339bc371540a2"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentsCoordinateTool::mutate_coordination (cyclomatic 20): AgentsCoordinateTool::mutate_coordination 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/engine/src/tools/subagent/coord.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fde3f6ec3d99e26ce613cf8ee5a0c7a84100cd4f702c91f56be29f24eac209f"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentTool::execute (cyclomatic 20): AgentTool::execute has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":14815}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f38fcad3019fce2ab140d28d8cf2383335c2dbc44e0f1011545eab6208e4ca"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::automation_manager::fire_due_triggers_with (cyclomatic 20): codewhale_engine::automation_manager::fire_due_triggers_with has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3354}}}],"partialFingerprints":{"codehealthFindingId/v1":"604ef49969913deb469b02ee6870d2c07a2609eb45a5170c40f85623db1386b6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::fleet::placement::decide (cyclomatic 20): codewhale_engine::fleet::placement::decide 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/engine/src/fleet/placement.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb9baa18748b31ebb294d2550ed72a1c193de9a6ec59bcea73483646181c24d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::provider_readiness::auth_class_for_provider (cyclomatic 20): codewhale_engine::provider_readiness::auth_class_for_provider has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_readiness.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b51e7fc741271dffa2d149cedd495eafb81a3bad902ab4f7f3e93f5408d4e4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::apply_patch::build_pending_writes_from_patches (cyclomatic 20): codewhale_engine::tools::apply_patch::build_pending_writes_from_patches 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/engine/src/tools/apply_patch.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc47a72be02e6e4fd7e258fd26f01e34142d6cf03bc0b4f941dc288775d0ff9"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::git::plan_commits (cyclomatic 20): codewhale_engine::tools::git::plan_commits has cyclomatic complexity 20 (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/engine/src/tools/git.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"396b56539235b59537f91ff7640d18b9041c7550a81ddcc4462e89e8a37c3f46"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::shell::build_shell_delta_tool_result (cyclomatic 20): codewhale_engine::tools::shell::build_shell_delta_tool_result has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":7475}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d5bea217987c465662703d817368e83195732aa0be7ef6e3be2fd9305bcb35"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::agent_segment_verdict (cyclomatic 20): codewhale_execpolicy::command_safety::agent_segment_verdict has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_execpolicy::command_safety::readonly_options_are_allowed (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0972967e7efe635f407a61bae71222c313b957081402cd8f7da04af3576e287"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::mark_replacement_operands (cyclomatic 20): codewhale_execpolicy::shell_expand::mark_replacement_operands 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/execpolicy/src/shell_expand.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79e9052446913701df8d8a43953f06a689658740b56ab6e085084c62567f09e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::registry::copy_bundle_directory_fd (cyclomatic 20): codewhale_plugins::registry::copy_bundle_directory_fd 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/plugins/src/registry.rs"},"region":{"startLine":2581}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c61d91e04050eabd2a72b925ff9082a13be12afb8e7b40947c8b3246e4dc9a2"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::registry::gc::observe (cyclomatic 20): codewhale_plugins::registry::gc::observe 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/plugins/src/registry/gc.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf0bbf0f959ed97ac91afc1c8d8d14f3304d2f5523f50bfbb3a1b01de013d7b"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::apply_saved_selection (cyclomatic 20): Config::apply_saved_selection has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":4013}}}],"partialFingerprints":{"codehealthFindingId/v1":"b777c530f5d1543860b8adf412c9fc316e8374aa147d5efc5a436e34d0dd2312"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::resolve_persisted_provider_identity (cyclomatic 20): Config::resolve_persisted_provider_identity has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":4719}}}],"partialFingerprints":{"codehealthFindingId/v1":"738a05a8200373af871a2a972a733615eeb99cab436c9ac208356fdc89dc4c42"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings::load_persisted_from_candidates_with_migration_unlocked (cyclomatic 20): Settings::load_persisted_from_candidates_with_migration_unlocked has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Settings::canonical_key (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f559e432ce9800b925b71c7d01ca55d66d465fbd5cd9c4e9b316fd11669b96"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skill_install::frontmatter::validate_skill_frontmatter (cyclomatic 20): codewhale_skill_install::frontmatter::validate_skill_frontmatter 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/skill-install/src/frontmatter.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7621c26c92e038b7b25c8ca776165fd959682bcb7ad9c7cf5ec01bf59673d05f"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountLoginView::tick (cyclomatic 20): AccountLoginView::tick has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/account_login.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"38584c1878622051225b986479e379140b8a703d9b2ec992738583a76d6ebdeb"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextMenuView::render (cyclomatic 20): ContextMenuView::render has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/context_menu.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"379c0e87c6d2a6272f4cf9afc370bf825a7ff4ceb2447444b43b3ab976aa5659"}},{"ruleId":"D1","level":"warning","message":{"text":"TextField::key (cyclomatic 20): TextField::key 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/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"81caa87a0ef06f522dbc3b06d2feea4b2a03c285f44c56b49b0ca617c99cfcf3"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationsView::handle_key (cyclomatic 20): AutomationsView::handle_key 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/tui/src/tui/views/automations.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f8f19165599205e8ba1200dcda5ce2329d12d5b9cb8e832f6fe87b505ebb7e"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetListView::handle_key (cyclomatic 20): FleetListView::handle_key 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/tui/src/tui/views/fleet_list.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"066890e1914ff76902970f872b8b44dca5589ee487f800f6dc8910fcd1110449"}},{"ruleId":"D1","level":"warning","message":{"text":"ElevationWidget::render (cyclomatic 20): ElevationWidget::render 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/tui/src/tui/widgets/mod.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e681d14abd906bb560d312c1343e31455d0b6ae897db83ae29f0dd0331dff6a"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowPanel::history_expanded_lines (cyclomatic 20): WorkflowPanel::history_expanded_lines has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e929051ea2eb9c3f1593378ae475f4a9708e9b21b076febf9b0aca2ad90bf91e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::integrations::cli::run_dsh (cyclomatic 20): codewhale_tui::integrations::cli::run_dsh 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/tui/src/integrations/cli.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc12b1f0f217753c9d214dca50ea9637a0f68e42e684f51eb10422d524267974"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::file_frecency::worker (cyclomatic 20): codewhale_tui::tui::file_frecency::worker has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 5 function items inside it that branch (load_records, compact_store, merge_loaded_records, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_frecency.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8036fae9a9a33d80f332e60cf6539b2191cb9d643dde59af9b162bbd3ef90e0f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::slash_menu::visible_slash_menu_entries (cyclomatic 20): codewhale_tui::tui::slash_menu::visible_slash_menu_entries 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/tui/src/tui/slash_menu.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb48b5e44ae8e44f26a68af79ce92ef6c59d37d84a5354ba73879e4702e69dcf"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::tool_routing::apply_workflow_run_record (cyclomatic 20): codewhale_tui::tui::tool_routing::apply_workflow_run_record 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/tui/src/tui/tool_routing.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc847479149a73a2ca5fccad8db68442c6d8c5b8bdd9e415184c0bd66ce7588"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_util::files::open_confined_dir_fd (cyclomatic 20): codewhale_util::files::open_confined_dir_fd 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/util/src/files.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23e3a8965ce6c98f98e089c40f2dfc9e0425959988b76ff65066e711a05a96a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.reattachActiveTurns (cyclomatic 20): index.reattachActiveTurns 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":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"199665344976236c2b2f1e0d004c71947d09c163cb4ef025f9a5edb76b96eae8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.main (cyclomatic 20): index.main has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21a81b719b3dbd4430678cad48697de5ad998f1a2e9b04e5cf63c85ee7b9eb1"}},{"ruleId":"D1","level":"warning","message":{"text":"ingest.fromOTLP (cyclomatic 20): ingest.fromOTLP 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":"pet/src/core/ingest.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe91bc82ae6abdb9af20e821de4f173885112e05bfec6c635573802a266caf3"}},{"ruleId":"D1","level":"warning","message":{"text":"highlight.tokenize (cyclomatic 20): highlight.tokenize has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/ratatui/highlight.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"800196ed4c31f521e447ef249e1326f1a41a46da96b012b7d2f40ab3f0c382f0"}},{"ruleId":"D1","level":"warning","message":{"text":"model.validateQuoteInput (cyclomatic 20): model.validateQuoteInput has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/model.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cf2662024daea7b5ef0ba58f919c23eae6d5f552ffafe4b82bedce2dc1fe72"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/operate_best_of_n.workflow.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c5ff1580d4296237be9cc09d4f65d8812b6d1f5fe8e5cb1b9208bbd95d2263"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 8 function items inside it that branch (eventMatches, errorOnsetOf, stableHash, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::validatePetBucket (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"8564311900bcb6ee2ae14a7413db44314855f42b31f06b2a07d9bc1384b14cfe"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 8 function items inside it that branch (eventMatches, errorOnsetOf, stableHash, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::validatePetBucket (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d10395d544415e13cb4f194b4273f4dfcf898d9206d99fa70625c3a74c842a3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::dispatch::run (cyclomatic 19): codewhale_account_cli::dispatch::run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/dispatch.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6796bd256cda8132510cd7a9d20d46608a2b1ddf9b530972496ca7f73b9f27f"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControlController::queue_runtime_envelope_inner (cyclomatic 19): RemoteControlController::queue_runtime_envelope_inner 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/app-server/src/remote_control.rs"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"646d1febcd7f75aaa9b53eb1dbfcb35c62ac0c3ad05e04b2c287cc8dbad77b25"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::map_compat_stream_event (cyclomatic 19): codewhale_app_server::runtime_api::map_compat_stream_event has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_app_server::runtime_api::fleet_event_label (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11592}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda4fdd0d74f8189bf3d5d8d0b54fdce633f1360333a629a3e723d39ee861cd4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server_protocol::codegen::methods_rs (cyclomatic 19): codewhale_app_server_protocol::codegen::methods_rs has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbcd5f6d5967de1f38d43361b0574f50a24f39856285835d3e7679830b2cb3b3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server_protocol::schema::parse_ty (cyclomatic 19): codewhale_app_server_protocol::schema::parse_ty has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/schema.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c61460ebeee9cd4f1db2f9a7da29ffac5f4c81670b4ca44a08768f9dccf9be"}},{"ruleId":"D1","level":"warning","message":{"text":"CatalogCorrections::validate (cyclomatic 19): CatalogCorrections::validate 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/config/src/catalog/corrections.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c350370ac1084d87542c52cda61acdc3e0fec3156b905128271b55ab73d922"}},{"ruleId":"D1","level":"warning","message":{"text":"UserInputWait::await_decision (cyclomatic 19): UserInputWait::await_decision 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/engine/src/core/engine/approval.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb2914c7c082f0e8b76aa12b8cb4053a4e30195a87ca9b9535ee8307f912af9"}},{"ruleId":"D1","level":"warning","message":{"text":"SdkTransport::exchange (cyclomatic 19): SdkTransport::exchange 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/engine/src/extension_host/mcp.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2be213a8716a0b0e7e800f1cb9ced46758af2ef43436032e749b11dce1ec1c"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionHostManager::ensure_host (cyclomatic 19): ExtensionHostManager::ensure_host 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/engine/src/extension_host/mod.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc6ac8d6d5f30d24f8fe114a63473bea57de16ea6a0a182a27c19e12116c685"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetManager::start_leased_workers (cyclomatic 19): FleetManager::start_leased_workers 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/engine/src/fleet/manager.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"0245efa47462818519763ba166d3f4f5f80dc4558058ae3e6ad74cebfce3a43f"}},{"ruleId":"D1","level":"warning","message":{"text":"HookContext::to_env_vars (cyclomatic 19): HookContext::to_env_vars 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/engine/src/hooks/executor.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"46937776548425cb876d9c7ebc7e4f1325b451f96d50b0d1c1dc716ffe079b4e"}},{"ruleId":"D1","level":"warning","message":{"text":"SseTransport::run_sse_loop (cyclomatic 19): SseTransport::run_sse_loop 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/engine/src/mcp/sse.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6efae0741e41a92307a63936a6dcd64f1d41145f5f8121866e0e727eeefae4"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::shutdown_and_wait (cyclomatic 19): RuntimeThreadManager::shutdown_and_wait 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":4564}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a13034d739dd409d9caf7290292f2d8ca91591fe49a459a3f51673d71c8c3d"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::spawn_idle_shell_completion_monitor (cyclomatic 19): RuntimeThreadManager::spawn_idle_shell_completion_monitor 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b099322ab17e8c401c8ca793d2ab28cc78f5adade7bd94f594b1b4be77ef0c0"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::steer_turn (cyclomatic 19): RuntimeThreadManager::steer_turn 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":14776}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c5632545d15d2d8058c3d48ea93d97f21a9bc1f3e0912c801d8e51b2917046"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionManager::apply_late_usage_result (cyclomatic 19): SessionManager::apply_late_usage_result 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/engine/src/session_manager.rs"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"9156a07f1c8a399d66c688729f041e33316dc5688a20fd24eb46b991436e495d"}},{"ruleId":"D1","level":"warning","message":{"text":"WriteFileTool::execute (cyclomatic 19): WriteFileTool::execute 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/engine/src/tools/file.rs"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c9ec45eda6b56d54b26ec0fab6c8e00ed988a85d9075cd8a296a0cdd389eba"}},{"ruleId":"D1","level":"warning","message":{"text":"BashTool::execute_wait_many (cyclomatic 19): BashTool::execute_wait_many 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/engine/src/tools/shell.rs"},"region":{"startLine":7083}}}],"partialFingerprints":{"codehealthFindingId/v1":"31413685cc35099b2eab684aecfe03f5ec64e00524608ad64815bebc8ac78e84"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::automation_manager::reconcile_run_statuses_shared (cyclomatic 19): codewhale_engine::automation_manager::reconcile_run_statuses_shared 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/engine/src/automation_manager.rs"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"e071f84b5b83f8ce145ddc804238332de0eda41513472751fb03f9c857a81040"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::mcp::snapshot_from_config (cyclomatic 19): codewhale_engine::mcp::snapshot_from_config 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/engine/src/mcp.rs"},"region":{"startLine":8580}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d2e9e7379733f9b738e4dd0d62355992200f4a9994191c95c80175afbc1ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::prompts::system_prompt_with_instruction_assembly_for_host (cyclomatic 19): codewhale_engine::prompts::system_prompt_with_instruction_assembly_for_host 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/engine/src/prompts.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9e25bc1e1102f31f66c804ecf6b69a2076602b8209c3d266b0430feb5756fe"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::provider_lake::compute_merged_snapshot (cyclomatic 19): codewhale_engine::provider_lake::compute_merged_snapshot 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/engine/src/provider_lake.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e5d568d7e13c46ab73c7b18b12ec6b65cb565ba5bbe94f824cd9b8b11dc4ef"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::route_billing::capture_product (cyclomatic 19): codewhale_engine::route_billing::capture_product has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_engine::route_billing::classify (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_billing.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60a49114e88232b298a18b513a4d4ac26ad27c028d38f414d70ae287bb52c11"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::runtime_threads::reconstruct_messages_from_turns_with (cyclomatic 19): codewhale_engine::runtime_threads::reconstruct_messages_from_turns_with 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/engine/src/runtime_threads.rs"},"region":{"startLine":6094}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5e40c23aee92b01b5d051ac79ccb03fdb8d7ba3902426d5641145bdc15947f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::approval_cache::computer_use_user_gate (cyclomatic 19): codewhale_engine::tools::approval_cache::computer_use_user_gate 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/engine/src/tools/approval_cache.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebf8266a16465d2ee968ce10409514fff54a903aae7e4a9c04da4019806f0a2"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::review_pr::complete_file_set (cyclomatic 19): codewhale_engine::tools::review_pr::complete_file_set 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/engine/src/tools/review_pr.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b07b06d1ad3530758df47f3d8c1b3c2cbeb405740d1e675f34cb4fb17e4b79"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::search::matches_expanded_glob (cyclomatic 19): codewhale_engine::tools::search::matches_expanded_glob 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/engine/src/tools/search.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb94c853151294ac498a7ae3e112ae4d8b8c7a0a01618c4166b25c079dd7b310"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::web::extract::sniff_media (cyclomatic 19): codewhale_engine::tools::web::extract::sniff_media 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/engine/src/tools/web/extract.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0f8a8724991271d17f2baeaa306309317c0f6aed9147d5354a347639bcdce4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::workflow::start_workflow (cyclomatic 19): codewhale_engine::tools::workflow::start_workflow 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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"461a0abca7f0a0cdbcf3fc736a6121c4288d413115a143b242822fc779f13fce"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_localization::parse_locale (cyclomatic 19): codewhale_localization::parse_locale 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/localization/src/lib.rs"},"region":{"startLine":5809}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd226deeb03ebdcdb8b0706babc8fd06d569d44f0d66015fb84e84ed6e0d18a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_models::schema_sanitize::normalize_kimi_compatibility (cyclomatic 19): codewhale_models::schema_sanitize::normalize_kimi_compatibility 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/models/src/schema_sanitize.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36ab28e7bc7c1827257fd1e50dde743300dc65c5f1b2ffbe0b0ecd3f1564d3b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_net::import_claude::build_plan (cyclomatic 19): codewhale_net::import_claude::build_plan 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/net/src/import_claude.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf5659fef0ed2e16892483334ba60a1df3205b85bfa596c457a3127b2c0bbf9"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginRegistry::restage_inner (cyclomatic 19): PluginRegistry::restage_inner 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/plugins/src/registry.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a335a966124ccc3ef9d8d5fd4dfe9f324ca41d2c4801c7ffc5466ecc51207e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::update (cyclomatic 19): codewhale_plugins::install::update 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/plugins/src/install/mod.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ae6527d22d42612477658d3693b1ec2f2b138bbc399eca4d11bac02c8f22f2"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::resolve_provider_identity (cyclomatic 19): Config::resolve_provider_identity has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9007310b4b2c95eb752cb085e15059df74158c8ff9dab7231c1db37bd66ec17"}},{"ruleId":"D1","level":"warning","message":{"text":"Workspace::browser_completion_candidates_inner (cyclomatic 19): Workspace::browser_completion_candidates_inner 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/runtime/src/working_set.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb8eb888cc40edbe3c63f4be2a5a1c7aaa388ba9f11971d644b16425a9fbb88"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::config::merge_config (cyclomatic 19): codewhale_runtime::config::merge_config 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":10093}}}],"partialFingerprints":{"codehealthFindingId/v1":"451153548e7aa3021ad523d121a8aafbb6e202106e7ee399e2929431d8ef9b58"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::config::save_api_key_for_identity_unlocked (cyclomatic 19): codewhale_runtime::config::save_api_key_for_identity_unlocked has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":11839}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea17eae3cc69c97e061f2424c55c673d11955851dcb12db8ea7ac4acd0a1f14"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skills::audit::find_skill_packages (cyclomatic 19): codewhale_skills::audit::find_skill_packages 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/skills/src/audit.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d517597fd7c649d66bf9d582578de2d20e727306e77a1cf6f66d635369168c5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skills::audit::classify_cross_root (cyclomatic 19): codewhale_skills::audit::classify_cross_root 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/skills/src/audit.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee8a105c97bfc2a976682a22a21792d6dbf9d8fafe137d225072378a5301820"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandPaletteView::render (cyclomatic 19): CommandPaletteView::render 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/tui/src/tui/command_palette.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f951304f0144f2390aba3e052e65b4aa23fa687949e694c8f2ecec5af33498"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::run_setup (cyclomatic 19): codewhale_tui::run_setup 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/tui/src/lib.rs"},"region":{"startLine":4647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b221eba7d4b875dc926a5105afaa7e1bc3bc6dd0fc6b3d7c5021e49d522b8e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::run_plugins_cli (cyclomatic 19): codewhale_tui::run_plugins_cli 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/tui/src/lib.rs"},"region":{"startLine":9552}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc7caa3b6acc4bab2461bbe937a90b07e4cca8fd41cc8a3d9639447964e3e20"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::execute_in_context (cyclomatic 19): codewhale_tui::commands::execute_in_context 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/tui/src/commands/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e068cec812b091f92f5382c5b0c476d5abac7213bfefe36c7332d5df300000"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::core_navigation_voice_host::capture_and_transcribe (cyclomatic 19): codewhale_tui::commands::core_navigation_voice_host::capture_and_transcribe 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/tui/src/commands/core_navigation_voice_host.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b157d3abac1402b8c3ce3d78a2115fa09fed6cb6874576c46e26d32200208f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::command_palette::build_entries_with_plugins (cyclomatic 19): codewhale_tui::tui::command_palette::build_entries_with_plugins 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/tui/src/tui/command_palette.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71d3ec1325126ecba45895c0307c2996a5e870d8296de0f2414bb5ed9aec137"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::render_matrix (cyclomatic 19): codewhale_tui::tui::history::latex_render::render_matrix 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_tui::tui::history::latex_render::append_superscript (cyclomatic 42) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca02bb068a37f962987e52572a227f722837837524582153291e14a7fd3042b7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_engine_error_to_app (cyclomatic 19): codewhale_tui::tui::ui::apply::apply_engine_error_to_app 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/tui/src/tui/ui/apply.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beaa696c38b57145592e2b4f3acf15f05a87636e6b53fb29da9915c02cc0973"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::views::render_settings_category_strip (cyclomatic 19): codewhale_tui::tui::views::render_settings_category_strip 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/tui/src/tui/views/mod.rs"},"region":{"startLine":4950}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad0177e888be463d8abe3cd00de92f5165102b84e28f73340261e9c72217013"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::views::fleet_roster::member_detail_lines_with_session (cyclomatic 19): codewhale_tui::tui::views::fleet_roster::member_detail_lines_with_session has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_roster.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"3727c3b1a539c695d9fe47be95bf1271c0f0863ad247056fb0c0a523e4714d2f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::render::layout::height (cyclomatic 19): codewhale_tui::tui::work_surface::render::layout::height 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/tui/src/tui/work_surface/render/layout.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4217c1d3e4809dbc4df63604df59d9646ac5bec50f4614e99cb51ca30b42a43f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui_kit::markdown_render::render_parsed_tagged_with_palette (cyclomatic 19): codewhale_tui_kit::markdown_render::render_parsed_tagged_with_palette 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/tui-kit/src/markdown_render.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5f45febbd3bca909a254d1ea98ca00b6a2ee12c9994043360db592e5aa73ea"}},{"ruleId":"D1","level":"warning","message":{"text":"harness._parse_stream_receipt (cyclomatic 19): harness._parse_stream_receipt 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":"integrations/verifiers-codewhale/codewhale_harness/harness.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91ec8f8d72fad1522f7646dab45e6e58fb0fd193b2ce0cfee52e3589a896b95"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSharedFrame.validate (cyclomatic 19): PetSharedFrame.validate has cyclomatic complexity 19 (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":"pet/swift/PetShared.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca44482ac18d2336a61154a2de22b77dc21b09c8a304ff349d0a4f42ed90216c"}},{"ruleId":"D1","level":"warning","message":{"text":"chat.readPayloadUserInput (cyclomatic 19): chat.readPayloadUserInput has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 882, 899). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28f29ecc2147d09da590ae0f1e0e12e6fe766b1d9f601621085657819560e2f"}},{"ruleId":"D1","level":"warning","message":{"text":"qr.makeMatrix.setFinder (cyclomatic 19): qr.makeMatrix.setFinder has cyclomatic complexity 19 (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":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"9958d6c1b11b9c76a162a20157741fdc1b8196c2bff11531b8da224661128782"}},{"ruleId":"D1","level":"warning","message":{"text":"index.reconcileAdmission (cyclomatic 19): index.reconcileAdmission 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":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"190f03cc7587749f1507dbaf924d9865cd0b13de737040dda8b88951a56ca81b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.reconcileSnapshot (cyclomatic 19): index.reconcileSnapshot has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 697, 692, 694). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"38acfd84cbdbc4ce059d671d20505ca67f656e67a8f57aa83f0c005e19671663"}},{"ruleId":"D1","level":"warning","message":{"text":"index.handleInbound (cyclomatic 19): index.handleInbound has cyclomatic complexity 19 (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":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbe3fd6c71d6820c4328ce16009a63c9778d25cf5c20f17467d1b9ec66595c6"}},{"ruleId":"D1","level":"warning","message":{"text":"ingest.redact (cyclomatic 19): ingest.redact 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":"pet/src/core/ingest.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8408bc2026ba2592cd519aea7a34b06481244f3fa54ac4026a1bfc403b0e924d"}},{"ruleId":"D1","level":"warning","message":{"text":"connection-banner.ConnectionBanner (cyclomatic 19): connection-banner.ConnectionBanner has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 8 of the 19 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 81, 40, 63, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/connection-banner.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"796cbd947a7156bc9221345e506086f841603ce80a5b19827aff42fb6cb376d1"}},{"ruleId":"D1","level":"warning","message":{"text":"contributor-merch.ContributorMerch (cyclomatic 19): contributor-merch.ContributorMerch has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 8 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/contributor-merch.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3ec11e2ed885ff77d215c45fe2c8addd1abd82725bebd5cc28a2ce50e0184b"}},{"ruleId":"D1","level":"warning","message":{"text":"install-guide-lib.buildInstallGuide (cyclomatic 19): install-guide-lib.buildInstallGuide has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/install-guide-lib.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b8bfabbcb6f73ad101ca560beba119475d18307fc93db1bfac204883232cc2"}},{"ruleId":"D1","level":"warning","message":{"text":"interest.validated (cyclomatic 19): interest.validated has cyclomatic complexity 19 (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":"web/lib/merch/interest.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eeabe2d882aa295095012b32f29aedb699e95bac82a555b39ee90e0c56d24f9"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::step (cyclomatic 19): (anonymous)::step has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::validatePetBucket (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceb3048d103bf38b4596e6eebe72f629ab784ee297b76a10ce933f9a2811052"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::step (cyclomatic 19): (anonymous)::step has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::validatePetBucket (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"7797ee648ba6e2f2f4e1bb1925b1ea202416ef35d2ef0f26805f076f0372ca79"}},{"ruleId":"D1","level":"warning","message":{"text":"startTrackedTurnStream (cyclomatic 19): startTrackedTurnStream has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 569, 589, 587). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff71b303e00a3d220507fbb31bb013540d84c4f56e321d1424d2c83609928d0c"}},{"ruleId":"D1","level":"warning","message":{"text":"makeMatrix::setFinder (cyclomatic 19): makeMatrix::setFinder has cyclomatic complexity 19 (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":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b75defc6f80fd56e6e2f09d84d83e4755a327ff30ac3e89d5d3b7bbf28efa14"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::work::cancel (cyclomatic 18): codewhale_account_cli::work::cancel 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/account-cli/src/work.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"082ca81af61e5ef9e8b5c007469e21859bad9e3b78fa6d322345f0435714a601"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketLines::poll_read (cyclomatic 18): WebSocketLines::poll_read has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/websocket.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"4689f81e99e31f4f51e3b8c09847e9d28d25598646b0cf0c43020c094c9850ad"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::exec_agent::summarize_tool_args (cyclomatic 18): codewhale_app_server::exec_agent::summarize_tool_args 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/app-server/src/exec_agent.rs"},"region":{"startLine":3730}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4bddbca9d08118a06b21276c0c294c2a4f1b1be959119ed438e8c984a6e2f5"}},{"ruleId":"D1","level":"warning","message":{"text":"RustOut::item (cyclomatic 18): RustOut::item has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dabb28fc2e99075b0ee768a9958f3d40d0a6e23f303e723b23041e010cbcef3"}},{"ruleId":"D1","level":"warning","message":{"text":"WatchEventReceipt::validate (cyclomatic 18): WatchEventReceipt::validate has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/runtime/watch_event.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85e26a2511484e59744e22baa49a52db2cfc192eb561c32eed9f6a31467ab71"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::update::uninstall::plan_path_blocks (cyclomatic 18): codewhale_cli::update::uninstall::plan_path_blocks 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/cli/src/update/uninstall.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c46c5eb9d97548fb0753fec46d1386613434a7d9b3d869ec7f3ff8e589ef95"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_core::fragments::collect_candidate_files (cyclomatic 18): codewhale_core::fragments::collect_candidate_files 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/core/src/fragments.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b669e48742b79f636676c81d3297a28bed82047128bee1d51e2e869e1f8014"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_core::prefix_cache::context_update_message (cyclomatic 18): codewhale_core::prefix_cache::context_update_message 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/core/src/prefix_cache.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"37580dd0c65d47af0d941cf6ef3b71113276e8051d69e3b65cfe5ec6c07be323"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolActionKind::from_tool_call (cyclomatic 18): ToolActionKind::from_tool_call 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/engine/src/core/authority/auto_review.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"85888ea5d8ac3a0c26425f49cd0f5d96c79286bad6c195807b1b2e9c64321759"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::discover_mcp_for_tool_search (cyclomatic 18): Engine::discover_mcp_for_tool_search 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/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b59038d24b565c3015ac5310010fd4f45a8747fb21c141da2e3e792bb060335"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::record_mcp_runtime_context (cyclomatic 18): Engine::record_mcp_runtime_context 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/engine/src/core/engine.rs"},"region":{"startLine":9876}}}],"partialFingerprints":{"codehealthFindingId/v1":"93775ce5bac61d42663f93ca0062b5d3183b96177d46925abdd54d250f0a959a"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::observe (cyclomatic 18): Session::observe 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/engine/src/extension_host/mcp.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8897c7ad867d610e46af4bd175a31767ccf2a8964d79b2fb5278a2b736b370"}},{"ruleId":"D1","level":"warning","message":{"text":"ExtensionHostManager::execute_launch_for_caller (cyclomatic 18): ExtensionHostManager::execute_launch_for_caller 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/engine/src/extension_host/execution.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"5836de4c1d772d49a631028e55e76e3ca44f321cdf8ade88c0d3cbadc1bf0b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"OwnerRegistry::register_shell_hook (cyclomatic 18): OwnerRegistry::register_shell_hook has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5f2789eed0d2bb8b9e2b2b96cd91294c8353cca6ed489016d38fbde422b3e8"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetLedger::compact_with_snapshot_hook (cyclomatic 18): FleetLedger::compact_with_snapshot_hook 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_engine::fleet::ledger::privacy_bounded_worker_payload (cyclomatic 29) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d68b9cb70834d87d94e724acf104594fb0059c7eea0eef59c22e9fd957ab83"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::settle_external_turn (cyclomatic 18): RuntimeThreadManager::settle_external_turn has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccb9f3e9ab3a35658680bf7837017c7a9d900c0a6e980a7e1c3fb4ba976a28c"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::settle_thread_goal_after_turn (cyclomatic 18): RuntimeThreadManager::settle_thread_goal_after_turn 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":5943}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e3fcd602a9f650267b4d9e5ac4638be9d9ab4fc4a48624335141e4d161c669"}},{"ruleId":"D1","level":"warning","message":{"text":"Run::repair_documents (cyclomatic 18): Run::repair_documents 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/engine/src/session_reconcile.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b74865a034ad2f0fbc065905c9e5d1dc681ea405e794f3c35d06eed515706c4"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskManager::admit_task_record (cyclomatic 18): TaskManager::admit_task_record 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/engine/src/task_manager.rs"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ec13ac76eb1cded9307978d0ae59f0b7f3334f58a52e5b3621909365d13a1f"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskManager::apply_event_to_task (cyclomatic 18): TaskManager::apply_event_to_task 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/engine/src/task_manager.rs"},"region":{"startLine":3325}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c19200e625269067402cfab3a399670fc6d0758a9c31a2df0f31ede1bcd8a31"}},{"ruleId":"D1","level":"warning","message":{"text":"CoordinationLedger::reconcile (cyclomatic 18): CoordinationLedger::reconcile 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/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5258352385f76055a5dd37c4906072a8a0b7b3d1ba38857ecb41da4bc3af51e"}},{"ruleId":"D1","level":"warning","message":{"text":"ChildAuthority::validate (cyclomatic 18): ChildAuthority::validate 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/engine/src/tools/subagent/engine.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98b0c4f74e08b14f0480ff2ef6dd424831c4bac65a92b0e829aaf82b4e8e7a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ChildAuthority::tools_for_model (cyclomatic 18): ChildAuthority::tools_for_model 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/engine/src/tools/subagent/engine.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ef64648b23d857dfe8ecde568a946bdf6ccffc44de4c9fc6d9879ccaf3cbf6"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowRunJournal::hydrate_runs (cyclomatic 18): WorkflowRunJournal::hydrate_runs 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/engine/src/tools/workflow/journal.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"621bc6ecb963037f6f50dfeb4f9321497418393bb07fe3319f266c9e5b529bb3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::llm_client::with_retry (cyclomatic 18): codewhale_engine::llm_client::with_retry 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/engine/src/llm_client/mod.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb0fd2dfaeb85eb62c8221a7a148847558383768351c9476126b0b0fc62d301"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::provider_lake::provider_capability_with_wire (cyclomatic 18): codewhale_engine::provider_lake::provider_capability_with_wire 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/engine/src/provider_lake.rs"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"974a8d87c3bb54d6db393a7933b6798ecf1b45c4c34cbaf140437d8b70da2055"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::receipts::classify (cyclomatic 18): codewhale_engine::receipts::classify has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"1700dcea87f4803f1d6a095da1d73ec22cfec1cb4b515ca11df9e435bf88d1da"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::route_preferences::admit_reviewed_selection (cyclomatic 18): codewhale_engine::route_preferences::admit_reviewed_selection has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_preferences.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9668ad8a5a9fe3be37e6160ca7eff0f680901a0e8ffb69001cf7bf0eb9a13d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::execution_envelope::enforce_execution_envelope (cyclomatic 18): codewhale_engine::tools::execution_envelope::enforce_execution_envelope 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/engine/src/tools/execution_envelope.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c286392290c34a094a241e2674ca3247bf329b535a2f02c28445f5874c929b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::review::plan_pr_review (cyclomatic 18): codewhale_engine::tools::review::plan_pr_review 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/engine/src/tools/review.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c46cb4620fb07e0bf3d8e97a0ee2da5430af09aae5b077eb6239aaaaf3f8cd"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::shell::execute_foreground_via_background (cyclomatic 18): codewhale_engine::tools::shell::execute_foreground_via_background 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/engine/src/tools/shell.rs"},"region":{"startLine":5145}}}],"partialFingerprints":{"codehealthFindingId/v1":"048d23c7d4e4bffb6cd3844ffc26c70e26f12057d04e4b29b898de17c7e6ac54"}},{"ruleId":"D1","level":"warning","message":{"text":"PluginManifest::validate_metadata (cyclomatic 18): PluginManifest::validate_metadata 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/plugins/src/manifest.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2345b794c070ff8cfd60ad21e871656fe41693d9cbbbdf1c54b78f259849a3e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::marketplace::parsers::claude::parse_claude_entry (cyclomatic 18): codewhale_plugins::marketplace::parsers::claude::parse_claude_entry 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/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46abf60adc90d4fea87754c1e9e9c4cce352f0721731f9e2f9cbf57df1d16eb"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::marketplace::parsers::claude::normalize_claude_source (cyclomatic 18): codewhale_plugins::marketplace::parsers::claude::normalize_claude_source has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"77201eca1772bb8332b578a100824fe1f4e086177f24a2b7b2d1c689336b40ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Inventory::summary_lines (cyclomatic 18): Inventory::summary_lines has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/installs.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3102a772b2d84ec4382908ae336ffe9985711c41283e1a6749e82ff812c3eefd"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::readonly_health_credential_generation (cyclomatic 18): Config::readonly_health_credential_generation has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":6108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab824ac691cddfd3f51606fd6e4a2bead304c4a915f434d28027a7b97b7040a3"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountLoginView::handle_key (cyclomatic 18): AccountLoginView::handle_key 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/tui/src/tui/account_login.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"da22a5951ccda222345f937d8de9b0d8133d2ae021f202ddc959fe8e0b54db68"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelPickerView::handle_mouse (cyclomatic 18): ModelPickerView::handle_mouse 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/tui/src/tui/model_picker.rs"},"region":{"startLine":4432}}}],"partialFingerprints":{"codehealthFindingId/v1":"957d8a466ea6159e679b693dc227e8bd5fdc9378bdacc0163869c22add1411b6"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetRosterView::render_body (cyclomatic 18): FleetRosterView::render_body has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_roster.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e129eb143ed66238959fd2aeb07c1deb3e5c99d4012b12777595045f671bde63"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetSetupView::apply_motion (cyclomatic 18): FleetSetupView::apply_motion has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e994baf4c5592c8d4dc639686bcd73a24b80e2b6ae80855c369b62b4d38a457"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetSetupView::render_review (cyclomatic 18): FleetSetupView::render_review 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/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc4e94799d8f4affc8867c6048e5af2c72a3e08c3f8ab547faa4b793cd5c2ea"}},{"ruleId":"D1","level":"warning","message":{"text":"ApprovalWidget::render (cyclomatic 18): ApprovalWidget::render 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/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"baaa7884d2c921a65de4b6c7d1db28ed6936218a4a926bc09c89eb1296a4bd08"}},{"ruleId":"D1","level":"warning","message":{"text":"AttachmentPreviewWidget::render (cyclomatic 18): AttachmentPreviewWidget::render 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/tui/src/tui/widgets/attachment_preview.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22119b84683a0fdc639b8b5d8a11a31f971c7d4cdd9ea62192e18c8c84bda04"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposerWidget::frame (cyclomatic 18): ComposerWidget::frame 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/tui/src/tui/widgets/mod.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf8b5b0e81597ce6dd5c39b0eb5240b9ccbe16dcd75a0a9dcbe6630b7e1d58b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::resolve_credential_diagnostic (cyclomatic 18): codewhale_tui::resolve_credential_diagnostic 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/tui/src/lib.rs"},"region":{"startLine":4847}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde4497de090dfcb78bf23969ce2e99fc9a18551b229fe523583e38070650b0b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::approval::build_prominent_details (cyclomatic 18): codewhale_tui::tui::approval::build_prominent_details 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/tui/src/tui/approval.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"b790fe6db68eaea5a1693ac31c5d610b561ed52fe3f17a404c9d7975639233cd"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::provider_picker::auth_status_for (cyclomatic 18): codewhale_tui::tui::provider_picker::auth_status_for 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. This is NOT this file\u0027s highest cyclomatic complexity: ProviderPickerView::render (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"9058295e2fbdeec74f473c7fec28d1d89f6570a463113993147a95306973de77"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::activity_detail::open_details_pager_for_cell (cyclomatic 18): codewhale_tui::tui::ui::activity_detail::open_details_pager_for_cell 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/tui/src/tui/ui/activity_detail.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc5f165ebdef1d4fcaaa4be00314a111431c650029f851dbcd8b8930150ee69b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::session_state::capture_turn_started_metadata (cyclomatic 18): codewhale_tui::tui::ui::session_state::capture_turn_started_metadata 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/tui/src/tui/ui/session_state.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1035eae699f16b818da9998b056fa0a401b66270339e72617fbddeae28fc01f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::session_state::poll_fresh_session (cyclomatic 18): codewhale_tui::tui::ui::session_state::poll_fresh_session 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/tui/src/tui/ui/session_state.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdcc3562aeeb3cf3370dfa4dda9052967046232a66b5d1386a7534e9b28d0f5"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.constructor (cyclomatic 18): PetWorld.constructor has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0229ebbadbb27995467faee6aa15f0ab98712998904d3ee89da9677bd14633f"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSim.step (cyclomatic 18): PetSim.step has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0fabedda8d44eb369d4b739cc3116181148b36591307c086b6a279d3953bf3"}},{"ruleId":"D1","level":"warning","message":{"text":"lib.parseQuestionAnswers (cyclomatic 18): lib.parseQuestionAnswers has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"412d4a86dc4995a1b5843ca6be8032c23547922b9a09621e6d7332d834299d43"}},{"ruleId":"D1","level":"warning","message":{"text":"index.streamTurnEvents (cyclomatic 18): index.streamTurnEvents has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9f34cdc04054fdac9e3108f528b1d4712cf098db5ef5ea5d9edd39f9f7f745"}},{"ruleId":"D1","level":"warning","message":{"text":"install.prepareCompiledHost (cyclomatic 18): install.prepareCompiledHost 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":"npm/codewhale/scripts/install.js"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd05933338da2d8e5b10ea6c3f98c9700109209d82e8fb239d65d10436656b6"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.constructor (cyclomatic 18): PetWorld.constructor has cyclomatic complexity 18 (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66a30878f5fe37a83e81ab0a1bce2abf756344ab191a6e447c16ba1e8886203"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSim.step (cyclomatic 18): PetSim.step has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadce9ed6f76cf0e7288ab5ff62f5b91ce8236371e094110e235fabfae5adca7"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSim.step (cyclomatic 18): PetSim.step has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-sim.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"240217cccddb531e258f7d325f47a384d80b805a22870a5e37457facfac3a82b"}},{"ruleId":"D1","level":"warning","message":{"text":"PetWorld.constructor (cyclomatic 18): PetWorld.constructor has cyclomatic complexity 18 (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":"pet/src/core/pet-world.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b81e526dc7e37167a3ffff13ce144696568c2583f1a2f2541e1d01f372b63c"}},{"ruleId":"D1","level":"warning","message":{"text":"pet.get(\u0027follow\u0027).onclick (cyclomatic 18): pet.get(\u0027follow\u0027).onclick has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (poll). 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":"pet/src/ui/pet.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cd1c16ce120ddb4a2868f316083a1ca7a6f750d69b75c34482089ef07028fb"}},{"ruleId":"D1","level":"warning","message":{"text":"release-updates.validSnapshot (cyclomatic 18): release-updates.validSnapshot has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 22). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/release-updates.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"589ad2bf55eb46e5018cd1058f2b45e63660acf84333bfc19e95fce98538e14f"}},{"ruleId":"D1","level":"warning","message":{"text":"server.webhook (cyclomatic 18): server.webhook 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":"web/lib/merch/server.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f18d59fb9d738c1617795651c470277ab4ce5412cd1540073a5b71b70b391c"}},{"ruleId":"D1","level":"warning","message":{"text":"release-docs-lib.checkReleaseDocs (cyclomatic 18): release-docs-lib.checkReleaseDocs 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":"web/scripts/release-docs-lib.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a236adfe533551e11bfd99f9e5fa72bf7a26ab2f3ad0f0b7aa41a73a72709792"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::presentation (cyclomatic 18): (anonymous)::presentation has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::validatePetBucket (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7734f4a3aa3cc3748210d3ee330d4fc9c73ed543b73bc009ef72f313c5b2f9bd"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::constructor (cyclomatic 18): (anonymous)::constructor has cyclomatic complexity 18 (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. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::validatePetBucket (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5f29595b2b35d07edfa4696b85c9bb22b5fc129876277362742149dc7f868e"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::presentation (cyclomatic 18): (anonymous)::presentation has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::validatePetBucket (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"98759014f8122c75de19aa12381c4b74d09b849999e76456813e69a0462fcc18"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous)::constructor (cyclomatic 18): (anonymous)::constructor has cyclomatic complexity 18 (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. This is NOT this file\u0027s highest cyclomatic complexity: (anonymous)::validatePetBucket (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"58de559ef9bdebf8a35e582e6e87e638b846c02ec4fffd5b1dfc412bd436911d"}},{"ruleId":"D1","level":"warning","message":{"text":"ReqwestTransport::execute (cyclomatic 17): ReqwestTransport::execute has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"3623ed05f0de3b7a0358ca45366865d01b98b979c1f73409ebfa00fcf5aa63cd"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::attribute_window (cyclomatic 17): codewhale_app_server::runtime_api::attribute_window has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_app_server::runtime_api::fleet_event_label (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":9480}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15e6987f0b36c416ae6d897cf923d29831df12ae8734511f65988f259d05bd9"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::plugins::prepare_plugin_ui (cyclomatic 17): codewhale_app_server::runtime_api::plugins::prepare_plugin_ui 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_app_server::runtime_api::plugins::catalog_description (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plugins.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb1302c872c6f0572d1755c4cd8e9fc5cc7eab402b91fa4ab25eb909dd58956"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::metrics::read_events_jsonl (cyclomatic 17): codewhale_cli::metrics::read_events_jsonl 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/cli/src/metrics.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af3b666be416361e80475b85cf7b75bbffa35dac4af970b364bcffcb71d971b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_commands::debug::cache_format::format_cache_stats (cyclomatic 17): codewhale_commands::debug::cache_format::format_cache_stats 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/commands/src/debug/cache_format.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7951324824b0c8383384b7b9ea902e72e58b09fa6a8ad8874e68f3d4daef1d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_config::catalog::offerings_from_models_dev (cyclomatic 17): codewhale_config::catalog::offerings_from_models_dev 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/config/src/catalog.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"1676db8ab34157467079b08a9b77faca5c836fa6885b5bd56dc64accbd7db0fc"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_config::private_directory::open_owned_directory (cyclomatic 17): codewhale_config::private_directory::open_owned_directory 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/config/src/private_directory.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"44765a7475a953d46972a3dde08be2a7becbd905475e08d0bdefd54e48e8acf1"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhaleClient::send_retry_loop (cyclomatic 17): CodewhaleClient::send_retry_loop 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/engine/src/client.rs"},"region":{"startLine":4901}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae6531f3e10bcc259b2cac35bf01ee14941acb7f9001aa6e06e72df103f852b"}},{"ruleId":"D1","level":"warning","message":{"text":"CapturedRlmCaller::dispatch_admitted (cyclomatic 17): CapturedRlmCaller::dispatch_admitted 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/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f0876b1f87b506c569948b8c2e88ea18afd8ffdc303c3cd8d75e81ca768629"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::reconcile_restored_work_bindings (cyclomatic 17): Engine::reconcile_restored_work_bindings 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/engine/src/core/engine.rs"},"region":{"startLine":8665}}}],"partialFingerprints":{"codehealthFindingId/v1":"a558b2d53771e68f57fc9bc71f7d9c3c549a242780ce2e154ba67cac2ef5dcd6"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::start_mcp_session_boot (cyclomatic 17): Engine::start_mcp_session_boot 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/engine/src/core/engine.rs"},"region":{"startLine":9430}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4dc18cb6870f7d7bce370929fc0691dfc62eb438c273bde992728253b9d54ac"}},{"ruleId":"D1","level":"warning","message":{"text":"NativeUsageSource::prepare_observed_kind (cyclomatic 17): NativeUsageSource::prepare_observed_kind has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5e31ac09933435972f61801fcb877f7e8319b53f026bcc3c705a32c52cd7e8"}},{"ruleId":"D1","level":"warning","message":{"text":"BrokerContext::act (cyclomatic 17): BrokerContext::act has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"2821f5ebfbda3fa4336ddf9b9d29dbb6ec4f2b8690bc1a52fd16932f3fa696f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::handle (cyclomatic 17): Reader::handle 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/engine/src/extension_host/supervisor.rs"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf186fcdd0091c12baf0cd33818e302825c747e08a6979617ebd0b07f1186c1"}},{"ruleId":"D1","level":"warning","message":{"text":"FleetManager::run_to_completion (cyclomatic 17): FleetManager::run_to_completion 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/engine/src/fleet/manager.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"639028fad9ad12ee07cdc20e5c7acac3533dbdb75d20965f09a65b2452df3432"}},{"ruleId":"D1","level":"warning","message":{"text":"McpHttpClient::execute_inner (cyclomatic 17): McpHttpClient::execute_inner has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/http_client.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e52fc6e4d283cef6a420e041b8f820ad324b0dda6e699206468b6a49254ffa"}},{"ruleId":"D1","level":"warning","message":{"text":"McpPool::plan_supervision (cyclomatic 17): McpPool::plan_supervision 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/engine/src/mcp.rs"},"region":{"startLine":4644}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a26c6b173a712c017557d15226cc4eea4b1ecf2a803ca7c7962af6c16aa46f3"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::deliver_agent_mail (cyclomatic 17): RuntimeThreadManager::deliver_agent_mail has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6344}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e08ccb4dfbbe789e0724107dfa13010bcb228ee2af25673913d706f7dacb558"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::run_extension_command_inner (cyclomatic 17): RuntimeThreadManager::run_extension_command_inner has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2584387aabb7947c644ceb879254a901244a7828a298945a95ff23010b23e801"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadManager::register_runtime_usage_sink (cyclomatic 17): RuntimeThreadManager::register_runtime_usage_sink has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16464}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac68536ce57eeed5977ff42e3ffdd80fb8bfb8b2e2b0e25c4f598f25ebed3c3"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadStore::seed_complete_beneath_later_turn (cyclomatic 17): RuntimeThreadStore::seed_complete_beneath_later_turn 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/engine/src/runtime_threads.rs"},"region":{"startLine":3274}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5f5a20a2221bb87cb9742fb7afc10bc05cd8f7e3aeee5ef70478a1e200da30"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeThreadStore::newest_message_text_by_turn (cyclomatic 17): RuntimeThreadStore::newest_message_text_by_turn 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/engine/src/runtime_threads.rs"},"region":{"startLine":3907}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a70d47d729b1ebe85a83665e3be471e055452ec58cc437333d75cceaf4b7b7"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionManager::read_checkpoint_file (cyclomatic 17): SessionManager::read_checkpoint_file has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":4886}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ea6304795fd13d92d8902742a92f3cdb3b097b90de373bf5a92335fbc5f3df"}},{"ruleId":"D1","level":"warning","message":{"text":"TaskManager::worker_loop (cyclomatic 17): TaskManager::worker_loop 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/engine/src/task_manager.rs"},"region":{"startLine":2935}}}],"partialFingerprints":{"codehealthFindingId/v1":"6819261824fd28f7d131bf62c29b1258ce92bb5268ea3549fc709019510eb740"}},{"ruleId":"D1","level":"warning","message":{"text":"AnchoredDirectory::open (cyclomatic 17): AnchoredDirectory::open 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/engine/src/tools/github/report.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"1497d58f8b8cb90b59663e36445abefcba787b7e16926700ee782f446316ab4e"}},{"ruleId":"D1","level":"warning","message":{"text":"SubAgentManager::followup_child (cyclomatic 17): SubAgentManager::followup_child 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":8459}}}],"partialFingerprints":{"codehealthFindingId/v1":"42098fa560e5bbb8e53a79de27f64ed13d8d00eced0e4315afa70e7d03728021"}},{"ruleId":"D1","level":"warning","message":{"text":"SubAgentManager::commit_prepared_child (cyclomatic 17): SubAgentManager::commit_prepared_child has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":10404}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c718dab33ce4db80bed4644b67925be5bb674e7616850d6b732324009f2d49"}},{"ruleId":"D1","level":"warning","message":{"text":"SubAgentManager::commit_terminal_result (cyclomatic 17): SubAgentManager::commit_terminal_result has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":11636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c7bf525b292cc577509c310fcdaab0242bdfa30ea0917701e4b1f85028301d"}},{"ruleId":"D1","level":"warning","message":{"text":"RetrieveToolResultTool::execute (cyclomatic 17): RetrieveToolResultTool::execute has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5581edbe04085df5e8cd7a0294ae36cfd8fb69f54cc4313c2850f116b949c5f3"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowTally::from_events (cyclomatic 17): WorkflowTally::from_events 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/engine/src/tools/workflow/view.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0f5af4c7448ec5302186d2d48b3273a955e3e932867212f9715278d0517d8c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::core::engine::dispatch::format_tool_error_with_schema (cyclomatic 17): codewhale_engine::core::engine::dispatch::format_tool_error_with_schema 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/engine/src/core/engine/dispatch.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"8241aec7fe3ef04d40baf3f13e659963b93e50a6b782a21a5e81ed0f88b03680"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::core::engine::tool_catalog::likely_field_corrections (cyclomatic 17): codewhale_engine::core::engine::tool_catalog::likely_field_corrections has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_catalog.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"41676d68ccd8cc0754f9e68bb2be466040cb6d377e8dc1470ed078be0472d2f5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::core::engine::tool_preparation::prepare_tool_call (cyclomatic 17): codewhale_engine::core::engine::tool_preparation::prepare_tool_call 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/engine/src/core/engine/tool_preparation.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b7a2cd78060c6c34781d905c177665d16db6334264d149d0153154ab8f1539"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::cost_status::record_interactive_runtime_usage (cyclomatic 17): codewhale_engine::cost_status::record_interactive_runtime_usage has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":4014}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c3bd0d66cc2d618e0b291ddc8310737db4844685ad30358521222ae1c15ef5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::desired_owners_from (cyclomatic 17): codewhale_engine::extension_host::desired_owners_from 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/engine/src/extension_host/mod.rs"},"region":{"startLine":3233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f851adae281c2d9351e9a4089e4c073b03c4b7cc3843986784c383084a396547"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_network::scrub (cyclomatic 17): codewhale_engine::extension_host::dsh_network::scrub 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/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df1967591bd9af1466b5ff35cb1602958b500dc6ba71e2cb979053572180d22"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_terminal::serve (cyclomatic 17): codewhale_engine::extension_host::dsh_terminal::serve has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_terminal.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a5271a7d43105efe1d73354212bede7127dbc87f3525affc83bf28b5b265aa"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::execution::run_job (cyclomatic 17): codewhale_engine::extension_host::execution::run_job 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/engine/src/extension_host/execution.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10d98e1ffbe66cfa5f18fbdc4b59a419f05ce4118a7a2efde94a3a74e31827b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::supervisor::host_denied_read_paths (cyclomatic 17): codewhale_engine::extension_host::supervisor::host_denied_read_paths 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/engine/src/extension_host/supervisor.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3d5c8826e748706f995255ca1eb24fd4f209c31acb13f3be8cac884a050c45"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::windows::verify_token (cyclomatic 17): codewhale_engine::extension_host::windows::verify_token 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/engine/src/extension_host/windows.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"291adfea018232fe3a16ad213f0d810bbe3e295ebaed9183448235db5a223458"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::fleet::members::add_fleet_model (cyclomatic 17): codewhale_engine::fleet::members::add_fleet_model 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/engine/src/fleet/members.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"588c0243eb4ce70eb60571b9b611878e5560c8fce0a4421745490d36ae2aa6bb"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::git_status::parse_porcelain_v2 (cyclomatic 17): codewhale_engine::git_status::parse_porcelain_v2 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/engine/src/git_status.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea7107a30f27ac8756e1e936aa4f6ad391bd206256422af082c2015a27af392"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::mcp::oauth::secret_value_span (cyclomatic 17): codewhale_engine::mcp::oauth::secret_value_span 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/engine/src/mcp/oauth.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f097242f79f7c1c18ae21d58f6025a052554db42275bfc944b993bb1994c5b4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::project_context::load_dir_instructions (cyclomatic 17): codewhale_engine::project_context::load_dir_instructions 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/engine/src/project_context.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa279bc848b700b29459a2fded4f38edf19f5f348f0c8ae8c253984402678ba6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::provider_lake::run_models (cyclomatic 17): codewhale_engine::provider_lake::run_models 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/engine/src/provider_lake.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea0b3e8b0e9974881ae26ca7d1993d83ab22b3fe29dcc6fec5385e3292e5aa3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::purge::cascade_tool_pair_removals (cyclomatic 17): codewhale_engine::purge::cascade_tool_pair_removals 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/engine/src/purge.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"807a536219c1397cfae886687d5fe66d2cb8f78605d9748b0980bea723589f2f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::session_secret_scrub::scrub_files (cyclomatic 17): codewhale_engine::session_secret_scrub::scrub_files 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/engine/src/session_secret_scrub.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"078df2c285735019a4f2a4d7205e08046e727946a87ec87ff349cb18a8ae3ae6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::apply_patch::apply_hunk (cyclomatic 17): codewhale_engine::tools::apply_patch::apply_hunk 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/engine/src/tools/apply_patch.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca6707abceb9b1ff230642e69314b3ac070b150af35c3b3073a29eff59c64b4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::shell::enforce_readonly_segment_operands (cyclomatic 17): codewhale_engine::tools::shell::enforce_readonly_segment_operands 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/engine/src/tools/shell.rs"},"region":{"startLine":4893}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ec6bcde6a125087516d1cba53111c1ff07e7b153b8ef15f33473df8ca9fd0a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::run_prepared_subagent_task (cyclomatic 17): codewhale_engine::tools::subagent::run_prepared_subagent_task 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":12136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8908cc8978691e7c96bc667905e40253e14b8af087635b7755d60fff2b1d0bb"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::web_run::run_image_search (cyclomatic 17): codewhale_engine::tools::web_run::run_image_search 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/engine/src/tools/web_run.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b146e4564ae5d87df2334570a79143419b474b55975c20087117ad7314c5b4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::web_search::run_backend_search (cyclomatic 17): codewhale_engine::tools::web_search::run_backend_search 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/engine/src/tools/web_search.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"960d7ed1aaf35dc72144e7afb5003a879a1cfb911c838032a209e71ef2856a1d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::workflow::structured_plan_to_workflow_spec (cyclomatic 17): codewhale_engine::tools::workflow::structured_plan_to_workflow_spec 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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfc6873285ea8ef02ce594d35687f3b4acc04410050b0a43e4ac05ac149a31f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::workflow::looks_like_declarative_workflow (cyclomatic 17): codewhale_engine::tools::workflow::looks_like_declarative_workflow 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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":3355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a248fc3264136c05bae24d869e483e7fbcd2acc4b25fd26edc8379cb36334f16"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::walk_invocations::collect (cyclomatic 17): codewhale_execpolicy::command_safety::walk_invocations::collect has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_execpolicy::command_safety::readonly_options_are_allowed (cyclomatic 37) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78b9994751e4606d1c49426f8c84c07b9cbfa911ec13f54f7b8b7086a5ba26c"}},{"ruleId":"D1","level":"warning","message":{"text":"Components::mcp_row (cyclomatic 17): Components::mcp_row 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/plugins/src/install/dsh.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb12da08683cd10630ceb7a6a4a8590ab7b01ed9f56525fe7e7d0246f9a17c4b"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::marketplace::parsers::kimi::parse_kimi_entry (cyclomatic 17): codewhale_plugins::marketplace::parsers::kimi::parse_kimi_entry has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/kimi.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"478b2d72abdf4c66ce87c81cf3de439ed83d2e70a404b28cdc5dd2aff3f79bb4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_release::installs::inventory (cyclomatic 17): codewhale_release::installs::inventory 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/release/src/installs.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd7433c1f95df9bc3c36850977e799e71ee18f294819ac44753a6443fd3485a"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonRuntime::run (cyclomatic 17): PythonRuntime::run 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/repl/src/runtime.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"6829ea7369521e259a8c39c9eabfb08ecf880bdb43ea4b2e4d363370af2a9586"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::approval_policy_control (cyclomatic 17): Config::approval_policy_control 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3513}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efcda9e5b285cdf67163a97ecf05cd89f20a03351b8c9d8776a4e2abba23d2c"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings::apply_env_overrides (cyclomatic 17): Settings::apply_env_overrides 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. This is NOT this file\u0027s highest cyclomatic complexity: Settings::canonical_key (cyclomatic 48) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0c2ee991819c118c33ded4500308712c9b1159ff34ab55d981393befa0001a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::config::canonical_model_id_for_provider (cyclomatic 17): codewhale_runtime::config::canonical_model_id_for_provider has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"03efc588d7144bede8c58441d680223b1ef9b3a406717f8baf9751725047821c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::external_credentials::open_secure_regular_file (cyclomatic 17): codewhale_runtime::external_credentials::open_secure_regular_file 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/runtime/src/external_credentials.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2bf158e93c8432b548571610d92a877de98f97ac825d54f148494ad770c7b31"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skills::mutation::unpack_tar_gz (cyclomatic 17): codewhale_skills::mutation::unpack_tar_gz 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/skills/src/mutation.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c64e983a0aaa69a9d11d4e375316cc95e775bc5615aa2ca9ea305b2dadbdab"}},{"ruleId":"D1","level":"warning","message":{"text":"SnapshotRepo::restore_path_plan_locked (cyclomatic 17): SnapshotRepo::restore_path_plan_locked 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/snapshot/src/repo.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f5cef7c426cb99fc665b7269ce4ed3fcd25fc4b0ae2c63d2f8005c8ef373a3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tools::patch_preflight::parse_hunk_header (cyclomatic 17): codewhale_tools::patch_preflight::parse_hunk_header 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/tools/src/patch_preflight.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"826c7b5c02f01e8ea6c0832215d3be0f9714b7835609ca0fed7bc8f4179a7ee7"}},{"ruleId":"D1","level":"warning","message":{"text":"ProviderPickerView::provider_detail_lines (cyclomatic 17): ProviderPickerView::provider_detail_lines has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ProviderPickerView::render (cyclomatic 28) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"335af115affd45f09fc3f12086cf09612fb595cffe59609993be54222da20d83"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigView::handle_choice_key (cyclomatic 17): ConfigView::handle_choice_key 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/tui/src/tui/views/mod.rs"},"region":{"startLine":3582}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e146f2f62378bb436d164f0fb69914ab58b86d9255e9e1220dc56600622f65d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::run_sandbox_command (cyclomatic 17): codewhale_tui::run_sandbox_command 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/tui/src/lib.rs"},"region":{"startLine":13752}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bc51e953aca1ca30ca53902c624a921a558c4406975f332f117db3ccd93b42"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::contract::scan_managed_plugins_portable (cyclomatic 17): codewhale_tui::commands::contract::scan_managed_plugins_portable has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_tui::commands::contract::key_to_message_id (cyclomatic 109) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":4058}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a3c862ff9ea2b33a93e3c173700e45286129e1366f4e2417c4eeacbe4bd9cf"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::config::trust (cyclomatic 17): codewhale_tui::commands::groups::config::config::trust 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/tui/src/commands/groups/config/config.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2510975a8b1fcc2ef1a6d9da27cb15591ac94147b59b66d5aca098b8ec73a90"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::import_claude::render_plan (cyclomatic 17): codewhale_tui::commands::groups::config::import_claude::render_plan has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/import_claude.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a5c175c2e8ae301957db18adf6d1e32bdbea04bb2d927a52eef7b339546efd"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::project::init::parse_cargo_toml (cyclomatic 17): codewhale_tui::commands::groups::project::init::parse_cargo_toml 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/tui/src/commands/groups/project/init.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49dfce2ea8c4b49e553d99233ee3fbd7e7a45a561b0d0f429eeb9fd25a35a50"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::agent_focus::render_focus (cyclomatic 17): codewhale_tui::tui::agent_focus::render_focus has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_focus.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd3a096ad3a94c278e839837050e085979c1e7aa99af0e5be05a178fc298ba0"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::approval::build_impact_summary (cyclomatic 17): codewhale_tui::tui::approval::build_impact_summary 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/tui/src/tui/approval.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea3598648cdd2c8bd863a98bb6f9147d86dccec42dd4255df3d4572dda48723"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::composer_ui::handle_composer_history_arrow (cyclomatic 17): codewhale_tui::tui::composer_ui::handle_composer_history_arrow has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/composer_ui.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"19df87b3ae4ae51bec0153ad1e143297c461b9ad7726373ee574f853be388290"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::history::tool_output::for_each_output_row (cyclomatic 17): codewhale_tui::tui::history::tool_output::for_each_output_row 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/tui/src/tui/history/tool_output.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"442992a69dcf37464922cf88bdea1b85e450cfedde0e5189fc30b4537c6530d4"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::mouse_ui::push_work_row_entries (cyclomatic 17): codewhale_tui::tui::mouse_ui::push_work_row_entries 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/tui/src/tui/mouse_ui.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e60c489d76365370803f0db2c5586517b0eeef63e37f0d6a0bd6925f89ef64"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::underwater::mcp_launch_lines (cyclomatic 17): codewhale_tui::tui::underwater::mcp_launch_lines 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/tui/src/tui/underwater.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f2957424f63c122232cad088fd2c346c7a77c863783e3e8c8de60826f4df5c"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::views::git_state_rows (cyclomatic 17): codewhale_tui::tui::work_surface::views::git_state_rows has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/views.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0eafdba29bfe6618a18872270115f3e91f921e2c2f0dfd87220ded9fc28066"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkflowPlan::from_config (cyclomatic 17): WorkflowPlan::from_config 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/workflow/src/lib.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bfb6e5c0e105c900f1b095d955817b842f40a77561d6739365b358ebc41fa0"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhaleHarness.launch (cyclomatic 17): CodewhaleHarness.launch 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":"integrations/verifiers-codewhale/codewhale_harness/harness.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"528bc07baec8d02bf9f2b09695aa179150637d7e9511aacf8214394d0d3e7f6a"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhalePetMobileApp.body (cyclomatic 17): CodewhalePetMobileApp.body has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/CodewhalePetApp.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6278e1bc25370ca3a9160bb24a655d7d07e556481c0e91054820df36f7f0f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"CodewhalePetApp.body (cyclomatic 17): CodewhalePetApp.body 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":"pet/macos/CodewhalePetApp.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9c559eea70aa2a97ff9385de87658ab0981352e663ef01118bc4b704030598"}},{"ruleId":"D1","level":"warning","message":{"text":"PetSharedHost.start (cyclomatic 17): PetSharedHost.start 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":"pet/swift/PetShared.swift"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86dc8b6049c527d59d92731adc4dbfe15ff8bebe48b00de672e58cdb005e7cd"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreadStore.ensureShape (cyclomatic 17): ThreadStore.ensureShape has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69bea1773525dcf30f71e4af131ea0311a5856be203097a6a72c02b01bae771"}},{"ruleId":"D1","level":"warning","message":{"text":"index.handleIncomingMessage (cyclomatic 17): index.handleIncomingMessage 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":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31280d9f749e47011155568c9356e7d0a92c0bb4eeab3e9de487f987ad960c9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.handleCommand (cyclomatic 17): index.handleCommand 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":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd256f736328e7be68fafa1fbf851922a96bc7af57025a613efccc4abadb1ae"}},{"ruleId":"D1","level":"warning","message":{"text":"install.isRetryable (cyclomatic 17): install.isRetryable 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":"npm/codewhale/scripts/install.js"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"a002858412fae0006e2a512225415f346bade90c1e1eeda919dccc449e5e5d19"}},{"ruleId":"D1","level":"warning","message":{"text":"install.ensureBinary (cyclomatic 17): install.ensureBinary 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":"npm/codewhale/scripts/install.js"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b01f46dbe42fcb85b0793e517e72486a4dbd2aa6ca72bf0998844061753f79"}},{"ruleId":"D1","level":"warning","message":{"text":"install.run (cyclomatic 17): install.run has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"npm/codewhale/scripts/install.js"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff0c4074843b8aed1d8ae9ccb47f20f1e3e03cbd5c671fb0251354fd0d9027b"}},{"ruleId":"D1","level":"warning","message":{"text":"pet.get\u003CHTMLInputElement\u003E(\u0027file\u0027).onchange (cyclomatic 17): pet.get\u003CHTMLInputElement\u003E(\u0027file\u0027).onchange 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":"pet/src/ui/pet.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a16370ef9d54767f68303e58acce7141b67d16f30445616953c2e5213d0fb2a"}},{"ruleId":"D1","level":"warning","message":{"text":"content-watch.runSemanticDrift (cyclomatic 17): content-watch.runSemanticDrift has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content-watch.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f112e15654088f13c14701d1706775c515379b5054c9ad0cb2cdca4b09573a"}},{"ruleId":"D1","level":"warning","message":{"text":"audit-dependencies.classifyAudit.mitigated (cyclomatic 17): audit-dependencies.classifyAudit.mitigated 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":"web/scripts/audit-dependencies.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d83267e69869f7db7229a444bd0272d38d3380b9781f2f6e865317c03dbd60"}},{"ruleId":"D1","level":"warning","message":{"text":"changelog-lib.parseChangelog (cyclomatic 17): changelog-lib.parseChangelog 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":"web/scripts/changelog-lib.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"213daa4172ed2a8c43b0310d4f0e8eb05fc1d7a9acb8bdd7c246e74c582aead9"}},{"ruleId":"D1","level":"warning","message":{"text":"render-terminal-capture.compact.rows (cyclomatic 17): render-terminal-capture.compact.rows has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-terminal-capture.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30cd16c772d23546dcad1bf78e0b6496d1967002fda972e2a5d9eca4aef2292"}},{"ruleId":"D1","level":"warning","message":{"text":"handleCallbackQuery (cyclomatic 17): handleCallbackQuery 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":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"af188039745f1eb129b5c808dc543271c6b0bdd8fab55fe918b5ca3e82064cc8"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::run_computers (cyclomatic 16): codewhale_account_cli::run_computers 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/account-cli/src/lib.rs"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e2ac950d764f86c8d78d8e43e093ee2ee027972d55cd0099f59d5abce5f434"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_account_cli::validate_verification_url (cyclomatic 16): codewhale_account_cli::validate_verification_url 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/account-cli/src/lib.rs"},"region":{"startLine":3534}}}],"partialFingerprints":{"codehealthFindingId/v1":"4348ddc90acdd022801c13f1da967aee5110914c32db7491f7a4b29205c90839"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeEventJournal::load (cyclomatic 16): RuntimeEventJournal::load 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/app-server/src/remote_control.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"15668de76fb95b09169b1aad292b14e9da91a3b254831d248ee4b1f2c76c99bc"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteControlController::observe_engine_event (cyclomatic 16): RemoteControlController::observe_engine_event 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/app-server/src/remote_control.rs"},"region":{"startLine":2526}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ca7c5e946d7480bfa1465d3ef31434f9497a8af6ccdd942f62294ec62212ba"}},{"ruleId":"D1","level":"warning","message":{"text":"CapturedRuntimeFrontend::serve (cyclomatic 16): CapturedRuntimeFrontend::serve 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_app_server::runtime_api::fleet_event_label (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d10cddee90e3ea84630646686406a8349e7e6a287f25dfa7393e4406f113d8"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::daemon_socket::run_authorized_connection (cyclomatic 16): codewhale_app_server::daemon_socket::run_authorized_connection 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/app-server/src/daemon_socket.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"209d70b9401ad59dceaca8e3f4328540fa9c1a37cc35300e1c5b7ce27ccadc43"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::validate_runtime_listener_security (cyclomatic 16): codewhale_app_server::runtime_api::validate_runtime_listener_security has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_app_server::runtime_api::fleet_event_label (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":2840}}}],"partialFingerprints":{"codehealthFindingId/v1":"693ffafb79cf49a6ea7274015e127e58566e2a7e9c8130fecbae2d57541ea125"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::prepare_managed_fleet_run (cyclomatic 16): codewhale_app_server::runtime_api::prepare_managed_fleet_run 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_app_server::runtime_api::fleet_event_label (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":4683}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d554d6c403a4d2560552a626f3234c3a240d0f151568c164e1d12f20afe285"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::switch_provider (cyclomatic 16): codewhale_app_server::runtime_api::switch_provider 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_app_server::runtime_api::fleet_event_label (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":13195}}}],"partialFingerprints":{"codehealthFindingId/v1":"be546e8b633dd54c3ff1305f034104a939b53ff229152c2f79e28a0642228633"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::collect_git_status_detail (cyclomatic 16): codewhale_app_server::runtime_api::git::collect_git_status_detail 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/app-server/src/runtime_api/git.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"2431c8277d736e98ef25fa0ed4bdce08270458136fc5f6d588f1acf9a94faed3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::members::start_thread_member (cyclomatic 16): codewhale_app_server::runtime_api::members::start_thread_member 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/app-server/src/runtime_api/members.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"5090894a63b4c8b223c62af7805e38f974fa76bdb90d5021b34195bdf51b7f84"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::secrets::run_provider_connect (cyclomatic 16): codewhale_app_server::runtime_api::secrets::run_provider_connect 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/app-server/src/runtime_api/secrets.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4adc0b459d2ade4b58073cb61074874b732ff13cd1bb93a329a44833515f82"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_api::thread_history::legacy_journal (cyclomatic 16): codewhale_app_server::runtime_api::thread_history::legacy_journal 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/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb3ceb102ba754f1379f697f07b99cb67285984b46f7a36d2b757a09c2406ca"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::runtime_chat_relay::project_native_event (cyclomatic 16): codewhale_app_server::runtime_chat_relay::project_native_event 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/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bb38b65b68cf995373358b5f0b3fa5a04353186c3fb1767c3b500c0cd92ee6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_app_server::thread_control::list (cyclomatic 16): codewhale_app_server::thread_control::list 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/app-server/src/thread_control.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca491eeda2e42399eb4e4c4ca5fb3500af02a9a563915a4092ac45b039cd8153"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_cli::config_bundles::run_import (cyclomatic 16): codewhale_cli::config_bundles::run_import 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/cli/src/config_bundles.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f17bdd1dff25da8498b5dcd62d3a8711294a2c3ced7393a43011f1941957a9"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_commands::debug::cache::cache_portable (cyclomatic 16): codewhale_commands::debug::cache::cache_portable 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/commands/src/debug/cache.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"876c2ec570752c7cb6a743b8d6c649756b529a848af97a17ca8805bac94a389b"}},{"ruleId":"D1","level":"warning","message":{"text":"Engine::settle_provider_request_receipt (cyclomatic 16): Engine::settle_provider_request_receipt 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/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4779}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fa0a43d8981de3118640c791f6d7aa4cd440bb552c9f38c9433934415bf368"}},{"ruleId":"D1","level":"warning","message":{"text":"LiveRuntimeAuthority::narrows (cyclomatic 16): LiveRuntimeAuthority::narrows has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 2 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different 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/engine/src/core/engine.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a508738f9995a637d661cb898485b5c73c67d899a1c75113f0b374c696dbdbac"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolActivationCache::activate_inner (cyclomatic 16): ToolActivationCache::activate_inner has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/session.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5892ee97e0f372152ab2577c242ee35d666576f6b9237b0d0a628d141c6817a"}},{"ruleId":"D1","level":"warning","message":{"text":"Caller::check (cyclomatic 16): Caller::check has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/execution.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"52900d54d9545b70cd8bfb9dae2e2258a30bea18489083255f7aac084196c3e8"}},{"ruleId":"D1","level":"warning","message":{"text":"McpHttpClient::client_for_target (cyclomatic 16): McpHttpClient::client_for_target has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/http_client.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0de8edc9781aaa981ca8f15cb692a5c4eda230c5ca55ed5bbae9f0b4e8aa1c7"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionManager::list_sessions_with_recovery (cyclomatic 16): SessionManager::list_sessions_with_recovery 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/engine/src/session_manager.rs"},"region":{"startLine":5914}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc154fbf0733eb9cb5dea74d204a47cd300259be4d13047d8093ca11c5f9e07d"}},{"ruleId":"D1","level":"warning","message":{"text":"Run::repair_store (cyclomatic 16): Run::repair_store 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/engine/src/session_reconcile.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"b711757beb0384e818dbd78ee08278e1186ebcdbc0dfd954c070f4de22ff1051"}},{"ruleId":"D1","level":"warning","message":{"text":"OcrOutcome::into_host_text (cyclomatic 16): OcrOutcome::into_host_text has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/image_ocr.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c81e59a64c3da7110e41361b3da655ab7864e5ff7f853cf17fd026d5026d1b5"}},{"ruleId":"D1","level":"warning","message":{"text":"CoordinationLedger::record_decision_in_scope (cyclomatic 16): CoordinationLedger::record_decision_in_scope 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/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94f0da92db82b34630bb18dea524b82ee6c590b298c10e38153d50f183f0c34"}},{"ruleId":"D1","level":"warning","message":{"text":"PersistedSubAgentState::validate_worker_origins (cyclomatic 16): PersistedSubAgentState::validate_worker_origins 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1fefe31403a324cd84e11fa18dd5f0bea0c4f687ff1d293ff5d42f0cdf245d"}},{"ruleId":"D1","level":"warning","message":{"text":"SubAgentManager::finish_terminal_result (cyclomatic 16): SubAgentManager::finish_terminal_result 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":11427}}}],"partialFingerprints":{"codehealthFindingId/v1":"de08a7b70f5379eb9ac85c4202bb2b7027fab7c2971f37aebd50bfb068c5a34c"}},{"ruleId":"D1","level":"warning","message":{"text":"UserInputRequest::validate_transport (cyclomatic 16): UserInputRequest::validate_transport 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/engine/src/tools/user_input.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7bafefee2cb558214e9d4d1746b1ea4e9ef90dc20901342a428ee15b324515"}},{"ruleId":"D1","level":"warning","message":{"text":"SlotLedger::classify (cyclomatic 16): SlotLedger::classify 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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bf8831dc3d0e781878620d3ab39258315a010ca33c5c707f457bfcdb879bf3"}},{"ruleId":"D1","level":"warning","message":{"text":"EvidenceRef::new (cyclomatic 16): EvidenceRef::new 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/engine/src/work_graph/model.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"1207dcebc45df0d8c35a2078966215fe4d892a7175087b84cc710c3680db7276"}},{"ruleId":"D1","level":"warning","message":{"text":"WorkRuntime::restore_internal (cyclomatic 16): WorkRuntime::restore_internal 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/engine/src/work_graph/runtime.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c75f2a7229eca1b45714fca03ff8f9274792c3a1b47ccaf34ae12617a26317"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::client::chat::build_chat_wire_body_with_window (cyclomatic 16): codewhale_engine::client::chat::build_chat_wire_body_with_window 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/engine/src/client/chat.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dcb22d79b49fb2b13c1513da3358c04a42a5f8b69217464f8d26ce77eb11023"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_workspace::serve (cyclomatic 16): codewhale_engine::extension_host::dsh_workspace::serve 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/engine/src/extension_host/dsh_workspace.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d57e98cb2d062cf3de02fb7de594c5d739961655df9f0fbeb21ee27ce9cd771"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::fleet::worker_runtime::freeze_fleet_task_members (cyclomatic 16): codewhale_engine::fleet::worker_runtime::freeze_fleet_task_members 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/engine/src/fleet/worker_runtime.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"836923fd117db44e62ad40b77f2a0851934f38b4db8296834a593322cda3901e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::pricing::verified_catalog_offering (cyclomatic 16): codewhale_engine::pricing::verified_catalog_offering 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. This is NOT this file\u0027s highest cyclomatic complexity: UnpricedReason::from_label (cyclomatic 23) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/pricing.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1c9095a557c6ba8ad81d134e1f7b9c10be1496bbbc95b169c3510111d68b78"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::project_context::load_global_agents_context (cyclomatic 16): codewhale_engine::project_context::load_global_agents_context 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/engine/src/project_context.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea6257578587ac80c21c77b1f07e0fa9aa5af367ea732c2f018732c2d8e32d8"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::prompts::translation_target_language_for_tag (cyclomatic 16): codewhale_engine::prompts::translation_target_language_for_tag 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/engine/src/prompts.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7575e132b3c615618ad0aec7d6a2d94407a0d42a7dd06d23ecdcf4652ed645"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::provider_catalog_live::load_from_disk_unlocked_with_limit (cyclomatic 16): codewhale_engine::provider_catalog_live::load_from_disk_unlocked_with_limit 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/engine/src/provider_catalog_live.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"388fda1ff181c3a79b1295d455a5f3b05e3c85f9e8bac8e0c8a56d3a0dac4140"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::receipts::failure_evidence (cyclomatic 16): codewhale_engine::receipts::failure_evidence 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/engine/src/receipts.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e545c8582e6b668c8727dd18e21db0d9371cd45d18de7ef7be5c3f84c1f0dba"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::repo_law::write_target_paths (cyclomatic 16): codewhale_engine::repo_law::write_target_paths 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/engine/src/repo_law.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"326c461cdac65a73e2ffb858e5b628f895b0ef0eef35cbe80549c0574e254d5d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::session_manager::find_json_key (cyclomatic 16): codewhale_engine::session_manager::find_json_key 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/engine/src/session_manager.rs"},"region":{"startLine":7142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1ab8bb1eaf393d27092c505485b27c18ce7f217e97867085c688c315ee7f24"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::session_secret_scrub::scrub_value (cyclomatic 16): codewhale_engine::session_secret_scrub::scrub_value 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/engine/src/session_secret_scrub.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be0f9bba1d58348d08e9e3acd57c8b9065686b9e03eb2bb640a7cddebca2157"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::telemetry_notice::apply_persistent_preference_at (cyclomatic 16): codewhale_engine::telemetry_notice::apply_persistent_preference_at 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/engine/src/telemetry_notice.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"992861b484a97e9c8e297609c2c621f25f946a9aa34e98ebd058c81b80cd3887"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::apply_patch::build_mutation_metadata (cyclomatic 16): codewhale_engine::tools::apply_patch::build_mutation_metadata 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/engine/src/tools/apply_patch.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02f462c35d4fdbbad7987d2e46ac35b8cbef7cdbabd4fa06a0ca7254b27f424"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::file::nearest_match_hint (cyclomatic 16): codewhale_engine::tools::file::nearest_match_hint 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/engine/src/tools/file.rs"},"region":{"startLine":3552}}}],"partialFingerprints":{"codehealthFindingId/v1":"59484537bf477bee4f897fed14c4f11fe73b034c310a1a686119e3ac228fe2fd"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::finance::fetch_host_endpoint (cyclomatic 16): codewhale_engine::tools::finance::fetch_host_endpoint 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/engine/src/tools/finance.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17f23fd6544aebb88527d0ffc054c1f706ef941365f3f70b11c183bc8a2f4f9"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::git_tool::review_scope (cyclomatic 16): codewhale_engine::tools::git_tool::review_scope 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/engine/src/tools/git_tool.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcb64d51e19ece89a825c3fff4606f21bcc799ff8cb3630d453ac8c87edbb7a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::review_core::apply_claim_limits (cyclomatic 16): codewhale_engine::tools::review_core::apply_claim_limits 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/engine/src/tools/review_core.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"561b9d86c381ca91cb57428ed846dcbdb2ccf75c95ce9fe85bbd91244d67e886"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::search::search_file_streaming (cyclomatic 16): codewhale_engine::tools::search::search_file_streaming 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/engine/src/tools/search.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"da20eee3a16be1de89fda7ec90315291c979b2a4b950034e621fdf276af0db2f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::speech::prepare_speech_options (cyclomatic 16): codewhale_engine::tools::speech::prepare_speech_options 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/engine/src/tools/speech.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82a209772ef72d21bf26eb91e4fa7c5ae18b9a6799dd573eff6e95e4d660281"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::validate_spawn_write_contract (cyclomatic 16): codewhale_engine::tools::subagent::validate_spawn_write_contract 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":18981}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f804a76d8dc9dcaf94ab06bfa1c45dfd352d05dc70b43bdd9719869fed4eee2"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::subagent::budget_handback::fallback_partial_text (cyclomatic 16): codewhale_engine::tools::subagent::budget_handback::fallback_partial_text 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/engine/src/tools/subagent/budget_handback.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"11982baf56aece874065c01920fdd098d0c08e612ab5883e3d8ef97a5ca04cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::truncate::apply_spillover_inner (cyclomatic 16): codewhale_engine::tools::truncate::apply_spillover_inner 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/engine/src/tools/truncate.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5a399da37d72bbedf3a163e43ee41512ca63dd7a20ac26336e75a0b56ead8a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_engine::tools::workflow_plan_approval::analyze_plan_object (cyclomatic 16): codewhale_engine::tools::workflow_plan_approval::analyze_plan_object 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/engine/src/tools/workflow_plan_approval.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bf7b1e9782634d29614d5a8bcc852092fd7da83fabdd02f69caa5badaa742e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_execpolicy::denied_prefix_matches (cyclomatic 16): codewhale_execpolicy::denied_prefix_matches 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/execpolicy/src/lib.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab252175c4852b3ee5f445d78c1d81d5d2c1a430f063898f5dcfe32a7cfd23c"}},{"ruleId":"D1","level":"warning","message":{"text":"Store::recall_impl (cyclomatic 16): Store::recall_impl 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/memory/src/store.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c8d63205ccc92aea38fd3ad6a93a716a29ef642593bfc22cd38cb35c7144c2"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_models::schema_sanitize::mfjs_schema_can_terminate (cyclomatic 16): codewhale_models::schema_sanitize::mfjs_schema_can_terminate 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/models/src/schema_sanitize.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"3022c031570e8edafd977124f12771d22e66aae2fab8b33fe721f9106b06e481"}},{"ruleId":"D1","level":"warning","message":{"text":"EventSoundPolicy::decide_configured (cyclomatic 16): EventSoundPolicy::decide_configured 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/notify/src/sound_policy.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dde17dd20818e5c946a4945c98bae80781c16761c12ce9f05452f8cf299490"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::agent_plugin::parse_kimi_plugin_json (cyclomatic 16): codewhale_plugins::agent_plugin::parse_kimi_plugin_json 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/plugins/src/agent_plugin.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"7578be6730ff2ae98bbd89a836fac2ffabf462a716c2943292fa70d40770f2e0"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::dsh::load_bundle (cyclomatic 16): codewhale_plugins::install::dsh::load_bundle 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/plugins/src/install/dsh.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd87bb7051d3f8ccb32e7013eabc70a71ccf0ce7aede6b121227a98711cae159"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::tarball::scan_bundle_entries (cyclomatic 16): codewhale_plugins::install::tarball::scan_bundle_entries 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/plugins/src/install/tarball.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"57639cc49860074d7495dfb04e7f82a55c37ae6f09401fc37ee32d4e4b37243e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::install::tarball::extract_entries (cyclomatic 16): codewhale_plugins::install::tarball::extract_entries 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/plugins/src/install/tarball.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"14353f90ee6eff2a556169dd210730e7fbc77747d2ef5a772a3caa6a5c652a9d"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_plugins::registry::gc::collect_children (cyclomatic 16): codewhale_plugins::registry::gc::collect_children 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/plugins/src/registry/gc.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59cf783bb6f569d1957c9b3553e16402dc6d8ca4425d64dac2e1c95bf466d12"}},{"ruleId":"D1","level":"warning","message":{"text":"Config::allow_shell_control (cyclomatic 16): Config::allow_shell_control 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_runtime::config::provider_env_base_url_override (cyclomatic 36) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3606}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d6d1e4b0cb849643b9265fb4e3a5bac446307c442169655392a6c6de2507e8"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::safe_label::sanitize_persisted_route_label (cyclomatic 16): codewhale_runtime::safe_label::sanitize_persisted_route_label 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/runtime/src/safe_label.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"234f6373402df0aa7c6aac034139edaea34c7ee4d21fd01f106e8f4bdf2f0277"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_runtime::tool_history_repair::repair_tool_call_pairs_inner (cyclomatic 16): codewhale_runtime::tool_history_repair::repair_tool_call_pairs_inner has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/tool_history_repair.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e427bfba793f4d02a1c0a789783f020cfaba5407369a4fb5eecff8cbcffb2e8"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skill_install::install::install_with_registry (cyclomatic 16): codewhale_skill_install::install::install_with_registry 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/skill-install/src/install.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"99922fb0bbcfa996b19706a95c49936b9897b590d27956eaeca56cfbcaf74af7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_skills::system::bundled_skills_status (cyclomatic 16): codewhale_skills::system::bundled_skills_status 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/skills/src/system.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b59242717f17eb8de2a8f577ebec4261c6bab9edc3389db32fb29c7c1f29cf"}},{"ruleId":"D1","level":"warning","message":{"text":"SetupCmd::execute (cyclomatic 16): SetupCmd::execute has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/setup.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca79a794bf3c82a153be83e1f0faaf70971ec33dd086e7afc752462cbd462fa"}},{"ruleId":"D1","level":"warning","message":{"text":"ExecCell::render_calm (cyclomatic 16): ExecCell::render_calm 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/tui/src/tui/history.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9241113786ddaeb6e482331b2135beb2c839a4f12c2bbf253deff75e2a3751"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationEditor::save (cyclomatic 16): AutomationEditor::save has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"898c8fec849b004e450641798180380401576df1cf179673731d514e0c8c14e7"}},{"ruleId":"D1","level":"warning","message":{"text":"AutomationEditor::mouse (cyclomatic 16): AutomationEditor::mouse 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/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"b557dceac550d035ae1f573c355058d5d6c12f8df524fe282bfe558bf194e2c0"}},{"ruleId":"D1","level":"warning","message":{"text":"ConfigView::new_for_app (cyclomatic 16): ConfigView::new_for_app 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/tui/src/tui/views/mod.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1bf74bcd4a81e5339547948b08ab45c7152986dbec00f58d87c7fe84a8ee0a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::run_setup_status (cyclomatic 16): codewhale_tui::run_setup_status 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/tui/src/lib.rs"},"region":{"startLine":5018}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5a02bbf39696826f4f72980405ba2ec6e97fa6286434f83aa3e9dd62073135"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::run_interactive_prepared (cyclomatic 16): codewhale_tui::run_interactive_prepared 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/tui/src/lib.rs"},"region":{"startLine":14739}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89fa705fb45d07d1c5d816d21c6d11bd3a139ff1864c35fb120f15ae1f936a6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::core::constitution::user_constitution_stack_status (cyclomatic 16): codewhale_tui::commands::groups::core::constitution::user_constitution_stack_status 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. This is NOT this file\u0027s highest cyclomatic complexity: ConstitutionCmd::execute (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/constitution.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"2961b6952ebf46f7fee5484b285201e1650c5f502043b5d31aabf69f404e44e0"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::plugins::marketplace::render_candidates (cyclomatic 16): codewhale_tui::commands::groups::plugins::marketplace::render_candidates 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/tui/src/commands/groups/plugins/marketplace.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"095fecf16527f875920020550810cfbd12240eff1bcf4a0ef3d46bb303b2fdc5"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::plugins::render::render_gc_report (cyclomatic 16): codewhale_tui::commands::groups::plugins::render::render_gc_report 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/tui/src/commands/groups/plugins/render.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8585b66a2c905b4f0b02864b59c93b65f3d28d580543e0a36d2511171ad6e362"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::project::init::gather_git_info (cyclomatic 16): codewhale_tui::commands::groups::project::init::gather_git_info has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/project/init.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7c636b59fb4482696a6a5cf944a1f02a687c50c0dc1ecf22f0835f2d89687f"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::session::export::render_content_block (cyclomatic 16): codewhale_tui::commands::groups::session::export::render_content_block 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/tui/src/commands/groups/session/export.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f7434ddb028774af9c8920fcd0e2cb478e64d1d72d1262530f705889bc5f1c3"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::skills::restore::restore (cyclomatic 16): codewhale_tui::commands::groups::skills::restore::restore 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/tui/src/commands/groups/skills/restore.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ca8be7b79df9c60a0a6d7af6ee0c44945b0f3a93e732b59573f5402b16a62a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::commands::groups::utility::mcp::parse_add_for_platform (cyclomatic 16): codewhale_tui::commands::groups::utility::mcp::parse_add_for_platform 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/tui/src/commands/groups/utility/mcp.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"644e6bb0fa36a885c107507bbea1f1c5ba7b9f1db4968fa117d6c9ed35da2cda"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::integrations::cli::print_status (cyclomatic 16): codewhale_tui::integrations::cli::print_status 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/tui/src/integrations/cli.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cb13793a63cfac2e2e4345b6a1ee5c291cbff987f43b82508eb89090547835"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::focus_texture::apply_focus_texture (cyclomatic 16): codewhale_tui::tui::focus_texture::apply_focus_texture 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/tui/src/tui/focus_texture.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5805168b994e8a1b88fb574bca504259480ccaa501ee4ec7bd1efe9ecfc469b6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::render_array (cyclomatic 16): codewhale_tui::tui::history::latex_render::render_array has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_tui::tui::history::latex_render::append_superscript (cyclomatic 42) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"62552b26136da7937f149bae70e45f8f26ce3eaa50da1947d80d3984cff4b19a"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::history::thinking::render_thinking_with_preview_limit (cyclomatic 16): codewhale_tui::tui::history::thinking::render_thinking_with_preview_limit 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/tui/src/tui/history/thinking.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d596ed003ef8139014cdce67924a408f427843c07e4478c98e041378981a908"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::model_row_meta_chips (cyclomatic 16): codewhale_tui::tui::model_picker::model_row_meta_chips 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/tui/src/tui/model_picker.rs"},"region":{"startLine":3211}}}],"partialFingerprints":{"codehealthFindingId/v1":"4529491f4260b959dddab1378e1fe2498c9a6dd0010d0327faec89418655fb9e"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::slash_menu::partial_inline_skill_mention_at_cursor (cyclomatic 16): codewhale_tui::tui::slash_menu::partial_inline_skill_mention_at_cursor 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/tui/src/tui/slash_menu.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"355a978cc8659be98a39a77b890645f81ec784af32e98ebfbe098cff3e286fa7"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::activity_detail::timeline_tool_summary (cyclomatic 16): codewhale_tui::tui::ui::activity_detail::timeline_tool_summary 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/tui/src/tui/ui/activity_detail.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0117d5da2fcc7268e8cc67435876d97032a25dac38fc30fa2b79e7b3b4b9bbc"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::dispatch::dispatch_user_message_with_recovery (cyclomatic 16): codewhale_tui::tui::ui::dispatch::dispatch_user_message_with_recovery 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/tui/src/tui/ui/dispatch.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"965ebd991a63e05c6fe0a2cf35d44d6cbbcb37760cb673c77ad586829c4f9cc6"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui::tui::ui::frame::build_session_snapshot (cyclomatic 16): codewhale_tui::tui::ui::frame::build_session_snapshot 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/tui/src/tui/ui/frame.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"685f2252d27fc87632f0488ede6f7bed49f95fe9ec4150a6005fe82f016f07de"}},{"ruleId":"D1","level":"warning","message":{"text":"codewhale_tui_kit::markdown_render::push_parsed_line (cyclomatic 16): codewhale_tui_kit::markdown_render::push_parsed_line 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. This is NOT this file\u0027s highest cyclomatic complexity: codewhale_tui_kit::markdown_render::html_character_reference (cyclomatic 19) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/markdown_render.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef4f2dae8766ef0f3b42b5f0eb99d10a3be6172882e8680ee9e6adee371df24"}},{"ruleId":"D1","level":"warning","message":{"text":"ExactFleet::from_toml (cyclomatic 16): ExactFleet::from_toml 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/workflow/src/fleet_exact.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb305124d43e4f8be9773078d3f9bc68411b47c3030436798be40c16012441c9"}},{"ruleId":"D1","level":"warning","message":{"text":"PetNativeCore.pcm (cyclomatic 16): PetNativeCore.pcm has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetNativeCore.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"8646bdde69e19cbe39671797192f6b407f0ee611758a7277c7589f20e85695fa"}},{"ruleId":"D1","level":"warning","message":{"text":"app.startBrowserClient::updateItemNode (cyclomatic 16): app.startBrowserClient::updateItemNode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (app.startBrowserClient::renderUserInput, app.startBrowserClient::loadNewThreadModels) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d003e305c7118e5f3a40cd5b9b83c9ae3db54572e39af9a96f72e555d6f27d"}},{"ruleId":"D1","level":"warning","message":{"text":"app.startBrowserClient::renderUserInput (cyclomatic 16): app.startBrowserClient::renderUserInput has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (app.startBrowserClient::updateItemNode, app.startBrowserClient::loadNewThreadModels) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 3 times rather than 3 independent problems. Splitting this body alone leaves the other 2 exactly as they are. Where these are variations on one operation, the change that clears all 3 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"6310416d586450a59d5bbd35e54e3da7e3b6dbc003743f68dbaa840eea6bbb1f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.startPromptTurn (cyclomatic 16): index.startPromptTurn 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. This is NOT this file\u0027s highest cyclomatic complexity: index.handleCommand (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"9037341d9fb1fd3ba2b43ad2b3313f5b46dd0ea7c41f66dc1b87ae24e4bef59c"}},{"ruleId":"D1","level":"warning","message":{"text":"index.runPrompt (cyclomatic 16): index.runPrompt has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: index.handleCommand (cyclomatic 17) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a62f174205f404ad652915ab922d1d22ce8d2cd84a47fd46dcb78da72811fd"}},{"ruleId":"D1","level":"warning","message":{"text":"index.ensureThread (cyclomatic 16): index.ensureThread 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":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fad76d31144c51db4f7ba37bac05fa7c54ccb56c6c55043be0a9db7835231b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.applyTurnEvent (cyclomatic 16): index.applyTurnEvent has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc196ae6946a9955d19d44620467f33cc224d28454f5f410593f8423028f6b7f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.startChatRecovery (cyclomatic 16): index.startChatRecovery has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 786). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8050c954c99afb3c3038d57df7ecf1898c913394ec4c86f7fa5facaf06e63d"}},{"ruleId":"D1","level":"warning","message":{"text":"verify-release-assets.downloadJson (cyclomatic 16): verify-release-assets.downloadJson has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 227, 207, 196, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/verify-release-assets.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d3a5021d864d8e82316100341f8d55884c0c6b2dab80efa2ebdd7fd2b2770c"}},{"ruleId":"D1","level":"warning","message":{"text":"pet.draw (cyclomatic 16): pet.draw 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":"pet/src/ui/pet.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4caf29c91f8d792fba6750aa5d40b0852d9074103400d009ecc25c86b276413"}},{"ruleId":"D1","level":"warning","message":{"text":"cloud-facts.fetchCurrentRow (cyclomatic 16): cloud-facts.fetchCurrentRow has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators. This is NOT this file\u0027s highest cyclomatic complexity: cloud-facts.isEnvelope (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b43436ebbdeb0ca5b7438537b1f73e26812631bdfcf413bb6c89c63a008d6c2"}},{"ruleId":"D1","level":"warning","message":{"text":"learning.getGuidance (cyclomatic 16): learning.getGuidance 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":"web/lib/ratatui/learning.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad75906a91a5f200ed48a7d63111265a00f8c1b18d060852667c68ee78418425"}},{"ruleId":"D1","level":"warning","message":{"text":"render-terminal-capture.frameSvg (cyclomatic 16): render-terminal-capture.frameSvg has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 229, 241). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-terminal-capture.mjs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"562d7f78f055982cee5603cc4f61603ea1f301f59e8c34888c61fe3aba2a45bf"}},{"ruleId":"D1","level":"warning","message":{"text":"incoming (cyclomatic 16): incoming has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"daba19aa0371e508e509abc4981b8c18b0394e6963339f3d8886117c8e2ca1de"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::event_loop::run_event_loop (cognitive 1771): codewhale_tui::tui::ui::event_loop::run_event_loop has cognitive complexity 1771 (threshold 15). Drivers by points: if/else 404 (1356 pts), match/switch 43 (187 pts), boolean chains 186, loops 12 (42 pts) (nesting depth added 1126). 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/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3bfc3aa2d424b513a57640339378efd8a33a7a29245f7e54652bd86778cb91"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::monitor_turn (cognitive 473): RuntimeThreadManager::monitor_turn has cognitive complexity 473 (threshold 15). Drivers by points: if/else 128 (359 pts), match/switch 16 (56 pts), loops 12 (32 pts), boolean chains 26 (nesting depth added 291). 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16827}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ad57f70383a877346bb4e67e30e27d3b85e7171644590f88e3ccb8299849bb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::handlers::handle_view_events (cognitive 419): codewhale_tui::tui::ui::handlers::handle_view_events has cognitive complexity 419 (threshold 15). Drivers by points: if/else 97 (293 pts), match/switch 31 (101 pts), boolean chains 21, loops 2 (4 pts) (nesting depth added 268). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e496fc21459f8f4ed649148cb6bb8d64e7a781c480f1729fe2fe13add17fd76"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_command_result_inner (cognitive 366): codewhale_tui::tui::ui::apply::apply_command_result_inner has cognitive complexity 366 (threshold 15). Drivers by points: if/else 87 (247 pts), match/switch 36 (110 pts), boolean chains 9 (nesting depth added 234). 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/tui/src/tui/ui/apply.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3a4fefc204bbac0459acc998fa959aafe0f3123991dcdad34d866869d26d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::exec_agent::run_exec_agent (cognitive 277): codewhale_app_server::exec_agent::run_exec_agent has cognitive complexity 277 (threshold 15). Drivers by points: if/else 93 (195 pts), match/switch 12 (40 pts), boolean chains 35, loops 2 (7 pts) (nesting depth added 135). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e8852d62720192024f2d1e5e045978ba80a8bf50a49ec463aef32eef1b22bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::run_owned (cognitive 254): Engine::run_owned has cognitive complexity 254 (threshold 15). Drivers by points: if/else 57 (183 pts), match/switch 15 (60 pts), boolean chains 9, loops 2 (nesting depth added 171). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":3888}}}],"partialFingerprints":{"codehealthFindingId/v1":"8862843c3370b3eea31c7d5c468babafe859132141742ad76f8a186f7725f862"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::config_main_host::set_config_value (cognitive 237): codewhale_tui::commands::config_main_host::set_config_value has cognitive complexity 237 (threshold 15). Drivers by points: if/else 87 (159 pts), match/switch 33 (68 pts), boolean chains 10 (nesting depth added 107). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_main_host.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0756335d43d1378a0b1ab77cfa20c30509319b9d8b0ce81502ac1315c5c295"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::owner::run_world (cognitive 236): codewhale_tui::tui::pet_watch::owner::run_world has cognitive complexity 236 (threshold 15). Drivers by points: if/else 60 (177 pts), loops 6 (29 pts), boolean chains 19, match/switch 4 (11 pts) (nesting depth added 147). 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/tui/src/tui/pet_watch/owner.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"63560db1065c32a843ebad5c182739be05739f148ac6cbf86692c650d0f47a73"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::render_latex_to_string (cognitive 232): codewhale_tui::tui::history::latex_render::render_latex_to_string has cognitive complexity 232 (threshold 15). Drivers by points: if/else 72 (208 pts), match/switch 5 (19 pts), boolean chains 4, loops 1 (nesting depth added 150). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37e8f94103df5cf35455d5e905fc5a4fc941961b5b4f43cbc6030fea8b8bdfb"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::execute_planned_tools (cognitive 225): Engine::execute_planned_tools has cognitive complexity 225 (threshold 15). Drivers by points: if/else 57 (162 pts), match/switch 9 (29 pts), loops 7 (20 pts), boolean chains 14 (nesting depth added 138). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":2747}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48471b52804e75a2739534c401154cfd4274afc9c344ade170ba9de860b6338"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::plan_tool_calls (cognitive 221): Engine::plan_tool_calls has cognitive complexity 221 (threshold 15). Drivers by points: if/else 64 (141 pts), match/switch 12 (38 pts), boolean chains 35, loops 5 (7 pts) (nesting depth added 105). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"78037f807539ac9f7cc352da22476873c1a625e75974b0bc2eafc1a8eb4d6671"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::config::apply_env_overrides_unlocked (cognitive 217): codewhale_runtime::config::apply_env_overrides_unlocked has cognitive complexity 217 (threshold 15). Drivers by points: if/else 116 (144 pts), boolean chains 73 (nesting depth added 28). 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/runtime/src/config.rs"},"region":{"startLine":8267}}}],"partialFingerprints":{"codehealthFindingId/v1":"db188500268bbb19d270b9e8ccd0857d20adea4a7ac7adabf493f2031f7bc816"}},{"ruleId":"D2","level":"warning","message":{"text":"evidence.analyzeEvidence (cognitive 217): evidence.analyzeEvidence has cognitive complexity 217 (threshold 15). Drivers by points: if/else 48 (131 pts), boolean chains 39, loops 15 (26 pts), ternaries 5 (21 pts) (nesting depth added 110). Of this number, 201 points are the body\u0027s own statements and 16 belong to 9 function items inside it that branch. 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":"pet/src/core/evidence.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7857376006a71b71a041c592f5a444bc8cff0ab441b4cf86db4f883e1a59f67e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::run_doctor (cognitive 199): codewhale_tui::run_doctor has cognitive complexity 199 (threshold 15). Drivers by points: if/else 99 (127 pts), match/switch 25 (37 pts), loops 12 (21 pts), boolean chains 14 (nesting depth added 49). 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/tui/src/lib.rs"},"region":{"startLine":5300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25678b5c23f458743e4ae0d68fb9c3294f592810b46ab8221ee6971a279afd0"}},{"ruleId":"D2","level":"warning","message":{"text":"Expander::expand (cognitive 193): Expander::expand has cognitive complexity 193 (threshold 15). Drivers by points: if/else 32 (100 pts), loops 15 (51 pts), boolean chains 33, match/switch 3 (9 pts) (nesting depth added 110). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/shell_expand.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"2001a00ca8fceb93c8de1d10a47a45004527e22fd1c778415d6abb9a1d02b49b"}},{"ruleId":"D2","level":"warning","message":{"text":"BashTool::execute (cognitive 188): BashTool::execute has cognitive complexity 188 (threshold 15). Drivers by points: if/else 95 (138 pts), boolean chains 31, match/switch 10 (15 pts), loops 2 (4 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":6110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc7cc7dc3ea2c5509d7b36416ae24071d49a56f8968f84e8da2748c972bf423"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::chat::build_chat_messages_with_reasoning (cognitive 186): codewhale_engine::client::chat::build_chat_messages_with_reasoning has cognitive complexity 186 (threshold 15). Drivers by points: if/else 48 (144 pts), loops 7 (20 pts), boolean chains 19, match/switch 1 (3 pts) (nesting depth added 111). 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/engine/src/client/chat.rs"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4d83ab074c4865754e373b1f0fa40160a6cb1f5ec4860e8e0373e57449c2ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::run_model_step (cognitive 184): Engine::run_model_step has cognitive complexity 184 (threshold 15). Drivers by points: if/else 78 (126 pts), boolean chains 31, match/switch 12 (22 pts), loops 4 (5 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/model_step.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c5b2df039881015feb20891da9be86cd8181cea2bcc7804dec9e1b22b2479c"}},{"ruleId":"D2","level":"warning","message":{"text":"route.POST (cognitive 168): route.POST has cognitive complexity 168 (threshold 15). Drivers by points: if/else 49 (94 pts), error handling 14 (34 pts), boolean chains 23, ternaries 7 (15 pts), loops 1 (2 pts) (nesting depth added 74). Of this number, 131 points are the body\u0027s own statements and 37 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/post/route.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c04a7aa90b5d6fe208ee70e6740b0ab347da251ffaf6055d3d2557330c37313"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::remote_control::relay_worker (cognitive 156): codewhale_app_server::remote_control::relay_worker has cognitive complexity 156 (threshold 15). Drivers by points: if/else 29 (122 pts), match/switch 8 (22 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 114). 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/app-server/src/remote_control.rs"},"region":{"startLine":3451}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb55b6f57e103bce7da8908ad936be746f0829d31a0f2475c4a5e14cd13f88f3"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhaleClient::handle_responses_stream (cognitive 155): CodewhaleClient::handle_responses_stream has cognitive complexity 155 (threshold 15). Drivers by points: if/else 34 (122 pts), match/switch 6 (18 pts), boolean chains 12, loops 2 (3 pts) (nesting depth added 101). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/responses.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"71523afd2613160cad011bc8692168892767b7de28c25b33ec2ea0c929d19a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::start_turn_with_narrowing (cognitive 147): RuntimeThreadManager::start_turn_with_narrowing has cognitive complexity 147 (threshold 15). Drivers by points: if/else 85 (116 pts), boolean chains 18, match/switch 6 (8 pts), loops 3 (5 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13895}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe205170c1daac669993453d3fef0d8bbe6842ae6cda469ad10555cd55a6ad93"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::live::run (cognitive 143): codewhale_tui::tui::pet_watch::live::run has cognitive complexity 143 (threshold 15). Drivers by points: if/else 45 (111 pts), match/switch 6 (18 pts), boolean chains 9, loops 3 (5 pts) (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/live.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34c1636860294d2fca59c1e68a54705cfe75b181dcd707389c17e2b96730482"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposerWidget::render (cognitive 142): ComposerWidget::render has cognitive complexity 142 (threshold 15). Drivers by points: if/else 68 (118 pts), loops 7 (15 pts), boolean chains 9 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99373a0918220cf83b9e7af76817450463e395a5b0dcb3c6ad66da8c698c4b4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::run_async_main_dispatch (cognitive 137): codewhale_tui::run_async_main_dispatch has cognitive complexity 137 (threshold 15). Drivers by points: if/else 43 (105 pts), match/switch 6 (16 pts), boolean chains 12, loops 1 (4 pts) (nesting depth added 75). 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/tui/src/lib.rs"},"region":{"startLine":2715}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae18b1c6d22805a81b5017072d1f3ac5ba6188a15de73b2838f58e045ca061c8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::underwater::launch_empty_state (cognitive 132): codewhale_tui::tui::underwater::launch_empty_state has cognitive complexity 132 (threshold 15). Drivers by points: if/else 60 (99 pts), loops 11 (22 pts), boolean chains 11 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/underwater.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da0fc2efa99e2ad089c3edf596e50ca81592e1828737cf122b643ee6a72eb0d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skill_install::frontmatter::parse_frontmatter (cognitive 131): codewhale_skill_install::frontmatter::parse_frontmatter has cognitive complexity 131 (threshold 15). Drivers by points: if/else 30 (87 pts), loops 8 (32 pts), boolean chains 8, match/switch 1 (4 pts) (nesting depth added 84). 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/skill-install/src/frontmatter.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e9c2fb601f5c9e55706bfd1dd053e56eea81b1343260e4ff60b2fd8dc90f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::mouse_ui::handle_mouse_event (cognitive 129): codewhale_tui::tui::mouse_ui::handle_mouse_event has cognitive complexity 129 (threshold 15). Drivers by points: if/else 48 (102 pts), boolean chains 13, match/switch 5 (12 pts), loops 1 (2 pts) (nesting depth added 62). 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/tui/src/tui/mouse_ui.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bb3995e772460b2b0fba26adfc6944fa86bef6f2a2b6a6cf01e37e46bda8d1"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhaleRuntimeTrace.append (cognitive 128): CodewhaleRuntimeTrace.append has cognitive complexity 128 (threshold 15). Drivers by points: if/else 25 (59 pts), ternaries 17 (52 pts), boolean chains 12, loops 2 (5 pts) (nesting depth added 72). Of this number, 126 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b984d774af227d7192aa02ffc4c1bf48cbf77c08647e6d953719fdce8419563"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderPickerView::handle_key (cognitive 126): ProviderPickerView::handle_key has cognitive complexity 126 (threshold 15). Drivers by points: if/else 28 (63 pts), match/switch 20 (43 pts), boolean chains 20 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":4856}}}],"partialFingerprints":{"codehealthFindingId/v1":"084f6e5863e91cce6f330611a5129a1e7d7111ce1cef99af3396fa2dce6ef54a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::computer::run (cognitive 122): codewhale_account_cli::computer::run has cognitive complexity 122 (threshold 15). Drivers by points: if/else 66 (85 pts), boolean chains 24, loops 3 (8 pts), match/switch 3 (5 pts) (nesting depth added 26). 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/account-cli/src/computer.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1552f215fa8cec17ce13e93c6a548f569f7f2d3cdd2cbd63ed68496f947d1055"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::process_stream (cognitive 122): Engine::process_stream has cognitive complexity 122 (threshold 15). Drivers by points: if/else 32 (89 pts), match/switch 9 (23 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 72). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4903}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42ce0b0bc998529a8579a89ee0481a8d54197a8221ead7e1104cebb4982765b"}},{"ruleId":"D2","level":"warning","message":{"text":"facts-publish.validateSource (cognitive 122): facts-publish.validateSource has cognitive complexity 122 (threshold 15). Drivers by points: if/else 42 (85 pts), boolean chains 23, loops 5 (10 pts), error handling 1 (4 pts) (nesting depth added 51). Of this number, 52 points are the body\u0027s own statements and 70 belong to 2 function literals inside it that branch. 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":"web/scripts/facts-publish.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fbc0b31f3411e672dae01cdfb842c1ece92e41562a70ab505233b9900eab4b"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::seed_thread_from_messages_with_history_operation (cognitive 116): RuntimeThreadManager::seed_thread_from_messages_with_history_operation has cognitive complexity 116 (threshold 15). Drivers by points: if/else 34 (86 pts), loops 9 (15 pts), match/switch 4 (13 pts), boolean chains 2 (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11649}}}],"partialFingerprints":{"codehealthFindingId/v1":"f623e8c49cebd7164b17bd0ed7fe49950aa8edc15ebcb292b01da14a67dac623"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::handle_admitted_operation (cognitive 114): Engine::handle_admitted_operation has cognitive complexity 114 (threshold 15). Drivers by points: if/else 64 (80 pts), boolean chains 18, match/switch 8 (13 pts), loops 3 (nesting depth added 21). 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/engine/src/core/engine.rs"},"region":{"startLine":6815}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b4267d42f87464126aa697097406782b4ef5d7fb0c17a9f0c1572da92c90e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::run_inline_repl_phase (cognitive 113): Engine::run_inline_repl_phase has cognitive complexity 113 (threshold 15). Drivers by points: if/else 33 (83 pts), match/switch 6 (17 pts), boolean chains 7, loops 2 (6 pts) (nesting depth added 65). 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/engine/src/core/engine/turn_loop/inline_repl.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a59797be7e2ab4d67c458dd178532fab6d5bb2591ae4612ba2050dd890b064"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::build_turn_tool_registry_and_catalog (cognitive 112): Engine::build_turn_tool_registry_and_catalog has cognitive complexity 112 (threshold 15). Drivers by points: if/else 52 (83 pts), match/switch 4 (11 pts), boolean chains 9, loops 4 (9 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":6212}}}],"partialFingerprints":{"codehealthFindingId/v1":"429b30002a3b78f8024f7094b67ca6e8e8797528cf0db0b3b219bb22a8b38121"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow::redaction::redact_for_disclosure (cognitive 111): codewhale_workflow::redaction::redact_for_disclosure has cognitive complexity 111 (threshold 15). Drivers by points: if/else 31 (88 pts), boolean chains 12, loops 4 (11 pts) (nesting depth added 64). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/redaction.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fd5279f15f024ddcc2d48efed94c9b938a8b6f37e3941b93028be17a7443ee"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::engine::drive_child_actor (cognitive 109): codewhale_engine::tools::subagent::engine::drive_child_actor has cognitive complexity 109 (threshold 15). Drivers by points: if/else 29 (65 pts), match/switch 9 (29 pts), boolean chains 9, loops 6 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df55b44e9c98c56bc5c8d249dab076e058e9b4a0ab074182afb02314fe2793b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::command_heads (cognitive 108): codewhale_execpolicy::shell_expand::command_heads has cognitive complexity 108 (threshold 15). Drivers by points: if/else 23 (76 pts), match/switch 4 (18 pts), boolean chains 8, loops 2 (6 pts) (nesting depth added 71). 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/execpolicy/src/shell_expand.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18edc4d45d6647bbb227391f900c60119f65dc7554339d268419f0352dd0ee6"}},{"ruleId":"D2","level":"warning","message":{"text":"App::new_with_plugin_registry (cognitive 108): App::new_with_plugin_registry has cognitive complexity 108 (threshold 15). Drivers by points: if/else 54 (68 pts), boolean chains 25, match/switch 6 (13 pts), loops 2 (nesting depth added 21). 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/tui/src/tui/app/init.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44072975f5ddf248564aa691a205e50e58ff83cdac3ca5b15208b8f4d856dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::tool_routing::handle_tool_call_complete (cognitive 105): codewhale_tui::tui::tool_routing::handle_tool_call_complete has cognitive complexity 105 (threshold 15). Drivers by points: if/else 33 (72 pts), match/switch 10 (24 pts), boolean chains 9 (nesting depth added 53). 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/tui/src/tui/tool_routing.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"8015b42b3bab6b2d376ec313039a0fb6dbac68079f0c34b5bb075edbce903497"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_sanitize::redact::redact_line (cognitive 104): codewhale_sanitize::redact::redact_line has cognitive complexity 104 (threshold 15). Drivers by points: if/else 36 (87 pts), boolean chains 10, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 54). 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/sanitize/src/redact.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe6b30a6035dab8b6c5cc9beacd16e77d672cf3bbc5f51c15c2773c29495cf3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::run_mcp_command (cognitive 103): codewhale_tui::run_mcp_command has cognitive complexity 103 (threshold 15). Drivers by points: if/else 32 (70 pts), loops 7 (21 pts), boolean chains 6, match/switch 3 (6 pts) (nesting depth added 55). 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/tui/src/lib.rs"},"region":{"startLine":13157}}}],"partialFingerprints":{"codehealthFindingId/v1":"279891f7e02a1510a99a828354d68ea27294e579185ae8dd1fa94f581c12299e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::frame::render (cognitive 102): codewhale_tui::tui::ui::frame::render has cognitive complexity 102 (threshold 15). Drivers by points: if/else 67 (79 pts), boolean chains 23 (nesting depth added 12). 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/tui/src/tui/ui/frame.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"6481e8abd67c89591930a446766ffac13c4dd7f8a38a64ca1e8ba9b9b289e605"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginManifest::validate_mcp_servers (cognitive 98): PluginManifest::validate_mcp_servers has cognitive complexity 98 (threshold 15). Drivers by points: if/else 30 (68 pts), boolean chains 14, loops 6 (14 pts), match/switch 1 (2 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"caca027a8d1973fd24b85e0429a6eb021fd3a5f1e662387bec8496f14f52cffc"}},{"ruleId":"D2","level":"warning","message":{"text":"pet-telemetry.compilePetTelemetry (cognitive 97): pet-telemetry.compilePetTelemetry has cognitive complexity 97 (threshold 15). Drivers by points: if/else 18 (37 pts), ternaries 10 (25 pts), boolean chains 18, loops 10 (17 pts) (nesting depth added 41). Of this number, 92 points are the body\u0027s own statements and 5 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-telemetry.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27d49d204ae90cc70cffce308f446b8d9ee10fb03a5283211fe5dc9bba215cc"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::update_thread_under_history_guard (cognitive 95): RuntimeThreadManager::update_thread_under_history_guard has cognitive complexity 95 (threshold 15). Drivers by points: if/else 50 (64 pts), boolean chains 25, match/switch 4 (5 pts), loops 1 (nesting depth added 15). 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":9120}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e2851120804dede74b70e52a12a2f06b40394b5ff0a60228bc05a96a7fefb1"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentManager::prepare_background_with_assignment_options (cognitive 95): SubAgentManager::prepare_background_with_assignment_options has cognitive complexity 95 (threshold 15). Drivers by points: if/else 51 (75 pts), boolean chains 11, match/switch 6, loops 2 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":9652}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dada28748745453ea3ddace041aacfc245f4991f2ef42021ae5c75a7a09a8e5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::mcp_http::fetch (cognitive 95): codewhale_engine::extension_host::mcp_http::fetch has cognitive complexity 95 (threshold 15). Drivers by points: if/else 40 (58 pts), boolean chains 25, match/switch 6 (9 pts), loops 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp_http.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"e789096f9b65b77f93306e4fa013849e4b5425065ffa6d6f9ed60f525b07b85c"}},{"ruleId":"D2","level":"warning","message":{"text":"explorer.RatatuiExplorer (cognitive 93): explorer.RatatuiExplorer has cognitive complexity 93 (threshold 15). Drivers by points: ternaries 20 (56 pts), boolean chains 21, if/else 13 (16 pts) (nesting depth added 39). Of this number, 64 points are the body\u0027s own statements and 29 belong to 17 function items inside it that branch. 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":"web/components/ratatui/explorer.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f8dc8deca5d6bcb1f2b08bc44b662ee3c2254d28b6422858a15b075ae2d207"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::responses::convert_messages_to_responses_input (cognitive 92): codewhale_engine::client::responses::convert_messages_to_responses_input has cognitive complexity 92 (threshold 15). Drivers by points: if/else 16 (58 pts), match/switch 6 (21 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/responses.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"022676b3861d6d9b480153d5a81fe4be7e2011bf6ee22c7a9a78e46ca096c938"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::project_context::project_instruction_sources_with_settings (cognitive 92): codewhale_engine::project_context::project_instruction_sources_with_settings has cognitive complexity 92 (threshold 15). Drivers by points: if/else 30 (58 pts), loops 12 (20 pts), boolean chains 7, match/switch 2 (7 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d0469117a67b8b786fe87bb741f3a6b1a6d4739d722f23b6ac5ca41e80e3ac"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::widgets::slash_completion_hints_for_plugins (cognitive 92): codewhale_tui::tui::widgets::slash_completion_hints_for_plugins has cognitive complexity 92 (threshold 15). Drivers by points: if/else 29 (58 pts), loops 12 (24 pts), boolean chains 10 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b841ff0c197e414995cd6997a1d6f284f77490dc05e92989e6a343a4d663f61"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::route_engine_events (cognitive 91): RuntimeThreadManager::route_engine_events has cognitive complexity 91 (threshold 15). Drivers by points: if/else 17 (55 pts), match/switch 8 (27 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":15694}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1eb3842bddd714a8b51e6a92c24d542466952cb69dcd9322d1e0301907eead5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale.fromCodewhaleSession (cognitive 90): codewhale.fromCodewhaleSession has cognitive complexity 90 (threshold 15). Drivers by points: ternaries 15 (44 pts), if/else 20 (35 pts), boolean chains 6, loops 4 (5 pts) (nesting depth added 45). Of this number, 85 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ba3dab338438ce2cd032b63693fb62dd2572737b11b3285e3894835c993d59"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::chat::parse_sse_chunk_with_reasoning_style (cognitive 88): codewhale_engine::client::chat::parse_sse_chunk_with_reasoning_style has cognitive complexity 88 (threshold 15). Drivers by points: if/else 19 (54 pts), loops 5 (16 pts), match/switch 5 (16 pts), boolean chains 2 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":4185}}}],"partialFingerprints":{"codehealthFindingId/v1":"91212966a53b43046407e5b5bac96e43f65ed675950dfad568c95d99a7ff151c"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigView::render_settings_shell (cognitive 88): ConfigView::render_settings_shell has cognitive complexity 88 (threshold 15). Drivers by points: if/else 50 (72 pts), boolean chains 6, match/switch 3 (6 pts), loops 3 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"87824bf36ede717530ad4e76c26f3cf5ecdfe369a1e94974c43de443e575b239"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhaleClient::handle_chat_completion_stream (cognitive 87): CodewhaleClient::handle_chat_completion_stream has cognitive complexity 87 (threshold 15). Drivers by points: if/else 17 (44 pts), match/switch 7 (18 pts), loops 5 (16 pts), boolean chains 9 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fb1aa24d94977238522975f956aa3800dc9b823ae456efeca763429b0315f7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::compilePetTelemetry (cognitive 87): (anonymous)::compilePetTelemetry has cognitive complexity 87 (threshold 15). Drivers by points: if/else 18 (37 pts), ternaries 9 (18 pts), loops 10 (17 pts), boolean chains 14, other 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"0468abb02b4c842d26e06494de754f802f2737154c68d8a95dd1de581c5caafd"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::compilePetTelemetry (cognitive 87): (anonymous)::compilePetTelemetry has cognitive complexity 87 (threshold 15). Drivers by points: if/else 18 (37 pts), ternaries 9 (18 pts), loops 10 (17 pts), boolean chains 14, other 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c1be6bd4955ca73b477964b06038546d21f748814aad15dba55aa9f51231c5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::run_agents (cognitive 86): codewhale_account_cli::run_agents has cognitive complexity 86 (threshold 15). Drivers by points: if/else 36 (69 pts), boolean chains 9, loops 2 (4 pts), match/switch 2 (4 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cc3b19b30cc275a04710264da8abf070c77893e5e9cea539b60336b58e19fb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ambient_life::build_frame_marks (cognitive 86): codewhale_tui::tui::ambient_life::build_frame_marks has cognitive complexity 86 (threshold 15). Drivers by points: if/else 40 (71 pts), loops 6 (10 pts), boolean chains 5 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ambient_life.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"252fe0422276ab6cf17b9b1a09757574ca02f5cbe2520e481ac65ff8deb88605"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::config_main_host::show_single_setting (cognitive 85): codewhale_tui::commands::config_main_host::show_single_setting has cognitive complexity 85 (threshold 15). Drivers by points: if/else 47 (71 pts), match/switch 9 (13 pts), boolean chains 1 (nesting depth added 28). Of this number, 82 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_main_host.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"844ae352fe1c6b2e92094d53dd1c72ca0117a16e6283046522a93cc2511711b8"}},{"ruleId":"D2","level":"warning","message":{"text":"streamTurnEvents (cognitive 85): streamTurnEvents has cognitive complexity 85 (threshold 15). Drivers by points: if/else 26 (52 pts), boolean chains 25, ternaries 2 (5 pts), error handling 2, loops 1 (nesting depth added 29). Of this number, 79 points are the body\u0027s own statements and 6 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bcc3b71368d21e12812575900689781672099cdc464293eb5f8361a297ea53"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::thread_history::mutate_in_owner (cognitive 82): codewhale_app_server::runtime_api::thread_history::mutate_in_owner has cognitive complexity 82 (threshold 15). Drivers by points: if/else 35 (57 pts), match/switch 10 (19 pts), boolean chains 6 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1134eb694013d4960e4fe255670b05b1c1f0abbdcb2e4b660c2bbd266342eef"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::render (cognitive 82): Renderer::render has cognitive complexity 82 (threshold 15). Drivers by points: if/else 28 (46 pts), loops 12 (31 pts), boolean chains 5 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/graphics.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b503e4d8450b6164001a9f2bfe535db34145db943f6aca749fc4fcd77595526f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::remote_control_bridge::drain_remote_control_events (cognitive 82): codewhale_tui::tui::ui::remote_control_bridge::drain_remote_control_events has cognitive complexity 82 (threshold 15). Drivers by points: if/else 15 (48 pts), match/switch 8 (29 pts), boolean chains 4, loops 1 (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/remote_control_bridge.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4b834430f7fe7af9c06571621aefbd85db754210dcdfe0c62867f627251cf8"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::continue_model_step (cognitive 81): Engine::continue_model_step has cognitive complexity 81 (threshold 15). Drivers by points: if/else 31 (60 pts), boolean chains 13, match/switch 2 (5 pts), loops 1 (3 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/continuation.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c26997ad32be5b9b323b605e3e77747d31224f5bd09666a517b1cfd716732c9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::observe (cognitive 81): (anonymous)::observe has cognitive complexity 81 (threshold 15). Drivers by points: if/else 19 (36 pts), boolean chains 24, ternaries 8 (18 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fdcba5caa9a2d844f3cd89febbc314e7ac05cb2157d7c74b62a4c72c4f165c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::observe (cognitive 81): (anonymous)::observe has cognitive complexity 81 (threshold 15). Drivers by points: if/else 19 (36 pts), boolean chains 24, ternaries 8 (18 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d868428b9eba2dbea2ef94eb07fc45180aa687fc3afc7352c540459f9caeeb"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::execute_tool_admitted (cognitive 80): Engine::execute_tool_admitted has cognitive complexity 80 (threshold 15). Drivers by points: if/else 41 (56 pts), match/switch 9 (14 pts), boolean chains 10 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_execution.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef13fd1dd645a23491ead6cf4659b5041345586eec5bb4a5b60a0435361aa01"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::run_review (cognitive 80): codewhale_tui::run_review has cognitive complexity 80 (threshold 15). Drivers by points: if/else 39 (61 pts), match/switch 9 (13 pts), boolean chains 3, loops 2 (3 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/tui/src/lib.rs"},"region":{"startLine":11313}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40fe57f3577dd17d4d785071d7b830795ff6375e8c8159d5758e59a9faffecd"}},{"ruleId":"D2","level":"warning","message":{"text":"report-funnel.buildFunnelReport (cognitive 80): report-funnel.buildFunnelReport has cognitive complexity 80 (threshold 15). Drivers by points: if/else 25 (51 pts), boolean chains 15, ternaries 6 (10 pts), loops 3 (4 pts) (nesting depth added 31). Of this number, 76 points are the body\u0027s own statements and 4 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/scripts/report-funnel.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1431c654cf2123771776bda36b80a02706cf9316b97935bc602bbf33775068"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhaleClient::prepare_outbound_request_body (cognitive 79): CodewhaleClient::prepare_outbound_request_body has cognitive complexity 79 (threshold 15). Drivers by points: if/else 31 (65 pts), loops 2 (8 pts), boolean chains 5, match/switch 1 (nesting depth added 40). 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/engine/src/client.rs"},"region":{"startLine":3261}}}],"partialFingerprints":{"codehealthFindingId/v1":"26703b3de79aea2c81abbb39ebe6707f4c649dc10237c3bb3a7b5f072970ff9b"}},{"ruleId":"D2","level":"warning","message":{"text":"install.httpRequest (cognitive 79): install.httpRequest has cognitive complexity 79 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 23, error handling 10 (20 pts), ternaries 7 (8 pts) (nesting depth added 19). Most of this is not in the body itself: 6 of the 79 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 547, 592, 668, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64c1de2bc4a11f2a1dc4ff90b9a253ad6e77d2765f37a1c55f8a04eefed11b2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::history_cells_from_message_with_results (cognitive 78): codewhale_tui::tui::history::history_cells_from_message_with_results has cognitive complexity 78 (threshold 15). Drivers by points: if/else 27 (68 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"181d4dcb96b35521ea834b6c030ba1d5fc009f93d77286201240bb9713beaa5d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::provider_readiness::credential_state_for_provider (cognitive 77): codewhale_engine::provider_readiness::credential_state_for_provider has cognitive complexity 77 (threshold 15). Drivers by points: if/else 44 (59 pts), boolean chains 16, 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/engine/src/provider_readiness.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"755d7b4be32e28a3648254491231a2189b9dcf44937840a0779a3ec63c11de63"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui_kit::diff_render::render_diff_into (cognitive 77): codewhale_tui_kit::diff_render::render_diff_into has cognitive complexity 77 (threshold 15). Drivers by points: if/else 27 (64 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6318e4f46b1bcc78b3aaa88c3af8726cbed96cf1a385982222b1955d87e919a"}},{"ruleId":"D2","level":"warning","message":{"text":"scene.createOcean (cognitive 77): scene.createOcean has cognitive complexity 77 (threshold 15). Drivers by points: if/else 32 (36 pts), boolean chains 18, ternaries 9 (14 pts), loops 7 (8 pts), error handling 1 (nesting depth added 10). Most of this is not in the body itself: 2 of the 77 points are its own statements and the rest belongs to 27 function items inside it that branch (drawFish, buildColors, detectScheme, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/scene.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb0e39264b3b4ca81cc7a1d9bf8e7c12a38f07751a8d87c4b86e7b729da720e"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetManager::drive_executor_tick (cognitive 76): FleetManager::drive_executor_tick has cognitive complexity 76 (threshold 15). Drivers by points: if/else 19 (49 pts), match/switch 5 (12 pts), loops 4 (8 pts), boolean chains 7 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"175fc5f67e201a502b09f0dfd58c29101f010b9970d1c8d2cef0243b4759c386"}},{"ruleId":"D2","level":"warning","message":{"text":"PetHost.restart (cognitive 75): PetHost.restart has cognitive complexity 75 (threshold 15). Drivers by points: if/else 14 (37 pts), ternaries 5 (12 pts), boolean chains 11, error handling 4 (10 pts), loops 1 (5 pts) (nesting depth added 40). 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":"pet/swift/PetHost.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ed4f40814b00a9bf3d915a2bbfc3a69ad1a06b797fed5004c78ec44d89cc2e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::review_core::run_review_core (cognitive 74): codewhale_engine::tools::review_core::run_review_core has cognitive complexity 74 (threshold 15). Drivers by points: if/else 22 (49 pts), match/switch 5 (12 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"11eb5c6eb441a24323e6fcff2355e3379de85570a11c1dbc849b368f3167a38f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::work_graph::validate::check_structural (cognitive 74): codewhale_engine::work_graph::validate::check_structural has cognitive complexity 74 (threshold 15). Drivers by points: if/else 22 (46 pts), match/switch 5 (12 pts), boolean chains 9, loops 6 (7 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/validate.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"9727129eab8efa9a0fa49795a6afda92e7f4daf72d813af3bb07338161463771"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderPickerView::render_list (cognitive 74): ProviderPickerView::render_list has cognitive complexity 74 (threshold 15). Drivers by points: if/else 46 (62 pts), boolean chains 8, match/switch 2 (3 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/tui/src/tui/provider_picker.rs"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"396f409390cb3ca0ead7beefd57aad93dccfb9fbdf092ad71a532adc1973d1df"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericToolCell::lines_with_mode_and_locale (cognitive 73): GenericToolCell::lines_with_mode_and_locale has cognitive complexity 73 (threshold 15). Drivers by points: if/else 31 (56 pts), boolean chains 15, loops 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8970abfa78c388cca2a0de5776f697645674536f99ae58679c32b268783d5593"}},{"ruleId":"D2","level":"warning","message":{"text":"PetEngineTelemetry.observe (cognitive 73): PetEngineTelemetry.observe has cognitive complexity 73 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 19, ternaries 5 (12 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 25). Of this number, 69 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"088b3925ab6acd6f9d976320323c992951aa28f6504dd1cacc778235b7e9757f"}},{"ruleId":"D2","level":"warning","message":{"text":"PetEngineTelemetry.observe (cognitive 73): PetEngineTelemetry.observe has cognitive complexity 73 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 19, ternaries 5 (12 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 25). Of this number, 69 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfcf6f56a8d6cb650f6833dd8dab59e23a7df2da15baa7e97e1b98eaa76d872"}},{"ruleId":"D2","level":"warning","message":{"text":"PetEngineTelemetry.observe (cognitive 73): PetEngineTelemetry.observe has cognitive complexity 73 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 19, ternaries 5 (12 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 25). Of this number, 69 points are the body\u0027s own statements and 4 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-engine.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca07f61ea693e26d654659976b26fef490b2855db23b6407fcb7e898d404333f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::stdio::run_stdio_loop (cognitive 72): codewhale_app_server::stdio::run_stdio_loop has cognitive complexity 72 (threshold 15). Drivers by points: if/else 17 (46 pts), match/switch 6 (19 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/stdio.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6458756b1c310acac982a8f7fea0c60a84b94cc058040130d16ff07ed2d054e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::registry::gc::plan (cognitive 72): codewhale_plugins::registry::gc::plan has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (47 pts), match/switch 4 (13 pts), boolean chains 6, loops 5 (6 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry/gc.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87a590fde3958f942e108a25bd01b6461bfa221486ca9283238a63fbdbc2945"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui_kit::diff_render::wrap_parts (cognitive 72): codewhale_tui_kit::diff_render::wrap_parts has cognitive complexity 72 (threshold 15). Drivers by points: if/else 29 (52 pts), loops 6 (14 pts), boolean chains 6 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd0f1a9cd6c01a55e6e5fcc837da035608dcee23d31e28c270ac016d7742a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"pet-runtime.followRuntime (cognitive 72): pet-runtime.followRuntime has cognitive complexity 72 (threshold 15). Drivers by points: if/else 16 (45 pts), boolean chains 9, ternaries 2 (8 pts), error handling 3 (7 pts), loops 2 (3 pts) (nesting depth added 40). Most of this is not in the body itself: 6 of the 72 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 32, 43). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-runtime.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc810b0174a758b785d3ea80e1988b4e61bd8a5ef1c80ef9bd01fefa267c3fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogOffering::complete_facts (cognitive 71): CatalogOffering::complete_facts has cognitive complexity 71 (threshold 15). Drivers by points: if/else 31 (38 pts), boolean chains 31, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/catalog.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d129b3aebf947105f0c5c0b12c57453bd80991146f01b0cc6579918193b460ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::execute_tools_with_nested_gate (cognitive 71): Engine::execute_tools_with_nested_gate has cognitive complexity 71 (threshold 15). Drivers by points: if/else 13 (42 pts), match/switch 6 (18 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfac9b90ee1df4b4bb13feed2f0e0a73840a7e74b3522f6569270863e0db8e93"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::mcp_http::read (cognitive 71): codewhale_engine::extension_host::mcp_http::read has cognitive complexity 71 (threshold 15). Drivers by points: if/else 19 (55 pts), loops 3 (9 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp_http.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5416e0dc350b81b757713ee62fd2a0d131ec732089574f9cf8ee63a920ab02"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::makeFrame (cognitive 71): (anonymous)::makeFrame has cognitive complexity 71 (threshold 15). Drivers by points: ternaries 22 (26 pts), if/else 14 (23 pts), boolean chains 12, other 6, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3fb6e53c1f8bf1adda98fd020156abd7304cdf1dd73e3ab19c76be85ebb2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::makeFrame (cognitive 71): (anonymous)::makeFrame has cognitive complexity 71 (threshold 15). Drivers by points: ternaries 22 (26 pts), if/else 14 (23 pts), boolean chains 12, other 6, loops 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"36319a60e8828c9aa916d32f651c0286967cc2f4eb0c47271410ab728abf5a11"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::plugin_index::get_plugin_index (cognitive 70): codewhale_app_server::runtime_api::plugin_index::get_plugin_index has cognitive complexity 70 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 12 (25 pts), match/switch 9 (15 pts), boolean chains 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plugin_index.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"a422ab6e43543718d44667e3a97befdbdc3fbdb7fb608dd3e68d684e6046f5e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::prepare_model_step (cognitive 70): Engine::prepare_model_step has cognitive complexity 70 (threshold 15). Drivers by points: if/else 41 (54 pts), boolean chains 9, match/switch 4 (6 pts), loops 1 (nesting depth added 15). 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/engine/src/core/engine/turn_loop/preparation.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f839235ed4ab19d7a1b84abd0752a1d3aa14c5e972b1f872dc3d22d3fa5ad7f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::run_config_command (cognitive 68): codewhale_cli::run_config_command has cognitive complexity 68 (threshold 15). Drivers by points: if/else 28 (56 pts), loops 2 (5 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":5509}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79e315b7831e6b8d0365ec0987d7673c2655a2c9c2f176f9e2796b34b66d080"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigToml::resolve_runtime_options_with_secrets (cognitive 68): ConfigToml::resolve_runtime_options_with_secrets has cognitive complexity 68 (threshold 15). Drivers by points: if/else 43 (44 pts), boolean chains 15, match/switch 5 (9 pts) (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_resolve.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c1a93937b769405eb80b8897e469ba2fbdf6c8278ea656728dba71c566414b"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelInventory::from_config_scoped (cognitive 68): ModelInventory::from_config_scoped has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (49 pts), boolean chains 8, loops 4 (7 pts), match/switch 3 (4 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_inventory.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5df3b7e2ba4ba6c03f59c4820a924015e9bd5f45c9420c03e59b673892f8062"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::input::handle_mouse (cognitive 68): codewhale_tui::tui::work_surface::input::handle_mouse has cognitive complexity 68 (threshold 15). Drivers by points: if/else 18 (40 pts), match/switch 7 (15 pts), boolean chains 13 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/input.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5447162d8ef02e36351e83c96805931fbb973545e3c9967ca3ac520761eba0"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::run_auto_compaction (cognitive 67): Engine::run_auto_compaction has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (51 pts), match/switch 5 (11 pts), boolean chains 5 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/compaction.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c116c8b8dce6219c26b1cf7f986afba8622286c7f4e4e7b6cf72bd56b02a6c5"}},{"ruleId":"D2","level":"warning","message":{"text":"WebRunTool::execute (cognitive 67): WebRunTool::execute has cognitive complexity 67 (threshold 15). Drivers by points: if/else 26 (48 pts), loops 6 (12 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfca3bdae79e424be99c4362fafd18e8004664615d6a8d13efd846a2321196f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::split_ansi_c_shell_words (cognitive 67): codewhale_execpolicy::shell_expand::split_ansi_c_shell_words has cognitive complexity 67 (threshold 15). Drivers by points: if/else 17 (45 pts), loops 5 (13 pts), boolean chains 7, match/switch 1 (2 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/shell_expand.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5744835badb9ea4d912a184af127ef85628994c1a2cbf7d9a5d952443445a0"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionsView::render (cognitive 67): ExtensionsView::render has cognitive complexity 67 (threshold 15). Drivers by points: if/else 35 (45 pts), match/switch 4 (10 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 18). 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/tui/src/tui/views/extensions.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"269e0ba88775a0ae47ad9198835731a8ccd2a7156c3bf36c0c7c18fc839074e0"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadStore::visit_diagnostic_records (cognitive 66): RuntimeThreadStore::visit_diagnostic_records has cognitive complexity 66 (threshold 15). Drivers by points: if/else 15 (44 pts), match/switch 6 (14 pts), loops 5 (8 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9604d8aaf8f19cdaa8595578856bbd2392574b6bb7bbe2998fd22cdc7f17369"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentStoreAuthority::merge_publish (cognitive 66): SubAgentStoreAuthority::merge_publish has cognitive complexity 66 (threshold 15). Drivers by points: if/else 26 (44 pts), boolean chains 14, loops 5 (8 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":13776}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d454d2b2b743ff9eaf17d2e45fea3ce5cb9da19b605c9e5e531a73fe7985620"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::review_core::render_review_summary (cognitive 66): codewhale_engine::tools::review_core::render_review_summary has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 7 (16 pts), match/switch 4 (9 pts), boolean chains 3 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e1dfdc60ef221a9dbbb9e70328c026948602cc3d6d837847b2b410bf2b6af1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::skills::skills::list_skills (cognitive 66): codewhale_tui::commands::groups::skills::skills::list_skills has cognitive complexity 66 (threshold 15). Drivers by points: if/else 27 (48 pts), loops 4 (13 pts), boolean chains 5 (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/tui/src/commands/groups/skills/skills.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ff572c97304ebd9451857f864d55a7851283e054da640f15f60cd384587117"}},{"ruleId":"D2","level":"warning","message":{"text":"app.applyRuntimeEvent (cognitive 66): app.applyRuntimeEvent has cognitive complexity 66 (threshold 15). Drivers by points: if/else 26 (38 pts), boolean chains 18, ternaries 5 (10 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fb2e6b04c4a588980fb494a30034234aaa98985bd86309363b9cc27be4367e"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::recover_interrupted_state (cognitive 65): RuntimeThreadManager::recover_interrupted_state has cognitive complexity 65 (threshold 15). Drivers by points: if/else 19 (47 pts), loops 7 (11 pts), boolean chains 5, match/switch 1 (2 pts) (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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":19264}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ae5eac1b7ea16fad8e0a1fc61513c4e8170f74db1d12f882e04a0862f262aa"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::receipts::assemble (cognitive 65): codewhale_engine::receipts::assemble has cognitive complexity 65 (threshold 15). Drivers by points: if/else 21 (37 pts), match/switch 5 (11 pts), boolean chains 9, loops 8 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dc42f4c4242f59dc9feaa0b66a1767b62d22a782043bd6fed45f40149ad309"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatWidget::new_with_ocean_elapsed (cognitive 65): ChatWidget::new_with_ocean_elapsed has cognitive complexity 65 (threshold 15). Drivers by points: if/else 30 (42 pts), boolean chains 14, loops 4 (9 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/tui/src/tui/widgets/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8c9015d86ffec138b78f15a6ab8b13493474f6a6ef8e7fda6b343d32e6d047"}},{"ruleId":"D2","level":"warning","message":{"text":"flushOutputs (cognitive 65): flushOutputs has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (45 pts), boolean chains 7, loops 3 (6 pts), ternaries 2 (5 pts), error handling 1 (2 pts) (nesting depth added 30). Of this number, 31 points are the body\u0027s own statements and 34 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1dda3b1c48b4f84efebf9a4b0bd273289765f76bab3c86b0745fb32dc14371"}},{"ruleId":"D2","level":"warning","message":{"text":"Broker::authorize_frame (cognitive 64): Broker::authorize_frame has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (51 pts), boolean chains 12, match/switch 1 (nesting depth added 26). 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/engine/src/extension_host/mcp.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c8f21d56dc33c07a21b58213e344393976e705f9a50058d1fff70b03e608fd"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskManager::run_task (cognitive 64): TaskManager::run_task has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (41 pts), match/switch 4 (11 pts), loops 5 (8 pts), boolean chains 4 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f30eb519b5a292ae64b15e50b7ca7b016fa33ee0aebd32f333ef6f8208644fd"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatWidget::new_with_ocean_elapsed (cognitive 64): ChatWidget::new_with_ocean_elapsed has cognitive complexity 64 (threshold 15). Drivers by points: if/else 30 (42 pts), boolean chains 13, loops 4 (9 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/tui/src/tui/widgets/transcript_legacy.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"09da80b90b5a6f6f4ce14916792c852d091e0151469da0446762105dc634056b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::render::render (cognitive 64): codewhale_tui::tui::work_surface::render::render has cognitive complexity 64 (threshold 15). Drivers by points: if/else 36 (55 pts), boolean chains 7, loops 1, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7513cdf3ad8e29df527d59448550e70f7b31a827f31778e91a4bffd486fd7093"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow::redaction::redact_assignment_segment_at (cognitive 64): codewhale_workflow::redaction::redact_assignment_segment_at has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (56 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/redaction.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"8256eae44780e7facc73fd175631118f4eb385f22e21e95fbd7bb02e0a87a384"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::stream_turn (cognitive 63): codewhale_app_server::runtime_api::stream_turn has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 5 (11 pts), match/switch 5 (9 pts), boolean chains 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b5f88c2a3289319c3a74bd82d66d28687aaedbd3846b76207fa75f45693a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Components::walk (cognitive 63): Components::walk has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (43 pts), match/switch 5 (13 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa79116212b3db131041f57a5b34ed343d565c2b9c202222932bb07ae51279d"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.validateBatch (cognitive 63): schema.validateBatch has cognitive complexity 63 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 20, ternaries 2 (3 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddbf741444b5004db74386ea38c5e6abf40291997ab34a82530f5f14257a969"}},{"ruleId":"D2","level":"warning","message":{"text":"AcpServer::history_updates (cognitive 62): AcpServer::history_updates has cognitive complexity 62 (threshold 15). Drivers by points: if/else 11 (44 pts), match/switch 3 (9 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/acp_server.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a631a0e55c95f6e6265b76d8aad3ec6dc76161da6d6c580984be75ac8d068e"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhaleClient::build_anthropic_wire_body (cognitive 62): CodewhaleClient::build_anthropic_wire_body has cognitive complexity 62 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 12, match/switch 4 (9 pts), loops 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bc5771f16829608b8892f0dea8de3c2f2992faa6e82689a1a0cf17a96be15b"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::aggregate_usage (cognitive 62): RuntimeThreadManager::aggregate_usage has cognitive complexity 62 (threshold 15). Drivers by points: if/else 11 (37 pts), loops 9 (22 pts), boolean chains 2, match/switch 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":8561}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69f96c48d1abf940bb98590d2098a495cd490af52893e2404b6d4bd6828ee56"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::settle_claimed_turn_failure (cognitive 62): RuntimeThreadManager::settle_claimed_turn_failure has cognitive complexity 62 (threshold 15). Drivers by points: if/else 22 (36 pts), loops 6 (12 pts), match/switch 5 (12 pts), boolean chains 2 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12693}}}],"partialFingerprints":{"codehealthFindingId/v1":"3526ce7463148299952f0f5b2e4609794f76ef5dec2b432c8404789b04ea41ba"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::task_manager::drive_engine_turn (cognitive 62): codewhale_engine::task_manager::drive_engine_turn has cognitive complexity 62 (threshold 15). Drivers by points: if/else 12 (37 pts), match/switch 8 (21 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5e23d76f40727c5789ec8c59ed165bde2148a741d990818f9391369c4607d9"}},{"ruleId":"D2","level":"warning","message":{"text":"MfjsValidationState::validate_schema (cognitive 62): MfjsValidationState::validate_schema has cognitive complexity 62 (threshold 15). Drivers by points: if/else 26 (41 pts), boolean chains 10, loops 5 (9 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/schema_sanitize.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"4551d13b59cdca784431eb2deef2b176ad90b844e7b2e68ac058abe47aa2e6f5"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::gaitTarget (cognitive 62): (anonymous)::gaitTarget has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (30 pts), ternaries 10 (30 pts), boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"5402a86d58e58fb2aaef2c7a94fd8976f4b036aba831ca74c97d35e9fd9f0cd0"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::gaitTarget (cognitive 62): (anonymous)::gaitTarget has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (30 pts), ternaries 10 (30 pts), boolean chains 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64f678211dbb420605243de5a5e53bbb71dbbbe412ea80a12752e56b4bd8fcc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::compaction::create_summary (cognitive 61): codewhale_engine::compaction::create_summary has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (43 pts), match/switch 6 (15 pts), boolean chains 2, loops 1 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction.rs"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bb455a5848cb90487bdd90858adebc2056676059c2c4b0fc4e81a9b919ad81"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::dsh::native_composition_files (cognitive 61): codewhale_plugins::install::dsh::native_composition_files has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 12, match/switch 2 (8 pts), loops 6 (7 pts) (nesting depth added 25). Of this number, 52 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"6205003fc450bd98afbb1529dc79970a6ad3ba108064bfdf433628928ace2519"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_sanitize::sanitize::strip_ansi_impl (cognitive 61): codewhale_sanitize::sanitize::strip_ansi_impl has cognitive complexity 61 (threshold 15). Drivers by points: if/else 11 (39 pts), loops 4 (13 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/sanitize.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cbefa44c8808315191a845fa61cb05a20eca2d1d541289640544d6a571fbeb"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillRegistry::discover_recursive (cognitive 61): SkillRegistry::discover_recursive has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 7 (20 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/lib.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"350a26314e8ce92b889c2f18dd87ad8d41a49284c4695b98ee53ec6414f2eae3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::runtime::run (cognitive 61): codewhale_tui::tui::pet_watch::runtime::run has cognitive complexity 61 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 5 (16 pts), loops 3 (9 pts), boolean chains 4 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/runtime.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c75b026093acd9a21dcf99ce17e55caf59d6cd3b76e73cc4d57257c51907a3"}},{"ruleId":"D2","level":"warning","message":{"text":"makeMatrix (cognitive 60): makeMatrix has cognitive complexity 60 (threshold 15). Drivers by points: loops 11 (21 pts), if/else 7 (15 pts), ternaries 4 (14 pts), boolean chains 10 (nesting depth added 28). Of this number, 46 points are the body\u0027s own statements and 14 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3fa08f0878990e68030ece443e88570f7027c48a6cd9e886aff4e6188f451d1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::jobs::create_thread_job (cognitive 59): codewhale_app_server::runtime_api::jobs::create_thread_job has cognitive complexity 59 (threshold 15). Drivers by points: if/else 33 (48 pts), boolean chains 7, loops 2, match/switch 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/jobs.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee8ef9400e4c8630e4fee248eda6a98cc44ae051d9d06b4d3cbf6297104a0c7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::provider_lake::runtime_catalog_resolver_for_identity (cognitive 59): codewhale_engine::provider_lake::runtime_catalog_resolver_for_identity has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 10, loops 4 (7 pts), match/switch 2 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5505bfb1b88b8497c2d286db885eadbe0a4ffd16272c6a060312eb4ffa4a97"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::event_loop::run_tui (cognitive 59): codewhale_tui::tui::ui::event_loop::run_tui has cognitive complexity 59 (threshold 15). Drivers by points: if/else 28 (34 pts), match/switch 6 (14 pts), boolean chains 9, loops 2 (nesting depth added 14). 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/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"889bc520fa8bd28eac9624ff70bca81bfad520c3b61a4c466a6d432317fb7a49"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::run (cognitive 58): codewhale_cli::run has cognitive complexity 58 (threshold 15). Drivers by points: if/else 31 (42 pts), boolean chains 10, match/switch 4 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf55a43302f8e590992f18b856f7d917d3ac17e8c878e8bf455e285648034c3"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadStore::checkpoint_tail (cognitive 58): RuntimeThreadStore::checkpoint_tail has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (37 pts), match/switch 3 (11 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 40). 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/engine/src/runtime_threads.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f9035e1ac01e118e5ca66a42cdc002748cab4f4bcef20b7c335c396c59a6a6"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::resolve_active_route_api_key (cognitive 58): Config::resolve_active_route_api_key has cognitive complexity 58 (threshold 15). Drivers by points: if/else 28 (33 pts), boolean chains 16, match/switch 5 (9 pts) (nesting depth added 9). 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/runtime/src/config.rs"},"region":{"startLine":6315}}}],"partialFingerprints":{"codehealthFindingId/v1":"907ea5a373075221ad07411a016e2f622674a69b706ff087cd93d22e9e809878"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.validateEvent (cognitive 58): schema.validateEvent has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 9, ternaries 4 (7 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1e499d6bc75f0c9807836ffc409823c135e14c2c3b6cf3bc648a06a9134570"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::buildPyramid (cognitive 58): (anonymous)::buildPyramid has cognitive complexity 58 (threshold 15). Drivers by points: loops 11 (21 pts), if/else 10 (20 pts), ternaries 3 (11 pts), boolean chains 3, other 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"baff85e5ba2b3c968fc3451b003861ebba866c9edb44beb44d6ef463ba4447b1"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::buildPyramid (cognitive 58): (anonymous)::buildPyramid has cognitive complexity 58 (threshold 15). Drivers by points: loops 11 (21 pts), if/else 10 (20 pts), ternaries 3 (11 pts), boolean chains 3, other 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3a22b99fea7e4fd650647c413a5fe2075aa18e0eadf5c0a75f81ca0f355c85"}},{"ruleId":"D2","level":"warning","message":{"text":"CoreCalls::serve_subagent (cognitive 57): CoreCalls::serve_subagent has cognitive complexity 57 (threshold 15). Drivers by points: match/switch 14 (34 pts), if/else 9 (21 pts), boolean chains 2 (nesting depth added 32). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/engine/src/extension_host/core_call.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd72ae598d6bed3f2519fe1f502c39049d912e62ec3da1b5fce2ca34cf010b41"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::run_subagent_task_inner (cognitive 57): codewhale_engine::tools::subagent::run_subagent_task_inner has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (31 pts), match/switch 11 (21 pts), boolean chains 4, 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":17045}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0aedea039a1fddaddc2e763c97a8faece5b73ead2d80399c9b06bf88dfff2b"}},{"ruleId":"D2","level":"warning","message":{"text":"PetWorld.makeFrame (cognitive 57): PetWorld.makeFrame has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 12 (18 pts), boolean chains 12, loops 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1db6fbab2bbf57f2da1ec54e8a9b31769dfcb902bd49e936651fc99a9f6e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"PetWorld.makeFrame (cognitive 57): PetWorld.makeFrame has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 12 (18 pts), boolean chains 12, loops 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be2fc3fa7ac05a54ce37b50d27b9f15897ac33755c1f6064fcbc5a418337044"}},{"ruleId":"D2","level":"warning","message":{"text":"PetWorld.makeFrame (cognitive 57): PetWorld.makeFrame has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 12 (18 pts), boolean chains 12, loops 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-world.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"c195c1206a558a5940776fb84c233a3921220774834d00d0a9a9ba1b86db3daf"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::mark_replacement_operands (cognitive 56): codewhale_execpolicy::shell_expand::mark_replacement_operands has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (40 pts), loops 4 (9 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/shell_expand.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b0b5eafc3f177113aa18efb881f5aa12ac9d9b15a384b34397e494c48bdee1"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelPickerView::render_pane (cognitive 56): ModelPickerView::render_pane has cognitive complexity 56 (threshold 15). Drivers by points: if/else 33 (45 pts), boolean chains 10, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e62172d084b17e1baf3cd662b3887c5ebb70d97ff21012c7a006efc84378743"}},{"ruleId":"D2","level":"warning","message":{"text":"PagerView::render (cognitive 56): PagerView::render has cognitive complexity 56 (threshold 15). Drivers by points: if/else 34 (46 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f77a0a6ae3ecae604f499620f2cf962fdc111a9ca79218e0a8abbe376a4ae6d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::find_math_end (cognitive 56): codewhale_tui::tui::history::latex_render::find_math_end has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (39 pts), boolean chains 9, loops 4 (8 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ca673b3a8cc2658337a50b1a57e493f8b290a178c0d70a149d6e768c2adf99"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSimKt.gaitTarget (cognitive 56): PetSimKt.gaitTarget has cognitive complexity 56 (threshold 15). Drivers by points: if/else 28 (54 pts), boolean chains 1, match/switch 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/android/PetSim.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7427d862eb9d6a1cb363cb0ad0ba88d32e9edec9fbf1f8d88fc4c447788b0c"}},{"ruleId":"D2","level":"warning","message":{"text":"runTurn (cognitive 56): runTurn has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (43 pts), error handling 2 (4 pts), ternaries 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 34). Of this number, 46 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"61940acb7d86b3b9878e324573f162fb035141a152b772970ad3840bb75b5422"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::replay_live_thread_events (cognitive 55): codewhale_app_server::runtime_api::replay_live_thread_events has cognitive complexity 55 (threshold 15). Drivers by points: if/else 9 (25 pts), match/switch 6 (17 pts), loops 5 (13 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0811c2b5b5d90f719dd9f60fc43193333b1f37934a580fd8dbcb371ae04825ba"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationSchedule::next_after_in_timezone (cognitive 55): AutomationSchedule::next_after_in_timezone has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (40 pts), loops 4 (10 pts), boolean chains 4, match/switch 1 (nesting depth added 32). 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/engine/src/automation_manager.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a08f8e0f5cc8d873b20dfd39a5ba08660c20d82699619e8e5a7011efe373857"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_net::import_claude::build_plan (cognitive 55): codewhale_net::import_claude::build_plan has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 6 (20 pts), match/switch 1 (5 pts), boolean chains 1 (nesting depth added 36). 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/net/src/import_claude.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"295c343b49c3328432b714fbb9a86ed902a3c6cf9bfee9185718b1d2b25b5945"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ambient_life::paint_marks (cognitive 55): codewhale_tui::tui::ambient_life::paint_marks has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 6 (11 pts), match/switch 3 (7 pts), 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/tui/src/tui/ambient_life.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3b0aae0d9892ca6dc563568eb345022d0c4ede4fc38905f9e6836adbf3a3fc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ambient_life::pet_sim::gait_target (cognitive 55): codewhale_tui::tui::ambient_life::pet_sim::gait_target has cognitive complexity 55 (threshold 15). Drivers by points: if/else 27 (52 pts), boolean chains 2, match/switch 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ambient_life/pet_sim.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd683c2c1cb7bbbd98462d6c49026577c3f419eb3196efbe4e99155c6759ceef"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::run_model_command (cognitive 54): codewhale_cli::run_model_command has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 5, loops 2 (5 pts), match/switch 2 (4 pts) (nesting depth added 26). 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/cli/src/lib.rs"},"region":{"startLine":6018}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68481b1b13738489b3630d23346ed17834f333366a74db251a437d50e32d62c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::lex_readonly_command (cognitive 54): codewhale_execpolicy::command_safety::lex_readonly_command has cognitive complexity 54 (threshold 15). Drivers by points: if/else 13 (35 pts), match/switch 3 (9 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa4696da6e3291a9bb553b07f36510359f59ac151beb4f597499a62baa9f046"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::dsh::convert_package (cognitive 54): codewhale_plugins::install::dsh::convert_package has cognitive complexity 54 (threshold 15). Drivers by points: if/else 27 (39 pts), loops 7 (10 pts), boolean chains 5 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":2983}}}],"partialFingerprints":{"codehealthFindingId/v1":"2025fb94bde5cbb0f868c49a104e89f98be2d3c1eb23d71d1a2cbb919e0eca57"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::config::credential_resolve::resolve_credential_source_with (cognitive 54): codewhale_runtime::config::credential_resolve::resolve_credential_source_with has cognitive complexity 54 (threshold 15). Drivers by points: if/else 31 (43 pts), boolean chains 9, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config/credential_resolve.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"551ade7b1f13e22b2b43eb77785aafc871f0732de7b0facfe8d4bdb415ad11c6"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigView::render (cognitive 54): ConfigView::render has cognitive complexity 54 (threshold 15). Drivers by points: if/else 27 (47 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":4467}}}],"partialFingerprints":{"codehealthFindingId/v1":"58df021c0bf234492d7e60d0a47d0bc11bce731a0e7ef2f6bf1ec7257f6d60ac"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowPanel::apply_event (cognitive 54): WorkflowPanel::apply_event has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (50 pts), boolean chains 3, match/switch 1 (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/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75b924a8a8ea0eb229ede2da6392fc7847d47dfd78285b40d0149ecb4fd7675"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow::redaction::redact_structured_token (cognitive 54): codewhale_workflow::redaction::redact_structured_token has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (47 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 26). 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/workflow/src/redaction.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"f579b6f7912653e9242f543bc855b286a991df97451950b24bf9711ad3f0a478"}},{"ruleId":"D2","level":"warning","message":{"text":"pet-sim.gaitTarget (cognitive 54): pet-sim.gaitTarget has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (30 pts), ternaries 7 (22 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-sim.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb1867dab73913be9d799f1f3de72e3dc8684b17e4e76dcf7a7870fc203d64b"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::next_run_input (cognitive 53): Engine::next_run_input has cognitive complexity 53 (threshold 15). Drivers by points: if/else 9 (29 pts), match/switch 6 (18 pts), boolean chains 5, loops 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":3634}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e5d1a1d53a35a4d30614a19161500877b86eb58514b48ddf7d41df05a2b05d"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::prepare_fork_from_cutoff (cognitive 53): RuntimeThreadManager::prepare_fork_from_cutoff has cognitive complexity 53 (threshold 15). Drivers by points: if/else 21 (36 pts), match/switch 4 (10 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db436a7c2416d67e978758b4dcb93207316d0f513e70f5f335afe3a84c9a0e9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::github::host::run (cognitive 53): codewhale_engine::tools::github::host::run has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (43 pts), match/switch 3 (10 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/engine/src/tools/github/host.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6480955098349b9d2a2b0c1e46f4d121f850a8d41447193b8453b9b5cfb8826"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::handlers::handle_mcp_ui_action (cognitive 53): codewhale_tui::tui::ui::handlers::handle_mcp_ui_action has cognitive complexity 53 (threshold 15). Drivers by points: if/else 22 (31 pts), match/switch 9 (17 pts), boolean chains 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4d075f7fa42967ffc27855ad65e9e2d56a05d43547cf567f9892ce53af30d8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::patch_undo_workspace_files_impl (cognitive 52): codewhale_app_server::runtime_api::patch_undo_workspace_files_impl has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (34 pts), loops 8 (10 pts), match/switch 3 (7 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":9629}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ed880c88593cf95d197079ae8fac6326b8e6f5c9af8e265caf2403ef5362b1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_network::fetch (cognitive 52): codewhale_engine::extension_host::dsh_network::fetch has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 4 (6 pts), match/switch 3 (5 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/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c11558a971e0188fb9c66f872d340da1b9f4f84346ad36f0d7fc87982374f3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow::run_workflow_vm (cognitive 52): codewhale_engine::tools::workflow::run_workflow_vm has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (39 pts), match/switch 6 (9 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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc849e2899a197959edd104b93484826ad85ce57c5fcee71ed170af49c5baef"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::file_mention::stabilize_screenshot_references (cognitive 52): codewhale_tui::tui::file_mention::stabilize_screenshot_references has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (35 pts), loops 5 (8 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d5073982d23082ac6069806f94bf7cb4c34dbf016635ed5f053e543fd5a1282"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::assign_default_sections (cognitive 52): codewhale_tui::tui::model_picker::assign_default_sections has cognitive complexity 52 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 13, loops 7 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c74d982e61c7491aa5c8b8c3b93daeec0f681e1101c677a6d15f3f65e06271"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::full::render (cognitive 52): codewhale_tui::tui::pet_watch::full::render has cognitive complexity 52 (threshold 15). Drivers by points: if/else 36 (40 pts), boolean chains 10, match/switch 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/full.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"581a1d9a7ece26254cc7ebb0c90b5acd1c228134e6ebb9c0532c665b19c16c89"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewedCatalog::validate (cognitive 51): ReviewedCatalog::validate has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 16, loops 10, 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/config/src/catalog/reviewed.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbb72a473210119d5c58735495604d82f1269d1db8f200dc3b0c480fa04add6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_models::schema_sanitize::sanitize_for_kimi (cognitive 51): codewhale_models::schema_sanitize::sanitize_for_kimi has cognitive complexity 51 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 6 (20 pts), boolean chains 5 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/schema_sanitize.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7d5b70f27278f9d12732979bddd14e38b94caffcb1ccdd89e62a9570d0e6be"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::dsh::admit_host_compatibility (cognitive 51): codewhale_plugins::install::dsh::admit_host_compatibility has cognitive complexity 51 (threshold 15). Drivers by points: if/else 14 (35 pts), match/switch 4 (10 pts), loops 2 (5 pts), 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/plugins/src/install/dsh.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89f8c5e8afeafda55fbc4d44f0c91604a1b78103ce1db994a318c506ea15c3c"}},{"ruleId":"D2","level":"warning","message":{"text":"TranscriptViewCache::ensure_iter (cognitive 51): TranscriptViewCache::ensure_iter has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (34 pts), boolean chains 13, match/switch 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/transcript.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"543c477573e5edb3d6d49e1d92d0483d7730d63ef3774004c400c6364270734f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::config_main_host::set_subagents_config_value (cognitive 51): codewhale_tui::commands::config_main_host::set_subagents_config_value has cognitive complexity 51 (threshold 15). Drivers by points: if/else 25 (38 pts), match/switch 10 (13 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/tui/src/commands/config_main_host.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3097f3001758775c8ca993149302d34b21d2ac04b9e9cb7d6060f58cbf7a1045"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui_kit::markdown_render::parse_inline_spans (cognitive 51): codewhale_tui_kit::markdown_render::parse_inline_spans has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 12, match/switch 1 (3 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/markdown_render.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba171df676dadf53bb9add9769d0251eda1b296c4df0670612d12930595a4f17"}},{"ruleId":"D2","level":"warning","message":{"text":"DingTalkBridge.handle (cognitive 51): DingTalkBridge.handle has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 8 (17 pts), boolean chains 16 (nesting depth added 15). Of this number, 49 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f5bd96d1360309f3e1dc409b9bbb3764e63c87025390acc344a74d321e654d"}},{"ruleId":"D2","level":"warning","message":{"text":"merch-storefront.MerchCheckout (cognitive 51): merch-storefront.MerchCheckout has cognitive complexity 51 (threshold 15). Drivers by points: ternaries 15 (25 pts), boolean chains 13, if/else 11, error handling 2 (nesting depth added 10). Of this number, 19 points are the body\u0027s own statements and 32 belong to 7 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-storefront.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"227c835242fb6e6f700cb4401ebea36d0514cd853498537b8b7cc58316f769db"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::metrics::print_human (cognitive 50): codewhale_cli::metrics::print_human has cognitive complexity 50 (threshold 15). Drivers by points: if/else 26 (34 pts), match/switch 5 (11 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 15). 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/cli/src/metrics.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28dba67e303f9e7689ee00be8e958ab87ba7c7a085621fcb940db7873983c1d"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetRoster::load_with_personal_dir_and_plugins (cognitive 50): FleetRoster::load_with_personal_dir_and_plugins has cognitive complexity 50 (threshold 15). Drivers by points: loops 14 (35 pts), match/switch 4 (9 pts), if/else 5 (6 pts) (nesting depth added 27). 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/engine/src/fleet/roster.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d88a6ba0f4abc73c640a6c6c1ab416b933417f684901cccd39738519435c42"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::ensure_engine_loaded (cognitive 50): RuntimeThreadManager::ensure_engine_loaded has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (37 pts), boolean chains 6, loops 3 (5 pts), match/switch 1 (2 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":15184}}}],"partialFingerprints":{"codehealthFindingId/v1":"913ffca774c66decc48f0031e63c734948cf08c92d09eec0448650e359d73c41"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::provider_native_search::parse_responses_search (cognitive 50): codewhale_engine::client::provider_native_search::parse_responses_search has cognitive complexity 50 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 7 (22 pts), boolean chains 5 (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/engine/src/client/provider_native_search.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b974b94866440c9cef5483adf33280892f2e2cd1d7e89a7fce6ca560fbb7926"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::registry::enforce_tool_authority (cognitive 50): codewhale_engine::tools::registry::enforce_tool_authority has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 9, 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/engine/src/tools/registry.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"170c520092df242d699672d6b1fe69e1b6e5d3ab06796b7a18d91415add31a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skills::audit::classify_cross_root (cognitive 50): codewhale_skills::audit::classify_cross_root has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 6 (11 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/audit.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"047e5434b0b5619ce888e03fb7a5274d12eac3c0f11dd97d7e71742b126f1475"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetDetailView::render_overview (cognitive 50): FleetDetailView::render_overview has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 3 (8 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ad75d89c9f43daefb0c7354ebccdfae67accf7e4dd4f6f48dc654383cdf3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowPanel::from_run_json (cognitive 50): WorkflowPanel::from_run_json has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 5 (13 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"91db55351329cdbc4631f7ef90ba724346e6555b73fffa8ad4249be82d6c6970"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::config::config (cognitive 50): codewhale_tui::commands::groups::config::config::config has cognitive complexity 50 (threshold 15). Drivers by points: match/switch 10 (22 pts), if/else 12 (14 pts), loops 3 (11 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/config.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be206d945319dc090442df4b20f6fede28641edbb5e21a3153c6563877077cc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::model::ordered_rows (cognitive 50): codewhale_tui::tui::work_surface::model::ordered_rows has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (33 pts), boolean chains 13, match/switch 3, loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/model.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"363196b3a2f2fd83d5160d078c2512de58978dfbc33113fe4ecd6ec923d869b3"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSim.swift.gaitTarget (cognitive 50): PetSim.swift.gaitTarget has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 8 (25 pts), if/else 14 (22 pts), boolean chains 2, match/switch 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":"pet/swift/PetSim.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6043a972875bda8f227f3b4be892bd3ab8850801df72cf5dba012256fa8dc9af"}},{"ruleId":"D2","level":"warning","message":{"text":"readSse (cognitive 50): readSse has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (30 pts), ternaries 4 (13 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"26cb054dbd574814686a372c6bf01a1c3d0cd8dd6c2176f759f7d0273c523a82"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::run_auth_command_with_secrets_and_runtime (cognitive 49): codewhale_cli::run_auth_command_with_secrets_and_runtime has cognitive complexity 49 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 4 (10 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 22). 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/cli/src/lib.rs"},"region":{"startLine":4993}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e56a540d35fbd395cda771fb91b3b789d3b32d960afa9288eca05a2b927dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_config::cloud_facts::verify::verify_envelope (cognitive 49): codewhale_config::cloud_facts::verify::verify_envelope has cognitive complexity 49 (threshold 15). Drivers by points: if/else 30 (37 pts), boolean chains 10, loops 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/cloud_facts/verify.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50a59d56722ee6e03c22213101eb062d8b848804dc42255ce9f6d953201a6d4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::tool_result_retrieval::stream_evidence (cognitive 49): codewhale_engine::tools::tool_result_retrieval::stream_evidence has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (31 pts), match/switch 4 (11 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ea642d08b8731d832aaf437c96ad9c71242bc16acde15b45c43716fe7efd44"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::agent_plugin::parse_claude_plugin_json (cognitive 49): codewhale_plugins::agent_plugin::parse_claude_plugin_json has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 6 (10 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/agent_plugin.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"789f1001da3fb38a489f7b232fb840e35c2ea20a802968298bdd191497cbaad9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::terminal::render (cognitive 49): codewhale_tui::tui::work_surface::terminal::render has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (35 pts), match/switch 2 (7 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0440a827767910e1e0732957ed37caa971a60b2a1318c130744dadbeb1ce61f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow_js::vm::line_leading_export_default (cognitive 49): codewhale_workflow_js::vm::line_leading_export_default has cognitive complexity 49 (threshold 15). Drivers by points: if/else 20 (43 pts), boolean chains 5, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/vm.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdf9eed37b04559740d21e202a27ff6163666e906006b0e8c2f1c3707851af7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.streamTurnEvents (cognitive 49): index.streamTurnEvents has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 16, ternaries 3 (10 pts), error handling 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ac04758f6303fbe242df1df5ba2d1ca9b3bd6af8f9717051c2e7ec15e6c17e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::metrics::read_audit_log (cognitive 48): codewhale_cli::metrics::read_audit_log has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (31 pts), match/switch 5 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"912fc4217b4c6f7e6ac3bc9e43091b679d1d07edb6b4e5e453f7f1351a716c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_core::fragments::collect_candidate_files (cognitive 48): codewhale_core::fragments::collect_candidate_files has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 4 (15 pts), boolean chains 5 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fragments.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"960f07142954fe5b18672639f70fcddcb53c2520074a26feef1e303b681e861d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::summary::build_summary (cognitive 48): codewhale_plugins::install::summary::build_summary has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (39 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/summary.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11d09324159c29042b3d38804944a05950dd19881d5cf11534b4e3bab8b1be5"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationEditor::key (cognitive 48): AutomationEditor::key has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (41 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c9d950cc0a48aff7a2f40aad13ffd24cb7922f9ec73de5cb7e47f56c67e563"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::contract::debug_operations::plan_undo_range (cognitive 48): codewhale_tui::commands::contract::debug_operations::plan_undo_range has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 7 (14 pts), match/switch 3 (12 pts), boolean chains 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/debug_operations.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55241a82ab4fda0379944fd60c5b20169e3143908ff650e6517084e39e3f1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::restore (cognitive 48): (anonymous)::restore has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 40, if/else 4, other 2, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"350afde5da5a05aa21124b3d95f489c1c1be766d3d92bb79371a09a1e4f49e45"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::restore (cognitive 48): (anonymous)::restore has cognitive complexity 48 (threshold 15). Drivers by points: boolean chains 40, if/else 4, other 2, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c9c70225507ec6b0b2578ba0300b8102655c6a1a37c5b50b63d3edf7ac3233"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::worktree_remove (cognitive 47): codewhale_app_server::runtime_api::git::worktree_remove has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 5 (7 pts), boolean chains 5, 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":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"121b9e92300ff7dc0c2978b9e3df8674810dafad47c07b7bbc268843a0787475"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::update::run_update (cognitive 47): codewhale_cli::update::run_update has cognitive complexity 47 (threshold 15). Drivers by points: if/else 24 (35 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (3 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/cli/src/update.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a236c04a20c34ff48c4d81abf89f7c67aa343bdda35f8b185bf9836b176ca7a1"}},{"ruleId":"D2","level":"warning","message":{"text":"RouteResolver::scope_selector (cognitive 47): RouteResolver::scope_selector has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 10, match/switch 2 (4 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/route/resolver.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad04ed7c06a4b6f974b95c27afaa99459426d612cc8bea573c4e32d2f587d724"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::recover_context_overflow (cognitive 47): Engine::recover_context_overflow has cognitive complexity 47 (threshold 15). Drivers by points: if/else 27 (40 pts), boolean chains 5, 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/engine/src/core/engine/compaction.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f2372206915df50ae0cff00c785102c9fc1cacc605a91abf38da80892d1d1d"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::async_subagent_wake_op (cognitive 47): RuntimeThreadManager::async_subagent_wake_op has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 5 (10 pts), boolean chains 3, match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6693}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f39beee1372072a7d282af051561a31db17602ca02113046fba679ee0b0917"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::monitor_host (cognitive 47): codewhale_engine::extension_host::monitor_host has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (37 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfe9bfbf406b8052a0e049b5c6fdaa846ddd3054c63584433381761ad54135a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::delivery::explicit_change_paths (cognitive 47): codewhale_engine::tools::subagent::delivery::explicit_change_paths has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (37 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/delivery.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec8e9af81a33b8ec95c6d470185a5ccfac5d0ae53a858ff2c89aaf31312ed96"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skills::render_skills_block_with_configured_root (cognitive 47): codewhale_skills::render_skills_block_with_configured_root has cognitive complexity 47 (threshold 15). Drivers by points: if/else 23 (32 pts), loops 5 (11 pts), boolean chains 3, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/lib.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce5e6775ca9273836618239f4776253d2307e4bb49d9f47def1c969e101a0fc"}},{"ruleId":"D2","level":"warning","message":{"text":"ApprovalWidget::build_inline_parts (cognitive 47): ApprovalWidget::build_inline_parts has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (38 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"876efad545984187d144c78ab2fdf589b59da8452a8976adfaeeaa43c4905bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"check-runtime-routes.runtimeRouteInventory (cognitive 47): check-runtime-routes.runtimeRouteInventory has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-runtime-routes.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25737093f9401a08ff108b80b208c2e36c48b99a2dbfeaa8eeeed494b141fae"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetFile::validate (cognitive 46): FleetFile::validate has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (32 pts), loops 4 (7 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/store.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95f83c296384aec684803734693a8d6d05bd4910feddd9b0cf6bdad6ff533d3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::runtime_threads::reconstruct_messages_from_turns_with (cognitive 46): codewhale_engine::runtime_threads::reconstruct_messages_from_turns_with has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (35 pts), loops 4 (8 pts), match/switch 1 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":6094}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ab0549fc05bfb6d55459473a8e19454caf2a1383dcac62a887343dc4af4037"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::search::visit_files_recursive (cognitive 46): codewhale_engine::tools::search::visit_files_recursive has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/search.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"209f28be409a25d8b1f1ed4f5e020d355e628f97bed0c25e7a4ddb6cb6a86c55"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow::bounded_run_record_value (cognitive 46): codewhale_engine::tools::workflow::bounded_run_record_value has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (36 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"888935a74d3b04c4348f6db8a101bfdfc5f5c62c3f63f2e2f6bfea9623e89d15"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::config::normalize_model_config (cognitive 46): codewhale_runtime::config::normalize_model_config has cognitive complexity 46 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 15, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8979}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea43b0fcee378153ce748e44ea968c8f3b3dbb50d70754d630e28d9bc6d44ff"}},{"ruleId":"D2","level":"warning","message":{"text":"PagerView::handle_key (cognitive 46): PagerView::handle_key has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (32 pts), boolean chains 7, match/switch 4 (7 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"3526f468f346dcc91b65e0df25927db3a9b4dcd8215d49c705ecf9baffe081f5"}},{"ruleId":"D2","level":"warning","message":{"text":"ApprovalWidget::body_facts (cognitive 46): ApprovalWidget::body_facts has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c32366fe0af02a892ea4faf1a6f4aa413cde29e1b94dcaff2a220339748a07"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_model_picker_choice (cognitive 46): codewhale_tui::tui::ui::apply::apply_model_picker_choice has cognitive complexity 46 (threshold 15). Drivers by points: if/else 27 (34 pts), boolean chains 8, match/switch 3 (4 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"86256aa1827662b87bd875d61205c86bff561f3efadbf917967e338699f0ab83"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::event_loop::apply_engine_session_projection (cognitive 46): codewhale_tui::tui::ui::event_loop::apply_engine_session_projection has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (30 pts), match/switch 4 (10 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":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc02c7419f8abeb624987cb7235d3d6fc9947a24daa857ad3791793f1aead7e"}},{"ruleId":"D2","level":"warning","message":{"text":"lib.validateBridgeConfig (cognitive 46): lib.validateBridgeConfig has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (26 pts), boolean chains 18, error handling 1, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ac8045bcf40a444dc836352bcd3cf79231b41d968ace866a811ede460f567a"}},{"ruleId":"D2","level":"warning","message":{"text":"lib.validateBridgeConfig (cognitive 46): lib.validateBridgeConfig has cognitive complexity 46 (threshold 15). Drivers by points: if/else 23 (26 pts), boolean chains 19, error handling 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":"integrations/telegram-bridge/src/lib.mjs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"11da5b67ff7376988749b31a403903876a292063b5054050a2159b910982bef1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::update::uninstall::remove (cognitive 45): codewhale_cli::update::uninstall::remove has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 5 (7 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update/uninstall.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"13adbebc682f01b3a1b634b5f4c22428d2bc35c6194c0c1799a430e630a90761"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_config::cloud_facts::scope::scoped_view (cognitive 45): codewhale_config::cloud_facts::scope::scoped_view has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 8, loops 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/cloud_facts/scope.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"033bdbd4a815e0dc9c370779bb7c74a25fa8b30d21cc5f4be08f7bd859906b55"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewTool::execute (cognitive 45): ReviewTool::execute has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (28 pts), match/switch 8 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0c6f243886a5b63b4b3296f35b5ecc183aec0f6e8fc3de6c307a8d1caa05c1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::configured_model_bound_secret_values_with (cognitive 45): codewhale_engine::client::configured_model_bound_secret_values_with has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 8 (16 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":"crates/engine/src/client.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bcdb513d5e939453d2bd37a4029a6ad7fbbf4bcb5135ea38647ff2cd1281a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecPolicyEngine::check (cognitive 45): ExecPolicyEngine::check has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 10, match/switch 5 (8 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/lib.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3ef77674a763c6cd9dc4525462248f689084fd0c74dd8bfae68d3c689983d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::validate (cognitive 45): Config::validate has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 6, loops 3 (5 pts), match/switch 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b4e62a3c7c428f061725f866e0a84e45ef6dd5f70b1043c1deaec98c1f795b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::core::core::model (cognitive 45): codewhale_tui::commands::groups::core::core::model has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (34 pts), match/switch 2 (6 pts), boolean chains 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/core.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd919680181afe647c521a0f2b9e8204cd626affd80d7413ec04454bd4065a9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::frame::info_segments (cognitive 45): codewhale_tui::tui::ui::frame::info_segments has cognitive complexity 45 (threshold 15). Drivers by points: if/else 24 (31 pts), boolean chains 12, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/frame.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c917d4db4f98199ea5cfa9820b10b6685252c207ce9f8f87b4c18baa739f6d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_util::files::open_confined_dir_fd (cognitive 45): codewhale_util::files::open_confined_dir_fd has cognitive complexity 45 (threshold 15). Drivers by points: if/else 15 (38 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/files.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"9160ab9f8d73f8c477e15d98de2b00c2bf34031af13ab3fc7a745a790eb336cd"}},{"ruleId":"D2","level":"warning","message":{"text":"PetScore.voices (cognitive 45): PetScore.voices has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, ternaries 2 (9 pts), loops 3 (8 pts) (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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e54afe2cc4c5f884b17386a5874e8de57ffbe15061da3528276d7ec750b1ea"}},{"ruleId":"D2","level":"warning","message":{"text":"index.streamTurnEvents (cognitive 45): index.streamTurnEvents has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 15, ternaries 1 (3 pts), error handling 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb81a762fdf4eba91698d17dc670ea3d7ee72009abe4e63465eb6d639a199c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"PetScore.voices (cognitive 45): PetScore.voices has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, ternaries 2 (9 pts), loops 3 (8 pts) (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81eaf7e6f84def3ab98f4fcd0e5a8efca070abef41c30d3774f46565bdcb843"}},{"ruleId":"D2","level":"warning","message":{"text":"PetScore.voices (cognitive 45): PetScore.voices has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, ternaries 2 (9 pts), loops 3 (8 pts) (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":"pet/src/core/pet-audio.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f232da3e51f73c7bedf9eaa30b14cee07faff37d8572016769c96705dd6e4f63"}},{"ruleId":"D2","level":"warning","message":{"text":"facts-publish.verifyEnvelope (cognitive 45): facts-publish.verifyEnvelope has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (26 pts), boolean chains 10, error handling 3 (5 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"31eb2be37ac3a5533867cbdee292c11ce00cd70ec7d8c73dcf7d3438b7cb2276"}},{"ruleId":"D2","level":"warning","message":{"text":"render-terminal-capture.frameSvg (cognitive 45): render-terminal-capture.frameSvg has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 7 (31 pts), if/else 4 (9 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 30). Most of this is not in the body itself: 1 of the 45 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 229, 241). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-terminal-capture.mjs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7e1849db525a4bcef7c2da808c26b58761eaf4c29e549581a008ad9bf7f4de"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::voices (cognitive 45): (anonymous)::voices has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, ternaries 2 (9 pts), loops 3 (8 pts) (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c92df83944959cd52c1a681d26076e4eba019e4a2ca8a47772e011c7b67ce63"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::projectDotField (cognitive 45): (anonymous)::projectDotField has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 16 (27 pts), if/else 3 (7 pts), boolean chains 4, match/switch 1 (3 pts), other 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe4b28172bbebf7c2291bb2724cf98a803cb4fec7fdf38ae60d5f4dcb76f688"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::voices (cognitive 45): (anonymous)::voices has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, ternaries 2 (9 pts), loops 3 (8 pts) (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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4d4a8aaf1dd6a6616174e6f9fd41f34b7d03fc5584e37c527541bda043b5e8"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::projectDotField (cognitive 45): (anonymous)::projectDotField has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 16 (27 pts), if/else 3 (7 pts), boolean chains 4, match/switch 1 (3 pts), other 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1ff8086f4410d3fff16a3cfc85573a585fffc2d80bc4212679df36628f85f9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::responses::build_responses_wire_body (cognitive 44): codewhale_engine::client::responses::build_responses_wire_body has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (30 pts), match/switch 4 (9 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/responses.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e48e9b9f67b83e427d2401b719d8231b7069b1138417a6d1967b9711b7872d3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::desired_owners_from (cognitive 44): codewhale_engine::extension_host::desired_owners_from has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (33 pts), match/switch 3 (8 pts), loops 2, boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":3233}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4982b5234c4877338156c105b541beeefc906ba3a7eb709b051cda96b5fffd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::session_image_prune::prune_clipboard_images (cognitive 44): codewhale_engine::session_image_prune::prune_clipboard_images has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 6 (8 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_image_prune.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a732e002d9c155d53540f8756bd455b97b4493a28f0720d8cb2d49750d0ac9a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_palette::adapt::nearest_ansi16 (cognitive 44): codewhale_palette::adapt::nearest_ansi16 has cognitive complexity 44 (threshold 15). Drivers by points: if/else 28 (39 pts), boolean chains 5 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"84792b28f8f0ed42e552accf87e336b4dc348032717d8b1fa94b5de8f7911877"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::tool_output::output_projection (cognitive 44): codewhale_tui::tui::history::tool_output::output_projection has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (35 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/tool_output.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9c408350b28b7c2c604101d2ea885b183898efdadaa7280b5f10b302efc296f"}},{"ruleId":"D2","level":"warning","message":{"text":"signal.buildPyramid (cognitive 44): signal.buildPyramid has cognitive complexity 44 (threshold 15). Drivers by points: loops 11 (21 pts), if/else 10 (20 pts), boolean chains 3 (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/signal.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50c874a80e81929474382887daecf0ea03d44ae30415cdb7d5db0debc9c3a42"}},{"ruleId":"D2","level":"warning","message":{"text":"ingest.importTrace (cognitive 44): ingest.importTrace has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (23 pts), ternaries 10 (12 pts), boolean chains 6, loops 2, error handling 1 (nesting depth added 6). Of this number, 27 points are the body\u0027s own statements and 17 belong to 5 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"752318ea00afa8821f4b39b758ec474709ebca5efe711ca99ed3a32ed64b00bd"}},{"ruleId":"D2","level":"warning","message":{"text":"product-usage.validateEnvelope (cognitive 44): product-usage.validateEnvelope has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 9, ternaries 2 (5 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/telemetry/product-usage.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0effd0c15505a15b3badb24ee189937ebb6cfc0217feb6e966d706a6765f6d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::metrics::stats::collect (cognitive 43): codewhale_cli::metrics::stats::collect has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 7 (18 pts), loops 3 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics/stats.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf481290cdcdf1b8cba3c14645a96301f195d2ec70cb7e9c30778308e4f4801"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::process_tool_results (cognitive 43): Engine::process_tool_results has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 5, 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/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4521}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2558132df89cdcb48d327f756a8d62f0c4facc8b7e4abecfe087a3175596f85"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::catalog_delta_from_models_body (cognitive 43): codewhale_engine::client::catalog_delta_from_models_body has cognitive complexity 43 (threshold 15). Drivers by points: if/else 26 (38 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":6195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc0ca0afcfbfc38a5079f3c337294bed104fc7e8d9af9217d20bd78850a461d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::integrations::dsh::compute_status (cognitive 43): codewhale_tui::integrations::dsh::compute_status has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 7 (26 pts), if/else 11 (17 pts) (nesting depth added 25). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/mod.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e265a10388f2efb73592c6e0d56660fef2240ef313f031e453ec5122724780b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.monitorLoop (cognitive 43): index.monitorLoop has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 7, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 18). Of this number, 35 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bbc146d84fc3635ba56ec0f50bf1424b67f90710b97b958ba8edf95d9900632"}},{"ruleId":"D2","level":"warning","message":{"text":"facts-publish.main (cognitive 43): facts-publish.main has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (33 pts), ternaries 3 (6 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0a401da0215b16bbc1f80b26e9ab61c088bd40b2d88bc125b4cd4c2b9b55f0"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControlController::try_next_event (cognitive 42): RemoteControlController::try_next_event has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 7, match/switch 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/app-server/src/remote_control.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"30729609eda194db32d94a4093faa76b9fe31dfb7ef5c813cb733e9df7a8cdb6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_command_contract::metrics::build_groups (cognitive 42): codewhale_command_contract::metrics::build_groups has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (38 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/command-contract/src/metrics.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"638bec73a0c16f8c02fe8c88cb33b8f6a7f1862aa0f8ed28e53481a8e1cf83c8"}},{"ruleId":"D2","level":"warning","message":{"text":"SseTransport::run_sse_loop (cognitive 42): SseTransport::run_sse_loop has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 6 (14 pts), loops 3 (6 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/sse.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b4c5c7189b786008be1818f83d656ed1c7da0d898f6f526238855ad8cadd01"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::supervisor::native_runtime_libraries (cognitive 42): codewhale_engine::extension_host::supervisor::native_runtime_libraries has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (2 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/engine/src/extension_host/supervisor.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6931eaf89d7e83df7ee85644a590bf432d509ea1d30554a1597622c6260c9f0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::spawn_subagent_from_input (cognitive 42): codewhale_engine::tools::subagent::spawn_subagent_from_input has cognitive complexity 42 (threshold 15). Drivers by points: if/else 24 (31 pts), match/switch 7 (8 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":15581}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad36e8517cac7b00dad336a255bb35a6f5240a621c4a664f471220ce2f2b427"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::registry::copy_bundle_directory_fd (cognitive 42): codewhale_plugins::registry::copy_bundle_directory_fd has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (36 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":2581}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d05795f48d19057b3c149caf6d0759e3b7ce17de676e2b6a2417437e14581a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::render_picker_model_hint (cognitive 42): codewhale_tui::tui::model_picker::render_picker_model_hint has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (30 pts), match/switch 7 (10 pts), boolean chains 2 (nesting depth added 10). 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/tui/src/tui/model_picker.rs"},"region":{"startLine":4015}}}],"partialFingerprints":{"codehealthFindingId/v1":"589503e5b418101950b3e6542962b4a5b7b0e71d57dfcf76e35a4b75bdf08fea"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui_kit::markdown_render::render_line_with_links_tagged (cognitive 42): codewhale_tui_kit::markdown_render::render_line_with_links_tagged has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 4 (7 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/tui-kit/src/markdown_render.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b0475841681334a0d3f6b35e3d1a79572d0993157781e2e91152cd2a8e43a9"}},{"ruleId":"D2","level":"warning","message":{"text":"docs-search.DocsSearch (cognitive 42): docs-search.DocsSearch has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 19, if/else 15 (16 pts), ternaries 5, error handling 1, loops 1 (nesting depth added 1). Most of this is not in the body itself: 14 of the 42 points are its own statements and the rest belongs to 14 function items inside it that branch (a function literal at line 152, a function literal at line 219, selectSearchResult, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6710368eb954e1e53c91d899d733d95230cd68b8bed066976ed5e2939fecab5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::exec_agent::persist_exec_session (cognitive 41): codewhale_app_server::exec_agent::persist_exec_session has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":3366}}}],"partialFingerprints":{"codehealthFindingId/v1":"981cf9be9419f6927f9f2c0f1708b5aa2da5c1a51136f150b06d06c9b3b07414"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::run_http_server (cognitive 41): codewhale_app_server::runtime_api::run_http_server has cognitive complexity 41 (threshold 15). Drivers by points: if/else 21 (29 pts), match/switch 6 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b07e52fde3eafc2d2fad20edb039d90d3390140801ca8c2782020038a26449"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::metrics::read_session_file (cognitive 41): codewhale_cli::metrics::read_session_file has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (28 pts), match/switch 5 (8 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"739017831c230c9d398bc10bfa9a192197e8a96cea66578767fc5a5511a92e0e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::hooks::executor::sanitize_hook_denial_reason (cognitive 41): codewhale_engine::hooks::executor::sanitize_hook_denial_reason has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8a8cbe48818ed1336759938f600cefe4627edaaebf7d274a44753b8171b85b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_palette::user_theme::apply_colors (cognitive 41): codewhale_palette::user_theme::apply_colors has cognitive complexity 41 (threshold 15). Drivers by points: if/else 41. 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/palette/src/user_theme.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72d9795e7a6d617906e3b0fd8812eb98308b667c6f89b8e38c8c02e1c90da0a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::marketplace::parsers::codewhale::parse_codewhale_entry (cognitive 41): codewhale_plugins::marketplace::parsers::codewhale::parse_codewhale_entry has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 8, match/switch 4 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/codewhale.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c364bf16fa38fdba6c9f5a08bb09de74bbfe8563f666ec15388901f4e71b675"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::terminal::poll (cognitive 41): codewhale_tui::tui::work_surface::terminal::poll has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 4 (12 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3de71d87c0cf061cbe22f915cddf5d308e5604b5e6afadcd75ed24077a422cb"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptRun::project_turn (cognitive 40): PromptRun::project_turn has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 5 (13 pts), boolean chains 5, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/acp_server/runtime.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"99023710128db7a3f40f6fc33a99e1809dd2e2038d676458262064a9391b7693"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionHostManager::activate_owner (cognitive 40): ExtensionHostManager::activate_owner has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 8 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":2462}}}],"partialFingerprints":{"codehealthFindingId/v1":"73de1f34cab576a6013d5535c1554471ad8dc6bf6ac84da5711a4e02dbb3ac52"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetManager::reconcile_coordination_worker_statuses (cognitive 40): FleetManager::reconcile_coordination_worker_statuses has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 13, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"baca73d29516c55da95255ea85fe09dd663a708884eb379fe806ff2cb9d1130e"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetManager::start_leased_workers (cognitive 40): FleetManager::start_leased_workers has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (29 pts), match/switch 3 (6 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"320074384555c99b2ec845a69ea5631e4997efe12867cca3de472dbfaa400ff1"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager::remove_session (cognitive 40): SessionManager::remove_session has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 7 (10 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":6237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eabb52d3b13f443c6039f6739397f870711e634af52205b8c0b368daedeb37a"}},{"ruleId":"D2","level":"warning","message":{"text":"CoordinationLedger::validate_replay (cognitive 40): CoordinationLedger::validate_replay has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 9, loops 6 (7 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/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"28447d1a5d4cf95f7ec74baca58443fa6ead57e6aa904c2a3aaa4db57a58e840"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::config::save_api_key_for_identity_unlocked (cognitive 40): codewhale_runtime::config::save_api_key_for_identity_unlocked has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 3 (11 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":11839}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f760d38abb26ade6c4cf672b9263ce5527eca0aa77f0ba14fa0cdfa96b2720"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigView::handle_editing_key (cognitive 40): ConfigView::handle_editing_key has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 1, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":3635}}}],"partialFingerprints":{"codehealthFindingId/v1":"3244c64d73d4cfab6d35a99d31751cff910d9c3c409b6d4aeb7815253e3e866a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::agent_details::project_agent_details (cognitive 40): codewhale_tui::tui::agent_details::project_agent_details has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_details.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"9385097bcf0af3c6aec88411b76ec6209c7047f7647306761da6b6e0b47f35e5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_loaded_session_with_goal (cognitive 40): codewhale_tui::tui::ui::apply::apply_loaded_session_with_goal has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 5, loops 3 (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/tui/src/tui/ui/apply.rs"},"region":{"startLine":4552}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b88891876ce3b2680338af7e7cc995bd25e3452c0179e53a57c3827cb410e0e"}},{"ruleId":"D2","level":"warning","message":{"text":"dot-field.projectDotField (cognitive 40): dot-field.projectDotField has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 13 (25 pts), if/else 3 (7 pts), boolean chains 4, match/switch 1 (3 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/dot-field.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca39ec5f63aececb52f5058986e0b6c239b1538335a14de12f0148f16a23afd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::work::write_work_result (cognitive 39): codewhale_account_cli::work::write_work_result has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (21 pts), loops 4 (9 pts), match/switch 5 (6 pts), boolean chains 3 (nesting depth added 9). 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/account-cli/src/work.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc231add6daf4456587043552e7fa681bb7b2899fa67ce2ad9c8daffded02585"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_network::scrub (cognitive 39): codewhale_engine::extension_host::dsh_network::scrub has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 6 (14 pts), boolean chains 3 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d97339feec6bbb45e0989648dc7b92b5b850ba563539d26c2662dec1aa38ec"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::session_secret_scrub::scrub_value (cognitive 39): codewhale_engine::session_secret_scrub::scrub_value has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 2 (7 pts), boolean chains 2, match/switch 1 (nesting depth added 25). 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/engine/src/session_secret_scrub.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f03c7553cbbd35f307d067c099364543fd4870f0c9d7de2f7ed1b938d9505c"}},{"ruleId":"D2","level":"warning","message":{"text":"Expander::record (cognitive 39): Expander::record has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 5 (12 pts), match/switch 3 (8 pts), boolean chains 6 (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/execpolicy/src/shell_expand.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83d753160cd8169ea6f23e5d6d0b3b8a9ded5e4fc929b3bc21481771dffee1c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::registry::gc::collect_children (cognitive 39): codewhale_plugins::registry::gc::collect_children has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry/gc.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd079de49d23c6334dda1ccebf07f28af6610380d413358e5a6b33e135f0528"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_release::installs::classify (cognitive 39): codewhale_release::installs::classify has cognitive complexity 39 (threshold 15). Drivers by points: if/else 25 (33 pts), boolean chains 6 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/installs.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfb250975fd73b03516a708f60ce35808bdd91ca43d8c854cb46630a9ca4983"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skill_install::install::sync_one_skill (cognitive 39): codewhale_skill_install::install::sync_one_skill has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/install.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f55639ea1d5d597fbe01d4df794bae7e02867d6d5b0fccbcda729834b1fd1d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::parse_rows (cognitive 39): codewhale_tui::tui::history::latex_render::parse_rows has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 3 (10 pts), boolean chains 2 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"67914dd248b4a5b3c27e29e100005feef11a8a2052d5d5b66c6ef8e76ac1499e"}},{"ruleId":"D2","level":"warning","message":{"text":"qr.penalty (cognitive 39): qr.penalty has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 11 (17 pts), ternaries 2 (8 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (qr.penalty::scanForFinderLike) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cea81ecfac2e43524e64ff2e78501265ac850653d4ef4f8a90b9c2ac70650e0"}},{"ruleId":"D2","level":"warning","message":{"text":"merch-interest.MerchInterest (cognitive 39): merch-interest.MerchInterest has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 10 (22 pts), if/else 10 (11 pts), boolean chains 5, error handling 1 (nesting depth added 13). Most of this is not in the body itself: 11 of the 39 points are its own statements and the rest belongs to 7 function items inside it that branch (join, a function literal at line 71, a function literal at line 35, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-interest.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"117c53a489575d46fa70bcfc015a42020efd610d079fc2edc9322c2738668a4b"}},{"ruleId":"D2","level":"warning","message":{"text":"cloud-facts.verifyEnvelope (cognitive 39): cloud-facts.verifyEnvelope has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 10, ternaries 3 (6 pts), error handling 3 (4 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8c8a250ba3dc6775f4a00a6b16d072966127980578aefa2e981f6bb3f5343c"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::await_tool_approval (cognitive 38): Engine::await_tool_approval has cognitive complexity 38 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 5 (12 pts), boolean chains 4, 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/engine/src/core/engine/approval.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3404361f8f443b07e0a113ef5a4f510054f178227c1203b2757794e1f1fe878f"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::run_tool_batch_phase (cognitive 38): Engine::run_tool_batch_phase has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (26 pts), boolean chains 6, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 9). 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/engine/src/core/engine/turn_loop/tool_batch.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b71d6afb5a8ab3c6fc7cacd14c1b3a4c36b773ee261b4b2cd195a7692de5e49"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::llm_client::with_retry (cognitive 38): codewhale_engine::llm_client::with_retry has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/llm_client/mod.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"0927af4223e927e7b3bc92397b4ddc544ae607302ea1bd98233676b7fd98135a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::agent_plugin::validate_mcp_server_json (cognitive 38): codewhale_plugins::agent_plugin::validate_mcp_server_json has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 5, loops 4 (5 pts), match/switch 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/agent_plugin.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"00afb512d4f6733488a2e0678b526f326de06a250bcb1dbbccf67544073d42d5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::registry::gc::observe (cognitive 38): codewhale_plugins::registry::gc::observe has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry/gc.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"370b3ef580227f914f295aa5415a74903148f760dd7744aa12de9da542c0f9ae"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skills::merge_watched_directories (cognitive 38): codewhale_skills::merge_watched_directories has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/lib.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc726972daf6840ded1468950de59f5ca616dd896fb18d738c6c748ac389d1d1"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetListView::render_rows (cognitive 38): FleetListView::render_rows has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (25 pts), boolean chains 6, loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_list.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e4f9d44d644398932650ad14b1f11e297f5c14ce6ac5f8b89e4775663b0808"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::views::render_settings_category_strip (cognitive 38): codewhale_tui::tui::views::render_settings_category_strip has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23 (34 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":4950}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdd6a73c8b6c82e306f1ef2403c3d668fc04997b072674cbc9ce6d06211d7fa"}},{"ruleId":"D2","level":"warning","message":{"text":"pet-recorder.createPetRecorder (cognitive 38): pet-recorder.createPetRecorder has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 7, loops 2 (4 pts), error handling 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":"pet/scripts/lib/pet-recorder.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b624c39d6efe834873538d78ffa889221a6b50a66511a42e02f5e2404516087"}},{"ruleId":"D2","level":"warning","message":{"text":"parseProviderDescriptors (cognitive 38): parseProviderDescriptors has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 22, if/else 8 (11 pts), other 2, error handling 1, loops 1, ternaries 1 (nesting depth added 3). Of this number, 36 points are the body\u0027s own statements and 2 belong to 6 function literals inside it that branch. 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":"web/lib/provider-descriptors.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfde8fb5f26bdbc08badb5dda8e50b06eace1c2470c86a1c80f7b78280e12ee"}},{"ruleId":"D2","level":"warning","message":{"text":"PromptRun::project_event (cognitive 37): PromptRun::project_event has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 5, match/switch 2 (4 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/app-server/src/acp_server/runtime.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"234395fd1d011e1f7a176ed02e0f809a8327beaa58802763f93f7f3624dfcd14"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::validated_patch (cognitive 37): codewhale_app_server::runtime_api::git::validated_patch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 2 (6 pts), boolean chains 3, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":1952}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75fa825fe53267d39926f2f22ba3925d4429d2ac3e247121d5bb00f815dcf40"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::turns::message_native_thread (cognitive 37): codewhale_app_server::turns::message_native_thread has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 6 (12 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/turns.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"2094af4987650f7b539818f8e5cb5a6737f714d5c11fea1d59990c119a0f4e0d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::config_bundles::prepare_import (cognitive 37): codewhale_cli::config_bundles::prepare_import has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 6 (9 pts), boolean chains 4, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/config_bundles.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"416b37f8bee00a6f1770ba36b160b5ef3d4c3c99b02f62a5f0640db5557ad953"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cloud_facts::refresh_using (cognitive 37): codewhale_cloud_facts::refresh_using has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (31 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cloud-facts/src/lib.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc41dc30b8baf846a9f2ec6ae17d6bf328de4076f960b359d4304d12af630a1"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::create_thread_with_reserved_id (cognitive 37): RuntimeThreadManager::create_thread_with_reserved_id has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 6 (7 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7876}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8082626a8c85e00bdc74119be52d932bd5bfd60b002fc12efe14f688e4df7e9"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::run_extension_command_inner (cognitive 37): RuntimeThreadManager::run_extension_command_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 4 (6 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13468}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bf2bf4fe884fafd8a04f646370bc6a9a4ea2d21fdc9c07121aa5e02689d2bc"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionCostSnapshot::project_usage_record_inner (cognitive 37): SessionCostSnapshot::project_usage_record_inner has cognitive complexity 37 (threshold 15). Drivers by points: if/else 24 (32 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c8bbc9444aa8e9d8790a697bfc353c90ef2b3319276b5fed98784b78dca1db"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::prompts::guard_instruction_prefix (cognitive 37): codewhale_engine::prompts::guard_instruction_prefix has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f935e3a9ac98e4ae65b88494bd7fd6408fbb6899e9b74e67086dd37bf61f90"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::session_secret_scrub::session_files (cognitive 37): codewhale_engine::session_secret_scrub::session_files has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 5 (9 pts), boolean chains 5, match/switch 2 (5 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/engine/src/session_secret_scrub.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02df1c3fce24addf3479b0e69c5649bb4c9317d1ed32c4e1d16391127b4e81b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::apply_patch::build_pending_writes_from_patches (cognitive 37): codewhale_engine::tools::apply_patch::build_pending_writes_from_patches has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (31 pts), boolean chains 5, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/apply_patch.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb2b11bdb908453f268f5378ead696b18bf29ced339ce588b982271caf3c3cb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::lifecycle::compact_row (cognitive 37): codewhale_engine::tools::subagent::lifecycle::compact_row has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (26 pts), loops 2 (6 pts), boolean chains 3, match/switch 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/lifecycle.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6895d4fd67cbb993153b664f52adb47d15099d6f3d16bcfd4cb1aa9dace070"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web::extract::html_attribute_value (cognitive 37): codewhale_engine::tools::web::extract::html_attribute_value has cognitive complexity 37 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 6 (11 pts), boolean chains 10 (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/engine/src/tools/web/extract.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"1655613c10cb4e2f141e41293413da132ad7c72c5efd671a83b65b3fa5606991"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow::structured_plan_to_workflow_spec (cognitive 37): codewhale_engine::tools::workflow::structured_plan_to_workflow_spec has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"150257bd51b00c796711dac5642046b2db3bd14c2ce9a140d3737fddaf73f8b1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow::report::render_run_report (cognitive 37): codewhale_engine::tools::workflow::report::render_run_report has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 6 (14 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/report.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9437491e942e4a055c2f18d2083ac9423579acbbb7e2ef519c71ccfc55a67985"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::render_tank (cognitive 37): codewhale_tui::tui::pet_watch::render_tank has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 10, loops 2 (7 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/tui/src/tui/pet_watch/mod.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7805ef25773fd8834fe648c49633b1a0ff3ef0d5d23b29b51c41425f4fc127"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::task_projection::refresh_active_task_panel (cognitive 37): codewhale_tui::tui::ui::task_projection::refresh_active_task_panel has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 8 (12 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/task_projection.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc85c86717eb2f3ddeed9fe85f8fa58e42fdccda55ac3f10396298e7b89c859e"}},{"ruleId":"D2","level":"warning","message":{"text":"draft-claim-lock.applyDraftLock (cognitive 37): draft-claim-lock.applyDraftLock has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 8, ternaries 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/draft-claim-lock.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dec96deda2493c01005dc0c458e146d20e3150a1532875df78b445e0451cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::activity (cognitive 37): (anonymous)::activity has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 14, ternaries 12, if/else 5 (6 pts), other 5 (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f6b70f7b1c1caeb484390b7d35599edf762a13973a375f26ba4d3b00fd6577"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::activity (cognitive 37): (anonymous)::activity has cognitive complexity 37 (threshold 15). Drivers by points: boolean chains 14, ternaries 12, if/else 5 (6 pts), other 5 (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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d7d8ba197213bee08b583a0c6826df8185e96bc53c6f75c5c99f44b9021e72"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::work::quote (cognitive 36): codewhale_account_cli::work::quote has cognitive complexity 36 (threshold 15). Drivers by points: if/else 23 (25 pts), boolean chains 9, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/work.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f18748018baa38b8e06a5657b0f51217cd348cb66374d90f4489498d19ec6b5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_commands::debug::cache_format::format_cache_calls (cognitive 36): codewhale_commands::debug::cache_format::format_cache_calls has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 5, match/switch 3 (5 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/commands/src/debug/cache_format.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c884bdb44e9b8c2058e8709456991a584f7482722b09c7bb91827e4da38a5507"}},{"ruleId":"D2","level":"warning","message":{"text":"UserInputWait::await_decision (cognitive 36): UserInputWait::await_decision has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/approval.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea57a32070a96b92a084a7d3d56f8ae875ed81b17382f4a68f0e4379e1d7c8fb"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskManager::worker_loop (cognitive 36): TaskManager::worker_loop has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":2935}}}],"partialFingerprints":{"codehealthFindingId/v1":"0def4fc2bea25b04dcecff9538c883478b3cc080c7fb9349042e690509c1d3e2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::receipts::tally (cognitive 36): codewhale_engine::receipts::tally has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 7 (21 pts), if/else 4 (11 pts), loops 2 (4 pts) (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":2045}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92ade45bb068d09003422beab4f37f6cf859d7fd75f39350edef3093baded19"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::git::plan_commits (cognitive 36): codewhale_engine::tools::git::plan_commits has cognitive complexity 36 (threshold 15). Drivers by points: loops 11 (17 pts), if/else 5 (14 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff3bd9c13cadc7f8e4462a0aeca10a3b281fc0666ed38bc7be1a24f00490f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::read_substitution (cognitive 36): codewhale_execpolicy::shell_expand::read_substitution has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (10 pts), boolean chains 6, match/switch 2 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/shell_expand.rs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"4994c98c499276afd9a2f06b7d393d170c026388793f415e945205a3a03702d5"}},{"ruleId":"D2","level":"warning","message":{"text":"LspManager::semantic_locations (cognitive 36): LspManager::semantic_locations has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 4 (8 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/lsp/src/lib.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5242eb5b6ddeb7902fa410f08dbe5cf089c834a50b4ebf6973978989b8911085"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginRegistry::apply_state (cognitive 36): PluginRegistry::apply_state has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 5 (13 pts), boolean chains 4, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9edb64236abeedd50b15ef72e02c6ad26f0241a26bde52d8d561cef3391509"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecCell::render_with_locale (cognitive 36): ExecCell::render_with_locale has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 14 (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/tui/src/tui/history.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc8e7e08cec0764c6af901a78478820f74e625b1dff191d520c8716c53f2f52"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::core_navigation_voice_host::capture_and_transcribe (cognitive 36): codewhale_tui::commands::core_navigation_voice_host::capture_and_transcribe has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/core_navigation_voice_host.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42a2a6567ab64dd3ceda5f060eec1ce1a964f85536e99ea07db66998edcfbc1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::memory::memory::memory (cognitive 36): codewhale_tui::commands::groups::memory::memory::memory has cognitive complexity 36 (threshold 15). Drivers by points: match/switch 13 (26 pts), if/else 5 (9 pts), boolean chains 1 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/memory/memory.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b087cfe19b433fcc68436164b9c46e4f8482f32bef030d2db53c5607f0badbda"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::pet_watch::tick (cognitive 36): codewhale_tui::tui::pet_watch::tick has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 7, loops 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/mod.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"774ef0a9a7348c00c766c58d91339f9f80269567b3211f5c516944b058f2cad0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_goal_snapshot_to_app (cognitive 36): codewhale_tui::tui::ui::apply::apply_goal_snapshot_to_app has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 11, match/switch 2 (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/tui/src/tui/ui/apply.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"a532eb8f15f59b31e9543634d5c7d2df0e31684d90aab53dfcafc209b23e8219"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::provider_routes::switch_provider_inner (cognitive 36): codewhale_tui::tui::ui::provider_routes::switch_provider_inner has cognitive complexity 36 (threshold 15). Drivers by points: if/else 25 (30 pts), boolean chains 4, match/switch 2 (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/tui/src/tui/ui/provider_routes.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9313583e2f37edfc25409bccdff2c0627aa314b80eefbccf8899ebcadaf363e"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSharedHost.start (cognitive 36): PetSharedHost.start has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (25 pts), ternaries 2 (6 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetShared.swift"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a731db195b14a1a5f661c306709622a110c35057bbd43f879a76b9fe6a3616b"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_mobile.html.noteTurnUsage (cognitive 36): runtime_mobile.html.noteTurnUsage has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 19, if/else 12 (17 pts) (nesting depth added 5). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_mobile.html"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0362da41cbce20523f4a363bf75db341e0b0fb598a408c95b58898535f00ac"}},{"ruleId":"D2","level":"warning","message":{"text":"compiled-hosts.parseCatalog (cognitive 36): compiled-hosts.parseCatalog has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 9, loops 2 (3 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/compiled-hosts.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3b286fd735cea89eb3fb85f4cfc9daa38e84fd14a8dd795df4d91f153cbd96"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::get_settings_schema (cognitive 35): codewhale_app_server::runtime_api::get_settings_schema has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (19 pts), match/switch 7 (10 pts), boolean chains 6 (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/app-server/src/runtime_api.rs"},"region":{"startLine":14056}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e10f330322c692845bad3c4b89297e4d7a8a9178ecfc2a3da4b2b6c46e9115e"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::ty (cognitive 35): Builder::ty has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"524956282ce0dc3a50fe996b00f5be1cb563cc2b8b131c4973f28d7bd4d227f0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_config::catalog::offerings_from_models_dev (cognitive 35): codewhale_config::catalog::offerings_from_models_dev has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/catalog.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"07aea25665bafc12a75a3fe76e1e2ccee37c43d192479ed84da6bd8b8dec929b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_config::private_directory::open_owned_directory (cognitive 35): codewhale_config::private_directory::open_owned_directory has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c1dcff236491f6e186cf1ec287c8bcb60494bc4c1d87f1ba1c0959bfdd42de"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_config::responses_dialect_data::parse (cognitive 35): codewhale_config::responses_dialect_data::parse has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (7 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/responses_dialect_data.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeb22f120a5bb8eac5bb04aed39647b2063b882d6117cd0dd1a6ab57f490561"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhaleClient::handle_responses_message (cognitive 35): CodewhaleClient::handle_responses_message has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/responses.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d7c1217f299daaa4ad245c4f329776513b1baf939a3656b1116a7379cee4dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::build_request_manifest (cognitive 35): Engine::build_request_manifest has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19, match/switch 10 (12 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/preview.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b4b61c6b89585feb1b2a53895099ecd1b98812cb0c265a81be64c58a749217"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentManager::with_store_transaction (cognitive 35): SubAgentManager::with_store_transaction has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 8, loops 3, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":5999}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99983d150ea563637a41aaabc8ff81690fce81072053ada3e05ffa1ed07f1ad"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::analyze_command (cognitive 35): codewhale_execpolicy::command_safety::analyze_command has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 12, loops 2 (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/execpolicy/src/command_safety.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d88f6cdcc177a8078b2f5720619a918da91130c99cd01b3fa7d03de4a05a3c0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skill_install::install::scan_tarball_entries (cognitive 35): codewhale_skill_install::install::scan_tarball_entries has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, match/switch 3 (5 pts), loops 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/install.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83637ec8165017c58b90aba132c28432c21046530d74dfb9ab643782487a009"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skill_install::install::extract_entries (cognitive 35): codewhale_skill_install::install::extract_entries has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/install.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16e486ba5e83a922840f2bb796e2c182ab81703befcecf324df33ce72763e34"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelPickerView::render_route (cognitive 35): ModelPickerView::render_route has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 6, match/switch 4 (5 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/tui/src/tui/model_picker.rs"},"region":{"startLine":4546}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e6fcf51a890e95deaace8327770a971a7db93856738271cd1520bcbf065a00"}},{"ruleId":"D2","level":"warning","message":{"text":"PendingState::absorb_publication (cognitive 35): PendingState::absorb_publication has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 7, match/switch 1 (3 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/tui/src/tui/persistence_actor.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd251d6acf9bb0617f10261700a3f1660996d266c6dd779435ce8015c4bbff85"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::session::export::parse_request (cognitive 35): codewhale_tui::commands::groups::session::export::parse_request has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 4 (8 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/export.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1913dfdd324090facfa12a83ec89361a1fe0497f7b4660a7ccfdd7517074fae"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::focus_texture::apply_focus_texture (cognitive 35): codewhale_tui::tui::focus_texture::apply_focus_texture has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/focus_texture.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e43175b622c9adb95448686262159d3cd088b5479136580de57af1dfa0571f7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::tool_routing::handle_tool_call_started (cognitive 35): codewhale_tui::tui::tool_routing::handle_tool_call_started has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 5, match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/tool_routing.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"435a1a223ae0e56b67dec4564e21a2a3e112b26cbbe1a36a72a269eb4425d26e"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSharedHabitat.body (cognitive 35): PetSharedHabitat.body has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, ternaries 7 (8 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetShared.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbaa1f9e5c25d13ca545d97836f42ea77a9a50f35ee6b5c5a36e246a064f1d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"install.withRetry (cognitive 35): install.withRetry has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 10, error handling 1 (2 pts), ternaries 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b82649748eb9542c5344b26e8329917d8b867e90d5d4b072fcacc0218feac2"}},{"ruleId":"D2","level":"warning","message":{"text":"report-contribution-cohorts.contributionCohorts (cognitive 35): report-contribution-cohorts.contributionCohorts has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 7, loops 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/scripts/report-contribution-cohorts.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ef84d9d8daa5281fa8d3fb9f035d2afcc0805077facc2adb0d942b4accd0fc"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight.tokenize (cognitive 35): highlight.tokenize has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 3 (7 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 16). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/ratatui/highlight.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f57623984440ff289378710eb7f28b2b4a77b66f0133d3802c03e91b0976cd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::remote_control::parse_remote_command (cognitive 34): codewhale_app_server::remote_control::parse_remote_command has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 10, match/switch 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":4628}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4defd593d6f8c17d48bb17d6970c5546dfa3bc3271e7761bb7ba8453a3449fc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::check_preconditions (cognitive 34): codewhale_app_server::runtime_api::git::check_preconditions has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 3 (7 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":1723}}}],"partialFingerprints":{"codehealthFindingId/v1":"f559721e1028afbee4088975a179a664c7491ad0ee7c6329daef5f81ad937f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::finish (cognitive 34): Collector::finish has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 5 (8 pts), boolean chains 3, 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/cli/src/metrics/stats.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad55274919bf5150a91862af297a9b783b8f3539127998ac40676e4a15707012"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_commands::debug::cache_format::format_cache_stats (cognitive 34): codewhale_commands::debug::cache_format::format_cache_stats has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20 (32 pts), match/switch 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache_format.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd69fb4144839d8ed1010cfdc3bddba77b42aada2d854ef4f02c3b65dfb397c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::gate_nested_call (cognitive 34): Engine::gate_nested_call has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (21 pts), match/switch 4 (7 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4130}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc8d5ab5fd60409be04b2dea3eff3e05407606451d128b571e53f8f35e734de"}},{"ruleId":"D2","level":"warning","message":{"text":"CoordinationLedger::register_claim_in_scope (cognitive 34): CoordinationLedger::register_claim_in_scope has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 9, loops 3 (5 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"5323ef80cd23f3954541fa96ff92f15e5f7aad36433961da75d00e1151bd9bbe"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentManager::cleanup_inner (cognitive 34): SubAgentManager::cleanup_inner has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 10, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":11113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6bd118b5e8679b1bbeec084071ac21a2359448d8e85299d0c57533eb2f88719"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowRunJournal::hydrate_runs (cognitive 34): WorkflowRunJournal::hydrate_runs has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 4 (6 pts), match/switch 3 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e62d9bda9cb28f81542656b3691c259d12cb34700b577ad406dda98593a1409"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::supervisor::host_denied_read_paths (cognitive 34): codewhale_engine::extension_host::supervisor::host_denied_read_paths has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 3 (6 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb54f60556e2adb186293e52fd6947049aaea472eba956adaa8721a786b295d2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::fleet::ledger::apply_record (cognitive 34): codewhale_engine::fleet::ledger::apply_record has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"8125d7da6a7dc6b214bede3cada1189550765acb8b66fad5145c377ae5674f80"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::purge::cascade_tool_pair_removals (cognitive 34): codewhale_engine::purge::cascade_tool_pair_removals has cognitive complexity 34 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 5 (9 pts), match/switch 2 (7 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/purge.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef43b229d8420327dfccb05460975b5b568b57f54eba005cc6bb65f7519ce6cd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::route_runtime::classify_provider_route_preflight_next_step (cognitive 34): codewhale_engine::route_runtime::classify_provider_route_preflight_next_step has cognitive complexity 34 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 8, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_runtime.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4cb6dfe591207d2a2dad51fb19e6fd48e4b02fdc9213a9927dc03a6e05b7d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::review_triage::triage_review (cognitive 34): codewhale_engine::tools::review_triage::triage_review has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 4, loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_triage.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d627f09dacf07bc051094462df5d41b99aec27bcca44d1deed0167a050d5d70"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::shell_input (cognitive 34): codewhale_execpolicy::shell_expand::shell_input has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 6, match/switch 2 (5 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/shell_expand.rs"},"region":{"startLine":2389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9580942b1b1cbb71af558c311929c2f06aa18f4ec052c30192c08a3a9ebff2f7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::providers::validate_declarations (cognitive 34): codewhale_plugins::providers::validate_declarations has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 9, loops 3 (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/plugins/src/providers.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b8ef5cb1cdabad50dc51c52b8611442553ce8f2bad1b51a48cd626c81f1f0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings::set (cognitive 34): Settings::set has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 3 (5 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/runtime/src/settings.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7b66d5032670ed22c7a17f873672cf8a1363f463343c65908e69764616e1f8"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountLoginView::render (cognitive 34): AccountLoginView::render has cognitive complexity 34 (threshold 15). Drivers by points: if/else 24 (28 pts), boolean chains 3, loops 2 (3 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/tui/src/tui/account_login.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1883d16c930f147b6547a9a6352532245bc0a17445f5012308c8407e0d57ac8"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposerWidget::frame (cognitive 34): ComposerWidget::frame has cognitive complexity 34 (threshold 15). Drivers by points: if/else 27 (32 pts), boolean chains 2 (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/tui/src/tui/widgets/mod.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"681cd8ce982f698317c6fbd458e041949395094a085f39f3896a37a4fc888cd6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::prepare_mounted_session (cognitive 34): codewhale_tui::prepare_mounted_session has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (23 pts), match/switch 6 (9 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":10911}}}],"partialFingerprints":{"codehealthFindingId/v1":"488bda0b1c386be2f7cd60f871f0fa19766e9949bf825cc1c48f079f5936b8dc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::mouse_ui::handle_composer_mouse (cognitive 34): codewhale_tui::tui::mouse_ui::handle_composer_mouse has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/mouse_ui.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"873229526a712ad8614558edf44ae4353a10926aad279dd5d87b225c857ce5c5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::setup::constitution_ratification_text (cognitive 34): codewhale_tui::tui::setup::constitution_ratification_text has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 32 (34 pts) (nesting depth added 2). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/tui/src/tui/setup/mod.rs"},"region":{"startLine":4412}}}],"partialFingerprints":{"codehealthFindingId/v1":"94830bfdc8b09228d6906ab7871a8f41238246956a6e869a83c5dbcd665a920f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::run_with (cognitive 33): codewhale_account_cli::run_with has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 6 (16 pts), if/else 7 (13 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bd683660293e47e5bf61b9cd8ee318314a3140abe2bb0a1526701ed3ece59c"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControlController::queue_runtime_envelope_inner (cognitive 33): RemoteControlController::queue_runtime_envelope_inner has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":2737}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de143c46a83cd62c8aea19a96198bacacd9441559aefcbee7a1f426a5902eda"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::attribute_window (cognitive 33): codewhale_app_server::runtime_api::attribute_window has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (13 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":9480}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4de02a6c6e4da70ab7263b3781d8efa0798ce03d1c38c303505bda65e289eff"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::union (cognitive 33): Builder::union has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 4 (7 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"67495782099ec67db12af378070690390a5e828cb938d31f674fc12fcc2999f4"}},{"ruleId":"D2","level":"warning","message":{"text":"RustOut::fields (cognitive 33): RustOut::fields has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 2 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74affd7c9d8c92f3f234a32316e2f535175c71a6833657b2ad01e0ff7e96b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::new_admitted_with_subagent_manager (cognitive 33): Engine::new_admitted_with_subagent_manager has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17, match/switch 9 (11 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bf5ee8aaa33acc770f6238edae290c2338d8fee2473a5338e37bd98d59d925"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::reconcile_restored_work_bindings (cognitive 33): Engine::reconcile_restored_work_bindings has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":8665}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b08a0a40e617daba6c4cdf5e1cbfbd96b57a9fed91f1ab74ffa3b5af83453a"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager::apply_late_usage_result (cognitive 33): SessionManager::apply_late_usage_result has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b119cc6803246405f6635e10981da1fec268bf56ca69cddd76080457289ead"}},{"ruleId":"D2","level":"warning","message":{"text":"LoadSkillTool::execute (cognitive 33): LoadSkillTool::execute has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/skill.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb55253f661e790c4d3f0a5ec08804a9e2b9f670021c41c0f744b2989edde89"}},{"ruleId":"D2","level":"warning","message":{"text":"UserInputRequest::validate_response (cognitive 33): UserInputRequest::validate_response has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 9, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/user_input.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87a3854b377f6acbd42339347e6548198b9f4144371b79347fe063d81c35621"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::automation_manager::fire_due_triggers_with (cognitive 33): codewhale_engine::automation_manager::fire_due_triggers_with has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3354}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54b45970ed29fcf32a07a0ceb43b8ad9e865d73c13967ffd175d887bb1332b7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::automation_manager::reconcile_run_statuses_shared (cognitive 33): codewhale_engine::automation_manager::reconcile_run_statuses_shared has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9923ca4716df054c9d2c1f63c09b6d32ec23fa306996bfb319bcf2275e68ead"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::windows::edit_acl (cognitive 33): codewhale_engine::extension_host::windows::edit_acl has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 8, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd031fc4578a42a357a0d23cf07ef049da42e19f391c9d261ef87e6eb991a353"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::fleet::control::execute_fleet_control_with (cognitive 33): codewhale_engine::fleet::control::execute_fleet_control_with has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 8 (16 pts) (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/control.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a2e30de1da1fd6357d8bc5ed7ee4446b485243890638a0ae78813b5dc88a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::mcp::snapshot_from_config (cognitive 33): codewhale_engine::mcp::snapshot_from_config has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":8580}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32dbd8d7dc2c9fa9ad938938a9c91a0bb9db27fe6f734b7d75980c2638ee59c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::session_manager::find_json_key (cognitive 33): codewhale_engine::session_manager::find_json_key has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (6 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":7142}}}],"partialFingerprints":{"codehealthFindingId/v1":"03875991f8668e756607ee379c7ddc5a40ee9c4e10ecdbbedcd6ee9922499e12"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::file_search::search_files (cognitive 33): codewhale_engine::tools::file_search::search_files has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (20 pts), match/switch 3 (6 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file_search.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"73323a2219dbeebf4caeada428a1ae7557df43527b06d094b2d5c7fe9afbd6eb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::shell::execute_foreground_via_background (cognitive 33): codewhale_engine::tools::shell::execute_foreground_via_background has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":5145}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b4f6da70e18c65ca38f1f3355e983e30fada6875bab1ca6b6ccd37b12a17ba"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::run_prepared_subagent_task (cognitive 33): codewhale_engine::tools::subagent::run_prepared_subagent_task has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":12136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e14a21a2075171ac2e503cc607438bfffcb0472a3fb4c53b10a3f7ff1921f2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::tool_result_retrieval::resolve_spillover_reference (cognitive 33): codewhale_engine::tools::tool_result_retrieval::resolve_spillover_reference has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (27 pts), boolean chains 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2aae3b7e1160bac6d3ab1c395451ddb9492749b643cdb61fbffbf1bac29f32"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web_run::run_image_search (cognitive 33): codewhale_engine::tools::web_run::run_image_search has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc3b36ada885adac403ea7aeff500a1812e1762761a42a689536c48aca57fe0"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::default_model (cognitive 33): Config::default_model has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 13 (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/runtime/src/config.rs"},"region":{"startLine":5419}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c853722747f807bb814000e5ec9e4bd76e9de38d4ab2a2d670e26de5b180cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings::load_persisted_from_candidates_with_migration_unlocked (cognitive 33): Settings::load_persisted_from_candidates_with_migration_unlocked has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"de39710573872386916fa13870b0f5052efed13d03b5cb8d86675f6c894c4fab"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::config_persistence::migrate_legacy_route_preferences (cognitive 33): codewhale_runtime::config_persistence::migrate_legacy_route_preferences has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config_persistence.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8a870a921da5e5016fc9b3ce9fe7c8f5795c0ed2c5393610ae89acabd43f81"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetRosterView::render_body (cognitive 33): FleetRosterView::render_body has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (27 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_roster.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"032f9460164ca5eeda9ade91b584e7c92e8f06a95d4ef931ec3b9a8578145910"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::app::composer::strip_raw_mouse_report_runs (cognitive 33): codewhale_tui::tui::app::composer::strip_raw_mouse_report_runs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"43acbc30e48c3cc2f94feb75bb0475654f058f565357ef1bc6802ff175b63cde"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::effective_picker_metadata_with_codex (cognitive 33): codewhale_tui::tui::model_picker::effective_picker_metadata_with_codex has cognitive complexity 33 (threshold 15). Drivers by points: if/else 24 (25 pts), boolean chains 6, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6f54eab6e0f7d214e09d02b6d555434d5303f85ca9e7f8706be2f6d967b2d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::subagent_routing::format_task_detail (cognitive 33): codewhale_tui::tui::subagent_routing::format_task_detail has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (26 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/subagent_routing.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"d287629faddb3e50679879623ac0f6fe7b8c1af7bf6afbedc03bf428a9aff1fe"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::views::extensions::mcp_model (cognitive 33): codewhale_tui::tui::views::extensions::mcp_model has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17, boolean chains 11, match/switch 4 (5 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/extensions.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4396f648dd34d9c64e6c683069f70084c9c55231f63ce80237499d3ff2438720"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::input::handle_key (cognitive 33): codewhale_tui::tui::work_surface::input::handle_key has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 6, match/switch 3 (6 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/tui/src/tui/work_surface/input.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce70330fda8c4fad6bf583eac008e2695b6473bc4c2bfe2b188a2dff7bb2d027"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowPlan::from_config (cognitive 33): WorkflowPlan::from_config has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 7 (12 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/lib.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec247a7feb87800787f95fdd430e28283185c272cc320cdef856f5196cb5365e"}},{"ruleId":"D2","level":"warning","message":{"text":"markdown.renderMarkdown (cognitive 33): markdown.renderMarkdown has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (9 pts), ternaries 2 (7 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/markdown.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e452eb88cc8c51149f0f1d10e703920441e9ed830429e5dcb7494eac6be38e9b"}},{"ruleId":"D2","level":"warning","message":{"text":"ingest.fromOTLP (cognitive 33): ingest.fromOTLP has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 4 (9 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"a619eb821ffdaa6b62dd7382a090e0bf4579bd456ef2e65e60f7b8ec8c5e8a94"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountClient::connect_models_with_cancel (cognitive 32): AccountClient::connect_models_with_cancel has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/session.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f2ca36b20ee0bb1fa7606f91e91b4fb765015c87961327f3ae48ff9f317ded"}},{"ruleId":"D2","level":"warning","message":{"text":"ClientParser::feed (cognitive 32): ClientParser::feed has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (4 pts), match/switch 2 (4 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/app-server/src/runtime_api/computer_display.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"1382ce50811efc99c57fcc50d698aef3f96567d6e629cc84b15058f273963f7a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::thread_history::import_into_owner (cognitive 32): codewhale_app_server::runtime_api::thread_history::import_into_owner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (22 pts), match/switch 4 (5 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01c9f1a836161636930319d901dab2ff73e2da7f7eab51c97dd3cae647c9978"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogOffering::retain_fact_sources (cognitive 32): CatalogOffering::retain_fact_sources has cognitive complexity 32 (threshold 15). Drivers by points: if/else 27 (29 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/catalog.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e67c8ec072daec674e2252536df53e3f3dbaf99fe6f6c686264a1183e8bbbf"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_config::cloud_facts::catalog_patch::apply_patches (cognitive 32): codewhale_config::cloud_facts::catalog_patch::apply_patches has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/cloud_facts/catalog_patch.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afad0cd84485467ea90a4beb7d609a1a02866299be4f84704a9f48f2c555de7"}},{"ruleId":"D2","level":"warning","message":{"text":"CronField::parse (cognitive 32): CronField::parse has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f7abf907ed3bda58e65da8a13442408353838ebe3e785939d170eed3a403dc"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecAgentEvents::next (cognitive 32): ExecAgentEvents::next has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (7 pts), boolean chains 5, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/exec_events.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c488163466a8c93fdc6ae7c93840eaa34ad3cdc2c5f77f93380d3afdb04d83a"}},{"ruleId":"D2","level":"warning","message":{"text":"ReasoningEffort::normalize_for_route_identity (cognitive 32): ReasoningEffort::normalize_for_route_identity has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 5 (9 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/reasoning_preference.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a86fe0343b3ab7005b0c27c759a89e65b4eeb06d6697a813e41ec53f1c6925"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager::load_session_snapshot_with_limit (cognitive 32): SessionManager::load_session_snapshot_with_limit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 4, match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":5379}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c6ae9e1b4c0ae0c1dfd839ff7b9be13ce4091037798ebf08c374502a38b34d"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateGoalTool::execute (cognitive 32): UpdateGoalTool::execute has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 8 (13 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/engine/src/tools/goal.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c9ba332704859f3b552513a062396472bf743881eaac78954725865e40d7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::search::matches_expanded_glob (cognitive 32): codewhale_engine::tools::search::matches_expanded_glob has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/search.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4a526a15b6f5441ae69f622ee00afa4afec096be07c2373297509454d95b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::work_graph::model::constrained_effective_reasoning_for_route (cognitive 32): codewhale_engine::work_graph::model::constrained_effective_reasoning_for_route has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 7 (14 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/engine/src/work_graph/model.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5218246d2c334197bbc9c3a2e062f8dc71318c1144eb362a15ad6a66580afd6f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::push_ansi_c_escape (cognitive 32): codewhale_execpolicy::shell_expand::push_ansi_c_escape has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/shell_expand.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd65b7b75b9515fc986275db9c88ea27d8f4e773ca70300e248fac2137860f32"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginInstallSource::parse (cognitive 32): PluginInstallSource::parse has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 7, match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f27b34b18a11c5befc5649592746b55fc0330552be84125cbf4e123114a3bb"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandContextBundle::contexts (cognitive 32): CommandContextBundle::contexts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 32. 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/tui/src/commands/contract.rs"},"region":{"startLine":5089}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dd44f10e8c190bae94db594871e8328c2b10bf978bcfbdef3b174f5d4e12d1"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigView::handle_mouse (cognitive 32): ConfigView::handle_mouse has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 5 (10 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":4335}}}],"partialFingerprints":{"codehealthFindingId/v1":"0916f215cc949b962a558177e8c5ac8867901202521ab7963c4679708d7ab9e8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::merge_project_config_with_approval_baseline (cognitive 32): codewhale_tui::merge_project_config_with_approval_baseline has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 6, match/switch 2 (3 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":14262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e844b61eb536a928c2f811977dc148d4f2687d1a29526eb42aa3690fcdf7537"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::conformance::mcp::server::answer (cognitive 32): codewhale_tui::conformance::mcp::server::answer has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (19 pts), loops 3 (7 pts), boolean chains 4, match/switch 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/conformance/mcp/server.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fde6d699c4eb5ad73258effc23493199463738aa2e6d91343eb0430a0ac4a8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::tool_output::for_each_output_row (cognitive 32): codewhale_tui::tui::history::tool_output::for_each_output_row has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/tool_output.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"00beaeb121cdcf243241f98a2e86c2e51840f0bcf9aab9012d45357c93c5a8e9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow::js_authoring::blank_quoted_strings (cognitive 32): codewhale_workflow::js_authoring::blank_quoted_strings has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (10 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/js_authoring.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7555038f9c78fba89da1314540edfebf9b9c15cfd1e491185a6d2e98f8c0eb"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_mobile.html.eventText (cognitive 32): runtime_mobile.html.eventText has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 17, if/else 14 (15 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_mobile.html"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaaa5f87f1482404bd88ecf33db37a110a53f976a4ec31a687fcf82317449ed"}},{"ruleId":"D2","level":"warning","message":{"text":"render-released-capture.applySgr (cognitive 32): render-released-capture.applySgr has cognitive complexity 32 (threshold 15). Drivers by points: if/else 21 (22 pts), boolean chains 8, loops 1, ternaries 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":"web/scripts/render-released-capture.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a43158a25035a5630fab7b77260794f2b1ceaad40266e7e5110ee83b3e727a"}},{"ruleId":"D2","level":"warning","message":{"text":"createStreamConnector.connectStream (cognitive 32): createStreamConnector.connectStream has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 10, error handling 2, loops 1, ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 13 of the 32 points are its own statements and the rest belongs to 10 function items inside it that branch (onerror, a function literal at line 562, onopen, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"4248220c840c1262acaee5d047b474813b870f5f27ee9b1bb6fd3cf5e2a8301a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::daemon_socket::attach (cognitive 31): codewhale_app_server::daemon_socket::attach has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, match/switch 3 (5 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/daemon_socket.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"056b2af48e93ca5ce6a8852aef6721b08ecffc16aa6e978d43bd848ee706087d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::set_config (cognitive 31): codewhale_app_server::runtime_api::set_config has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":13569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9697343720c1d270a5c53a9000baec599a8710a20da0f00bb8d097cbb29580c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_config::legacy_root::plan_scope (cognitive 31): codewhale_config::legacy_root::plan_scope has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 9 (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/config/src/legacy_root.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"492809c42f0a5991f7fdfc9d54fddb583044704b3bbc7de6d0b258edb29053ca"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationSchedule::parse_rrule (cognitive 31): AutomationSchedule::parse_rrule has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (5 pts), boolean chains 2, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa32eaf410ecc1cd6cf57417e811615aad2969679a80764e0d77efb177cbfcd3"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::observe (cognitive 31): Session::observe has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 7 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eac5c3850ca86a877bc35b0aa8ccd76e9aab31ee4c99b48c70034aa1a3928b"}},{"ruleId":"D2","level":"warning","message":{"text":"McpConnection::recv_reply (cognitive 31): McpConnection::recv_reply has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43e1b4a51e98510b9844c974a79e9a79007d1e4be3480166648a814fcdee433"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::execution::run_job (cognitive 31): codewhale_engine::extension_host::execution::run_job has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 3 (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/engine/src/extension_host/execution.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eef4197caee1923e1cacdbbe0e23c0ad9bc095691e086b9d2c678f541a44fbd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::project_context::load_dir_instructions (cognitive 31): codewhale_engine::project_context::load_dir_instructions has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 2 (5 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a257580e4a1239a29c6ed2e41ec0360507cadc1b372b18273f0d52bdb23bd3b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::provider_lake::run_models (cognitive 31): codewhale_engine::provider_lake::run_models has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 2 (5 pts), match/switch 1 (3 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/engine/src/provider_lake.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0dd7b372d320eff8ba033dc4f8caff4f8f7bc48e4f4cac65f4de37cdac6cd0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::repo_law::write_target_paths (cognitive 31): codewhale_engine::repo_law::write_target_paths has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (5 pts), match/switch 2 (5 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/engine/src/repo_law.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"1358993df4940ce691e8f0679e864b3c5018027935a46d72bf8f5b4e529985f4"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginManifest::validate_metadata (cognitive 31): PluginManifest::validate_metadata has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d64b6a3c6d0930d43dd31b322de0160338e824ffaaac816999557ca6fb4490"}},{"ruleId":"D2","level":"warning","message":{"text":"ExploringCell::render_with_locale (cognitive 31): ExploringCell::render_with_locale has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39fc4ceb6e504210cdde728fdfb5ebfe46014c57424507ff4c047f9c81627e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderPickerView::handle_mouse (cognitive 31): ProviderPickerView::handle_mouse has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 5 (8 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":5431}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd5bde51125e3f80de21467e860a4245bcd5f7262bc187ba95c9f8c8547936c"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderDashboardRow::from_config_with_provider_id (cognitive 31): ProviderDashboardRow::from_config_with_provider_id has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 8, match/switch 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"d916d80bac51e81f2cfad8977ba55362b746712cb55f723ef7077a7fb184440d"}},{"ruleId":"D2","level":"warning","message":{"text":"AttachmentPreviewWidget::render (cognitive 31): AttachmentPreviewWidget::render has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/attachment_preview.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8f7083cb35458db75e8201773b0322dd9f6afdee158addb786e51128096b49"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::run_plugins_cli (cognitive 31): codewhale_tui::run_plugins_cli has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (11 pts), match/switch 2 (3 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":9552}}}],"partialFingerprints":{"codehealthFindingId/v1":"770c3dd3f8ccff31dd65c1845e8be7b650c27bbeb922c82daf6a7b72b8a6dd70"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::render_array (cognitive 31): codewhale_tui::tui::history::latex_render::render_array has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"7913043a76cdadf91a4c3cb04f1d0880d026a5070608c46902a5977632615321"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::subagent_routing::handle_subagent_mailbox_for_turn (cognitive 31): codewhale_tui::tui::subagent_routing::handle_subagent_mailbox_for_turn has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/subagent_routing.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4cdf64c34025dd0cb925fdbecfd1db7b53925619a6a325a4f24505a05fd682"}},{"ruleId":"D2","level":"warning","message":{"text":"app.applySnapshot (cognitive 31): app.applySnapshot has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 5 (10 pts), boolean chains 5, loops 5 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0de4869b065e82bb9534a4f1735e02ed6deb161103beb94e89301305f55cc3c"}},{"ruleId":"D2","level":"warning","message":{"text":"chat.readPayloadUserInput (cognitive 31): chat.readPayloadUserInput has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 9 (18 pts), if/else 5 (9 pts), boolean chains 4 (nesting depth added 13). Most of this is not in the body itself: 7 of the 31 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 882, 899). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b67dd35b7b2b7e9708b9aaefffcd4e7f37ec83f62ec2b8a15d727e29078741"}},{"ruleId":"D2","level":"warning","message":{"text":"index.startChatRecovery (cognitive 31): index.startChatRecovery has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 16). Most of this is not in the body itself: 2 of the 31 points are its own statements and the rest belongs to one function literal inside it that branches (line 786). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee98d4443f7a9112d4bd2d901a14415acf3b87b5fcf6fcabc9b7833c4c9eb9c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::apply_tui_env (cognitive 30): codewhale_cli::apply_tui_env has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":6738}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9d1152f698de4e524b7abbe1725e6566f9a050cedeb1814078f3c3d8a3716e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::update::compiled_host::prepare (cognitive 30): codewhale_cli::update::compiled_host::prepare has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update/compiled_host.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"e864bf1f066e56ae38218577d758fe13f2c716d02b7adbac7db5e2b38d0479ea"}},{"ruleId":"D2","level":"warning","message":{"text":"RouteResolver::resolve_scoped (cognitive 30): RouteResolver::resolve_scoped has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 4 (6 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/route/resolver.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"788d4cd8d6bf1fec1ddd64692214e864d6877da626403eb1d6645b964ecd80c6"}},{"ruleId":"D2","level":"warning","message":{"text":"SdkTransport::exchange (cognitive 30): SdkTransport::exchange has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bed4abd2ff71273f188ce22c5c70258e3d30648ce74e0de18524d1f4f83cc5e"}},{"ruleId":"D2","level":"warning","message":{"text":"McpPool::plan_supervision (cognitive 30): McpPool::plan_supervision has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 6, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":4644}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66229e5f869d281fa67abbed2ed6c733a71df3bca4d478118f7502666e24eda"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::start_external_turn (cognitive 30): RuntimeThreadManager::start_external_turn has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 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/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a45a8153eedfd258f74c55f3d091c99ea975bc81752e9f8f380b911247149d4"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::apply_external_update (cognitive 30): RuntimeThreadManager::apply_external_update has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 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/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc72c45e16103be9c1b901c44acd11157ed0ca21d5cbc368cad14b13f5c4bae5"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentWorkflowDriver::spawn_task_admitted (cognitive 30): SubAgentWorkflowDriver::spawn_task_admitted has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 6 (9 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":4779}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a1e29fc7425dc7f4d1fdde8e80e6242c4bc79d1ab1d5fddba860ba6c06c053"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::system_one::valid_decision_response (cognitive 30): codewhale_engine::client::system_one::valid_decision_response has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 8, loops 1 (2 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/engine/src/client/system_one.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac0d2d57e3d04aaf91383aac53ba22b8a5394748cd6ed7ad665fdae93eba131"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::mcp::merge_plugin_mcp_servers_from_plugins_with_environment (cognitive 30): codewhale_engine::mcp::merge_plugin_mcp_servers_from_plugins_with_environment has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (22 pts), boolean chains 4, loops 2 (4 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/engine/src/mcp.rs"},"region":{"startLine":7814}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95844067b7a0f17c3476b25e48ac07e9ce67df54650fcb7e3080616e507b294"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::review::plan_pr_review (cognitive 30): codewhale_engine::tools::review::plan_pr_review has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 6 (8 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d36b3de84472bfe4b683685346609c01bf1c8735f1e1d481f4606d456720bd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web_search::run_scrape_search_with_endpoints (cognitive 30): codewhale_engine::tools::web_search::run_scrape_search_with_endpoints has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 4 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf773c7ece91064a17ff6bf240ecd9d6f63da816a2cd758ee17cf36f75eb099"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow::looks_like_declarative_workflow (cognitive 30): codewhale_engine::tools::workflow::looks_like_declarative_workflow has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (21 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":3355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5713b84c6394f244693023c62a81d380bf7f5614f4959f84cd0525b07e3d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_palette::adapt::adapt_fg_for_theme (cognitive 30): codewhale_palette::adapt::adapt_fg_for_theme has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21 (22 pts), boolean chains 8 (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/palette/src/adapt.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3bf49ed4f691addd1439c692eff67951f10357a00072cbf97e3b03d5109796"}},{"ruleId":"D2","level":"warning","message":{"text":"Components::mcp_row (cognitive 30): Components::mcp_row has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (26 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf751b71ba9db73f7ee4cf24ea5741b039f701dc050a6fa3876fee4488c9f09"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::dsh::presets::contained_module (cognitive 30): codewhale_plugins::install::dsh::presets::contained_module has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, match/switch 4 (5 pts), loops 2 (4 pts) (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 13 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh/presets.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"af132271b4cf65f8fe1cb3911c20ca800679b3961428f0a569850c32edecd4b6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::tarball::extract_entries (cognitive 30): codewhale_plugins::install::tarball::extract_entries has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/tarball.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf49c625b2e20d8dd533439b427bec9d15e0b135f182d4c16de8f3a15cc1806"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_release::installs::prune_expired (cognitive 30): codewhale_release::installs::prune_expired has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/installs.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"285ab81df77867dfd1efe55565b1fc2bf4db763802757538076a471ea161c797"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::apply_saved_selection (cognitive 30): Config::apply_saved_selection has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":4013}}}],"partialFingerprints":{"codehealthFindingId/v1":"1394ce15c16ae447e10b953e67817e3c91636727c2165e3929ba3cef46080b92"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::working_set::walk_always_discoverable_dirs (cognitive 30): codewhale_runtime::working_set::walk_always_discoverable_dirs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/working_set.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"983febfe13c3105fbf4654bbebc1f642971d583eccab19742305ce01009bea80"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::project (cognitive 30): Connection::project has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 6 (12 pts), boolean chains 2 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/runtime.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb89de913be0ffada4038d617caabe41ee0d36263131ec55b8b6bbe4943cbf03"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellBinding::matches (cognitive 30): ShellBinding::matches has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 29, match/switch 1. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/shell_key_routing.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f6ba46f64120ada05a3e1d7e72b0f4a577ef0e13c2e566732395d7b31beff2"}},{"ruleId":"D2","level":"warning","message":{"text":"HelpView::render (cognitive 30): HelpView::render has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (25 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/help.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d4f5203662393f1a1d2492c00cb933ebc4788e0f109d45d73a3e1da2c6594e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::underwater::handle_launch_composer_key (cognitive 30): codewhale_tui::tui::underwater::handle_launch_composer_key has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 8, 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/tui/src/tui/underwater.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d090dc88faac0995653dac6e9f2446924f3819b42a70c1c4075923778615b7"}},{"ruleId":"D2","level":"warning","message":{"text":"PetEngineTelemetry.activity (cognitive 30): PetEngineTelemetry.activity has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 12 (15 pts), boolean chains 9, if/else 5 (6 pts) (nesting depth added 4). Of this number, 27 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8696f8703be79545b976e5acb760184ee0d67c0a711da1561a9ffedc1a1c3e3"}},{"ruleId":"D2","level":"warning","message":{"text":"DingTalkBridge.flush (cognitive 30): DingTalkBridge.flush has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 6 (17 pts), if/else 3 (6 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 16). Most of this is not in the body itself: 5 of the 30 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 354, 336, 339, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"464a804fdbf1d4fea386723da1e91464ae6eb18c361ac2b6cacc1fe0aec2b277"}},{"ruleId":"D2","level":"warning","message":{"text":"index.streamTurnEvents (cognitive 30): index.streamTurnEvents has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 5, loops 1 (nesting depth added 13). Of this number, 25 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caba56d20c30a6cc0e3f647252c799e5d3c307cf507b48bd2bf8ababa363845"}},{"ruleId":"D2","level":"warning","message":{"text":"PetEngineTelemetry.activity (cognitive 30): PetEngineTelemetry.activity has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 12 (15 pts), boolean chains 9, if/else 5 (6 pts) (nesting depth added 4). Of this number, 27 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c12b94d35eb42e2d5a9db64737eb7e79266b7edb89af07852c7f2d3f893845"}},{"ruleId":"D2","level":"warning","message":{"text":"PetEngineTelemetry.activity (cognitive 30): PetEngineTelemetry.activity has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 12 (15 pts), boolean chains 9, if/else 5 (6 pts) (nesting depth added 4). Of this number, 27 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-engine.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed60986b53fa297f0cdf4684448eb2c339b206219327bf1c771bc25ae66f4ef"}},{"ruleId":"D2","level":"warning","message":{"text":"interest.handleAdminMerchInterest (cognitive 30): interest.handleAdminMerchInterest has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, ternaries 2 (4 pts), error handling 2 (3 pts) (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/interest.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce233067b5586529bff93f79713f32e2e075e876329c93d679b20174d0381f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"consume (cognitive 30): consume has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 11, ternaries 3 (7 pts) (nesting depth added 9). None of this is in the body itself: all 30 points belong to 2 function literals inside it that branch (lines 307, 331). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a854fe2c0cd19b26b99e5455ccbc557992ec45e93642998a7baf097fe4d2dc98"}},{"ruleId":"D2","level":"warning","message":{"text":"RustOut::item (cognitive 29): RustOut::item has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (8 pts), match/switch 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/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c44476335dae2389e0d1e55d97f057a2fb561fbbdda0413c038ba6db506125"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server_protocol::codegen::methods_rs (cognitive 29): codewhale_app_server_protocol::codegen::methods_rs has cognitive complexity 29 (threshold 15). Drivers by points: loops 12 (21 pts), match/switch 2 (6 pts), if/else 1 (2 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"44feb7d7aa1d809cf609fa2e3f948367df1e1b77d85e3fb83023dc1460dbcbeb"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigToml::list_values (cognitive 29): ConfigToml::list_values has cognitive complexity 29 (threshold 15). Drivers by points: if/else 17 (22 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_resolve.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9830ffc1b2628e034c290023b7956efd82480b898a9e81a4b4f9b6261d517c"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhaleClient::handle_anthropic_stream (cognitive 29): CodewhaleClient::handle_anthropic_stream has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 3 (9 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"12fa2f1ee123a4da5fe33cb99d0030c4cb1f20e30071b17ef64036aaead1f8db"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionHostManager::reconcile_with_policy (cognitive 29): ExtensionHostManager::reconcile_with_policy has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 7, 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/engine/src/extension_host/mod.rs"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"40da73613b0ea39b3e29582ed593c66e9cdff0ae9c3e91c45899e49ec46f57a8"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetManager::run_to_completion (cognitive 29): FleetManager::run_to_completion has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"5facd5f4256fd16a227b4cf4828349e9dae022b0c3c5952ec612471b25097658"}},{"ruleId":"D2","level":"warning","message":{"text":"McpHttpClient::execute_inner (cognitive 29): McpHttpClient::execute_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/http_client.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa803984a698e69baae7aa409d0eadc576845f1cb2a360b5a5561552556a897"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteFileTool::execute (cognitive 29): WriteFileTool::execute has cognitive complexity 29 (threshold 15). Drivers by points: if/else 20 (23 pts), match/switch 4 (5 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":2162}}}],"partialFingerprints":{"codehealthFindingId/v1":"68caf8b00884e1aceebdd36d86928f55dde0eac9196ce92359e69590c07c3ef3"}},{"ruleId":"D2","level":"warning","message":{"text":"TextInspection::push_line (cognitive 29): TextInspection::push_line has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 9, loops 3 (5 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/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a62c1d3bba2da6211bc17b7e68a2b60b132bc8bb29a3e454ce3c8de9b98b140"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSearchTool::run_volcengine_search (cognitive 29): WebSearchTool::run_volcengine_search has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc021dcff554272993ab7c095a2c244460d3d4a06bb9c448aa6438886c7d2f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::provider_native_search::parse_anthropic_search (cognitive 29): codewhale_engine::client::provider_native_search::parse_anthropic_search has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (12 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"777aca86c268e82e8461889c94502b153dd5fa8d770047be2b66d84bf5512b93"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::fleet::worker_runtime::freeze_fleet_task_members (cognitive 29): codewhale_engine::fleet::worker_runtime::freeze_fleet_task_members has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/worker_runtime.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"281f678b7477630648ce1f210f309eade36116941680c0237fa97a870d5fe97a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::receipts::steps_from_messages (cognitive 29): codewhale_engine::receipts::steps_from_messages has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 2 (5 pts), loops 3 (4 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/engine/src/receipts.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"58fa28fe78c66f1454f0c63b4a38489786dbcff1ad0a27448dbfbb2e8b31cd1e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::receipts::approvals_from_events (cognitive 29): codewhale_engine::receipts::approvals_from_events has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5cf7590e749af0653957dc36a2e1caa469da5fe03ec0c5bf7eaedf744b8fe6f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::read_media::process_media_file (cognitive 29): codewhale_engine::tools::read_media::process_media_file has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/read_media.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b420fa144a46830792eca25d6d37a96c06cfee35d25960abaad19605cedc1d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::review_core::apply_claim_limits (cognitive 29): codewhale_engine::tools::review_core::apply_claim_limits has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d877a6d6cf4160bb85da97d37047f719d82942b99259ee3e937eda9637f7a8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::search::search_file_streaming (cognitive 29): codewhale_engine::tools::search::search_file_streaming has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/search.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"5534635f55ff1e7dbf324b7af88a6d2276d5dd87767a15dadab55f1688f9de36"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web::fetch::fetch_attempt (cognitive 29): codewhale_engine::tools::web::fetch::fetch_attempt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 1 (3 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/fetch.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"babe0f955d20a1eaf7d0b16ca4d54e16f99134572f9c613a605d34b7b1311411"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::denied_prefix_matches (cognitive 29): codewhale_execpolicy::denied_prefix_matches has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (25 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/lib.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb002ff82fe9513dfc15b190ee6df5a62085596a722fdd3342211c48ae9ed2a4"}},{"ruleId":"D2","level":"warning","message":{"text":"LspManager::intelligence_at_revision (cognitive 29): LspManager::intelligence_at_revision has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/lib.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"29911ddef78c0526804d53997ec0655d57582724f1c1b8d820ad2d66bcf923fa"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::discovery::parse_skill_snapshots_for_roots (cognitive 29): codewhale_plugins::discovery::parse_skill_snapshots_for_roots has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (7 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/discovery.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88d0ea77c5e925a8c7d477ed1196dda8498e77bb3625cb91ca328de8842f131"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::registry::stage_bundle (cognitive 29): codewhale_plugins::registry::stage_bundle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f625825f41d571f156a744b1e263ce2b94d85cee34f8a5df01e83db76dc1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skills::mutation::unpack_tar_gz (cognitive 29): codewhale_skills::mutation::unpack_tar_gz has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/mutation.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b26e6745dc5793b52dd8a28867cc27c44e9139b4aef2de94d2d5af10159a033"}},{"ruleId":"D2","level":"warning","message":{"text":"GenericToolCell::try_render_as_workflow (cognitive 29): GenericToolCell::try_render_as_workflow has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebc42ce6245165251a806805410f9b585728e68be081a837d9e0e0636ff5e7a"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelPickerView::ensure_projection (cognitive 29): ModelPickerView::ensure_projection has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9b26cb698819b1074c9a0246703fa8e839d2fb632d0ab78377fa9e48c03070"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderPickerView::render_key_entry (cognitive 29): ProviderPickerView::render_key_entry has cognitive complexity 29 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":3799}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa18fc793baaf9e020fcc60ee7a0cc352dee804cfb7a3183de75326fa71953d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::run_fleet_command (cognitive 29): codewhale_tui::run_fleet_command has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 5 (9 pts), match/switch 5, boolean chains 1 (nesting depth added 8). Of this number, 19 points are the body\u0027s own statements and 10 belong to 5 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0cebd7a658ac81594711c39fb0079748ad1a06a3c93cffac8d6d5b73291382"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::config::settings (cognitive 29): codewhale_tui::commands::groups::config::config::settings has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 3 (5 pts), loops 1 (3 pts), boolean chains 1 (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/tui/src/commands/groups/config/config.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e93eece46bf931d372bf9cf24b69522d5f5205d51ba65b41b417e41f2e6f5e6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::utility::mcp::mcp (cognitive 29): codewhale_tui::commands::groups::utility::mcp::mcp has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 12 (25 pts), boolean chains 2, if/else 2 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/utility/mcp.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce632090d0cc30b1fb3388cbfa961e0dc51fff7d1cab57888bbdd2eb36eb33c7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::user_commands::parse_frontmatter (cognitive 29): codewhale_tui::commands::user_commands::parse_frontmatter has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (25 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/user_commands.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9124594b3c1274d9795d3af0130587d5b76820bf70cce2a397f0c344f7866f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::coordination_detail::format (cognitive 29): codewhale_tui::tui::coordination_detail::format has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (17 pts), loops 6 (12 pts) (nesting depth added 8). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/coordination_detail.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c91646f21ac622d4fbabec8b559e2a21c50988a2bb1cc29e1c19f7e12646d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::provider_picker::auth_status_for (cognitive 29): codewhale_tui::tui::provider_picker::auth_status_for has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea82ef4fe3a6d0863d928b6f7ce451b4c8ea7adacbf9f4ea7b1b00ca8b53c99"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow::js_authoring::workflow_call_parenthesis (cognitive 29): codewhale_workflow::js_authoring::workflow_call_parenthesis has cognitive complexity 29 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (10 pts), boolean chains 2, match/switch 1 (2 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/workflow/src/js_authoring.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"05efe93e42380141959ba5cc5566a82af63ee9f6883de83bb8e848e929da476e"}},{"ruleId":"D2","level":"warning","message":{"text":"harness._parse_stream_receipt (cognitive 29): harness._parse_stream_receipt has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, error handling 1 (2 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/verifiers-codewhale/codewhale_harness/harness.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bf5d8ba20d10784fa5ad1d0933f5de7bc6b20f614d3d0dd0a4a6aab7ad493b"}},{"ruleId":"D2","level":"warning","message":{"text":"app.collectProviderModelPages (cognitive 29): app.collectProviderModelPages has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"c498048a3f0c45c0198a21734067d9217469492a016bfbf4ae85e94133f56014"}},{"ruleId":"D2","level":"warning","message":{"text":"pet-recorder.createPetRecorder.append (cognitive 29): pet-recorder.createPetRecorder.append has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 7, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-recorder.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2787fffb2b3a6c9b556d44c1a38f43d022953f794ea5227bb36eb7ea16d23b"}},{"ruleId":"D2","level":"warning","message":{"text":"render-released-capture.compact.lines (cognitive 29): render-released-capture.compact.lines has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (18 pts), if/else 4 (8 pts), boolean chains 2, loops 1 (nesting depth added 16). Of this number, 20 points are the body\u0027s own statements and 9 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-released-capture.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e18c1c509d5f017bf7bd4851cb49c5f9c32f463bb7164082b19d465e35a5be"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::fromRecording (cognitive 29): (anonymous)::fromRecording has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (10 pts), other 2, ternaries 2, loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"381eaa1ed4643d6a1cf081df37fa7ead3b98da2c5d15c294d1516b556bc42d36"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::fromRecording (cognitive 29): (anonymous)::fromRecording has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 14, if/else 8 (10 pts), other 2, ternaries 2, loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc86557462b8b2a49656c5c03f5c2c4b3df50190ee422d402ada559cc1bdbc7d"}},{"ruleId":"D2","level":"warning","message":{"text":"admitTurn (cognitive 29): admitTurn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 8, error handling 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":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa79b83c7e6e1c112e7e7d56e0b05e25b468ab0838aae59aa66fc5aaa2e503d5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::thread_control::list (cognitive 28): codewhale_app_server::thread_control::list has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 5, loops 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/thread_control.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a52e78e351b925249f8da5ee0b8d7ca869fdb7c600a61a31a9d513d85ac01b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::handle_set_goal_status (cognitive 28): Engine::handle_set_goal_status has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":6046}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea6590b7a18b880c9499ac35f001e95a27f5855b50d9fcd5ad55c59c3fe0665"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionHostManager::ensure_host (cognitive 28): ExtensionHostManager::ensure_host has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 4 (6 pts), boolean chains 4, 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/engine/src/extension_host/mod.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8fbbe47c8973af254c60543a92b4471d32d88e340dad5feb6261a115b80882"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionOffer::from_session_result (cognitive 28): SessionOffer::from_session_result has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/acp.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"432144a79b6d13e06a0e95ed696aef71a26b0b3daa166be33ca2f1861c68486f"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeOptions::merge (cognitive 28): RuntimeOptions::merge has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 14, if/else 14. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_options.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee12674152b44aafe3d6d3606be5309ef8b5a9da7e936cbe44456f09950aa9"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentManager::followup_child (cognitive 28): SubAgentManager::followup_child has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":8459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c950cb782ca6fe666815842375eedd1e184d6530d1f30e83946fa07c9cf89472"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentManager::finish_terminal_result (cognitive 28): SubAgentManager::finish_terminal_result has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":11427}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5834264797a99c9f1982c43bca33655128b481741db9664c88a6458796b3dd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::build_default_headers (cognitive 28): codewhale_engine::client::build_default_headers has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 9, 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/engine/src/client.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"286c4631055e73ad4daf2f5a83372e2c3dab55001d00eac070084b3bf0f43b61"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::engine::turn_loop::preserve_tool_output_before_fanout (cognitive 28): codewhale_engine::core::engine::turn_loop::preserve_tool_output_before_fanout has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 3, match/switch 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5f0ec5123322976f7100f6b48e4a3c2e22d5f7c7c40344686f3c7ff0aae0d9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::cost_status::record_interactive_runtime_usage (cognitive 28): codewhale_engine::cost_status::record_interactive_runtime_usage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":4014}}}],"partialFingerprints":{"codehealthFindingId/v1":"740d7fbd292a43d637221bcc5c1c07208824e84ddc41f55f1f9582cbf1458fac"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::pricing::audit_turn_cost_for_provider_on_endpoint_for_identity_at (cognitive 28): codewhale_engine::pricing::audit_turn_cost_for_provider_on_endpoint_for_identity_at has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 7, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/pricing.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6311bff994926bdc269a579ea63883dc69eea91cbb53e11ea6f55dee7630da3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::parse_spawn_request (cognitive 28): codewhale_engine::tools::subagent::parse_spawn_request has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 7, match/switch 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":18678}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6b76df5f253040cb1c1d42f82d570490de69649899f04d45e6dc8835894d28"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::walk_invocations::collect (cognitive 28): codewhale_execpolicy::command_safety::walk_invocations::collect has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (16 pts), if/else 4 (7 pts), boolean chains 5 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":2180}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c0f41e22d78d49fb5b40cd0ef28ab8bccb2a5496c55c9437c4511fbaf8d564"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionJournal::prune_plan (cognitive 28): SessionJournal::prune_plan has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (7 pts), match/switch 2 (7 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/session_tree.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4efb481e6d0cfac7393a132def7e69c8bb69669de0fc0b8b7663b676f1f5bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandPaletteView::render (cognitive 28): CommandPaletteView::render has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fad60d389a04881de0e6e83a51a9092a3cd46d8c23007724d1384b3fdece3f7"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputRowStream::push (cognitive 28): OutputRowStream::push has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, 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, 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/tui/src/tui/history/tool_output.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1ec6914e92e1acf5b49c09c12db39fa91f224cd1e1c4801fc4cb48b6c7edb5"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoryCell::lines_with_options_folded (cognitive 28): HistoryCell::lines_with_options_folded has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4 (7 pts), boolean chains 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"13127743388e22251980fa323b2822d8406ea5c0e9f5717bb12e14b22405e901"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetListView::handle_key (cognitive 28): FleetListView::handle_key has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (9 pts), loops 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_list.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cd4464b0acc6e0513bb47b60c55a6d45bc32f8195f9dd7a313fa84f4b1d2a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ApprovalWidget::render (cognitive 28): ApprovalWidget::render has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3e68aac5341679d82e463fe522d7d2543cf57f12fbc19f526d03cad600e502"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::dotenv_has_variable_expansion (cognitive 28): codewhale_tui::dotenv_has_variable_expansion has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":3649}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57a71e122087c73e49e73d7c33b9c14a250cf8095062c7a31f0f1f52c0725a0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::config::render_message (cognitive 28): codewhale_tui::commands::groups::config::config::render_message has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 4 (10 pts), match/switch 2 (3 pts) (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/config.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e848819af3f0a26d8a5c7a345bd0f7d95deb48bf3d78b57bf16448f155d26c6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::agent_focus::cells_for_messages (cognitive 28): codewhale_tui::tui::agent_focus::cells_for_messages has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (8 pts), match/switch 2 (5 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/tui/src/tui/agent_focus.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"499c04c818eb66bb8b84ec366f7b53a067012e486f892a67c652bc6c2c7fbd9c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::window_control::imp::toggle_pin (cognitive 28): codewhale_tui::tui::window_control::imp::toggle_pin has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/window_control.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a753eec35305c6ed7519d377ecadb27571ee82f1a30ba4727d368c1d4099a61"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatView.handleStreamEvent (cognitive 28): ChatView.handleStreamEvent has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 7, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"2177e2bb2985fd4a0bdd0908c1b702407a28a96aa997cc45b64930455af7e767"}},{"ruleId":"D2","level":"warning","message":{"text":"operator.operatorAction (cognitive 28): operator.operatorAction has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 8, error handling 1 (2 pts), ternaries 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":"web/lib/merch/operator.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ba74c3fa30603083450c70ee765902f297c0b9c1f25a079d7fbea1bd253b68"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::update::uninstall::plan_path_blocks (cognitive 27): codewhale_cli::update::uninstall::plan_path_blocks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (7 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update/uninstall.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4bcd99e147c156b3a3a5de750e5ce49a245e3aebda634e54c2beaadfe441b3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_config::catalog::configured::validate_configured_models (cognitive 27): codewhale_config::catalog::configured::validate_configured_models has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 10, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/catalog/configured.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"14437fb88108ebee8af2c1800b242f2f2b153d53fa36259826600edfe953c99d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_core::tool_parser::parse_arrow_syntax (cognitive 27): codewhale_core::tool_parser::parse_arrow_syntax has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/tool_parser.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa834bac88a67dcf35f1a2336eb6ff81f5143631b0d1ee199369ab3361f906a"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationManager::update_automation_unlocked (cognitive 27): AutomationManager::update_automation_unlocked has cognitive complexity 27 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f136783e8bd164fbc56e146be2eb4eeb56a29d3ca5edf69c76e898d72360797"}},{"ruleId":"D2","level":"warning","message":{"text":"HostProcess::spawn (cognitive 27): HostProcess::spawn has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 6 (9 pts), loops 4, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"5920cd473a74ccdbacc131fa5e68495f0fe848638c517807abb1333cfbe18f62"}},{"ruleId":"D2","level":"warning","message":{"text":"RawDacl::from_storage (cognitive 27): RawDacl::from_storage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 7, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f3bf87b63b0d02bbb4a396f470c0b1f721aca1f475d874a27a2e0107e7fc2f"}},{"ruleId":"D2","level":"warning","message":{"text":"HookExecutor::execute_sync_legacy (cognitive 27): HookExecutor::execute_sync_legacy has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 8 (10 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aadacd8f461bb1d63e4f4cae94709fa08b05dfb5ad99891c668c3ed72b22678"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::shutdown_and_wait (cognitive 27): RuntimeThreadManager::shutdown_and_wait has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 9 (10 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":4564}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b4a524ba29040445da88845595654781a91aa77e5a9c77901f8c6b968a757a"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::spawn_idle_shell_completion_monitor (cognitive 27): RuntimeThreadManager::spawn_idle_shell_completion_monitor has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7219}}}],"partialFingerprints":{"codehealthFindingId/v1":"705f470e2376f9f2bea5f8bbb19942b31bba0b48fb779e34656225231d3f3ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"BashTool::execute_wait_many (cognitive 27): BashTool::execute_wait_many has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 3, boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":7083}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2035c8cb3843f6cd78fbcd6b07a572f0057719b456d93ebe910e65e29896a81"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentManager::record_worker_source_admitted (cognitive 27): SubAgentManager::record_worker_source_admitted has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 13 (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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":7632}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef194db663b84600a87e573241a766e823ffed03d0b00673a4571d551daf2f46"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::chat::inspect_wire_request (cognitive 27): codewhale_engine::client::chat::inspect_wire_request has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f59e200e596bdf824c2729496bf5f42423c7c2748e5cdff0ee6cafe7ea88cb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::authority::auto_review::upload_values (cognitive 27): codewhale_engine::core::authority::auto_review::upload_values has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 4 (9 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/authority/auto_review.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f80bd9482fca83e1c2d91e47b77d149be3db3c129f5042962168f223f064c3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::engine::tool_preparation::prepare_tool_call (cognitive 27): codewhale_engine::core::engine::tool_preparation::prepare_tool_call has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_preparation.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bf412946983a097ab3459c141de503a39a6e9fd91cfd7a45190bd6480f4ad2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::fleet::identity::resolve_member_in_profiles (cognitive 27): codewhale_engine::fleet::identity::resolve_member_in_profiles has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, match/switch 4 (7 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/identity.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"530ec346a9b2102514424444c62ec33222b365314753062bc8b0b54e6bda8b8f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::pricing::audit_turn_cost_for_route_on_endpoint_for_identity_at (cognitive 27): codewhale_engine::pricing::audit_turn_cost_for_route_on_endpoint_for_identity_at has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/pricing.rs"},"region":{"startLine":1582}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7c22cb6a46702dce4da6f5b8f536154228ba198b5ceca168682d0918c8b2b0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::coord::wait_for_activity (cognitive 27): codewhale_engine::tools::subagent::coord::wait_for_activity has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28cb33e28d4ca42d778d41cf56f40183722c431c2dbeac2296187eec424e4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::work_graph::validate::check_v2_live_operations_rooted (cognitive 27): codewhale_engine::work_graph::validate::check_v2_live_operations_rooted has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (6 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/engine/src/work_graph/validate.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7e0ef22ff81f0162611358be80126fc097c15ccad8a385e0c825cae4a81733"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::recall_impl (cognitive 27): Store::recall_impl has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/memory/src/store.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33cb04f90c5c68e02246737d46926f8bd4e7872aa6ea479cadafc116e5f7c15"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::dsh::parse_yaml (cognitive 27): codewhale_plugins::install::dsh::parse_yaml has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (9 pts), boolean chains 5, loops 1 (nesting depth added 10). Of this number, 15 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4a9f4bf527326b59332309a43a9b67f4e2b631e33b4c7882356d91cb3a87b1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_release::installs::inventory (cognitive 27): codewhale_release::installs::inventory has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/installs.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b05ea680ba923d0a55218ce5f08ffe0b38dfd8178ea0cc0e021cbc44f9c480"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonRuntime::run (cognitive 27): PythonRuntime::run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 5 (12 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/repl/src/runtime.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce70ec3976f00d75afffdacedbdf7e289cd7fe247cd2a2285b11c17cb12f2d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::resolve_provider_identity (cognitive 27): Config::resolve_provider_identity has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 7 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":4472}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8dc4bc029e10233f0eb377247860557a1c3f75e86e6c61ef86e1f1ffaf8a87"}},{"ruleId":"D2","level":"warning","message":{"text":"Workspace::browser_completion_candidates_inner (cognitive 27): Workspace::browser_completion_candidates_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/working_set.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd445f86dec0c70f6990e8dfce4d67a09f44c16d6dee388ea6da458b0d58f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skills::audit::find_skill_packages (cognitive 27): codewhale_skills::audit::find_skill_packages has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/audit.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9586d09930f49237a60ae1b0ad43ec7fed0bc032c3bd3dc26801484d64a12a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"App::announce_settled_workflows (cognitive 27): App::announce_settled_workflows has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 9, loops 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":6686}}}],"partialFingerprints":{"codehealthFindingId/v1":"97283e305964d07ca91f57c28b51378d1b322495f3be49f4803edcb964ed63f0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::import_claude::render_plan (cognitive 27): codewhale_tui::commands::groups::config::import_claude::render_plan has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 9 (12 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/import_claude.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"194c81cede471535aeb98e6537cf77028db2329eda73cd192658b5031c17bb69"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::plugins::render::render_gc_report (cognitive 27): codewhale_tui::commands::groups::plugins::render::render_gc_report has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/plugins/render.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57a39a191d14aca76661a1a34add6055099d974545c740abb3c1430d3b62112"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::session::export::tokenize (cognitive 27): codewhale_tui::commands::groups::session::export::tokenize has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (7 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/tui/src/commands/groups/session/export.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e86460e50d5c2f90484b68c985fc7e11c1889b7ad737b797cbb20c0bc748cc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::utility::mcp::parse_scopes (cognitive 27): codewhale_tui::commands::groups::utility::mcp::parse_scopes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (9 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/tui/src/commands/groups/utility/mcp.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"1992e814a18f6ebf27f3778cff76b4931d01c2a75f173f7b056fd4398da9f98a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::app::composer::raw_mouse_report_keep_mask (cognitive 27): codewhale_tui::tui::app::composer::raw_mouse_report_keep_mask has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 5 (7 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc3b68290093d6c23e6a110c1fbc870264479170501749d0cadd7740f8cd715"}},{"ruleId":"D2","level":"warning","message":{"text":"mobile-menu.MobileMenu (cognitive 27): mobile-menu.MobileMenu has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15, boolean chains 8, loops 2, ternaries 2. Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 100, a function literal at line 79, a function literal at line 49, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/mobile-menu.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a4e2c071c5369b87b547e36c8a4b6c00c894c558edf68a542424e3c1fc818b"}},{"ruleId":"D2","level":"warning","message":{"text":"parseModelCatalog (cognitive 27): parseModelCatalog has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 14, if/else 3 (5 pts), ternaries 4, other 2, error handling 1, loops 1 (nesting depth added 2). Of this number, 18 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. 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":"web/lib/model-catalog.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1254dee91c6321ca863ed570fa61451181d85a2c18bdd8f8a78015ed8599d0"}},{"ruleId":"D2","level":"warning","message":{"text":"answersForUserInput (cognitive 27): answersForUserInput has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 4 (7 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 9). Of this number, 26 points are the body\u0027s own statements and 1 belongs to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"437fd7012f39c100abd617718c7f8bd3f47946af55708dfc698b54a0b760e5db"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_core::prefix_cache::context_update_message (cognitive 26): codewhale_core::prefix_cache::context_update_message has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6 (7 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/prefix_cache.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"8284ee8682c4613e7534e063e5f39ac3a529d6f64bdda913170fad5968e2c452"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhaleClient::send_retry_loop (cognitive 26): CodewhaleClient::send_retry_loop has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 3 (4 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":4901}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fea92d29c13faf1161c6c4923ee25b9db36b1c9b0e8661fc7e7286d9ee0fb87"}},{"ruleId":"D2","level":"warning","message":{"text":"Caller::check (cognitive 26): Caller::check has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/execution.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f5e5bd3e5aeb7aaa2a43e6c5d2a985d3ded8d837674faa522f51fccdaff481"}},{"ruleId":"D2","level":"warning","message":{"text":"McpPool::call_tool_with_decision (cognitive 26): McpPool::call_tool_with_decision has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, match/switch 3 (4 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/engine/src/mcp.rs"},"region":{"startLine":6582}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4da3e7608094ce4c8a83d39f68f48449725a2f94e887d73c16bfa43412cf039"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderLivePricingQuote::pricing_for_route (cognitive 26): ProviderLivePricingQuote::pricing_for_route has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 15, if/else 8 (10 pts), match/switch 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7d82ccd9d1690974cc90d4a505116907a1105daa654ad1554a35fadf7e7807"}},{"ruleId":"D2","level":"warning","message":{"text":"Run::repair_documents (cognitive 26): Run::repair_documents has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 5 (9 pts), 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/engine/src/session_reconcile.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"33192f864680c3180f49b76e21b7c781c1c00bbc1490c30b454e450e0a86b39b"}},{"ruleId":"D2","level":"warning","message":{"text":"EditFileTool::execute (cognitive 26): EditFileTool::execute has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (18 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23668674890eb9bc6b37942f77a35a8ad553ebf3f9bbd4187e274d7976c610e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::authority::auto_review::shell_command_credential_uploads (cognitive 26): codewhale_engine::core::authority::auto_review::shell_command_credential_uploads has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 12, if/else 4 (7 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/authority/auto_review.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"c739b509af022d0aa232e92850f7d56fc44d8c79ff20c6733b747856f0dd50e4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::authority::auto_review::pid_var_proofs (cognitive 26): codewhale_engine::core::authority::auto_review::pid_var_proofs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/authority/auto_review.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"5862ffdaadbf4b32d677eb539dce23a654ce9dd065b9607f77c8d2129eca4d74"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::mcp::oauth::secret_value_span (cognitive 26): codewhale_engine::mcp::oauth::secret_value_span has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (6 pts), match/switch 2 (6 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/oauth.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ad60fc075229b9c21596cff4ca0481fb2335f309d1b42b515f348d90cfab09"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::project_context::load_global_agents_context (cognitive 26): codewhale_engine::project_context::load_global_agents_context has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"b380d08967168803c8fa51e61ecdce547cd49bfc19abdba66e52437f563936f0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::task_manager::ingest_runtime_event (cognitive 26): codewhale_engine::task_manager::ingest_runtime_event has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"d010399da1b343a398bf60a0f218776133f82a6d4bc273a29f9c2f353bd0f455"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::task_manager::load_state (cognitive 26): codewhale_engine::task_manager::load_state has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":4021}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fce420ce362f1ce9f9ed8452909aaf450a69b087762dee7066e6bde110071c0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::read_media::encode_within_budget (cognitive 26): codewhale_engine::tools::read_media::encode_within_budget has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/read_media.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fa377db1e7820d80c70cd33b2c1a39e030ed4a2cf19715c4ea73e108479533"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::runtime_mcp::infer_server_name (cognitive 26): codewhale_engine::tools::runtime_mcp::infer_server_name has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/runtime_mcp.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"46692c87c5af78322eab15e0c60d4c3b75ce17e35154b15c6a78b40fcedd486c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::shell::finish_contract_bash_result (cognitive 26): codewhale_engine::tools::shell::finish_contract_bash_result has cognitive complexity 26 (threshold 15). Drivers by points: if/else 21 (26 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/engine/src/tools/shell.rs"},"region":{"startLine":5585}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2525700147494531a6966f959462e48d0bed5402c0cee28df47edc5c07dd85"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_models::schema_sanitize::normalize_kimi_compatibility (cognitive 26): codewhale_models::schema_sanitize::normalize_kimi_compatibility has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/schema_sanitize.rs"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa32c7e0d643cc796bea77ee4eeb3050fdecc6895e1b3059f2e9a284fdd7b0fe"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_palette::adapt::adapt_fg_for_light_palette (cognitive 26): codewhale_palette::adapt::adapt_fg_for_light_palette has cognitive complexity 26 (threshold 15). Drivers by points: if/else 19, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7aa804d3dc9df69719c576ece0db6e4e5cb8a3c367ffe8726d3d7a2167617c"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::resolve_persisted_provider_identity (cognitive 26): Config::resolve_persisted_provider_identity has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7, 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/runtime/src/config.rs"},"region":{"startLine":4719}}}],"partialFingerprints":{"codehealthFindingId/v1":"4986e4a5e4ea98149b5570b513eb2a32fdaeb6ecb366161a78560fc52348d35a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::tool_history_repair::repair_tool_call_pairs_inner (cognitive 26): codewhale_runtime::tool_history_repair::repair_tool_call_pairs_inner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/tool_history_repair.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc4c2dba7603cf96ec817e3452bad967421fbddc2da505023082f4012d484f7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skill_install::frontmatter::validate_skill_frontmatter (cognitive 26): codewhale_skill_install::frontmatter::validate_skill_frontmatter has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/frontmatter.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6cdb4a2fa60a6dc39648f065221d0bd1306f6453b00c4bd01fdfed92bd218c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skills::system::bundled_skills_status (cognitive 26): codewhale_skills::system::bundled_skills_status has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/system.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12a0b5178de3e49fe05b4f0d04527152b93c0481fc4b126d5b6d1362ef543fb"}},{"ruleId":"D2","level":"warning","message":{"text":"WorktreeManagerView::render_list (cognitive 26): WorktreeManagerView::render_list has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/worktree_manager.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6ed5c2f3e677dfcbb2066fc523cc54f486a846338ad9b935fbea8d8a015638"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::doctor_session_recovery_report (cognitive 26): codewhale_tui::doctor_session_recovery_report has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 7 (10 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":7101}}}],"partialFingerprints":{"codehealthFindingId/v1":"07da801e51d82e06d0238d7bf1b2f2149169a3b75d107a0614afa40bb74d8957"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::file_mention::local_context_from_file_mentions (cognitive 26): codewhale_tui::tui::file_mention::local_context_from_file_mentions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26342f48183d3409812d837b32c9d68e8edfcd800e0a1a288fb0ca3ba0a30f8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::render_matrix (cognitive 26): codewhale_tui::tui::history::latex_render::render_matrix has cognitive complexity 26 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 5 (11 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b1a43c29a6f2fb3e47fa85b7d8ad72f77d17e468d19760fbfc75914a375d04"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::views::append_subagent_group (cognitive 26): codewhale_tui::tui::views::append_subagent_group has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":6674}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cecb67063f468b8d64b695f0d4c7121c361b65b5fe8e9301cb00dd5a185ebf8"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayNormalizer::push (cognitive 26): DisplayNormalizer::push has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/ui_text.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"f349d796174c24404396c707da2177f07cbb077b28eb415c9a4bef385b8e812a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExactFleet::from_toml (cognitive 26): ExactFleet::from_toml has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 5 (12 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/fleet_exact.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"3000ce2e09386b0a44b464c18665eb054c4c52c24176b56bfcf42862089ea2ba"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow::redaction::redact_workflow_backslash_assignments (cognitive 26): codewhale_workflow::redaction::redact_workflow_backslash_assignments has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (25 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/workflow/src/redaction.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"46976c3fadbade2fdc1c85615c10a26ad1ba560373b35c0f7b75187726efc95d"}},{"ruleId":"D2","level":"warning","message":{"text":"PetHabitatView.body (cognitive 26): PetHabitatView.body has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (6 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetHabitatView.swift"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f4386d28477166d8260d21586ae0f21633c25b00f3cc78e4caa1986d19e136"}},{"ruleId":"D2","level":"warning","message":{"text":"PetWorld.fromRecording (cognitive 26): PetWorld.fromRecording has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 8 (10 pts), ternaries 2, loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e43c83adb5318e4d443bf912d156e8901724e6f17abda8c226bf7b00a643eef"}},{"ruleId":"D2","level":"warning","message":{"text":"PetWorld.fromRecording (cognitive 26): PetWorld.fromRecording has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 8 (10 pts), ternaries 2, loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b913b44605b639c3711a9564297492ba625bc84c2341c1851560655a7e831fe"}},{"ruleId":"D2","level":"warning","message":{"text":"PetWorld.fromRecording (cognitive 26): PetWorld.fromRecording has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 13, if/else 8 (10 pts), ternaries 2, loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-world.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d299e383ba46041da4bd2e47c1647cdd57da503c3fd2ee63f20efc1ac7c712"}},{"ruleId":"D2","level":"warning","message":{"text":"render-terminal-capture.compact.rows (cognitive 26): render-terminal-capture.compact.rows has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 3 (5 pts), boolean chains 4, loops 1 (nesting depth added 10). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-terminal-capture.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce961f3f07965abc17cb5e3a9c2506a4d0503e32c6367222ee0040ec448e84e"}},{"ruleId":"D2","level":"warning","message":{"text":"startTrackedTurnStream (cognitive 26): startTrackedTurnStream has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 7, error handling 2 (3 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 3 of the 26 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 569, 589, 587). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c16442058263544e5dfe2323f4e070ab280b02acce9c8a4a4baea91cc68afbd"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 26): main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (13 pts), error handling 5 (6 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (nesting depth added 5). Of this number, 25 points are the body\u0027s own statements and 1 belongs to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"444b4337aa1ebfb59d52cc9e7d1388c3c1363ed71381be24d3a792063a520cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::dispatch::run (cognitive 25): codewhale_account_cli::dispatch::run has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 7 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/dispatch.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eac63d14a064f2667d98114b2251515c8f45a4e61494def2dd5a372248a178"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::work::launch (cognitive 25): codewhale_account_cli::work::launch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (19 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/work.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9418101a52ae3add57e6fea68a047134e9c51cc50d08086ff594841030595e"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeChatPrompt::validate_shape (cognitive 25): RuntimeChatPrompt::validate_shape has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 9 (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/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edf52b00606044a7bcb17017c8095dd40e610b219d9f41925d444bfca844874"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::run_lane_command (cognitive 25): codewhale_cli::run_lane_command has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9ddd32598094dd428f6bd3dcaae639aa5991a04c049307b1b0a05a2d90fafb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_commands::diagnostics_reports::receipts::totals_line (cognitive 25): codewhale_commands::diagnostics_reports::receipts::totals_line has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (25 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/commands/src/diagnostics_reports/receipts.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ce6046a25a006962f8fabf69ad8fe27720fe0fdedb4eb5aaaa9788fb2618b6"}},{"ruleId":"D2","level":"warning","message":{"text":"NameStakes::from_tool_name (cognitive 25): NameStakes::from_tool_name has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 10, 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/engine/src/core/authority/auto_review.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d790620c4f04b4f19370fcfa16201575d00ee4bd99ce016a0dcec357a6cc5a2c"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::wait_for_named_mcp_boot (cognitive 25): Engine::wait_for_named_mcp_boot has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (8 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/engine/src/core/engine.rs"},"region":{"startLine":9220}}}],"partialFingerprints":{"codehealthFindingId/v1":"974848fef947f78abb8a0f785af95640eb0a76336fa40c3f5125e21c0f023229"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetLedger::finalize_task_attempt_with_tail_if_leased (cognitive 25): FleetLedger::finalize_task_attempt_with_tail_if_leased has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b64d451f8fbb46291164db377aa7f3f7c32c29fc05dae623955397faf5c87bd"}},{"ruleId":"D2","level":"warning","message":{"text":"LlmError::from_http_response_with_retry_hints (cognitive 25): LlmError::from_http_response_with_retry_hints has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 7, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/llm_client/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f1493ad143575273e9ddfd9fb06386a1f84c0788b09b0dcd1eafcbe34e5dbf"}},{"ruleId":"D2","level":"warning","message":{"text":"McpHttpClient::send_mcp_request (cognitive 25): McpHttpClient::send_mcp_request has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/http_client.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"b222790608cba016e068b1a3396a6942fd3022a8c55abf193c911ab5e33dfc11"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager::list_sessions_with_recovery (cognitive 25): SessionManager::list_sessions_with_recovery has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":5914}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8cd7c298da569be2804a1b913c151501cb6df93edddf6852f4f3253782703c"}},{"ruleId":"D2","level":"warning","message":{"text":"Run::collect_thread_references (cognitive 25): Run::collect_thread_references has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 5 (10 pts), loops 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_reconcile.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ea89d73398e83ea19c0731f7431beae8ea44c1026ca41ff4f3a45895d8034c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::authority::auto_review::deterministic_fallback (cognitive 25): codewhale_engine::core::authority::auto_review::deterministic_fallback has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 4 (7 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/authority/auto_review.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"012724c775d2aa9eed24a3e19a5cc6c5dcb2ee9a8e17a944b1fb147f0ef5f426"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::authority::auto_review::windows_session_runtime_risk_scoped (cognitive 25): codewhale_engine::core::authority::auto_review::windows_session_runtime_risk_scoped has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/engine/src/core/authority/auto_review.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa13d0f8b8a3bf76df623e981ff071d7022ae3973b38358b5b9e9934d21e5de"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::engine::streaming::filter_tool_call_delta_with_state (cognitive 25): codewhale_engine::core::engine::streaming::filter_tool_call_delta_with_state has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/streaming.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"380bffae4208ab91b7b58f1e2f2dcd401f737e44f5d9d4ae89b2e304b2356055"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::git_status::parse_porcelain_v2 (cognitive 25): codewhale_engine::git_status::parse_porcelain_v2 has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/git_status.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8614763f33589c455ef220fdad1c8512c3b08843f4160d161b4eff69f2ab46ee"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::image_attach::inline_image_sizes (cognitive 25): codewhale_engine::image_attach::inline_image_sizes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 3 (8 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":"crates/engine/src/image_attach.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd348ff8700f0a340b06e3bb7bcb7a8bc0678062cb3db21bf77f7f94039587d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::provider_lake::compute_merged_snapshot (cognitive 25): codewhale_engine::provider_lake::compute_merged_snapshot has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (8 pts), boolean chains 4, match/switch 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/engine/src/provider_lake.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9a33a35277f281e61ad35e7bba6284b78e5545667e14adc49cebc3d993c1d2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::runtime_threads::manager::sanitize_agent_mail_text (cognitive 25): codewhale_engine::runtime_threads::manager::sanitize_agent_mail_text has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f302b51f0d6a5485169b7edd072976e13f4564998938cbd1169183ea86d5c112"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::telemetry_notice::apply_persistent_preference_at (cognitive 25): codewhale_engine::telemetry_notice::apply_persistent_preference_at has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/telemetry_notice.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bc510ec4f961e969e9cfbb6d35fe8a970d144d1940d15d03a9ffa1405d6967"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::approval_cache::push_canonical_json_at (cognitive 25): codewhale_engine::tools::approval_cache::push_canonical_json_at has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (6 pts), match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/approval_cache.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89d827d1bdbf740fe448087bd24b750e55a339e897f285b405562c4cb3f406a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::shell::enforce_readonly_segment_operands (cognitive 25): codewhale_engine::tools::shell::enforce_readonly_segment_operands has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 6, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":4893}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fad72396124380569bc3fe9ee8c372bd228b64392011512ee2ea59dcb9fa5e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::inspect_agent_from_input (cognitive 25): codewhale_engine::tools::subagent::inspect_agent_from_input has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":15130}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2218d8c1c393031f3ad36df9edf1c024d68cc60c221f67dd8a6b7dd2dbd083"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::bind_spawn_model_route (cognitive 25): codewhale_engine::tools::subagent::bind_spawn_model_route has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 6, match/switch 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, 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":19982}}}],"partialFingerprints":{"codehealthFindingId/v1":"491c69ed725c5b5546d3fb8c686bd3bd6f5fe0382fc3bc43482e92b5967d127a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::verifier::run_gate (cognitive 25): codewhale_engine::tools::verifier::run_gate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 4 (5 pts), boolean chains 4, loops 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/engine/src/tools/verifier.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"423de4e16ce221c505686f78401daeec41f93b5b1588822a9959d19181984113"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::dsh::parse_comparator_token (cognitive 25): codewhale_plugins::install::dsh::parse_comparator_token has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 7 (9 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"3426a9b709040344255bcb4846a832f74bcf5a3b0eb986fd4a562d50abc2230d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::tarball::scan_bundle_entries (cognitive 25): codewhale_plugins::install::tarball::scan_bundle_entries has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, 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/plugins/src/install/tarball.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"227494d5c27d5dc4f25ad71e95e36f5f7f2de3144b1acca18776b47672d000c6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::recommend::recommend_from_entries (cognitive 25): codewhale_plugins::recommend::recommend_from_entries has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/recommend.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b93f16d084d3b64cf48998738bb91b029ff7ad8f321278caef111e88b395fd8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_release::installs::restore (cognitive 25): codewhale_release::installs::restore has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/installs.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b47487c3d48439a31f8df65ad2c2c40e981ed9c912a33b5b0ce77837459054"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionJournal::rebranch_active_messages_stamped (cognitive 25): SessionJournal::rebranch_active_messages_stamped has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/session_tree.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f3af91db18c031e2800eb1eab11c1eac4bfa68007167c92b51ead6448b8779"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::config::merge_config (cognitive 25): codewhale_runtime::config::merge_config has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14, boolean chains 9, match/switch 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":10093}}}],"partialFingerprints":{"codehealthFindingId/v1":"80890227ea2a29f499dc0c652601df3e855625e8a120cbcdd92444ba3a6f1179"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_sanitize::redact::mask_private_key_spans (cognitive 25): codewhale_sanitize::redact::mask_private_key_spans has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f411b755d2ba0d0057ae834c7e2b6135c0f71280647f0127fb2f5993a6f5758d"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSim::step (cognitive 25): PetSim::step has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (23 pts), loops 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/tui/src/tui/ambient_life/pet_sim.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f034ee917e18e5e483a8a8b49d6ab8a912908b9ad3ab4da1d9ffd83ee2a0749"}},{"ruleId":"D2","level":"warning","message":{"text":"App::apply_route_save_choice (cognitive 25): App::apply_route_save_choice has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 6 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":3060}}}],"partialFingerprints":{"codehealthFindingId/v1":"477dab2ed334d77871e257923f215186bdd259d0a805f9c3565a2716ab3a7687"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewCell::render (cognitive 25): ReviewCell::render has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"871a4e448cf7bf2eeeaf598b5b97a0d062a7a655609241fc8636318bcabbe7d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderPickerView::provider_detail_lines (cognitive 25): ProviderPickerView::provider_detail_lines has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (20 pts), loops 2, 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":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"374b50f0660e85ce5f2bef0f5269b88fabb8a3db9d0c8f661db74b56f497a917"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionPickerView::handle_key (cognitive 25): SessionPickerView::handle_key has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 5 (9 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/tui/src/tui/session_picker.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ff09f2cc23caa191134b8a9c7b9963a7ae92ee9bc988e27722ba0ab27be460"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationEditor::render_field (cognitive 25): AutomationEditor::render_field has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (5 pts), boolean chains 4, match/switch 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb438949f0913198b538fbbb2e33460aad5f39dd5e3fc95acd1621c7c238dfb"}},{"ruleId":"D2","level":"warning","message":{"text":"RouterSetupView::render (cognitive 25): RouterSetupView::render has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (4 pts), match/switch 3 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/router_setup.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7be349624c66effe62c422c98f97c9a972552584cbdd50cd0f5da8ec4cd3da6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::execute_in_context (cognitive 25): codewhale_tui::commands::execute_in_context has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 3 (5 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/tui/src/commands/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a83e5b11586b2e9c213816039c8179d6171825576c360f1592a1cbcc884432b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::config::import_claude (cognitive 25): codewhale_tui::commands::groups::config::config::import_claude has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/config.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3856a7ff48897030ff1293a468511802897a33a920019f85a06880774d63145"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::config::pet (cognitive 25): codewhale_tui::commands::groups::config::config::pet has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/config.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dc74de4662eb71f845d0f1cebc5e1db2b07abcce91466cfc889008ce786b44"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::project::init::parse_cargo_toml (cognitive 25): codewhale_tui::commands::groups::project::init::parse_cargo_toml has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (25 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/tui/src/commands/groups/project/init.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd515177f7d017e9ecf7945d58240a27f99a44d1485165e6f6aa5a8d3e2fe3a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::project::init::gather_git_info (cognitive 25): codewhale_tui::commands::groups::project::init::gather_git_info has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/project/init.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13bbc5c5224a20789534f81707999a663467029a9e5a83f50b74ef6895c77ca"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::integrations::cli::run_dsh (cognitive 25): codewhale_tui::integrations::cli::run_dsh has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/cli.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"af26853fd4b4fb7430ea5ed06d640056d18ea20b5b9de171edba43954980c37b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::command_palette::build_entries_with_plugins (cognitive 25): codewhale_tui::tui::command_palette::build_entries_with_plugins has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 3, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0847643260bb69def47d9e2d2aa0e5ff098c6d7973ff81789b505350de07db9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::file_picker::score (cognitive 25): codewhale_tui::tui::file_picker::score has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_picker.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"f446bbf75a974ae3afd5b5c2d0ec38a86e46676a4bf0736ba27e989f29491c71"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::tool_output::summarize_mcp_output (cognitive 25): codewhale_tui::tui::history::tool_output::summarize_mcp_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (4 pts), loops 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/tool_output.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb74bd8363f6a263209a13606142db56b66d2872dea83f92db15a8b408a40cd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::persistence_actor::flush_inner (cognitive 25): codewhale_tui::tui::persistence_actor::flush_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 3 (11 pts), match/switch 4 (10 pts), loops 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/persistence_actor.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b040e4c721f2596f043f35c225499d27b9830f18a4d52343cbff97e49ce6db9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::render::render_divider (cognitive 25): codewhale_tui::tui::work_surface::render::render_divider has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/mod.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"f543991191ac8b36e4a97aeaacf0191e32bc6a1f0941d6afda1ecb86e0454f92"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLines::next_line (cognitive 25): BoundedLines::next_line has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/bounded_lines.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ff1d50b69d5aaed0d6730022ec7f02e68feb7f47247c8e22abd1eb5f694180"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSim.step (cognitive 25): PetSim.step has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (23 pts), loops 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":"pet/android/PetSim.kt"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bea666023de95048c9138320a9c4c088632a0903b616936087b0d23df3ab027"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSharedClient.poll (cognitive 25): PetSharedClient.poll has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, boolean chains 10. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/android/src/main/kotlin/codewhale/pet/PetSharedClient.kt"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26c6e29d0d04a30926355cbe5a1e02dc283989b2eb4dea22ea3b57ebb2ff076"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhalePetApp.body (cognitive 25): CodewhalePetApp.body has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 4 (8 pts), boolean chains 3 (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":"pet/macos/CodewhalePetApp.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd6c8483f5fed92ed4d570ebb1c2179a45785d6761f24fb4d866f607b037cbf"}},{"ruleId":"D2","level":"warning","message":{"text":"app.createStreamConnector.connectStream (cognitive 25): app.createStreamConnector.connectStream has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, error handling 1, loops 1, ternaries 1 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 9 belong to 8 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78a2f6cc1266a6774fa2f65b96158d139f0e05e8e8b271ac88f24f1f894fc74"}},{"ruleId":"D2","level":"warning","message":{"text":"extension.activate (cognitive 25): extension.activate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, ternaries 2 (4 pts), error handling 3, match/switch 1 (nesting depth added 3). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 9 function items inside it that branch (checkAndRefreshRuntime, a function literal at line 170, a function literal at line 202, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/extension.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"73febe7b91a69e6e775c966cf88e32a079a8e1945577f0b93d715011ee42fb6f"}},{"ruleId":"D2","level":"warning","message":{"text":"install.prepareCompiledHost (cognitive 25): install.prepareCompiledHost has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4, ternaries 2 (4 pts), loops 2, error handling 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":"npm/codewhale/scripts/install.js"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"8895b25e09446557071995ce581a76975d2a50f734c5deaad4df31bcd5a5655c"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeEventJournal::load (cognitive 24): RuntimeEventJournal::load has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, loops 2 (3 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/app-server/src/remote_control.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc0fcfc4725bdb6bfc6700b50c40b6316af7f64667e2c8a460dca824243980e"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeChatRelayHost::apply_prompt (cognitive 24): RuntimeChatRelayHost::apply_prompt has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 5, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ae400dbee349f566ec3aca75fc3fbe94b6c77acf2a62d3fd3180217944b97d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::cancel_agent_run (cognitive 24): codewhale_app_server::runtime_api::cancel_agent_run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":4342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6812c3e6677b0c3d169246876c6ed136d2ae600f8b22df87879576be015c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"MoneyUsage::add (cognitive 24): MoneyUsage::add has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 8, 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/cli/src/metrics/stats.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"667c3f3f801ef88fc3dc4326df43ec25f03e0921f41520fc41369671640f1c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_core::tool_parser::parse_xml_parameters (cognitive 24): codewhale_core::tool_parser::parse_xml_parameters has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/tool_parser.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"56caaf9e8c5d73abef2ea3a6e7865ffdad059b6da2a236712d196f68dcf58e23"}},{"ruleId":"D2","level":"warning","message":{"text":"WireBodyView::extract (cognitive 24): WireBodyView::extract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/prepared.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3af422cb23a3d801660b19cfefd1f17c6bc8902df96c3b221814385dac7d57"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolActivationCache::activate_inner (cognitive 24): ToolActivationCache::activate_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/session.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cec9f9c556dbd58f8e6c357755a6cb18596a6e78f5c3de0291370a49bab3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"OwnerRegistry::register_command (cognitive 24): OwnerRegistry::register_command has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (22 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/engine/src/extension_host/registry.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b8c8237fb1746e821c08bd2b568761402c06782faee19911ae9d70e303d1d9"}},{"ruleId":"D2","level":"warning","message":{"text":"AcpClient::request (cognitive 24): AcpClient::request has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/acp.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb73961959be39533833e36aad96f4aad206d0aa4636a7326c2254eabef7a0f"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager::persist_late_usage_record_admitted (cognitive 24): SessionManager::persist_late_usage_record_admitted has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":3234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaf89e4e8b015ae95583dd0e765062d2500999ce6bcb15abfd355a6626f311f"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskManager::admit_task_record (cognitive 24): TaskManager::admit_task_record has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a18a4539f766e794cc80fe3838615f46c0ba81d755f6597786bbcadcd5a96d"}},{"ruleId":"D2","level":"warning","message":{"text":"RlmTool::execute_eval (cognitive 24): RlmTool::execute_eval has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14, match/switch 6 (10 pts) (nesting depth added 4). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/rlm.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"eced7d1484aeb071af87fc7767f5e0fd9bcae0026045248b01d87338bdcbe025"}},{"ruleId":"D2","level":"warning","message":{"text":"ShellManager::spawn_background_sandboxed (cognitive 24): ShellManager::spawn_background_sandboxed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (18 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":2833}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5da4d1876910eafa07ea58547ad3e937288d1e09bb83def0559f76285959eb5"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentWorkflowDriver::evaluate_gates_for_completed_role (cognitive 24): SubAgentWorkflowDriver::evaluate_gates_for_completed_role has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (7 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":4335}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b19d3779e6b2c4931fd66edda196ee61f167d59d1adbf5d5038e3f8bcf13dca"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::chat::build_chat_wire_body_with_window (cognitive 24): codewhale_engine::client::chat::build_chat_wire_body_with_window has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ed682843bd0430b6b19fb5c15c6dbd40f53b0c9f68cc01cdc2d4d170abf2c3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::compaction::plan_tool_result_prunes (cognitive 24): codewhale_engine::compaction::plan_tool_result_prunes has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7959604033b25e5ee69617d321f6fdab460024b8fa6173f4a9af7bdaff4fa302"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_workspace::serve (cognitive 24): codewhale_engine::extension_host::dsh_workspace::serve has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_workspace.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33271d91e35d3c40df4013b850b3b9d2bdb5cec370b14e96486be7ee2ee34ee"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::image_attach::shrink_images_for_request_with_budget (cognitive 24): codewhale_engine::image_attach::shrink_images_for_request_with_budget has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/image_attach.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"004ae8dd304783ea62b42ab8203ee35314969a56abf5a40bcc782424ff11d66b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::provider_lake::update_provider_catalog (cognitive 24): codewhale_engine::provider_lake::update_provider_catalog has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c4afe17815f8829eeb5c239b7c6fcc07ca29b37ae0148e6e1d400ef1567c43"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::purge::execute_purge_operations (cognitive 24): codewhale_engine::purge::execute_purge_operations has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, loops 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/purge.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"194f3367ed333a87b584b176685139f06abf937429075266235331520eccadde"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::apply_patch::build_mutation_metadata (cognitive 24): codewhale_engine::tools::apply_patch::build_mutation_metadata has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4, boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/apply_patch.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd56b97c97ca7ed194e1cfa47ddfd7f09ef12101b6360992360f3fc686c713c3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::approval_cache::computer_use_user_gate (cognitive 24): codewhale_engine::tools::approval_cache::computer_use_user_gate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, match/switch 4 (8 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/approval_cache.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ac911e4e4db66ad97ffe6f8844fb86819c1d4859ec67d62067310a727eeb3f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::execution_envelope::enforce_execution_envelope (cognitive 24): codewhale_engine::tools::execution_envelope::enforce_execution_envelope has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (22 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/engine/src/tools/execution_envelope.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44488c2cff92eab092e20107b32565aac466cc70ca0b0a108c9d47b5e220bbf"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::finance::fetch_host_endpoint (cognitive 24): codewhale_engine::tools::finance::fetch_host_endpoint has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/finance.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c201cf311314f6c05f16cc71740ef5cdb98bbb2d73da99aa145d65cdc25be86"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::budget_handback::fallback_partial_text (cognitive 24): codewhale_engine::tools::subagent::budget_handback::fallback_partial_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (5 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/budget_handback.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed55470cbc75db86abd830c0948234d7cf14fe5e331cbb2b00f2ce9b94c26a9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow::start_workflow (cognitive 24): codewhale_engine::tools::workflow::start_workflow has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (21 pts), match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcadcfd4c45481934aa62e378dfe42f686ddf384c10fbffd1728ba70c978afc4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow::validate_runtime_gates (cognitive 24): codewhale_engine::tools::workflow::validate_runtime_gates has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":3119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5085b0dfbef2fbfea7846fcec6b94982a733c94fb30cf5cf7c654e7af403c00b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_error_taxonomy::classify_error_message (cognitive 24): codewhale_error_taxonomy::classify_error_message has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 12, if/else 12. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/error-taxonomy/src/lib.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a372114efd9b557943ffefc2dc43b0164d16a7fc909313f5ee803ab1b7a9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_lsp::client::dispatcher_task (cognitive 24): codewhale_lsp::client::dispatcher_task has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/client.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff10271071f2017eef75d30dd91a41cc4c149ce6db5a19b5463e138a6c0d278"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_models::schema_sanitize::mfjs_schema_can_terminate (cognitive 24): codewhale_models::schema_sanitize::mfjs_schema_can_terminate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/schema_sanitize.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb068019fdb3c8a5b5a94272e873b37992c3d99619aa2f449475c872dae3520"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardedGet::send (cognitive 24): GuardedGet::send has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/src/guard.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3ec475c53df0a7adb0a97e8c6d3202aa2d66bf218ca064079ba9df051f1de1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_palette::adapt::adapt_fg_for_solarized_light_palette (cognitive 24): codewhale_palette::adapt::adapt_fg_for_solarized_light_palette has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, boolean chains 8. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffbbf811410feedf8bcacfeed998c7a215913cdb08bedee132f7e8124f22bf6"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelPickerView::handle_key (cognitive 24): ModelPickerView::handle_key has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 15, if/else 4 (6 pts), match/switch 2 (3 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":4273}}}],"partialFingerprints":{"codehealthFindingId/v1":"94aaf42498ab79e11c9222ad0997b82082510883bf66d1d2a6fd2d0c9c44b78c"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowPanel::history_expanded_lines (cognitive 24): WorkflowPanel::history_expanded_lines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (19 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40d44a832b59709ba3498c0f218007eb0e987ee163edb1d1d93d9c77f564844"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::render_command_mode (cognitive 24): codewhale_tui::tui::history::render_command_mode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"964429a014a57d15defdaf2c82a5c7ee98c252192b7051ae071f8680a90005ea"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::push_provider_model_rows (cognitive 24): codewhale_tui::tui::model_picker::push_provider_model_rows has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":2570}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfac2517378d3ce276147359cd2fa990f9d858e5f835687a1e56084a1866f4ab"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::open_fleet_setup_target (cognitive 24): codewhale_tui::tui::ui::open_fleet_setup_target has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"be683489980821c2d464d36d097078eae4661d4adf242269796089e00831878e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::dispatch::dispatch_user_message_with_recovery (cognitive 24): codewhale_tui::tui::ui::dispatch::dispatch_user_message_with_recovery has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4 (8 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/tui/src/tui/ui/dispatch.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f234875e78d21624ac642222a0e0f248b5dc21c27807cb431f5012686e13b3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::fatal_signal_guard::fatal_signal_handler (cognitive 24): codewhale_tui::tui::ui::fatal_signal_guard::fatal_signal_handler has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/fatal_signal_guard.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc857ddd82450acc291b17587c82bf9096c14e883ae3345286e8707f848af771"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::session_state::capture_turn_started_metadata (cognitive 24): codewhale_tui::tui::ui::session_state::capture_turn_started_metadata has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/session_state.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"3107dcff9c4d83b7835d33ca9fdee1470b4e562b8262ebb505ad5a7a1f6db320"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::render::layout::height (cognitive 24): codewhale_tui::tui::work_surface::render::layout::height has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 7 (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/tui/src/tui/work_surface/render/layout.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb7877394ea17f435a790a2c61133af0fb46f24048b75e02d4d269d3ada83a4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui_kit::markdown_render::wrap_plain_line (cognitive 24): codewhale_tui_kit::markdown_render::wrap_plain_line has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/markdown_render.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd814ce8150c21c71c803e397620bc749ed1e0d9cd90c05e1cad9e5a4671ffe"}},{"ruleId":"D2","level":"warning","message":{"text":"PetViewModel.handle (cognitive 24): PetViewModel.handle has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), error handling 3 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/android/src/main/kotlin/codewhale/pet/PetViewModel.kt"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed03a4ad658c3396790859a997fff4dd0c17b85ddecfacb2744e4f3476e64241"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhaleHarness.launch (cognitive 24): CodewhaleHarness.launch has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 2, ternaries 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":"integrations/verifiers-codewhale/codewhale_harness/harness.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0296e4515feda02d71a2fd0c7f708f639d290933ba387a1e5a8214d64dea0679"}},{"ruleId":"D2","level":"warning","message":{"text":"app.startBrowserClient::loadNewThreadModels (cognitive 24): app.startBrowserClient::loadNewThreadModels has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, ternaries 3 (4 pts), loops 2, error handling 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/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c584a9a9e00ff35b66f183e5e5be2b8cc6ea0c84734981a0d426f8cf596a5c"}},{"ruleId":"D2","level":"warning","message":{"text":"api.readThreadDetail (cognitive 24): api.readThreadDetail has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 3 (7 pts) (nesting depth added 12). Most of this is not in the body itself: 4 of the 24 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 594, 599, 562, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/api.ts"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e298f077900901a8e8bd516b6a9dce2fa07321531316280326ebae1d1396168"}},{"ruleId":"D2","level":"warning","message":{"text":"index.handleCommand (cognitive 24): index.handleCommand has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (23 pts), match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31c3216bdf7ea28665bebb6c8f4d3038f66751d5b1405c8a034b50f2dff9f93"}},{"ruleId":"D2","level":"warning","message":{"text":"page.HomePage (cognitive 24): page.HomePage has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 19 (22 pts), boolean chains 2 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 7 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/page.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7da4237a4e79d7caffb9fb39dbfa4a75f5b2c94345ffcb0a9d79fd8e643e93"}},{"ruleId":"D2","level":"warning","message":{"text":"release-updates.ReleaseUpdates (cognitive 24): release-updates.ReleaseUpdates has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, ternaries 6, loops 1 (2 pts), error handling 1 (nesting depth added 4). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 48, 59, 102, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/release-updates.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"189206a29e09c21edd8e4602bb69bdb839974cb18564ff1f39288636f07c1959"}},{"ruleId":"D2","level":"warning","message":{"text":"changelog-lib.parseChangelog (cognitive 24): changelog-lib.parseChangelog has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/changelog-lib.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"908fc9ad278febe265b2089b69873f297a61ebdedc7788c196150b6e0d125137"}},{"ruleId":"D2","level":"warning","message":{"text":"reattachActiveTurns (cognitive 24): reattachActiveTurns has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 9, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a523b690d72cbf94e4a4a2bef9324d28a7e0429114d1e821cab751007771467"}},{"ruleId":"D2","level":"warning","message":{"text":"startBrowserClient::renderUserInput (cognitive 24): startBrowserClient::renderUserInput has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 3 (7 pts), boolean chains 6, loops 3 (6 pts), if/else 2 (5 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/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ff3c25c8188a8361d89b2c72eef124a7d2a51b424746a75952285ae421ba6b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::parse_agent_turn_events (cognitive 23): codewhale_account_cli::parse_agent_turn_events has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":2208}}}],"partialFingerprints":{"codehealthFindingId/v1":"50938311f0b62ed87a81d7d45bb5c0f006c5f5366240a713ecc3a9315c656721"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::run_computer_files (cognitive 23): codewhale_account_cli::run_computer_files has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78257a3057ec329cbedcf1f9b3cfa70d31a26a1b7742a95a6f61e5f0838f8ae"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::get_fleet_profile_document (cognitive 23): codewhale_app_server::runtime_api::get_fleet_profile_document has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":4562}}}],"partialFingerprints":{"codehealthFindingId/v1":"473fc3e235fd50c53b4e90611e04261c0cac916de0c63a449e010d68322ec676"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_commands::debug::cache::cache_portable (cognitive 23): codewhale_commands::debug::cache::cache_portable has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 5 (9 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99bbcfed80fbdc3c914e7beb443e54dec1d2f150a02502a0ada411809bce259"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::start_mcp_session_boot (cognitive 23): Engine::start_mcp_session_boot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, loops 2, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":9430}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ab773a56a2efa7ce1774e26e5dc0c08bdadb0efa1c215df20b32d02a87be0d"}},{"ruleId":"D2","level":"warning","message":{"text":"Events::host_request (cognitive 23): Events::host_request has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64075aaf034e80510121814aaa9463ee6a26631ccda7c5af96511bfb82c8458"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::handle (cognitive 23): Reader::handle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b95add66ea679b7f188fc8fd072cb3102528fd7c675cd1424d3bf29680fcca3"}},{"ruleId":"D2","level":"warning","message":{"text":"McpPool::supervise_pool (cognitive 23): McpPool::supervise_pool has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":4825}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14dae89def2d907853077c5379f536404388eaae9444961b8ec64a207d2c0f7"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineTaskExecutor::execute (cognitive 23): EngineTaskExecutor::execute has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 5 (7 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd89b8702e4052bc291f4c2c6fc3867569f13fc1d4491421c7760cd52545336"}},{"ruleId":"D2","level":"warning","message":{"text":"AnchoredDirectory::open (cognitive 23): AnchoredDirectory::open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 6, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/report.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c936b9c99834ef0698c7b6bda825cee5b9e64ef9d31567d928834c77c2753d5"}},{"ruleId":"D2","level":"warning","message":{"text":"PlanState::update (cognitive 23): PlanState::update has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plan.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"925934b8fb689120e20e48045a17675562d86a449f1c68ace35257b72adcad49"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkflowTally::from_events (cognitive 23): WorkflowTally::from_events has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (4 pts), 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/engine/src/tools/workflow/view.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"06555bdf4c39b20a685775b03c4b6480b2c19c28a29a2b791b8c8a5b3cbcc27f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::wire::decode_delimited_tool_name (cognitive 23): codewhale_engine::client::wire::decode_delimited_tool_name has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/wire.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13a0fd55f7730d301f68c57758f686dd4fab7249836bf3d7bf187415e5c686f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::image_attach::replace_images_with_placeholders (cognitive 23): codewhale_engine::image_attach::replace_images_with_placeholders has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/image_attach.rs"},"region":{"startLine":1113}}}],"partialFingerprints":{"codehealthFindingId/v1":"352c7a8dfdd039421687004aa9ebf9f7801731dc3fa62a4a53e52062813dd2f0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::mcp::oauth::spawn_callback_server (cognitive 23): codewhale_engine::mcp::oauth::spawn_callback_server has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 4 (8 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/oauth.rs"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c6ca1ec6a3d24b9ec60af512920f4b03b7710df36a2b7cdfdad9c4cf32a2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::project_context::constitution::load_repo_constitution_block (cognitive 23): codewhale_engine::project_context::constitution::load_repo_constitution_block has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 3 (9 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context/constitution.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e293fb138eb093f180ff5a53eba443c1f75ebebfd5d87d986d110b9206576f47"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::route_preferences::scrub_root_model_aliases_for_export (cognitive 23): codewhale_engine::route_preferences::scrub_root_model_aliases_for_export has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_preferences.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d002acd8463745d6f1bec985238dbb9ba4b5758d9551220938a3c11a504158b9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::runtime_threads::turn_artifacts::artifact_refs_from_tool_metadata (cognitive 23): codewhale_engine::runtime_threads::turn_artifacts::artifact_refs_from_tool_metadata has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/turn_artifacts.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb19300165f61175f371b2e232daab74204edd0af49faa5d54b575d69f6649a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::handle::query_jsonpath_bounded (cognitive 23): codewhale_engine::tools::handle::query_jsonpath_bounded has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/handle.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84e3147146d46281f3f10aae76d743acdbefcd5f8d90177ed6f50d2ea2059f7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::review_core::refute_claims (cognitive 23): codewhale_engine::tools::review_core::refute_claims has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 4 (8 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a922639a512018536b1607acb3247b45df36c57685982ba271991e7b850e034"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::review_pr::complete_file_set (cognitive 23): codewhale_engine::tools::review_pr::complete_file_set has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_pr.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f238d6443a171e45f13f3ef7e0e4ea2eeccbf7306cce19e5c7217b08ccd26e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web_search::extract_search_query (cognitive 23): codewhale_engine::tools::web_search::extract_search_query has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (19 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/engine/src/tools/web_search.rs"},"region":{"startLine":3389}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5570630040c9cf8b31ca5976adf66373a743075701849cf3ac0860d72bf4f3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow::execution_from_declarative_spec (cognitive 23): codewhale_engine::tools::workflow::execution_from_declarative_spec has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (7 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":5309}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a257633852fe29c68d7de85d6126828025e6934e6d2e2590816042085ad422"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow_plan_approval::collect_children (cognitive 23): codewhale_engine::tools::workflow_plan_approval::collect_children has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow_plan_approval.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbb809f9ea539f318d83145b66133e5d6f5e9e2b5ee7936d09b0ed5b90b6323"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_memory::policy::validate_draft (cognitive 23): codewhale_memory::policy::validate_draft has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, loops 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/memory/src/policy.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2fff992a8adb19756b759b940fe12f9b9dc4101afd48363b821d6ebdce96c6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_models::schema_sanitize::collapse_nullable_unions (cognitive 23): codewhale_models::schema_sanitize::collapse_nullable_unions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/schema_sanitize.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1258431cd1fb556c727820b0c83dc8590570d020bc140ec5e45b5f7def8084"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::manifest::hash_path (cognitive 23): codewhale_plugins::manifest::hash_path has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"f588b369262319c8bdcccf74b7379a8c833d80f02b495c3a5e918d5faf66f40c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::registry::copy_bundle_tree_bounded (cognitive 23): codewhale_plugins::registry::copy_bundle_tree_bounded has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":2411}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6b032bd2470379675078bb06c39303eb5d05d16741a2a357c1c94dec48452a"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::runtime_preset_blocker (cognitive 23): Config::runtime_preset_blocker has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 8, match/switch 3 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3388}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10d68fd7bcbabb360a4d652bb2dfcf996cb6b03bd9fb45d3f6fe7b7cba10771"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_sanitize::redact::redact_backslash_assignments_at (cognitive 23): codewhale_sanitize::redact::redact_backslash_assignments_at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (22 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/sanitize/src/redact.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1026e8d8fa33a54839878f126ad0bc96523b0dd7c4656e4cf6885a6b2ca46d6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tools::patch_preflight::parse_unified_diff_files (cognitive 23): codewhale_tools::patch_preflight::parse_unified_diff_files has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tools/src/patch_preflight.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2fccc0616c287a0a46c111e13f2d04759c1b5141138401408861f1a616976c"}},{"ruleId":"D2","level":"warning","message":{"text":"UserCommandRegistry::load_from_entries (cognitive 23): UserCommandRegistry::load_from_entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (7 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/tui/src/commands/user_registry.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0538d9249a45ee0d4aedf306e6ecd256c8e4fbcd5878749b019959ceb5bea689"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextMenuView::render (cognitive 23): ContextMenuView::render has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 4 (8 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/context_menu.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c164d98d7652f0e6b58141b885344275cc380aa3418cdf99388a1abfe5c293d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelPickerView::handle_mouse (cognitive 23): ModelPickerView::handle_mouse has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":4432}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a0b4af92baf413e119314cb68421d22b7eb8424f8b322830c90ae0123c855f"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationEditor::save (cognitive 23): AutomationEditor::save has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 8 (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/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af1e6abf2cbef4dcb81dd5bb696b8ba478710d907fa6ce19db826ee47244645"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetSetupView::handle_key (cognitive 23): FleetSetupView::handle_key has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ffc0be4e73ac89d660dc6a9fe5b2544400fc66bced8f33bcd805e0256059b0"}},{"ruleId":"D2","level":"warning","message":{"text":"ElevationWidget::render (cognitive 23): ElevationWidget::render has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 4 (5 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":2492}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de8015e0379e877a9964f8e24a98149e41115c4638387c55fe17285576e0f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::config_main_import_host::apply_plan (cognitive 23): codewhale_tui::commands::config_main_import_host::apply_plan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (6 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/tui/src/commands/config_main_import_host.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4422a7f7f7379b4d50caaf8bb37d674829990a931da07389700ea50801179c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::approval::previews::apply_patch_preview_lines (cognitive 23): codewhale_tui::tui::approval::previews::apply_patch_preview_lines has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval/previews.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d808ee9426421a5dded2977bbc676f105a4c6ea564868834248de5c79ca7a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::render_aligned (cognitive 23): codewhale_tui::tui::history::latex_render::render_aligned has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 5 (10 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b658ee0563a0beb06394370efc82a81260edc86688f9a402fdce1dd846b826e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::thinking::extract_explicit_reasoning_summary (cognitive 23): codewhale_tui::tui::history::thinking::extract_explicit_reasoning_summary has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/thinking.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e85b8f5acfd4dcf25a1bb4d263a22ea9b160033ffc4b225f334715fd5e2cc2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::widgets::agent_card::apply_to_delegate (cognitive 23): codewhale_tui::tui::widgets::agent_card::apply_to_delegate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5, 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/tui/src/tui/widgets/agent_card.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9f31c37636c4e55a6b515c3b89e1ccdda4d27a408226d29cbde4e4d56ab671"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::views::git_state_rows (cognitive 23): codewhale_tui::tui::work_surface::views::git_state_rows has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (16 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/views.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ce933183f3b866171f92517faa4b3e46336952732990ca3fb05d0245654336"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow::model_policy::balanced_json_payload (cognitive 23): codewhale_workflow::model_policy::balanced_json_payload has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/model_policy.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f33cd1cf2b6143991191a7886e9a60e55415dc240e576549056b21e5d735649"}},{"ruleId":"D2","level":"warning","message":{"text":"runtime_mobile.html.openThreadEvents (cognitive 23): runtime_mobile.html.openThreadEvents has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 6). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 887, 900, 919, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_mobile.html"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c97e811da761b62455e4b5a2f0701a8d10c12a2c44011dc0880c755471ef54f"}},{"ruleId":"D2","level":"warning","message":{"text":"index.reconcileAdmission (cognitive 23): index.reconcileAdmission has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"23740a5449c3ee22da0e96e7148968855a84e2b2acb29f709484bdea97ba539c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::step (cognitive 23): (anonymous)::step has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 5 (8 pts), loops 2, other 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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cebe526de58cb2d46e33f36dee6d2e6a8b6a69be36c70689181f38b188499fb"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::step (cognitive 23): (anonymous)::step has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 5 (8 pts), loops 2, other 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e844cbee3852b92b4784315a60c7e5519de1e4201cfc9f843b71b2310a094a7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::collect_git_status_detail (cognitive 22): codewhale_app_server::runtime_api::git::collect_git_status_detail has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 6, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5eae648205f4e8a5768efe10d109a236e6c125983d83af9ba7eeb61aec48cc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::auth_status_all_providers_with_runtime (cognitive 22): codewhale_cli::auth_status_all_providers_with_runtime has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":4236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e319e9bf94b6604b23678a67f8e2c2215ded6bdf9436c88c87f67baeef38298"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::config_bundles::plan_import (cognitive 22): codewhale_cli::config_bundles::plan_import has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (7 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/cli/src/config_bundles.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda22872f709d77961d23394bc5257fc12695768076fc4b60c2c666ba3b515b8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::update::apply_staged_at_start (cognitive 22): codewhale_cli::update::apply_staged_at_start has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 4, match/switch 2, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4e9f5e9b97570c85361642b39d43184bbb9bfc1176248770ea161902b6edba"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_commands::debug::preview_request::parse_args (cognitive 22): codewhale_commands::debug::preview_request::parse_args has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/preview_request.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1dc330dbebd4a4a3549fd0a3e95f0e4070d96e68a3b19f6aa4b830bf26c230"}},{"ruleId":"D2","level":"warning","message":{"text":"CatalogCorrections::validate (cognitive 22): CatalogCorrections::validate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/catalog/corrections.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22b8541bd62793470e05b9281e2d191ee5bd93e425a4c7e40c2c383cc7b4829"}},{"ruleId":"D2","level":"warning","message":{"text":"RouteResolver::with_configured_models (cognitive 22): RouteResolver::with_configured_models has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/route/resolver.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fee8ed1e9c0d9a9313322cc050888089ac31e473a2c8cb066d1871b8fe966b0"}},{"ruleId":"D2","level":"warning","message":{"text":"EngineHandle::send_approval (cognitive 22): EngineHandle::send_approval has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/handle.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8c9c18f041d63e00e06d74c842456ba39be92538e1d016f562f209e52d5394"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::handle_manual_compaction (cognitive 22): Engine::handle_manual_compaction has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, match/switch 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/compaction.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"de880a8c088ad095d4851ee85c30e5edd17744cad0a01ff52d6e78ec84ece783"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::run_turn (cognitive 22): Engine::run_turn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 5 (9 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d758c36dd5acef4d907adf07d48a99266d36d489cf5fcce738413d1a0c4c8f70"}},{"ruleId":"D2","level":"warning","message":{"text":"NativeUsageSource::prepare_observed_kind (cognitive 22): NativeUsageSource::prepare_observed_kind has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a55a0c996a5149cfa89b9af4a5f01c66192c25310f9642262ccab8c95145c3a"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetLedger::compact_with_snapshot_hook (cognitive 22): FleetLedger::compact_with_snapshot_hook has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 11 (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/engine/src/fleet/ledger.rs"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4d2b259ff116bc734e766437b297d0aa18aeafef1fc6680512a3a799ccdcf7"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::saved_session_prefix_from_session (cognitive 22): RuntimeThreadManager::saved_session_prefix_from_session has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b507b2a667060bf3c40767f1b3dbea3636ba6eab422804a01e3e936eeb255cb2"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadStore::newest_message_text_by_turn (cognitive 22): RuntimeThreadStore::newest_message_text_by_turn has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (3 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":3907}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ad752f6f78a815ffccba7d9e9a62d65d6ea6cbaa6a6218626eccdcb66a10a4"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager::read_checkpoint_file (cognitive 22): SessionManager::read_checkpoint_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 2 (3 pts), boolean chains 2 (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/engine/src/session_manager.rs"},"region":{"startLine":4886}}}],"partialFingerprints":{"codehealthFindingId/v1":"80178006bbacd6af96fe8cb4d4016b54cfe436d1e3cc03fd60f7f79cd77550c7"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentsCoordinateTool::mutate_coordination (cognitive 22): AgentsCoordinateTool::mutate_coordination has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2, loops 1 (2 pts), match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"26738d7f76d0ad24540a1f1d5891a74e2119e50de5c6ea2b11b9709eb4104e03"}},{"ruleId":"D2","level":"warning","message":{"text":"ChildAuthority::tools_for_model (cognitive 22): ChildAuthority::tools_for_model has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 8, loops 2, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccb68ab972583813ce6b94947a3cec51b558c4a65085f3fa78ca9b467c13c15"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::chat::extract_mistral_polymorphic_content (cognitive 22): codewhale_engine::client::chat::extract_mistral_polymorphic_content has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb443ebe415891094e79623b9b5d1b0626d95debbad71e96d71ff3e832017d0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::chat::inline_reasoning_segments (cognitive 22): codewhale_engine::client::chat::inline_reasoning_segments has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"7400fddb753579bd3c058e4cf0258432516d594556e906cfc2d16fdbc854b52b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::reasoning_effort::apply_reasoning_effort (cognitive 22): codewhale_engine::client::reasoning_effort::apply_reasoning_effort has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 9 (17 pts), if/else 4 (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/engine/src/client/reasoning_effort.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3384a77bcd9d652bea4a656e20646cdb7e8282797502951d0b647f26a930a75e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::engine::context::compact_run_verifiers_result_for_context (cognitive 22): codewhale_engine::core::engine::context::compact_run_verifiers_result_for_context has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 2 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/context.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"6252e058b21d1c7dcfd67afd898899d4d826fb82e5a5aff221a8d6ce9a27eb9f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::engine::turn_loop::fold_tool_call_before_results (cognitive 22): codewhale_engine::core::engine::turn_loop::fold_tool_call_before_results has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":6335}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef19be4a7b01f6d585ad8280adebe64b01aabb41938bbde70b1ff7c1c4a3dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::cost_status::fold_audit_into_pending (cognitive 22): codewhale_engine::cost_status::fold_audit_into_pending has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":4219}}}],"partialFingerprints":{"codehealthFindingId/v1":"955a6a04b9486f649359e5d34ab6b2b9967ee97265551089e906e6ea64d9d053"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::union_of_desired_owners (cognitive 22): codewhale_engine::extension_host::union_of_desired_owners has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 4 (9 pts), match/switch 1 (3 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/engine/src/extension_host/mod.rs"},"region":{"startLine":3423}}}],"partialFingerprints":{"codehealthFindingId/v1":"30edc99a149b95d5c978e01115edbe51ae716bf95ecbe1cd79ea7cc3ebafa208"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_network::render_headers (cognitive 22): codewhale_engine::extension_host::dsh_network::render_headers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dde9676056a0f82fcaee7da3da6792dcb15eb9e15e35f2b95c92f827a40024"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::windows::retire_scope (cognitive 22): codewhale_engine::extension_host::windows::retire_scope has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02538179a6e869d59dab0cb0ad6cef0f0436fda379dc402114b918a61b9af36"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::project_context::budget::apply_instruction_budgets (cognitive 22): codewhale_engine::project_context::budget::apply_instruction_budgets has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 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/engine/src/project_context/budget.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"de256477e536cbf9daa05dd7309d263b9b2053034deb03c840d9f26239bc3e17"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::provider_lake::provider_capability_with_wire (cognitive 22): codewhale_engine::provider_lake::provider_capability_with_wire has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff40a03f08fa7aabf4f2d42c1916436af33a067418fee889b93445ad52fe6884"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::apply_patch::apply_hunk (cognitive 22): codewhale_engine::tools::apply_patch::apply_hunk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 2 (3 pts), match/switch 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/apply_patch.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fb7b4f9eeaa5741b981fc3542530fa0db659fda8671b9e9f8920d9b5857234"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::wait_for_subagents_from_input (cognitive 22): codewhale_engine::tools::subagent::wait_for_subagents_from_input has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), match/switch 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":15396}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a512395efa92a235419185df178567a2d356c47623a636bf61f130e4e0977d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web::backend::run_backend_chain (cognitive 22): codewhale_engine::tools::web::backend::run_backend_chain has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/backend.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bab1c34540d957c47f4b901b0224fa00a74d43d327f1ac6ee457444ec3b8d49"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_memory::workspace::snapshot (cognitive 22): codewhale_memory::workspace::snapshot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/memory/src/workspace.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"38235d8e04ba72b8e8732e1cc866bce513320fd89dced7347c998c19a935ec8a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_models::explicit_context_window_hint (cognitive 22): codewhale_models::explicit_context_window_hint has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/lib.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"f868dc71dd28ed8feee8c68c8bbb4c2b76ac2a635e4a91a81ef187b74550bb37"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::marketplace::parsers::dsh::pick_version (cognitive 22): codewhale_plugins::marketplace::parsers::dsh::pick_version has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/dsh.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8ae25c9dc5f10f2c51e7e086c4c610511c535bdafd233f83c0264fdf430f98"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::config::save_root_api_key_for_secret_slot (cognitive 22): codewhale_runtime::config::save_root_api_key_for_secret_slot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (11 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":11286}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a3429bad51816cec913e4ccfdd96d1cb83e7dd6f188a34566c22f1d0f8503a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::external_credentials::open_secure_regular_file (cognitive 22): codewhale_runtime::external_credentials::open_secure_regular_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/external_credentials.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4266b89331e71a3f1b490060231f684cf1e732a981e5081ac0e09debc4455be"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skill_install::package_digest::walk (cognitive 22): codewhale_skill_install::package_digest::walk has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/package_digest.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ca8fc256303563fa0a4cce0146daca335bd205d238821348badcd55818b83a"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillRootCatalog::runtime_directories (cognitive 22): SkillRootCatalog::runtime_directories has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/roots.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b764d878999f066848fb38b68ed822ffafd853356f580d12d457d000a8fea8a"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveTranscriptOverlay::flatten (cognitive 22): LiveTranscriptOverlay::flatten has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/live_transcript.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"976cf0d866566267e04cb20847e61dfad76e475f53fead46b3562bb8ff1ebf4d"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalInputPump::spawn_parts (cognitive 22): TerminalInputPump::spawn_parts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/terminal_input.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb07339022f975f6132dff0909ada1bbff8f8e6fcdd5ee6a7e647dc7cd12656c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::run_setup (cognitive 22): codewhale_tui::run_setup has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":4647}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7cc7dedc453872eab9953a0b6a5b3edfc36bdf561c45bf02bb6abe63139a07"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::config::config::trust (cognitive 22): codewhale_tui::commands::groups::config::config::trust has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/config.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"292011015761438e95445b71737138779da97fa9c58b278489d3c6737095d6ec"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::plugins::marketplace::render_candidates (cognitive 22): codewhale_tui::commands::groups::plugins::marketplace::render_candidates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/plugins/marketplace.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3770793c58fb15ef92e74e0563da140fe2d26c6db82fc3d3133cf7f3e4529a2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::context_report::base_source_entries (cognitive 22): codewhale_tui::context_report::base_source_entries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/context_report.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b057f4bba9e4919e66a68b51837684dbbfe22c5d08827f53aea75c84c6b37a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::file_frecency::worker (cognitive 22): codewhale_tui::tui::file_frecency::worker has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (16 pts), loops 4, match/switch 1 (2 pts) (nesting depth added 3). None of this is in the body itself: all 22 points belong to 5 function items inside it that branch (compact_store, load_records, merge_loaded_records, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_frecency.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50cd1740b50c736b3cacd71e60072257afb1772bc47677cc66835beb7793e98"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::file_mention::extract_file_mentions (cognitive 22): codewhale_tui::tui::file_mention::extract_file_mentions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":1300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae46708326c680582d43703c7738b9957d6dfcf50917e9f23df24847440d2805"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::catalog_picker_efforts (cognitive 22): codewhale_tui::tui::model_picker::catalog_picker_efforts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, 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/tui/src/tui/model_picker.rs"},"region":{"startLine":4986}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19ee5f0fe05547d11981f207e597dfc71798ae8bbe3d2f2b80dc9a79e515949"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::pager::wrap_ranges_into (cognitive 22): codewhale_tui::tui::pager::wrap_ranges_into has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2e6956b468453b16d1e73224f72678ee949d250942d3d37cd9cf27a85aaa2d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::slash_menu::visible_slash_menu_entries (cognitive 22): codewhale_tui::tui::slash_menu::visible_slash_menu_entries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 1 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/slash_menu.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d951e2e881931a52f850ed482c25a220bd09b70ad6330b0322af16dc63261336"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::tool_routing::apply_workflow_run_record (cognitive 22): codewhale_tui::tui::tool_routing::apply_workflow_run_record has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/tool_routing.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"563c57ba91ebb0d25f923f1b79a133fd04314de9aa103d9e0d4f07bf0375a514"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_engine_error_to_app (cognitive 22): codewhale_tui::tui::ui::apply::apply_engine_error_to_app has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/tui/src/tui/ui/apply.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4a435e8b6ed811e9e8cdd21ebafc208648f1d34c3076c2d19b023aed0f4e06"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::underwater::mcp_launch_lines (cognitive 22): codewhale_tui::tui::underwater::mcp_launch_lines has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/underwater.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5440b34cb0c3a23a7266a9d8cfa8fd76a9e46a7af53bdf5689be944ffb22f88"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::views::help::shed_to_width (cognitive 22): codewhale_tui::tui::views::help::shed_to_width has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/help.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3569b6c559922549c3b74906f9c1209c1592a93bb5c91bf00b445b03dcfaa6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::model::settled_file_activity (cognitive 22): codewhale_tui::tui::work_surface::model::settled_file_activity has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/model.rs"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e2488bc9c0d3b16cadb962bf20447bc529e22326aab02c2fb6cbf83d72905d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui_kit::markdown_render::render_parsed_tagged_with_palette (cognitive 22): codewhale_tui_kit::markdown_render::render_parsed_tagged_with_palette has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (5 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/markdown_render.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f6d0b41713d1363086f39192e9821e76c70f64b33547978ffc3ccfb06661b2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui_kit::osc8::strip_into (cognitive 22): codewhale_tui_kit::osc8::strip_into has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/osc8.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62dfe0976ecf908e5367cedddfd9a7e5e376f2af38660eddab54f6f5b8a6729"}},{"ruleId":"D2","level":"warning","message":{"text":"PetWorld.restore (cognitive 22): PetWorld.restore has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 17, if/else 4, ternaries 1. Of this number, 20 points are the body\u0027s own statements and 2 belong to 5 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e8322ddc8771b3714fc8b66679e30ec739a40b92d0e444e317573ae46bc353"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadStore.legacyThreadOwners (cognitive 22): ThreadStore.legacyThreadOwners has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"957e2985794502133bf603891920159842c55432fdebde0141d9c68f236df5cc"}},{"ruleId":"D2","level":"warning","message":{"text":"lib.parseQuestionAnswers (cognitive 22): lib.parseQuestionAnswers has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 4 (6 pts), loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2df850af70b92fb33d470c9447fc1fbfec5dac4ecf4b2a476fffb4c8862c6b"}},{"ruleId":"D2","level":"warning","message":{"text":"install.ensureBinary (cognitive 22): install.ensureBinary has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, ternaries 2, error handling 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":"npm/codewhale/scripts/install.js"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c600bf71fbed04d3f519cbfa954985009f6515c5ef952d7fe7519814de0fe6e"}},{"ruleId":"D2","level":"warning","message":{"text":"PetWorld.restore (cognitive 22): PetWorld.restore has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 17, if/else 4, ternaries 1. Of this number, 20 points are the body\u0027s own statements and 2 belong to 5 function items inside it that branch. 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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51981a50dbb80b9117dd5cbaba60dc4414799140497bf2b83a109f710346356"}},{"ruleId":"D2","level":"warning","message":{"text":"PetWorld.restore (cognitive 22): PetWorld.restore has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 17, if/else 4, ternaries 1. Of this number, 20 points are the body\u0027s own statements and 2 belong to 5 function items inside it that branch. 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":"pet/src/core/pet-world.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ae2e228db4559b4f3824afea5f6d2edb0de68ef24e1aaca0e6403bd2bfbd3f"}},{"ruleId":"D2","level":"warning","message":{"text":"install-guide-lib.buildInstallGuide (cognitive 22): install-guide-lib.buildInstallGuide has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 2, loops 2 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/install-guide-lib.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c29fc2fbde42d564bbc4f604afaf27ac2cfd56a8156801ad2d5c72d21362761"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 22): (anonymous) has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 12 (16 pts), other 4, boolean chains 1, loops 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/operate_best_of_n.workflow.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d799d7944f1ca009dfcfd33bcbfad13ae5e4cb4f32c69bc17de7f6df67c291e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::daemon_socket::platform::bind_with_owner (cognitive 21): codewhale_app_server::daemon_socket::platform::bind_with_owner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/daemon_socket.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeac6425a8a7e80785eac0d10f79cff9a409a00d9560a3f082ac1adf414b6b57"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::list_mcp_tools (cognitive 21): codewhale_app_server::runtime_api::list_mcp_tools has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":7586}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43d95e92655b060eb07ff4397e6e3616654dd883a094dadbf6849f179570d63"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::computer_display::run_session (cognitive 21): codewhale_app_server::runtime_api::computer_display::run_session has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/computer_display.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1efbe23411df2893df581c45b6b7eddcb142f49787849ff5ccd0cb98fe1b930"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::plugin_index::component_names (cognitive 21): codewhale_app_server::runtime_api::plugin_index::component_names has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plugin_index.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b003a1dbf2a45584f6afe99ef67c20a3c4017566ab887c267ce180036754deef"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::workspace::collect_workspace_status (cognitive 21): codewhale_app_server::runtime_api::workspace::collect_workspace_status has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/workspace.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"712a3a398e83fea51f285d7bdbf37abb1aef274c7c549242bd4e617b830fa99e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::thread_control::handle_owned (cognitive 21): codewhale_app_server::thread_control::handle_owned has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, match/switch 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/thread_control.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33c86a2816bb6ded8521a375de97c03926a0405f5ac71d463d91771f04deb84"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::settle_provider_request_receipt (cognitive 21): Engine::settle_provider_request_receipt has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 4 (8 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4779}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdc59e304d204ec41238fff13bbd9a4c4407cc59b500d524cf46eb95035ffa9"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::handle_idle_subagent_completion (cognitive 21): Engine::handle_idle_subagent_completion has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 4 (8 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9aab448ea48a264f859a6a01894a49748a2d9c5a480f3f4010216ae6af8f9ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::record_mcp_runtime_context (cognitive 21): Engine::record_mcp_runtime_context has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 8, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":9876}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab4b9463a3c67c36abc3cb43e78b7636e051835ff7760e469bd3112a1f09fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"HookExecutor::execute_message_submit_transform (cognitive 21): HookExecutor::execute_message_submit_transform has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dc6ea49349433eadc7aa5fd6d78dc8a62fb361c984b2a92f1d4f426c33e213"}},{"ruleId":"D2","level":"warning","message":{"text":"McpConnection::connect_with_backend_and_auth_context (cognitive 21): McpConnection::connect_with_backend_and_auth_context has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"7981524472b4b806f8d8c58c6a7c003e4a43a007ef795a931297adad053c17cf"}},{"ruleId":"D2","level":"warning","message":{"text":"RepoConstitution::render_block (cognitive 21): RepoConstitution::render_block has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (8 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context/constitution.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf375d7e99764d8a728f3037921ffa067f2f31f90e8c74d02d6f389d12cc6a38"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::spawn_dynamic_tool_settlement (cognitive 21): RuntimeThreadManager::spawn_dynamic_tool_settlement has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7546}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66504e1dacb6e96915eaf2dbff9437e20a891b1d375512abb59249c09a38434"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::execute_dynamic_tool (cognitive 21): RuntimeThreadManager::execute_dynamic_tool has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 7 (18 pts), loops 1 (2 pts), if/else 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":19552}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e16ef0bebb6bb4c097998fce30160bc7d0932a24fa306d128ce2edaa60c84d"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeUserInputSettlement::settle_claimed_user_input (cognitive 21): RuntimeUserInputSettlement::settle_claimed_user_input has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":3754}}}],"partialFingerprints":{"codehealthFindingId/v1":"903a02d5e5c7587d19035c4fb9613c93da92f87ed2defec84a8a9536c6c5ebd2"}},{"ruleId":"D2","level":"warning","message":{"text":"Run::repair_store (cognitive 21): Run::repair_store has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 5 (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/engine/src/session_reconcile.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77a343537da4c8275b5af4870f1ca213a553a6ddab9b155bbab4567decff325"}},{"ruleId":"D2","level":"warning","message":{"text":"TaskManager::apply_event_to_task (cognitive 21): TaskManager::apply_event_to_task has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":3325}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d6b640a5c1479811ec0ca56ea6c7fbb5cacac274ac8f8274431d87400540d5"}},{"ruleId":"D2","level":"warning","message":{"text":"DeliveryEvidence::changed_paths (cognitive 21): DeliveryEvidence::changed_paths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, 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/engine/src/tools/subagent/delivery.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"926989503eecec9c58e8e1e73bb1d12f88297aad496a369bbcace2d2474e1033"}},{"ruleId":"D2","level":"warning","message":{"text":"ChildAuthority::validate (cognitive 21): ChildAuthority::validate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"b889bbe8a077fdc31e20a89a68ba86086ab2503709e9bdadc98e4f2ac128a2ef"}},{"ruleId":"D2","level":"warning","message":{"text":"UserInputRequest::validate_transport (cognitive 21): UserInputRequest::validate_transport has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 7, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/user_input.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35c252d3bfc9e30af5429ba3c5ae4a964f95ec9a55a12080dff9ce9b69b7442"}},{"ruleId":"D2","level":"warning","message":{"text":"SlotLedger::classify (cognitive 21): SlotLedger::classify has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ad2fb066e9a701d9ae063192c01f897ab8953b5c4ea98aaa58d7289a687fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::compaction_archive::load (cognitive 21): codewhale_engine::compaction_archive::load has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction_archive.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff891fb8df1d3703041f8e2dad1b9d3bc021597df0a7311c2beadfc47c8b29a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::windows::verify_token (cognitive 21): codewhale_engine::extension_host::windows::verify_token has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 3 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5d980b11f5a7e28c2443772da58d1ef7e9501023db03a13c079bb404819fdd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::fleet::members::add_fleet_model (cognitive 21): codewhale_engine::fleet::members::add_fleet_model has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/members.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0276d306a55e79bfc5b9a1c7ddb5dc9c57788368120334222484bc42f23b4d2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::fleet::placement::decide (cognitive 21): codewhale_engine::fleet::placement::decide has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 3, match/switch 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/placement.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"956c524e2321818a626029e3d2ebbab46308c9a1eb8be8ee1742f3315da9b09f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::project_context::project_context_cache_candidate_paths (cognitive 21): codewhale_engine::project_context::project_context_cache_candidate_paths has cognitive complexity 21 (threshold 15). Drivers by points: loops 7 (12 pts), if/else 4 (9 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce6a54b873e3cf2b9f7200cabac6afe0cc8c1c2a997ff252ba3ae1ac837959c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::receipts::snapshot_turn_changes (cognitive 21): codewhale_engine::receipts::snapshot_turn_changes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b311c8c3fe77419a232f2d8ce2ef46dc4b09fabb8abc754fcc78176309c3bb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::route_billing::capture_product (cognitive 21): codewhale_engine::route_billing::capture_product has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_billing.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1afb5b1902be78f823a48d13cc7577cc23ccc1df1d3010fc882ccda4b40895"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::approval_summary::approval_summary_in (cognitive 21): codewhale_engine::tools::approval_summary::approval_summary_in has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 9 (14 pts), if/else 5 (7 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/approval_summary.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2c7f9644701874fd62bece3800c7160b94fb080fb7b7127ae1714ad0204767"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::file::apply_contract_edits (cognitive 21): codewhale_engine::tools::file::apply_contract_edits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":2934}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc024cf12e2d8335a8cc83fe8c8c6684463434fd66e095d80ab5b27a77fc1d80"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::review_core::introduced_lines (cognitive 21): codewhale_engine::tools::review_core::introduced_lines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 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/engine/src/tools/review_core.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9787410227e9e3c1ae664a53d171fed725dc340f0674634b89f0ec6a10b7bb49"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::spawn_workflow_task (cognitive 21): codewhale_engine::tools::subagent::spawn_workflow_task has cognitive complexity 21 (threshold 15). Drivers by points: if/else 19, boolean chains 1, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":16215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80f9d0272af44bff03ae062f916665edb2f8f5752e8bb00272a9401de9f0a31"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::worktree::git_repo_root (cognitive 21): codewhale_engine::tools::subagent::worktree::git_repo_root has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/worktree.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9044565aae35f2f87c1cfe4989c64d05ba1432d32c5ef9698c8fdfba6c597c47"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web_run::extract_duckduckgo_vqd (cognitive 21): codewhale_engine::tools::web_run::extract_duckduckgo_vqd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":1085}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a00a599029bddb5357e89205b2265faeef2f957d9cc64d80dc697146de89e4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::turn_route_plan::plan_turn_route (cognitive 21): codewhale_engine::turn_route_plan::plan_turn_route has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (18 pts), match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/turn_route_plan.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a681bdd125b48b65939781c237d344238713af5b1e7fefdc80ed4d7a20730e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::work_graph::reducer::apply_pure (cognitive 21): codewhale_engine::work_graph::reducer::apply_pure has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/reducer.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"27395c0fe23b819ede57cab2de504f7e1bdd967b8fc1a5b0137584b20b315e54"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::capture (cognitive 21): Store::capture has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/memory/src/store.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53223ca67091be4d92aaab6a10b5e57fda7e02425b0487f7ea1c89b1bf75e6b"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginRegistry::restage_inner (cognitive 21): PluginRegistry::restage_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e9d4e0416bcb42e5af89839771c3d420213eef27cab4fd882f8a762bfd8c37"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::place::finalize_install (cognitive 21): codewhale_plugins::install::place::finalize_install has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/place.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dde1dc4771bbd94d96e27650c537f3e26e765c63bcdb67e79a011cc77a4451a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::marketplace::parsers::claude::normalize_claude_source (cognitive 21): codewhale_plugins::marketplace::parsers::claude::normalize_claude_source has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c640b1a3370585e86dc7d374e941801346dd09a7aae7cb8eb6fd307ae42298"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::approval_policy_control (cognitive 21): Config::approval_policy_control has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3513}}}],"partialFingerprints":{"codehealthFindingId/v1":"6273a0303a1468af54dad8e4e2e738fcda69de4d976c0391cb5c4bdc4a1a30ea"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkingSet::append_resident_file_contents (cognitive 21): WorkingSet::append_resident_file_contents has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 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/runtime/src/working_set.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f35bbea613777d936bed29b7bb1b37d96dddda1524a7102aeaf24be5c19ad9b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::session_diagnostics::analyze_session_failure_jsonl (cognitive 21): codewhale_runtime::session_diagnostics::analyze_session_failure_jsonl has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/session_diagnostics.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f2e1ba01af791550fc8b5a86935b0442d1534d11c19399cb4f829b30772176"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_sanitize::redact::redact_single_keyed_assignment_at (cognitive 21): codewhale_sanitize::redact::redact_single_keyed_assignment_at has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 5, 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/sanitize/src/redact.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde9fdef71ba8bab0fa93bcfe66a3a62d23a355944240a2383991290f27b3446"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_sanitize::sanitize::hidden_chars (cognitive 21): codewhale_sanitize::sanitize::hidden_chars has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 7, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/sanitize.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4338e2f41bc014db624002e01ddb873a41892f4bcfca460af9b8951c8eb94974"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skill_install::install::install_with_registry (cognitive 21): codewhale_skill_install::install::install_with_registry has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/install.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cdca59531e6d590c3a9384d71f29f81eda7b38e3d45333d66a338a8ceec156"}},{"ruleId":"D2","level":"warning","message":{"text":"StateStore::migrate_schema (cognitive 21): StateStore::migrate_schema has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/state/src/lib.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"889efb82d7d0aa1bb90ca75eb830fb949941eb65b7bf97b0bad2686948e433bd"}},{"ruleId":"D2","level":"warning","message":{"text":"FileMutationReceipt::from_success (cognitive 21): FileMutationReceipt::from_success has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/file_mutation.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd06fcdb53df7f8df1648ddac20d24201747a2a9825ee6bef38619ac14bf92a"}},{"ruleId":"D2","level":"warning","message":{"text":"TextField::key (cognitive 21): TextField::key has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3aaecda055af807493d5c5f518f428f48aba11b174ce7f40b477ba44d0776a"}},{"ruleId":"D2","level":"warning","message":{"text":"TextField::render (cognitive 21): TextField::render has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca159adaac95e186a3a1d4e5716463226e547b9a8f7a0c1c9211ac4c71139f1"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetSetupView::render_review (cognitive 21): FleetSetupView::render_review has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 2, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6e678d3bada07659bf4c81c11326c2c9b768f8706831908ab63ce0475ed2f4"}},{"ruleId":"D2","level":"warning","message":{"text":"Worker::start (cognitive 21): Worker::start has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 6 (18 pts), if/else 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e275efb2c4a9b97d49392d1d70eeefa4ae8d264e280263a479c92a6f808388f2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::project::init::detect_test_frameworks (cognitive 21): codewhale_tui::commands::groups::project::init::detect_test_frameworks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/project/init.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f16c3fd6c92b9130241cadde479f99215f8840912a623c7b093b8ccc9ccc97"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::approval::build_prominent_details (cognitive 21): codewhale_tui::tui::approval::build_prominent_details has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"137cd5e71e981203ab1f26acb1c98db1c4448446c509dcfeb672af40ef5fee89"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::command_palette::build_mcp_entries (cognitive 21): codewhale_tui::tui::command_palette::build_mcp_entries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (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":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"5867fb6fee880320690416ca7e5e5146dba1d588b087b44835aa64942abd9602"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::file_picker::push_matching_files (cognitive 21): codewhale_tui::tui::file_picker::push_matching_files has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_picker.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d29dc76250a29f4ebb6dd5e207bcf2bd091c77520ef4333476e733643d0eea2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::file_tree::render_file_tree (cognitive 21): codewhale_tui::tui::file_tree::render_file_tree has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (2 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/tui/src/tui/file_tree.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d6737cccf42c4682bfad7c4fc42a46ccb824e0d9b5ffd3317d6c6149bf640e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::herdr::worker_loop (cognitive 21): codewhale_tui::tui::herdr::worker_loop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/herdr.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae7e891ece03d360512b9d299d5d762ca4daed1dc922a45fedc9c25b4fd4031"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::archived_context::render_archived_context (cognitive 21): codewhale_tui::tui::history::archived_context::render_archived_context has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 1, 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, 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/tui/src/tui/history/archived_context.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace4cb093b10394135551f26d5250c3bdaa64f2ecaa6b800cde3a6aaba40bc70"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::activity_detail::reasoning_timeline_text (cognitive 21): codewhale_tui::tui::ui::activity_detail::reasoning_timeline_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/activity_detail.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"41064d2dd39e7ed70255b3c6a5a13a98e63d014c7dd09cd96cd4da1a4b62fd45"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::widgets::transcript_legacy::apply_selection_to_line (cognitive 21): codewhale_tui::tui::widgets::transcript_legacy::apply_selection_to_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/transcript_legacy.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff2833f6eb29eeb07cbe093eb343940fa7d7870387720be179afd99f33603b9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::render::rows::layout_agent_row (cognitive 21): codewhale_tui::tui::work_surface::render::rows::layout_agent_row has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/rows.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4a9441b830a36a60684b3233b7006cba3f770b4a82371cdb907b7b93943e78"}},{"ruleId":"D2","level":"warning","message":{"text":"app.workflowReceiptPresentation (cognitive 21): app.workflowReceiptPresentation has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (9 pts), boolean chains 8, if/else 3, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b2d5caf4611420b21cf15c34a9e166af122bb36035908e30e73ee55c79b947"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::work::assign (cognitive 20): codewhale_account_cli::work::assign has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (4 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/work.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"136c45140cc6f060b04be82c9088a0f694abfabc5d3a81a5d8082e6151fac75d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::work::cancel (cognitive 20): codewhale_account_cli::work::cancel has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/work.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"9379229418501bc91f7a43ce822241ac199b628677c213c8209fecc034305c86"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::switch_provider (cognitive 20): codewhale_app_server::runtime_api::switch_provider has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 6 (8 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":13195}}}],"partialFingerprints":{"codehealthFindingId/v1":"7720a74ab9524a59d56a1b2ea5e0eec4a07bb0e03bfdc21dc3fc8943af0a54b3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::push_plan (cognitive 20): codewhale_app_server::runtime_api::git::push_plan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 3 (5 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/app-server/src/runtime_api/git.rs"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"78850a1c7e19a4ee6eb437b81b7f907ea5ec1c1fdb7060b180563c71aab0f202"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::memory_lens::act (cognitive 20): codewhale_app_server::runtime_api::memory_lens::act has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts), boolean chains 2 (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/app-server/src/runtime_api/memory_lens.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8551153e1c520f389eef0c04fd72edfd958f38be480991448606a32ca538ea87"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::thread_history::legacy_journal (cognitive 20): codewhale_app_server::runtime_api::thread_history::legacy_journal has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (9 pts), loops 6 (8 pts), if/else 2 (3 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1ffc4e42c0a589559ea783145c7026a245b47a907121b9148e7740ff4c6594"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_chat_relay::project_native_event (cognitive 20): codewhale_app_server::runtime_chat_relay::project_native_event has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 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/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62509e5565e9429872ff68cb02da2a44a7a6d4a0534562d71ffad27dd1ad0b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::fields (cognitive 20): Builder::fields has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0639345e5abb698fdaf8c551236067d7662b1b5ead2c3c1b7846760f7ac39a6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server_protocol::schema::typescript_defs (cognitive 20): codewhale_app_server_protocol::schema::typescript_defs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/schema.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1388c5feb92c6b7d64d35f1fd265c14a57f0c9fa20a423e27bbebef4b947f21e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::run_auth_migrate (cognitive 20): codewhale_cli::run_auth_migrate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (4 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/cli/src/lib.rs"},"region":{"startLine":5414}}}],"partialFingerprints":{"codehealthFindingId/v1":"123c9d22f4e9a9d876acecb9468be3a7b1d88f33047d0663f293f340dacf2615"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::config_bundles::run_import (cognitive 20): codewhale_cli::config_bundles::run_import has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 4, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/cli/src/config_bundles.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccec2f2d422ebbd233bcfd8c311b866416061e1a47af2c37eaff5caa5b3043fb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::metrics::read_events_jsonl (cognitive 20): codewhale_cli::metrics::read_events_jsonl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (8 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/cli/src/metrics.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a69c8426599b1b34bd89550c598bc7c6e40d55fb75c0a4dfc90a72c15ff6da"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigToml::set_value (cognitive 20): ConfigToml::set_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_resolve.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"4714a23700c7f02b72f7a648c0fbd6657894905716c3962163ff2aa7784cd2ce"}},{"ruleId":"D2","level":"warning","message":{"text":"OfferingPricing::quote_cost (cognitive 20): OfferingPricing::quote_cost has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (8 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/config/src/pricing.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"da98c4355d946bf1aeaf0ac94c23cf79bd2922de925bafada7e0af9c6e20e81b"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionHostManager::execute_launch_for_caller (cognitive 20): ExtensionHostManager::execute_launch_for_caller has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 3, match/switch 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/engine/src/extension_host/execution.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ed75a7ab2c8bff661fa8989eb5d3fc01a8be0e7abbbf1a8f60c93e8d641983"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::lookup_turn_operation_projection (cognitive 20): RuntimeThreadManager::lookup_turn_operation_projection has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 4 (5 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12434}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4927dc7f1f65a5735e2de2b46b3ef48fe7ec5df1fc1c6baddb2b2500b9cf68"}},{"ruleId":"D2","level":"warning","message":{"text":"Run::store_dirs (cognitive 20): Run::store_dirs has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 3 (7 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_reconcile.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b00bdfba68a0f884b0bd57d47bd778bbb41e6d7fc54ce1d6345f4309e18fcfb"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedOutputAccumulator::snapshot (cognitive 20): BoundedOutputAccumulator::snapshot has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell/output.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ba69c6335f38f4fb847b3488b4a7c94c7ecb978f78addff02ac1005553c733"}},{"ruleId":"D2","level":"warning","message":{"text":"PersistedSubAgentState::validate_worker_origins (cognitive 20): PersistedSubAgentState::validate_worker_origins has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"534832f84a65ac51e81082d5dd2d9c82dbe23b1369e74ec83aedde1d20033e5c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::baseten_to_catalog_offering (cognitive 20): codewhale_engine::client::baseten_to_catalog_offering has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":6755}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0234f964b1ab43a1a48a0cdb613090ae7d3eb9ab17dadda977dd082c63ce5d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::cost_status::child_usage_records_from_metadata (cognitive 20): codewhale_engine::cost_status::child_usage_records_from_metadata has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"209636e488e69a372b7cd8cb92d3f4667ec186fab67837a50d4efe922ed346a8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::llm_client::sanitize_http_error_body (cognitive 20): codewhale_engine::llm_client::sanitize_http_error_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/llm_client/mod.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"162ae8ecae96a7f4826b6b65c72ec26a4a6c9dc6e5185e073a6fcf0ea7d9772f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::model_routing::auto_route_inventory_recommendation (cognitive 20): codewhale_engine::model_routing::auto_route_inventory_recommendation has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_routing.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea32d7f489e522adf2742fcddc395c0465db95149e7d85c49c96baf4f5e3c63"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::file::nearest_match_hint (cognitive 20): codewhale_engine::tools::file::nearest_match_hint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":3552}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cc203f140ace7f6512cfaa1571cec67ab02a51b4757a64f90625fbad0fdd2b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::shell::build_shell_delta_tool_result (cognitive 20): codewhale_engine::tools::shell::build_shell_delta_tool_result has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14, boolean chains 4, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":7475}}}],"partialFingerprints":{"codehealthFindingId/v1":"33550c8863343843f93d8a3f372d79bdff78f844f53b4c0bcb59489bbf51ff72"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::coord::wait_for_all_children (cognitive 20): codewhale_engine::tools::subagent::coord::wait_for_all_children has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (6 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/engine/src/tools/subagent/coord.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb6b28237a694588ab750955b16f6363c42a99f641d0dd735545151bcc542a6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web_search::host_provider (cognitive 20): codewhale_engine::tools::web_search::host_provider has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8260fca72f778fabb17cd139cf5cf0ed73ea51ddfdcea510670c797e4cc11954"}},{"ruleId":"D2","level":"warning","message":{"text":"Expander::record_powershell (cognitive 20): Expander::record_powershell has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/shell_expand.rs"},"region":{"startLine":1487}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d02d56dbbe9e490fd682b94f8ae15c558d549e7f547542dd4ebc226dc064e1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::agent_text_filter_options_match (cognitive 20): codewhale_execpolicy::command_safety::agent_text_filter_options_match has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a402f667c6c599f8ee18fdbdea8890428b9880b5f0d865d59cc11ae052a5c30"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_notify::delivery::notify_with_sinks (cognitive 20): codewhale_notify::delivery::notify_with_sinks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/notify/src/delivery.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2907b8b2bc725f0e206602f9d0a74baed7c32761ac3aacabedcee228ad100b66"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::agent_plugin::parse_kimi_plugin_json (cognitive 20): codewhale_plugins::agent_plugin::parse_kimi_plugin_json has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), match/switch 3, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/agent_plugin.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"59750bb396a3b812f575537e5b8ba2f24c794e501a5a19c75609aadab21b18c3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::discovery::scan_root (cognitive 20): codewhale_plugins::discovery::scan_root has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (6 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/discovery.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"334697fa6884dec0b2a3adeb84d2fee448391d04a0680cd2991f311a8cbb0668"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::update (cognitive 20): codewhale_plugins::install::update has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/mod.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba0919c0155852f4ea7385c82f65625ef273ddea87aa2dd509cd75ada50325c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::dsh::load_bundle (cognitive 20): codewhale_plugins::install::dsh::load_bundle has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), match/switch 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"106cf026d62c290c72e363e6320b69d922063a68fe4296082cf16d02d0211034"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::recommend::idle_and_catalog_keyword_matches_for_os (cognitive 20): codewhale_plugins::recommend::idle_and_catalog_keyword_matches_for_os has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/recommend.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fb4cf9face532d5ef55d2f339792b742c64c5b749d3be274b991e17b3b4213"}},{"ruleId":"D2","level":"warning","message":{"text":"Inventory::summary_lines (cognitive 20): Inventory::summary_lines has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/installs.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6341fbfb763cf2654da572729ad4ec0172f00284cf9efe67d9c69889d6e85ec"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::oauth::revoke_owned_login_locked_with (cognitive 20): codewhale_runtime::oauth::revoke_owned_login_locked_with has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), match/switch 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/oauth.rs"},"region":{"startLine":4148}}}],"partialFingerprints":{"codehealthFindingId/v1":"33be827464666ef01eb27c61737e55c0baec8d0e596ec983e854004cd65f3c96"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::settings::fold_tui_prefs (cognitive 20): codewhale_runtime::settings::fold_tui_prefs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8fb469c0097146fb5d200dbefbc9bdf044862ae1dd366dd7ef24a0ccead2a6d"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotRepo::restore_path_plan_locked (cognitive 20): SnapshotRepo::restore_path_plan_locked has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5, boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"27dcb755259af926cf1d02851ae23ccf9287827441a7fedc7c3d8af419151738"}},{"ruleId":"D2","level":"warning","message":{"text":"DebugDiagnosticsAdapter::cache_telemetry (cognitive 20): DebugDiagnosticsAdapter::cache_telemetry has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 5 (6 pts), match/switch 3, loops 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/debug_diagnostics.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a247e78ccb6e80c9983c9b429ecafa983da6821d5beed4efc6296bc03494a872"}},{"ruleId":"D2","level":"warning","message":{"text":"App::cumulative_usage_chip (cognitive 20): App::cumulative_usage_chip has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":3230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7de5e25b2a9db1df0524df1757ad5fae8ff09f2be967c03620e0d88c62117b"}},{"ruleId":"D2","level":"warning","message":{"text":"App::rebase_active_cell_bindings (cognitive 20): App::rebase_active_cell_bindings has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":6288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a573e4a07dc1f712902f9707a23474ed86758a62a52f6609677d5cbb233df9a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecCell::render_calm (cognitive 20): ExecCell::render_calm has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f64e68796c08b7a4dbc9e489a1d19d8cf6a6198af53cf189219440a1bf759d8"}},{"ruleId":"D2","level":"warning","message":{"text":"UserInputView::render (cognitive 20): UserInputView::render has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 2, 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, 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/tui/src/tui/user_input.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"de70f1d886d3ac219552f3ea39310c90bbd55293582cec6ba1d45695bcfca118"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetSetupView::render (cognitive 20): FleetSetupView::render has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2872b0754431c4da7f78c5b84c6708f2cfacbe47c82a021a7f1919339057ffef"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigView::handle_key (cognitive 20): ConfigView::handle_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":4237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ea9f199b834348bac5e2a7c14d4b975e7d76fb88eeb8f79e006db2d7178e24"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::core::provider::provider (cognitive 20): codewhale_tui::commands::groups::core::provider::provider has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/provider.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab7821ba194159f330be1c44e8b18fc22914805fb0d128af2789357479ee0cf"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::core::workflow::pending_workflow_draft (cognitive 20): codewhale_tui::commands::groups::core::workflow::pending_workflow_draft has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/workflow.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1481a7e8f725c5c99b57dfb00251e54a007223ba53ebaa34b7e7ad2f61d93ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::plugins::headless::trust (cognitive 20): codewhale_tui::commands::groups::plugins::headless::trust has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/plugins/headless.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4142398d8e4cd09252448789f82fd502c7d6942e7a0e19d87e44e024eed56aae"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::project::init::ensure_deepseek_gitignored (cognitive 20): codewhale_tui::commands::groups::project::init::ensure_deepseek_gitignored has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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/tui/src/commands/groups/project/init.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a7d546cdfd6d78ad20add15e049049091e45e21d5998e85df1537b743e37f4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::agent_focus::render_focus (cognitive 20): codewhale_tui::tui::agent_focus::render_focus has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_focus.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf8e4969f73d00065313882a8a07b734b0dc91a670546108653bf12730931e6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ambient_life::pet_cameo::paint (cognitive 20): codewhale_tui::tui::ambient_life::pet_cameo::paint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ambient_life/pet_cameo.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35c9b40db8a100a5df4e554be8adf19a54bfb554c0071ceb589dab70b204541"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::agent_activity::delegate_identity_fallback (cognitive 20): codewhale_tui::tui::history::agent_activity::delegate_identity_fallback has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (20 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/agent_activity.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea8ece528c1090931836483fa78d73582dd34f3b603dbd2cbcf28cb65a6e69f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::thinking::render_thinking_with_preview_limit (cognitive 20): codewhale_tui::tui::history::thinking::render_thinking_with_preview_limit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, loops 1, match/switch 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, 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/tui/src/tui/history/thinking.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddb2e2eed302d5bf8354f9c7b2c897a1f857ffd4b56389ac6c8357e5bc6bcd5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::setup::tools_mcp::mcp_snapshot_inventory (cognitive 20): codewhale_tui::tui::setup::tools_mcp::mcp_snapshot_inventory has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/tools_mcp.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3d5d58528bcb242d3dce60bc207abc346779c35ac21e32bfdcb6f4cb3957c0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::activity_detail::turn_inspector_text_for_range (cognitive 20): codewhale_tui::tui::ui::activity_detail::turn_inspector_text_for_range has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/activity_detail.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe505ed9e12166c265756c530d07bd9f404149d9ef7d6222a5170b12b0ee420b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_provider_picker_setup_confirmed (cognitive 20): codewhale_tui::tui::ui::apply::apply_provider_picker_setup_confirmed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":4214}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c3ca686441ce9553c8e2f19ad840859dedc94bb5575a7ca93730f4d86f3716"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::session_state::poll_fresh_session (cognitive 20): codewhale_tui::tui::ui::session_state::poll_fresh_session has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 4, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/session_state.rs"},"region":{"startLine":1963}}}],"partialFingerprints":{"codehealthFindingId/v1":"900d3b06cf9fa610272b32beea57b5b0a747d7ae483d26a5e45b880642052822"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::widgets::composer_legacy::wrap_input_lines_internal (cognitive 20): codewhale_tui::tui::widgets::composer_legacy::wrap_input_lines_internal has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"50718840da0f5c293526d626ddcc311eacd52a30427ea80dd3a8546d4edffb30"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::widgets::composer_legacy::wrap_text (cognitive 20): codewhale_tui::tui::widgets::composer_legacy::wrap_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bde789625aaad3122205a6e8e866de9dd6f62514acf4d042e6dcb1163ee52a0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.runPrompt (cognitive 20): index.runPrompt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"18451a5117dc298f226f4f8e088b78d6c1a8ca60770e431e90a2dbf103cf3b6a"}},{"ruleId":"D2","level":"warning","message":{"text":"audit-dependencies.classifyAudit.mitigated (cognitive 20): audit-dependencies.classifyAudit.mitigated has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 5, 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":"web/scripts/audit-dependencies.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d096c383d29aeaf3b3341fc82f6b1c010e35f7d34761e703153b30d9c80924b8"}},{"ruleId":"D2","level":"warning","message":{"text":"compare-deployed-facts.main (cognitive 20): compare-deployed-facts.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, ternaries 2 (3 pts), error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/compare-deployed-facts.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"59be5054cac3e6acf492b2ad0c53276619ad70243048b9be56292a4ce1cbf043"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::validate_verification_url (cognitive 19): codewhale_account_cli::validate_verification_url has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":3534}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3fc1539bbd8e37c588cab09ca5414b8697a0083aee74a59a3e8af07039cfd9"}},{"ruleId":"D2","level":"warning","message":{"text":"DaemonSocket::serve (cognitive 19): DaemonSocket::serve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/daemon_windows.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e631592c59a2cf573dc80210ff8d41e042b6c3bebc37a95ed605b8e185dfa4ad"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketLines::poll_read (cognitive 19): WebSocketLines::poll_read has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/websocket.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"55249ec1a5c04ad63d5762b8f02ad3007e396a6f8415ade46249b388c9442e4b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::apply_write_request_to_config (cognitive 19): codewhale_app_server::runtime_api::apply_write_request_to_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":8119}}}],"partialFingerprints":{"codehealthFindingId/v1":"39344ffce37659339c29b1b87776fee74bf42cd7c0de198d0e6490b9a05e7764"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::provider_model_entry_for_api (cognitive 19): codewhale_app_server::runtime_api::provider_model_entry_for_api has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":12558}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cfbb481078623f4f87697e2d4e1d8f5ce9605ed64115144eb2b6ff17c4daa4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::members::start_thread_member (cognitive 19): codewhale_app_server::runtime_api::members::start_thread_member has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/members.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"69067f046a2f7c1eac32997ad77b61a841cc7dcf448161c186fe27c5c2203516"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::plugins::prepare_plugin_ui (cognitive 19): codewhale_app_server::runtime_api::plugins::prepare_plugin_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, 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/app-server/src/runtime_api/plugins.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4694948b073f969d2f06d3e857702f00c1f0b27be43e4b8a7304f7d3717fa12"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::tool (cognitive 19): Collector::tool has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics/stats.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1c85eba2f1a80e456872b36bfbc074a66b19d5379c486440b6c82ea861715c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_commands::diagnostics_reports::receipts::action_phrase (cognitive 19): codewhale_commands::diagnostics_reports::receipts::action_phrase has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 5 (9 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/diagnostics_reports/receipts.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdc201d2e0a96f9b8a9496dd4cd3c8f54d87c252be0d76e8ca9d0712105ec07"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonObjectSpans::next (cognitive 19): JsonObjectSpans::next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/user_constitution.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c252941478f19d7c616ddb71fb83c3ec7965682e5648941080619fc41970d6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::drain_mcp_boot_updates (cognitive 19): Engine::drain_mcp_boot_updates has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":9095}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84760d6f02676e06fd7d84e0ded8e35705f976365f2b06acb0ebf352bd7fd3e"}},{"ruleId":"D2","level":"warning","message":{"text":"McpOAuthRuntime::refresh_and_persist (cognitive 19): McpOAuthRuntime::refresh_and_persist has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/oauth.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"8710e574a1f3a6d3c65edaa381793204d459b69a467cf5faca65c4d47a83d917"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadStore::newest_message_text_by_thread (cognitive 19): RuntimeThreadStore::newest_message_text_by_thread has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (9 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":3768}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1c92faff83d29337ccd95f383b8e1003730956ed49ed10d762f7c88f8b1da9"}},{"ruleId":"D2","level":"warning","message":{"text":"ChildAuthority::validate_claim (cognitive 19): ChildAuthority::validate_claim has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"a822e8f07162d337ddb8307fbc700e2d38fa77a2e1fbc5be4ba969f9abfa8763"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentManager::commit_prepared_child (cognitive 19): SubAgentManager::commit_prepared_child has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, 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, 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":10404}}}],"partialFingerprints":{"codehealthFindingId/v1":"08acfe955ff8d38b2e40c9e31ee08439ba815422e3e448702421c7ebb4a3e297"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentManager::ensure_caller_controls_descendant (cognitive 19): SubAgentManager::ensure_caller_controls_descendant has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":10847}}}],"partialFingerprints":{"codehealthFindingId/v1":"921d96eb42ab5e8d083e60b79cb1160d9ce4be84940b4cd1047dc8a5bdf78146"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentManager::commit_terminal_result (cognitive 19): SubAgentManager::commit_terminal_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3 (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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":11636}}}],"partialFingerprints":{"codehealthFindingId/v1":"f391ef49ccd78c4c11c9a14cc9e6c2ddadfadbdab262aa185081457d60677839"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::anthropic::apply_anthropic_cache_breakpoints (cognitive 19): codewhale_engine::client::anthropic::apply_anthropic_cache_breakpoints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"39735dc3a7db98d5871eab5fa580112928d32c941b2d92babf4fdc96c97931eb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::engine::dispatch::mcp_tool_approval_description (cognitive 19): codewhale_engine::core::engine::dispatch::mcp_tool_approval_description has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (7 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/dispatch.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb32635f4ddfaf7c6c4e24dda539e0bfb8215b9b3d252d8984822fec9e07155"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::core::engine::tool_catalog::likely_field_corrections (cognitive 19): codewhale_engine::core::engine::tool_catalog::likely_field_corrections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_catalog.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45d1a85e5622dfe92e37995e78044cc107e53a78040428d179f8f57c7338239"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_settings::validate_change (cognitive 19): codewhale_engine::extension_host::dsh_settings::validate_change has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_settings.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"1232f7446109fa2ad91fd164623adb6ee37522f472ed17785ec53705ed1458c6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_terminal::serve (cognitive 19): codewhale_engine::extension_host::dsh_terminal::serve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 3, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_terminal.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ea691adaa30dc38676158301602f3712da39ae822be1b6b1d8456ab0d55b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::prompt::render_prompt_sections_inner (cognitive 19): codewhale_engine::extension_host::prompt::render_prompt_sections_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/prompt.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8b75f64ec611fb9e789e2f665aa7a9c0b321d769689852113539771a259e49"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::llm_client::rate_limit::inspect_json_envelope_with_disclosure (cognitive 19): codewhale_engine::llm_client::rate_limit::inspect_json_envelope_with_disclosure has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/llm_client/rate_limit.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6fddd608794d7d3c97f4663aca2ee2f491bf55f0aaf6ac2de7691ddb695889"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::approval_summary::mcp_summary (cognitive 19): codewhale_engine::tools::approval_summary::mcp_summary has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 10 (18 pts), if/else 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/approval_summary.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"b559dc3cd526ed8e0a60fa26754ec585f2ef5f0a46a9e8bcea2cdde821b0f017"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::git::generate_commit_message (cognitive 19): codewhale_engine::tools::git::generate_commit_message has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":1174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44a72a8bf2a5d20141bd3491290659c2d2d31b4a6de471d6e67539ed0d36b81"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web::extract::sniff_media (cognitive 19): codewhale_engine::tools::web::extract::sniff_media has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/extract.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"09136593a1d412257b8791f8b8dd6a636f66c6e5ee58e6a20a87d0462f666614"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::options_match_allowlist (cognitive 19): codewhale_execpolicy::command_safety::options_match_allowlist has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3909c63df91dc25e3a239d2e1b7a9232be8284b90139ec084db604ea8dde22"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::shell_expand::command_option_payloads (cognitive 19): codewhale_execpolicy::shell_expand::command_option_payloads has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (7 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/execpolicy/src/shell_expand.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"01baa42b83288bb2775916a50c50d3be6eeb89cba4ff283d00b40ab5d94f4391"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_localization::parse_locale (cognitive 19): codewhale_localization::parse_locale has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 3 (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/localization/src/lib.rs"},"region":{"startLine":5809}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7cb02f8fe5ab6144f0e9fcda38f48f40547344a469a99169b54148c5423a47"}},{"ruleId":"D2","level":"warning","message":{"text":"Store::advance_context (cognitive 19): Store::advance_context has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 2, 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, 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/memory/src/lens.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02f250afcdb6ea9a9071f3834705b57d3637342ac64d2532b7ddbc15a4d2ca0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_palette::adapt::adapt_bg_for_grayscale_palette (cognitive 19): codewhale_palette::adapt::adapt_bg_for_grayscale_palette has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, boolean chains 8, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6889fb028809ab18ff1b0126e961883ac34f8099fb51ba676161c443c464ea"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::marketplace::parsers::claude::parse_claude_entry (cognitive 19): codewhale_plugins::marketplace::parsers::claude::parse_claude_entry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 17, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd36d8cdc6df2ff334cd27db7b916c9666c5d103f555870eef3875a33a42f59"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::allow_shell_control (cognitive 19): Config::allow_shell_control has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3606}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4869c5b7bc537f131a23f6c33a8b5bb9e8bb46521c24e13f14bf365d85de24d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skill_install::recommend::recommend_one (cognitive 19): codewhale_skill_install::recommend::recommend_one has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (6 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/recommend.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2417ebebb8bbb27667b68c5c24899d292efe763db7b899eaba33eb8cd818dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"SetupWizardView::handle_key (cognitive 19): SetupWizardView::handle_key has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb51f43d19b190a20b401e0458dba30c97338bcc53d8a2b228bdda9da81bf58"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationsView::handle_mouse (cognitive 19): AutomationsView::handle_mouse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 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/tui/src/tui/views/automations.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cd5a5509fbf3d336828dc1f3f4e2a577b45110bf3b727e2a8e14beee48009f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionsSnapshot::with_recommended_actions (cognitive 19): ExtensionsSnapshot::with_recommended_actions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/extensions.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c64f586c6161a7db9fe52b271f88ffb25bd4641177a3d543fdb1760dd95c74a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::resolve_credential_diagnostic (cognitive 19): codewhale_tui::resolve_credential_diagnostic has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":4847}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b3ff506de06b571f14bb28bb2c5f939e22ce4af5537321d49d3a952b92af90"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::contract::scan_managed_plugins_portable (cognitive 19): codewhale_tui::commands::contract::scan_managed_plugins_portable has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 5 (8 pts), boolean chains 2, loops 1 (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":4058}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d661cf1bb24c81017cdaa44355cb356ea94a4d2b0624829d05093b2c43107ca"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::skills::skills::inspect_skills (cognitive 19): codewhale_tui::commands::groups::skills::skills::inspect_skills has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/skills/skills.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1aa83ffae55629dc54bb6029a88a31cbd172d3a71da4d1610a0ef5e67c6a616"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::composer_ui::handle_composer_history_arrow (cognitive 19): codewhale_tui::tui::composer_ui::handle_composer_history_arrow has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8, match/switch 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, 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/tui/src/tui/composer_ui.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7467404a6128b09cb8a7244f5e7c9bde73bb9ea7eeffb5900a762bd6ac35add"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::context_inspector::push_system_prompt_structure (cognitive 19): codewhale_tui::tui::context_inspector::push_system_prompt_structure has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (6 pts), match/switch 3 (4 pts), boolean chains 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/tui/src/tui/context_inspector.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a10d5f0ce2740e647c2d19168df5fcb273a53de140e8d98edcbaa72d4b668080"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::file_mention::resolve_mention_in_completion_index (cognitive 19): codewhale_tui::tui::file_mention::resolve_mention_in_completion_index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a88c992df960c82b7112e93b1bbc157d343ed425117b448d14ebae46a1fdb06"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::file_mention::read_line_range_past_prefix (cognitive 19): codewhale_tui::tui::file_mention::read_line_range_past_prefix has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"657660d7ea161cfd0253585da754b852e2a28f9985134b62e60d6981ee28823c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::render_cases (cognitive 19): codewhale_tui::tui::history::latex_render::render_cases has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0ba070eb7a5c9cc91ce29e992e77535e821ed744a3f44fb43ef9a880b5dc68"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::message::escape_note_backslashes (cognitive 19): codewhale_tui::tui::history::message::escape_note_backslashes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/message.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7ec24870e49c3162902fdc14212bd93a7063c3595401f5dbbca75368099265"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::thinking::collapsed_thinking_body (cognitive 19): codewhale_tui::tui::history::thinking::collapsed_thinking_body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/thinking.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80e4bacac51895254f786189938ccbbdacd92a81ece78ce71bff6d84d6ed0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::model_row_meta_chips (cognitive 19): codewhale_tui::tui::model_picker::model_row_meta_chips has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 1, match/switch 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, 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/tui/src/tui/model_picker.rs"},"region":{"startLine":3211}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d834521162980c15d7bfc73d6f94a75762b672c2676ee63d945b2c7e2396d5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::onboarding::wrap_words (cognitive 19): codewhale_tui::tui::onboarding::wrap_words has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/onboarding/mod.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfdac78b90c92cdc79becd0beebad877e6d4eb8f0d1818ad7c8b2b4569427cb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::paste::handle_paste_burst_key (cognitive 19): codewhale_tui::tui::paste::handle_paste_burst_key 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/tui/src/tui/paste.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fedc0d20b882e7f16ca879c91d2614e4a34a3a8dc31efb596d57a5382857c40"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::session_picker::build_list_lines (cognitive 19): codewhale_tui::tui::session_picker::build_list_lines has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc32deb3bf235deb142b02fd4449cd004fb22e2037d32808d6bb7eedf5301e2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::setup::tools_mcp::mcp_config_inventory (cognitive 19): codewhale_tui::tui::setup::tools_mcp::mcp_config_inventory has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/tools_mcp.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b0c633456a49581a4c980a8da54160e2b5b38bc880e0532241a4663054a3ce"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::subagent_routing::record_agent_current_activity (cognitive 19): codewhale_tui::tui::subagent_routing::record_agent_current_activity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/subagent_routing.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0af642d997975ec75b5a9863ae0d58a3fe1f4d4c26887cd432d9f55e474bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::tool_routing::accrue_child_token_cost_if_any (cognitive 19): codewhale_tui::tui::tool_routing::accrue_child_token_cost_if_any has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/tool_routing.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73375c3f14db2d13027abbefe9443938d7f0d8dc4830c66a2545a0bbda11893"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::event_loop::submit_decided_composer_input (cognitive 19): codewhale_tui::tui::ui::event_loop::submit_decided_composer_input has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"254e6dc734fbe9ece9b3365867c1917b7ee8fcad55bfcf9f2aa2790572f30642"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::handlers::handle_shell_job_action (cognitive 19): codewhale_tui::tui::ui::handlers::handle_shell_job_action has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (11 pts), if/else 3 (5 pts), loops 1 (3 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"638e5bcfaef8679874d3bd6d84c1664ada74c437d6a48f0e65ec30ed3ab41a44"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::underwater::mcp_problems_row (cognitive 19): codewhale_tui::tui::underwater::mcp_problems_row has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/underwater.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"f519f8dc2c25ba7685d05c6fa0aeec93372f60e8ca33f4b528f1ef57abe734f7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::terminal::handle_key (cognitive 19): codewhale_tui::tui::work_surface::terminal::handle_key has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5870c40169a3c47d2660a2f1525128d720ccba86b922333572f1649f9299794b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui_kit::diff_render::emphasised_chunk (cognitive 19): codewhale_tui_kit::diff_render::emphasised_chunk has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfd918ed8f647982223bf65b3cd43dd4e6c2936f4cc886eed86c8aea2d51537"}},{"ruleId":"D2","level":"warning","message":{"text":"ExactFleet::validate (cognitive 19): ExactFleet::validate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/fleet_exact.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"024188ce74ddd1ba1f31a94190ff50af0eb5765066473d0d3b4a3ac988184644"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow_js::vm::task_host_inner (cognitive 19): codewhale_workflow_js::vm::task_host_inner has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/vm.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b04f84f84b5b5f34de64ddf043c5059fe88b75150328c0e7774548b0e8938e7"}},{"ruleId":"D2","level":"warning","message":{"text":"CodewhalePetMobileApp.body (cognitive 19): CodewhalePetMobileApp.body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), error handling 5 (6 pts), boolean chains 1, match/switch 1, ternaries 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":"pet/ios/CodewhalePetApp.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ddc4236b00dd023b03f140b890875494d298c81e8aa5a537b228b3a76eafff"}},{"ruleId":"D2","level":"warning","message":{"text":"PetAudioOutput.present (cognitive 19): PetAudioOutput.present has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetAudioOutput.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7e3ac1ff4b485fe30feb15f32ed2b651667cc0f97ab4411d8628fd36508732"}},{"ruleId":"D2","level":"warning","message":{"text":"PetNativeCore.init (cognitive 19): PetNativeCore.init has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetNativeCore.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7c0e96ba3abf83a9cde470270e01fe81f991842a9d90776a3172a3aa9e8d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatView.openFileAtPath (cognitive 19): ChatView.openFileAtPath has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), error handling 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":"extensions/vscode/src/chat.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ca5ca843dfe7a62cf86b37e6236cf898094bbfbf51a4c281220fa737e19e24"}},{"ruleId":"D2","level":"warning","message":{"text":"lib.questionText (cognitive 19): lib.questionText has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (13 pts), boolean chains 3, 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":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9c7340e510982d7d21f441b9cae45a331b66989bb3d55de8fe0a54cca29195"}},{"ruleId":"D2","level":"warning","message":{"text":"qr.buildCodewords (cognitive 19): qr.buildCodewords has cognitive complexity 19 (threshold 15). Drivers by points: loops 11 (15 pts), if/else 1 (3 pts), ternaries 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e379adc2ad48818010099b59629f3c599195a92043e339fad23a657298c5ae"}},{"ruleId":"D2","level":"warning","message":{"text":"index.reconcileSnapshot (cognitive 19): index.reconcileSnapshot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, loops 2 (nesting depth added 1). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 697, 692, 694). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4804c5a8e3cb97d11b13133fe32beb86432788ec9cb02c2cf29dac91c43a8a3"}},{"ruleId":"D2","level":"warning","message":{"text":"ingest.redact (cognitive 19): ingest.redact has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 2 (3 pts) (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":"pet/src/core/ingest.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2dea03199360cb80e5b74bdf2d4cec5942bd1114caa18a6d3922b3508af5de"}},{"ruleId":"D2","level":"warning","message":{"text":"contributor-merch.ContributorMerch (cognitive 19): contributor-merch.ContributorMerch has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (12 pts), boolean chains 5, if/else 2 (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. 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":"web/components/contributor-merch.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"94101ec67b912f9a9d79c2632e0d079d4df95f1bb66af2dc7ff10a63131c7aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"community-agent.listDrafts (cognitive 19): community-agent.listDrafts has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), ternaries 1 (2 pts), boolean chains 1, error handling 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":"web/lib/community-agent.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90c968a34af6ce43775bacb8b5fe94c0c5d8a1e6410c4cfac88d7adac2eb63c"}},{"ruleId":"D2","level":"warning","message":{"text":"content-watch.validateDriftFindings (cognitive 19): content-watch.validateDriftFindings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content-watch.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed20feac11a30c673ec30aa7b8bc1aae56e6bea67a55ecb4d9158badca4634a"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 1). None of this is in the body itself: all 19 points belong to 8 function items inside it that branch (eventMatches, errorOnsetOf, stableHash, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"139fce6f0043b8ff7295aaad9e14f6f42303d40a42449fe77f8e5d0905acfbbf"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 19): (anonymous) has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, loops 1, ternaries 1 (nesting depth added 1). None of this is in the body itself: all 19 points belong to 8 function items inside it that branch (eventMatches, errorOnsetOf, stableHash, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"579ad8971abdf87bc58118b6f2cac054f7e03a744ce0c3a1483eb6bb9137d108"}},{"ruleId":"D2","level":"warning","message":{"text":"startBrowserClient::updateItemNode (cognitive 19): startBrowserClient::updateItemNode has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 6 (7 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"9143eb2d0a770eb04a30b813dc2eb1f75d9387cbd719287ab844c07f106b76b9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::run_computers (cognitive 18): codewhale_account_cli::run_computers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e546fde284a23fd656f4054b479d4c520b82fff511a79068a7195a7164c644"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControlController::reconcile_runtime_cursor (cognitive 18): RemoteControlController::reconcile_runtime_cursor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":3098}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b3b96e59d498cafb8ca10a809c8e7a6b838aa903553d62fe9127e0cc018337"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::exec_agent::summarize_tool_args (cognitive 18): codewhale_app_server::exec_agent::summarize_tool_args has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":3730}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8d90ff2031206765896cf4e8095740610d7fc73ca803a147d3137297ca3717"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::list_threads_summary (cognitive 18): codewhale_app_server::runtime_api::list_threads_summary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":4031}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eb855304d3f2edafe9d694347b272ccdc88f2bf270b2f28c9a0e0bb8fa627c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::prepare_managed_fleet_run (cognitive 18): codewhale_app_server::runtime_api::prepare_managed_fleet_run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 1 (3 pts), loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":4683}}}],"partialFingerprints":{"codehealthFindingId/v1":"32779f0ce3ca48b96e912391b5a1ffdceae4a9a4b0ff24b37e5235cb3e128a0a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::external_agents::acp_initialize (cognitive 18): codewhale_app_server::runtime_api::external_agents::acp_initialize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/external_agents.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b9e94b42a598a0097b7dd42bd75b6fec484e97d213e351249d207335dd6382"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::parse_worktrees (cognitive 18): codewhale_app_server::runtime_api::git::parse_worktrees has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83f112a99b85cc41d4b83e5b9636ac6dd11882b24294fa95a1c809437d0b861"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::jobs::project_operation (cognitive 18): codewhale_app_server::runtime_api::jobs::project_operation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/jobs.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"23664eaec072576ee203aacfce0b4188a32849fb2a67bd32af96dcdadd71a182"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::secrets::set_provider_key (cognitive 18): codewhale_app_server::runtime_api::secrets::set_provider_key has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/secrets.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff87da5a9f956c4b928dcb39bb01f2df24780bcf46709d91f3d182da011b22cc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::turn_artifacts::call_span_files (cognitive 18): codewhale_app_server::runtime_api::turn_artifacts::call_span_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/turn_artifacts.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b05bac6bbaa33b936e774b7bc01c7051d1670c5bca88efa56dab71bdc088f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"WatchEventReceipt::validate (cognitive 18): WatchEventReceipt::validate has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 pts), match/switch 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/runtime/watch_event.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"838ee7093a3632231f1666654f6882cbb8a83cc89fe7118cd8c52f179579c663"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::run_config_doctor (cognitive 18): codewhale_cli::run_config_doctor has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 6 (7 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":5882}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e19b97e648f15e9b79e8b958745fb6cae44d384338588a691e144f675f129c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_commands::debug::cache_format::format_cache_history (cognitive 18): codewhale_commands::debug::cache_format::format_cache_history has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache_format.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"2727ef748760944afa689ef4d18232427d05ab26fd82204997b82f209ba9a361"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_commands::debug::change::change_report (cognitive 18): codewhale_commands::debug::change::change_report has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/change.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"040c8af69796025d61faf5c40a4f98e8f0d6a2bdd2105867f35bfd873e5b5ab4"}},{"ruleId":"D2","level":"warning","message":{"text":"ApprovalReplay::from_receipts (cognitive 18): ApprovalReplay::from_receipts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/approval_log.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"89af0ebb1906c28d5a8422523312762c858759e47d78f6add82f8c8ccc2a9382"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::drain_subagent_completion_events (cognitive 18): Engine::drain_subagent_completion_events has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab9f7dbf26e1644131f4115155dddb7ec71c9239048290b24488993b2172e20"}},{"ruleId":"D2","level":"warning","message":{"text":"Broker::launch (cognitive 18): Broker::launch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05ca184c27d15625e7c2257db8f7cc36357132a0ee8ced24bf4c94e0d6fc479"}},{"ruleId":"D2","level":"warning","message":{"text":"HookContext::to_env_vars (cognitive 18): HookContext::to_env_vars has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a94641a79c794cf31a01758fda231f0f725dd2db00ff9d198a8bf357b734e23"}},{"ruleId":"D2","level":"warning","message":{"text":"BrokerSession::spawn_with_auth_context (cognitive 18): BrokerSession::spawn_with_auth_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 3 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/process_broker.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c28ddf9ffb8eac68a199fc6ebc4129266b2a2bb3cd2510035693da4cae4372e"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::settle_thread_goal_after_turn (cognitive 18): RuntimeThreadManager::settle_thread_goal_after_turn has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 5, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":5943}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6d7706c835fcbb4f1b056121e10fa29c1767788eac2a3f573f6f1fcb24567b"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::cleanup_unaccepted_turn_records (cognitive 18): RuntimeThreadManager::cleanup_unaccepted_turn_records has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12575}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8912a5c7b2a8eea35236db7d9631038ee7e8dc0a5d85a6b2ea9c4cee992926"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager::cleanup_old_sessions_inner (cognitive 18): SessionManager::cleanup_old_sessions_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":6450}}}],"partialFingerprints":{"codehealthFindingId/v1":"0886aee15c714ffb2974820698693ba655e53b0d68d476c6c131035f0b25cd90"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteFileTool::execute_contract_write (cognitive 18): WriteFileTool::execute_contract_write has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 4 (5 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":1993}}}],"partialFingerprints":{"codehealthFindingId/v1":"0475abf7de3c8aab2ab7dd19697f6eb4e6f53d320497c44bc3805deba876edd3"}},{"ruleId":"D2","level":"warning","message":{"text":"GoalState::sync_from_host_status_with_reason (cognitive 18): GoalState::sync_from_host_status_with_reason has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/goal.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e95d23530ab13e8efc464e96ece895e0b5e76a3f2811bcdcbf1997c650426d"}},{"ruleId":"D2","level":"warning","message":{"text":"CoordinationLedger::record_decision_in_scope (cognitive 18): CoordinationLedger::record_decision_in_scope has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3779ac19180f39a783628bc1a0c377bcdb3a4689b8fc4cd95b258654699cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"SubAgentManager::completion_usage (cognitive 18): SubAgentManager::completion_usage has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":11548}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e9cbff429143d299fc6221ba080b6849bdcbcd84131ec087156fd1c2d50623"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentTool::execute (cognitive 18): AgentTool::execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (7 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":14815}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec84b4432edb0b5c2f0bb49e2ce33967e166f270d4b91bb823eaf54abac58cb"}},{"ruleId":"D2","level":"warning","message":{"text":"RetrieveToolResultTool::execute (cognitive 18): RetrieveToolResultTool::execute has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13, boolean chains 4, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde02385527b94fc366a109bacef915822ee9ab6de34a93b19c471f046ec1811"}},{"ruleId":"D2","level":"warning","message":{"text":"EvidenceRef::new (cognitive 18): EvidenceRef::new has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 5 (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/engine/src/work_graph/model.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcd6c40f222aec8261eee2bdf869851e58d8f5ce7fd384a661115526f322517"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::dsh_network::plan_headers (cognitive 18): codewhale_engine::extension_host::dsh_network::plan_headers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0aaa31a9f61184db2762d2fab3244f95f3403130e54632551d17c783d2e9368"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::mcp_http::serve (cognitive 18): codewhale_engine::extension_host::mcp_http::serve has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp_http.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb6400f3bd5a24794eb1a774a0ea8604e6c7a74017a5edbd23bb15991e8f6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::supervisor::native_readable_paths (cognitive 18): codewhale_engine::extension_host::supervisor::native_readable_paths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5871b5c12abc44034814179fec6b01b2385aa0002679dc0f0d5f0769043fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::fleet::worker_runtime::validate_fleet_task_routes (cognitive 18): codewhale_engine::fleet::worker_runtime::validate_fleet_task_routes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/worker_runtime.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac092ea23b75a37d7d0248970ca16562a664dd560c973cf78967b8ba261188f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::hooks::config::load_with_project_and_plugins (cognitive 18): codewhale_engine::hooks::config::load_with_project_and_plugins has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (8 pts), match/switch 3 (8 pts), if/else 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/engine/src/hooks/config.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4d478841e7d384ba3f5d400400b003b60cf8f8e29212b9e2153a9eafb31c85"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::llm_client::rate_limit::provider_error (cognitive 18): codewhale_engine::llm_client::rate_limit::provider_error has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 7, match/switch 3. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/llm_client/rate_limit.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"060f42da00d36be0df7b0ac75fdf7aba784c439ecb0b97fe619070e9e46dc257"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::mcp::oauth::start_authorization (cognitive 18): codewhale_engine::mcp::oauth::start_authorization has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/oauth.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af7fa50252bc44d3adf2f7552a274e5e7257f49e93aa9d32b2ed99bc03e23c9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::model_routing::auto_route_decision_recommendation (cognitive 18): codewhale_engine::model_routing::auto_route_decision_recommendation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_routing.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"c935e71a18c9684afdb739b78d6a3b87c270a5a7c571b9bee9be523ab6d35805"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::project_context::configured_instruction_segments (cognitive 18): codewhale_engine::project_context::configured_instruction_segments has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d87a15c94aad35b9b54da8cd37712be9a55093ca7730621f2dd75334d199682"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::project_context::budget::keep_head_within_tokens (cognitive 18): codewhale_engine::project_context::budget::keep_head_within_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context/budget.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b344d64d74e7fbb9c8fee7c81733df8c407aa0b485b93445041b901aacf64fc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::prompts::system_prompt_with_instruction_assembly_for_host (cognitive 18): codewhale_engine::prompts::system_prompt_with_instruction_assembly_for_host has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 5, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdeba25be7d2fc8a73dd91f4f958a5b40861ace3f95dde67f527d8f8e1a52f7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::receipts::diff_lines (cognitive 18): codewhale_engine::receipts::diff_lines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 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/engine/src/receipts.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a13bcceb8199eb07f26f325e4a34958a307d683a3b5e0458ec7401e80a0858f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::receipts::failure_evidence (cognitive 18): codewhale_engine::receipts::failure_evidence has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"8533c613078c1a303d8786b115d4583dff5b1e7a544f4066a76ee2aaf16ae4d1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::route_runtime::plan_limit_overrides (cognitive 18): codewhale_engine::route_runtime::plan_limit_overrides has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_runtime.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db2748da246ec3cc429564b7f849042defa7ba171ed5d44067ebabe7d92e474"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::runtime_threads::manager::session_recovery_projection (cognitive 18): codewhale_engine::runtime_threads::manager::session_recovery_projection has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1ca4f018730cc536fbb0b2ada8a42fbb9e3b7179c8bb9e9551532c2c3433db"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::session_reconcile::collect_document_references (cognitive 18): codewhale_engine::session_reconcile::collect_document_references has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (8 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_reconcile.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"63884b9f1ff0d0d98744e21b834708f81b7446c36fdcb6ef66f1e576cde5dc17"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::todo_snapshot::todo_snapshot_body (cognitive 18): codewhale_engine::todo_snapshot::todo_snapshot_body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 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/engine/src/todo_snapshot.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3368065c099ec36fe0228a0fba8224fc1df47eda43a453b0bf65e30b5f7200"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::arg_repair::strip_trailing_commas (cognitive 18): codewhale_engine::tools::arg_repair::strip_trailing_commas has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/arg_repair.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2deac49f70ab29cbfddb28c1a52c5f6930c43b647d39e2ccbcb263cce626cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::review_pr::model_diff (cognitive 18): codewhale_engine::tools::review_pr::model_diff has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_pr.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff572536cfb97ab236363efcf201859d65a2679dbe20382a9855f48c04bf74b0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::shell::foreground_command_requests_detach (cognitive 18): codewhale_engine::tools::shell::foreground_command_requests_detach has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 5, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":7885}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ec016d4e68bc583fe147ccea93e8cf8d56e12c91cf852352a0c6eadec94cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::validate_spawn_write_contract (cognitive 18): codewhale_engine::tools::subagent::validate_spawn_write_contract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":18981}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dc0fd3a12b9f14ba489f9c088efde3aaa020279207f553ba7af1b6f298f44c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::engine::prepare_child_membership (cognitive 18): codewhale_engine::tools::subagent::engine::prepare_child_membership has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 1 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"487ae104590b380692a5cc7a84eba7deba3d4fe74db5e8b460c0c7eadd17a851"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web::extract::html_meta_encoding (cognitive 18): codewhale_engine::tools::web::extract::html_meta_encoding has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/extract.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"a070b3ace4af8a413087195516976fdc2f4e0e55f1245ba5d345dd26579737a6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow_plan_approval::analyze_plan_object (cognitive 18): codewhale_engine::tools::workflow_plan_approval::analyze_plan_object has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow_plan_approval.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"49dea39d48907d7a4c2ce5c1f84d12c2a6f4336da606415bdba1d8eddea09b08"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::voice::record_audio (cognitive 18): codewhale_engine::voice::record_audio has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/voice.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73504574d58cd4831f6ccbdd9e69bd0a9ca8b4c4818496ac29ceee6c7ee1e92"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::work_graph::runtime::apply_observation_to_snapshot (cognitive 18): codewhale_engine::work_graph::runtime::apply_observation_to_snapshot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/runtime.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"38af8eae21adf8f8371133f2d1b6ba92b07d24ff4a88a1299fc098c2eaabb02f"}},{"ruleId":"D2","level":"warning","message":{"text":"TmuxRuntime::start (cognitive 18): TmuxRuntime::start has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/runtime.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"4180bfc2f7c44c5675be52f21e4a40d19848fcc95ee09e55d6978d0941efec7d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_models::schema_canonicalize::canonicalize_schema (cognitive 18): codewhale_models::schema_canonicalize::canonicalize_schema has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 3 (8 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/schema_canonicalize.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"50811eb4a864ce05e988b3b53e967d0e999bc1b5bda09a70aa18a4138d1f71ac"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_models::tool_projection::project_tool_schema (cognitive 18): codewhale_models::tool_projection::project_tool_schema has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/tool_projection.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8968286a2f670599d90fd4e3a571ec034e77874cb781820d426a429139516e15"}},{"ruleId":"D2","level":"warning","message":{"text":"EventSoundPolicy::decide_configured (cognitive 18): EventSoundPolicy::decide_configured has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/notify/src/sound_policy.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"63570e27ce6b190aebd95aa424831b0b4b8c334cabcccd8cb86604e9170fbbbd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_palette::adapt::adapt_fg_for_grayscale_palette (cognitive 18): codewhale_palette::adapt::adapt_fg_for_grayscale_palette has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 5, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1249411541b2b41264493329e49aaa713eeb9c83b15c5df2e8482f00dcc4e2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::agent_plugin::slugify_plugin_name (cognitive 18): codewhale_plugins::agent_plugin::slugify_plugin_name has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/agent_plugin.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb5b0f149c5f18f29a77088c951f77845d8cf78a48c6a612246743b046219e0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::install::dsh::parse_npm_range (cognitive 18): codewhale_plugins::install::dsh::parse_npm_range has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df7b54c975396721c3ca4bfb325faee8d92d12ec51299276373455ec25b69be"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::marketplace::parsers::kimi::parse_kimi_entry (cognitive 18): codewhale_plugins::marketplace::parsers::kimi::parse_kimi_entry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/kimi.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4712ab88ac45f46f8177c5d51fb172a02e09b900763bcba15d73b1191c100f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::registry::gc::dir_size (cognitive 18): codewhale_plugins::registry::gc::dir_size has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry/gc.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"57659cc7ce5b9d1c7c19ca5f51b7f5e4df5bb788a2b906ec55e7e2eef4c5ddb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::readonly_health_credential_generation (cognitive 18): Config::readonly_health_credential_generation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 5, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":6108}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb11dfb457abfc24f2be393d4b93159e8c4e9bcc28a8b6355dcf3298d6eb1e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings::apply_env_overrides (cognitive 18): Settings::apply_env_overrides has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6 (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/runtime/src/settings.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"14100a392385400a22502b717b6a9609bf18102ece74c21eaf174d9f1faec41a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::process_tree::contained_run_with_limits (cognitive 18): codewhale_runtime::process_tree::contained_run_with_limits has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 3 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/process_tree.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7cd2fca6e9ad3c7b9b61fa97e6c67ea21613efe71d9f3596d5c5b35210b623"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::safe_label::sanitize_persisted_route_label (cognitive 18): codewhale_runtime::safe_label::sanitize_persisted_route_label has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6, 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, 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/runtime/src/safe_label.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8609cc1069c6dd8cccef742f442ebd48fca33b365e9d653049224c1671afe99"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_sanitize::redact::redact_secrets_with (cognitive 18): codewhale_sanitize::redact::redact_secrets_with has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"412ed4d7297d43c4e023485e2ee1b7c86f41493a8261cae7c19324906a1e73d5"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotRepo::diff_snapshots (cognitive 18): SnapshotRepo::diff_snapshots has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (7 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/delta.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bb143b630b76fd9c34977c24718d33d9da4ef756c411c6c34fb83a8487e2c2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tools::patch_preflight::inspect_patch_shape (cognitive 18): codewhale_tools::patch_preflight::inspect_patch_shape has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tools/src/patch_preflight.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcbe0a326b209d0d633599097405ae6cdedaa962a400f53c5b1a3a8c61ab681"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountLoginView::handle_key (cognitive 18): AccountLoginView::handle_key has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/account_login.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5b8b4436cd0aecc9c52eed7588cb409f2801375643e6ff09259b2656512fdd"}},{"ruleId":"D2","level":"warning","message":{"text":"ClipboardHandler::read_content (cognitive 18): ClipboardHandler::read_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/clipboard.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fe279e48db2a10b2d938b2dcec03e0ee0e0bfe8ba3d039010721d765d8af82"}},{"ruleId":"D2","level":"warning","message":{"text":"Avatars::refresh (cognitive 18): Avatars::refresh has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/avatars.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e5d173033619ea547d1a64aeea2b40252460912130c338a87966249b63200c"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionsView::handle_key (cognitive 18): ExtensionsView::handle_key has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/extensions.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"e932bd667c91b9fd3da98adcd0b3a7477ff1a848ad7748c692001a276313d3a9"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetDetailView::handle_key (cognitive 18): FleetDetailView::handle_key has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 3 (7 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"188396cde4e640ef1a4749abb972fe731a64437a599f73a8c655939d18d074a3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::run_sandbox_command (cognitive 18): codewhale_tui::run_sandbox_command has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 3 (5 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":13752}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1c785b63ba98a21123049e8c9c6618e18c7e9009192f892a02a0be587dea93"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::project::init::parse_package_json (cognitive 18): codewhale_tui::commands::groups::project::init::parse_package_json has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (18 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/tui/src/commands/groups/project/init.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"618513bf340d0033e99a9f2d17785b4383494cbeec204e153127eec19ed402ab"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::skills::restore::restore (cognitive 18): codewhale_tui::commands::groups::skills::restore::restore has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 5 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/skills/restore.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"68de1f850b3f3779245e496bd6007d866b0c5bf4a80e94e104ea98fcef6957af"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::doctor::config_credential_shaped_keys (cognitive 18): codewhale_tui::doctor::config_credential_shaped_keys has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 7, loops 1 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/doctor.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb908dc2ccd1c1e17dc8ce02890b5c1a4589e5c8ef0c07cb8e8c94871f64c00f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::context_inspector::push_references (cognitive 18): codewhale_tui::tui::context_inspector::push_references has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/context_inspector.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b6b1fe9e8b4819a5033b4b808fa136bd4bedc624ccf2a1370ea71f85bdca82"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::latex_render::render_math_segment (cognitive 18): codewhale_tui::tui::history::latex_render::render_math_segment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7f4e4f05c045960c17ecaa1139c4320729188bee9c04ec2451691b64e5c466"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::tool_routing::extract_patch_paths (cognitive 18): codewhale_tui::tui::tool_routing::extract_patch_paths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (16 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/tui/src/tui/tool_routing.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c2dce2f60943677a0869da500f4d805d1d3aa23bb3e25ff0d54077407e8991"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::transcript::truncate_spans_to_width (cognitive 18): codewhale_tui::tui::transcript::truncate_spans_to_width has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/transcript.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"07562573d87dd52023b1004f6614aca2ecd2a862d6eface6e4d959f598b40656"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::frame::build_session_snapshot (cognitive 18): codewhale_tui::tui::ui::frame::build_session_snapshot has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/frame.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a4b4e136aa4059a1cd796678d01bd9de39a14d2f2ccd9bc413b7bc683c2fdf"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::views::fleet_roster::member_detail_lines_with_session (cognitive 18): codewhale_tui::tui::views::fleet_roster::member_detail_lines_with_session has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), match/switch 5 (6 pts), boolean chains 3 (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/tui/src/tui/views/fleet_roster.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8320e87cbf510198135a41ed3d411497e2c825ab7a2c7fcad2cd66b8e4628fb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_util::git_metadata::precheck_metadata_sizes (cognitive 18): codewhale_util::git_metadata::precheck_metadata_sizes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/git_metadata.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6d785505ef1ec04afab18293886f3f57d3382b7b897ae2bdffcf6fff68d066"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow::js_authoring::skip_source_trivia (cognitive 18): codewhale_workflow::js_authoring::skip_source_trivia has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (9 pts), boolean chains 5, if/else 3 (4 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/js_authoring.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc832dafd6d99313e1aaf535078de017a17a6eeb081d92936b675c8266fa4f70"}},{"ruleId":"D2","level":"warning","message":{"text":"PetActivityKt.Controls (cognitive 18): PetActivityKt.Controls has cognitive complexity 18 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/android/src/main/kotlin/codewhale/pet/PetActivity.kt"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de84f98f8a15f389192b8525e9313a9ca38f3ccbd8bb1742fb06abea770363b"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSharedFrame.validate (cognitive 18): PetSharedFrame.validate has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 17, if/else 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetShared.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"756267882d603b8b76025a5bc5e0332dab4bb1178b87506af40d31f40a6d0919"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSim.step (cognitive 18): PetSim.step has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 7 (8 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetSim.swift"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"be737288e176fade1277583f390e2d6b335e32703a754b394f95290e2a123308"}},{"ruleId":"D2","level":"warning","message":{"text":"qr.renderQrToText (cognitive 18): qr.renderQrToText has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"0175ff3c88786ba36d3a7a376ffb4be850cc56233fafbaabb3d6373fa18eb789"}},{"ruleId":"D2","level":"warning","message":{"text":"pet.draw (cognitive 18): pet.draw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (4 pts), boolean chains 2, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/ui/pet.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfe62daf8a3d428835a643cf17dc1c160dc13410b45f644d9475d3e8bbea39c"}},{"ruleId":"D2","level":"warning","message":{"text":"pet.get(\u0027follow\u0027).onclick (cognitive 18): pet.get(\u0027follow\u0027).onclick has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3, error handling 2 (nesting depth added 2). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (poll). 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":"pet/src/ui/pet.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8a39748a8311d0e09d8be41049a6067303a18caba680e46170fa7bbb8e2cee"}},{"ruleId":"D2","level":"warning","message":{"text":"report-active-installs.formatReport (cognitive 18): report-active-installs.formatReport has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (9 pts), if/else 6 (7 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/scripts/report-active-installs.mjs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f413c77cf752d1b7baa99a503fcebe1da4abaa5d61fb777fe94f994c84303f"}},{"ruleId":"D2","level":"warning","message":{"text":"admin-client.AdminClient (cognitive 18): admin-client.AdminClient has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 3, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 4 function items inside it that branch (handleAction, startEdit, a function literal at line 71, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/admin/admin-client.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8023078e0b0d82f61d8397db9d61ce6f465e6cb6f64ef0fda63f82be34435ca7"}},{"ruleId":"D2","level":"warning","message":{"text":"bounded-body.readBoundedBody (cognitive 18): bounded-body.readBoundedBody has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 3 (4 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 6). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/bounded-body.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ed869e4589b40b124e19ce1a9cefea3974061a14fb99695b0c59c6720b651e"}},{"ruleId":"D2","level":"warning","message":{"text":"community-agent.getPostOutcomeUnknown (cognitive 18): community-agent.getPostOutcomeUnknown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9739f4740883679531ef78d681ff101fe9fc2e3a106412ef5e18c2d9953e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"content-watch.runSemanticDrift (cognitive 18): content-watch.runSemanticDrift has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 5, ternaries 2 (3 pts), error handling 2, loops 1 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content-watch.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f37f9b97c352d4bd9d7775274d2bf905228ceb2d45110c13d39b8736088ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-activity.readRepoActivity (cognitive 18): repo-activity.readRepoActivity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/repo-activity.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea16566af9e81d6ddad4d69e39e7093f1e225c1917c63e0c12d7e862aeae3bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"learning.getGuidance (cognitive 18): learning.getGuidance has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (9 pts), if/else 5, boolean chains 4 (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":"web/lib/ratatui/learning.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6973dc20c0fd1637aec3bafa69d2bf6d557d9cb12229c29a5a7bed3435b3274"}},{"ruleId":"D2","level":"warning","message":{"text":"release-docs-lib.checkReleaseDocs (cognitive 18): release-docs-lib.checkReleaseDocs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/release-docs-lib.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafc3cfd05dfd2c02ae7b0473b56b8fd9dd83a1ea0b8068e197def64777fc931"}},{"ruleId":"D2","level":"warning","message":{"text":"gt-site.check (cognitive 18): gt-site.check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/gt-site.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"580a920a5e4ff4104870f41c76ea53f39880ba15c8a20aba2dff4ef896407245"}},{"ruleId":"D2","level":"warning","message":{"text":"operate_best_of_n.workflow.default (cognitive 18): operate_best_of_n.workflow.default has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 12 (16 pts), boolean chains 1, loops 1 (nesting depth added 4). Of this number, 10 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/operate_best_of_n.workflow.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1650d9b969ca5335c3d955c620a555a68d6244fdee9e9f43be3243832bfce86d"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::presentation (cognitive 18): (anonymous)::presentation has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 4, if/else 3, other 3 (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4595a4d8afc2afd10d5f2f257c878e9970c386b707280852728c6cf90fca06a4"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::presentation (cognitive 18): (anonymous)::presentation has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 4, if/else 3, other 3 (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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"41362b6491f38681f2b7a5e736bc9f94cb9cfe8ef98265a2af700f3c7e356988"}},{"ruleId":"D2","level":"warning","message":{"text":"readJsonSafe (cognitive 18): readJsonSafe has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 4 (6 pts), error handling 2 (3 pts), loops 1 (2 pts) (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d5cf3644c85bd889a1236865356bd4adf5a4551b541b50f5a095b4ad72566c"}},{"ruleId":"D2","level":"warning","message":{"text":"handleStoredAction (cognitive 18): handleStoredAction has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b8d34fccd5bd522e23867125e2ff4f629b7c403f7f2954845f56ebd963564f"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountLogin::poll_once (cognitive 17): AccountLogin::poll_once has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/session.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccebc55dbec2f1cf408be7bcf45898b34f90b95aebd4aea0cbf74a4a198a5303"}},{"ruleId":"D2","level":"warning","message":{"text":"OwnerClient::forward (cognitive 17): OwnerClient::forward has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (15 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/app-server/src/daemon_client.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00e3a5066b1e9ebc68670a7e65e5b9269165c253ba4a419be1a0ba1a0903b3f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::eval::apply_patch (cognitive 17): codewhale_app_server::eval::apply_patch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/eval.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a6f7f5edd4330899251da1e07c59907ecc66843727eb026abf84f28e01e032"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::sessions::resolve_session_artifact (cognitive 17): codewhale_app_server::runtime_api::sessions::resolve_session_artifact has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/sessions.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"681a3003bf8cd491707dcf599183b76227a3b9be5dcb238b545b1a9fd5602471"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_config::notifications::edit_extras (cognitive 17): codewhale_config::notifications::edit_extras has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 1 (2 pts), 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/config/src/notifications.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f53513b06b735e38112f1c82240132c85f47cf4d5e8df7b2ffcc3290f8259b9"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_core::tool_parser::extract_braced_object (cognitive 17): codewhale_core::tool_parser::extract_braced_object has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/tool_parser.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff16261bc9bd4fdd6f3cd37c36bc61d838cfd09801f07bdb0a51d5b14f077a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationManager::list_runs_with_visibility (cognitive 17): AutomationManager::list_runs_with_visibility has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3018afbdffbc0c09d28ceddbd39b63f0f9133ee361efc56f5918a77e1f9660c"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationManager::get_runs_by_ids (cognitive 17): AutomationManager::get_runs_by_ids has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cbbff6e586c843c6f93110b9c95f16c364a42caee364fbbfab47d249649440"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationManager::collect_due_runs (cognitive 17): AutomationManager::collect_due_runs has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"235c64226b07160f4e567fef198e94ca5ba65487373a794c1b2b5f91dc417965"}},{"ruleId":"D2","level":"warning","message":{"text":"CapturedRlmCaller::dispatch_admitted (cognitive 17): CapturedRlmCaller::dispatch_admitted has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (5 pts), boolean chains 2, loops 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dcadd6564c497efa48005a1780ce602f7d49ab277a051898e21eebd88e4f70"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::acp_tool_build_with_mcp (cognitive 17): Engine::acp_tool_build_with_mcp has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/host_profile.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e4025938a92c1fb0b6783352951f815cef3270b1a6deca6c5d4a53875215b5"}},{"ruleId":"D2","level":"warning","message":{"text":"BrokerContext::act (cognitive 17): BrokerContext::act has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e6b883bca6fffc6d5df8f483a680549c772855a1562b9370761f376e31b349"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionHostManager::reconcile_builtin (cognitive 17): ExtensionHostManager::reconcile_builtin has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":2367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4319f6e93e629d31e5f1633f5071b9ad474e4d7d6ccb3aa3e59e1f9042364e01"}},{"ruleId":"D2","level":"warning","message":{"text":"HookExecutor::execute (cognitive 17): HookExecutor::execute has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"37bffe1cfc6ba404737fc6adffbf7474268e8064597985c6ccf8dfa054976ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"HookExecutor::tool_name_matches_condition (cognitive 17): HookExecutor::tool_name_matches_condition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f02b2441b70553e5bf8634939e3b18ca0624a26d7c30c5a7981d679e9b01553"}},{"ruleId":"D2","level":"warning","message":{"text":"HookExecutor::execute_sync_inner (cognitive 17): HookExecutor::execute_sync_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 3 (5 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2354}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae90f723100494bab191dc08551c738bc45465d0b4663cbedd058fcc837d89f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewedPluginMcpSource::prepare_stdio_launch (cognitive 17): ReviewedPluginMcpSource::prepare_stdio_launch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 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/engine/src/mcp.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f1068f2b959034b54f66d677ac7b681324c0e5de7624ef29f33b324ef3a09a"}},{"ruleId":"D2","level":"warning","message":{"text":"McpPool::reload_from_config_sources (cognitive 17): McpPool::reload_from_config_sources has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":3943}}}],"partialFingerprints":{"codehealthFindingId/v1":"6148732aef41f682dc13e957a20f7f3590b9ce9577b67d70e5a362869dd3481c"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::drive_external_turn (cognitive 17): RuntimeThreadManager::drive_external_turn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a009279d23479ead98223fca2101b4e4c8bf60daab968be932b0ea12c5eb222"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::steer_turn (cognitive 17): RuntimeThreadManager::steer_turn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, match/switch 3 (4 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":14776}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae6b102c694254c63147eefd8eb91ec6691094463df828222430d9b9734b3c0"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::persist_runtime_checkpoint (cognitive 17): RuntimeThreadManager::persist_runtime_checkpoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 4, loops 3 (4 pts), match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16615}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4b726e817f47922c992e46ab67d57fba27257a16b928ebe9fe3e952c6821a7"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadStore::seed_complete_beneath_later_turn (cognitive 17): RuntimeThreadStore::seed_complete_beneath_later_turn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 3 (5 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":3274}}}],"partialFingerprints":{"codehealthFindingId/v1":"64abaecc16f8aba339d60be2326fdfabd5ef05a5cab0a0f3087d47598a69b54e"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionManager::promote_interrupted_checkpoint (cognitive 17): SessionManager::promote_interrupted_checkpoint has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":5689}}}],"partialFingerprints":{"codehealthFindingId/v1":"a772dc8b0bef0d151b4a83556c7f145fc4c80cf71e8df1f63dca232fbac33a68"}},{"ruleId":"D2","level":"warning","message":{"text":"CodemodeInvoker::execute_in (cognitive 17): CodemodeInvoker::execute_in has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (5 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/codemode.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"f148700e6d47560ccc4c837956f4fe5e04cbc3e136eb2abd35768e5c5e4483d5"}},{"ruleId":"D2","level":"warning","message":{"text":"CoordinationLedger::reconcile (cognitive 17): CoordinationLedger::reconcile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14, 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/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f6f61f66a1a70941cf3d0d16c836feddc1aa876731e2d71264cca243687408"}},{"ruleId":"D2","level":"warning","message":{"text":"WorkRuntime::restore_internal (cognitive 17): WorkRuntime::restore_internal has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/runtime.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1cee62afd38296f947277bb96adc377ca041e4e9b138b02cb2fee0e46dc2424"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::automation_manager::scheduler_tick_with (cognitive 17): codewhale_engine::automation_manager::scheduler_tick_with has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3205}}}],"partialFingerprints":{"codehealthFindingId/v1":"65cfa76c50025ae5aa08fdb9e10af40f6a5866a24a63ae25d3eb6c51ef286abc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::chat::strip_google_tool_call_extra_content (cognitive 17): codewhale_engine::client::chat::strip_google_tool_call_extra_content has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2742446bf94030debae8dfd1588d2d9f0a70dd77747451ae3aa7342a48f97ed"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::chat::should_replay_reasoning_content_for_provider_on_route (cognitive 17): codewhale_engine::client::chat::should_replay_reasoning_content_for_provider_on_route has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":3541}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf38f4506096b9c469c79d1da61d28869c7c2840140b312ca6d8f0b84bfc18c2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::native_mcp::for_plugins (cognitive 17): codewhale_engine::extension_host::native_mcp::for_plugins has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/native_mcp.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0879c9e567df39a9f44e34c78202ccb135eafd6012b61ec8bf009e3169877fe"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::prompt::interpolate_prompt_template (cognitive 17): codewhale_engine::extension_host::prompt::interpolate_prompt_template has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/prompt.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeae3a86c5108e8543a8f64262a00352b3877edf93cbbf689cbb97a582c89486"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::mcp::resource_template_pattern (cognitive 17): codewhale_engine::mcp::resource_template_pattern has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc0c75ec509f23bbb8b8752c8b718b5a0af271b134440d2c423cac5983ef03a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::operate::live_roster (cognitive 17): codewhale_engine::operate::live_roster has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/operate.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"977f5a673a9630585c0e76e1c4067e2fb576f2d8217c31c8a94c2548d49a6e19"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::pricing::verified_catalog_offering (cognitive 17): codewhale_engine::pricing::verified_catalog_offering has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/pricing.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44666c4e0f03940f7d009460ea20ed3800a010ec6f519eb176f876f51acb8f4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::pricing::effective_offering_pricing (cognitive 17): codewhale_engine::pricing::effective_offering_pricing has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/pricing.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bba9ef0e6584d72732aab58d380c015819d6ffcfe5aa965a634ee691634d576"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::project_context::render_instruction_scope (cognitive 17): codewhale_engine::project_context::render_instruction_scope has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"218a8c0bce2ffe3e9e6a147ab716610536f6bfe741a48b772e3435c63cf5d986"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::provider_lake::catalog_offering_for_route (cognitive 17): codewhale_engine::provider_lake::catalog_offering_for_route has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"732349f43258ad17f9777de7306a5a10550a27a3255b87d86b24c27c6c5b3e28"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::receipts::thread_receipt (cognitive 17): codewhale_engine::receipts::thread_receipt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f966ba02efcb184827ddd1bdcac900e99c0ca0676984fd0feb88194d311257b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::repo_law::repo_law_plan_decision (cognitive 17): codewhale_engine::repo_law::repo_law_plan_decision has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), boolean chains 2, match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/repo_law.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6642f385907580753d1537d53626951747023b726ff855b14ea79cf84fe05bb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::apply_patch::apply_pending_writes (cognitive 17): codewhale_engine::tools::apply_patch::apply_pending_writes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/apply_patch.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"8050bfe6cac97552d816db6f5bcc32dafbcdc28e97f71c9c922c8c93091fabf4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::registry::mcp_result_to_rich_tool_result (cognitive 17): codewhale_engine::tools::registry::mcp_result_to_rich_tool_result has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4770dbf1eafb94b41978efce702b10cd1f8500666c097e8fbe143ba41311d6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::speech::prepare_speech_options (cognitive 17): codewhale_engine::tools::speech::prepare_speech_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, match/switch 4 (5 pts), boolean chains 3 (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/engine/src/tools/speech.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7d36be946c1e1a5fc5b467934d665827e5783e53324b05b46e263173a228fa"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::persist_child_settlement (cognitive 17): codewhale_engine::tools::subagent::persist_child_settlement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":11979}}}],"partialFingerprints":{"codehealthFindingId/v1":"000a29a611f4eb59a9daa02a50b095fe7df609fe735e878b6df48783d0d8fab4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::compact_spawn_receipt (cognitive 17): codewhale_engine::tools::subagent::compact_spawn_receipt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":15040}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfecce9afc2eceaf354d53b81f294ab7ee6c1661c2bc8dee5179b70e81e5405f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::truncate::apply_spillover_inner (cognitive 17): codewhale_engine::tools::truncate::apply_spillover_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/truncate.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fda377275bbe442b12390dd2ec229000972824b605de324089d2156f7d60f9"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecPolicyConfig::evaluate (cognitive 17): ExecPolicyConfig::evaluate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/toml_rules.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"394e21dfcd7b92e3bbb06321b279de60f889d667cb2f48071a2bc33aa2b87ab3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_lsp::client::reader_task (cognitive 17): codewhale_lsp::client::reader_task has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 2 (6 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/client.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ac073fbd5701b6435964cf559616323c4a4d7be5bc2600458f55993d254a75"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_memory::import::parse_markdown (cognitive 17): codewhale_memory::import::parse_markdown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/memory/src/import.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e2230dfd39d7e79cb6a5ffc6d445f9c8fc4a5c4550bd0195d82873a097f02f"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorDepth::detect_with (cognitive 17): ColorDepth::detect_with has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/palette/src/adapt.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"36471b89e2bcedc36f0f5680dfbb280689fdeaba1b887b222cabd010d6cf2ef3"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::agent_plugin::validate_plugin_json (cognitive 17): codewhale_plugins::agent_plugin::validate_plugin_json has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/agent_plugin.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8866a16cf6ae47879a28577e1d63db5c5f587fb5aa5f8192cfefffe2e70b0c55"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::config::clear_active_provider_api_key_under_lock (cognitive 17): codewhale_runtime::config::clear_active_provider_api_key_under_lock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":12742}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecebdfec3a4c1686d46a005ab13815b4349e88139577bfc9711211b59c731dca"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::oauth::pkce_login_with_selected (cognitive 17): codewhale_runtime::oauth::pkce_login_with_selected has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/oauth.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9413a69873014826931e2187da34df6c749caedbe3a63116541abfd158bedff2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_sanitize::redact::ends_after_header (cognitive 17): codewhale_sanitize::redact::ends_after_header has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"66dd137bbbf1f4eb9cf703598014fecc3921066248441209c484ae7841959718"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotRepo::newest_reflog_commit (cognitive 17): SnapshotRepo::newest_reflog_commit has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df5a33deec4ba0bca76ccafcbd4f4db71b3adcb37e4c5e4f19bc1db2ac936d8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tools::patch_preflight::preflight_apply_patch_plan (cognitive 17): codewhale_tools::patch_preflight::preflight_apply_patch_plan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tools/src/patch_preflight.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71d93bc3e3e182b4cbc03a08516686a94b67374c6feabbddb5abdf10a693235"}},{"ruleId":"D2","level":"warning","message":{"text":"App::submit_input (cognitive 17): App::submit_input has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30389f5d2b41a930edc0f1a85509c8bc068b41879d091c29a3050ed3a67547a"}},{"ruleId":"D2","level":"warning","message":{"text":"FilePickerView::render (cognitive 17): FilePickerView::render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_picker.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"04206b390997f23ff72540ed050a9ebcb39184e9f3423f770435ca47d7028c7e"}},{"ruleId":"D2","level":"warning","message":{"text":"HotbarSetupView::handle_key (cognitive 17): HotbarSetupView::handle_key has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (5 pts), match/switch 2 (3 pts) (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/setup.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab19e5b182f83e1e22ad339d07cfea85842e64bafce7f4d8577e36c165f96083"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderPickerView::render_model_pick (cognitive 17): ProviderPickerView::render_model_pick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":4209}}}],"partialFingerprints":{"codehealthFindingId/v1":"595b1d55c228c20b29d6337c7739be79b3bf1ed9c60dadb9cd75132ba057075d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProviderPickerView::activate_selected_row (cognitive 17): ProviderPickerView::activate_selected_row has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":4690}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53879754523bcb5d788dd2280d3c27475a33dfce906bd9bf65bc8680a3529bb"}},{"ruleId":"D2","level":"warning","message":{"text":"AutomationEditor::render (cognitive 17): AutomationEditor::render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 2, 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/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"7290bd9371686b787291a5816abca2d48b9824a35de8295ba4babac66bf3e8b8"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetSetupView::apply_motion (cognitive 17): FleetSetupView::apply_motion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 4 (8 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ca93c4418f27a92a439c26ff310450071a774db3007d4a19d8be20cb450f59"}},{"ruleId":"D2","level":"warning","message":{"text":"HelpView::handle_key (cognitive 17): HelpView::handle_key has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/help.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdf88685ff18359cad94baf65c9f0ed4d687616765c38c9b566a86a870f407c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::core::feedback::feedback (cognitive 17): codewhale_tui::commands::groups::core::feedback::feedback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/feedback.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c479f38d736f7cea281fbc19df22570212d34dc349f3b110cef01559cc8abf2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::core::hooks::list (cognitive 17): codewhale_tui::commands::groups::core::hooks::list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/hooks.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"385d11b1195a21f387fdec4945ff5a6232ad4bc6a9620c2ee9e88d6b08f3f62a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::core::provider::provider_fallback (cognitive 17): codewhale_tui::commands::groups::core::provider::provider_fallback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/provider.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62e0bc8b4c6efc0dfecadf5b2fa15fb7e2178286926f2b500d27572de00a7eb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::plugins::headless::update (cognitive 17): codewhale_tui::commands::groups::plugins::headless::update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/plugins/headless.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cece5e39fd8a1bcc96a85198709afcdee938c8485bd3adf184ab4f57f60aef4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::session::sessions::sessions_portable (cognitive 17): codewhale_tui::commands::groups::session::sessions::sessions_portable has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 5 (8 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/sessions.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa17c118fac9d322f6220930bd9fa140995e809f2eda8b7739f767bcdb7b8fcf"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::file_tree::build_file_tree_inner (cognitive 17): codewhale_tui::tui::file_tree::build_file_tree_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_tree.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"966a548dc5c17b2fc1b29d6c70f091f0ce0f6ba38a11a06be2f2dc9ffbff4162"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::hover_layer::apply_resolved_effects (cognitive 17): codewhale_tui::tui::hover_layer::apply_resolved_effects has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 1 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hover_layer.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbf91558b29d1b7755c6c0381eab7b40bb6fb530592ac57f52e5c21014518c0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::model_picker::picker_model_rows_for_app (cognitive 17): codewhale_tui::tui::model_picker::picker_model_rows_for_app has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":2213}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e76df04c2b6608d77b480253c57fb84c3a97ae3f3656d9ad8e793f84fa234e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::provider_picker::preview_provider_models (cognitive 17): codewhale_tui::tui::provider_picker::preview_provider_models has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, loops 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"742e19098812880f14066211fd4ae0bbcb68c047dd331f2a76aa0fd877cd5859"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::slash_menu::partial_inline_skill_mention_at_cursor (cognitive 17): codewhale_tui::tui::slash_menu::partial_inline_skill_mention_at_cursor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/slash_menu.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"70981e7b77915321c011626456281555ad34fbd25bdf67a8cc1d183f215cfdfc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::event_loop::handle_approval_required_event (cognitive 17): codewhale_tui::tui::ui::event_loop::handle_approval_required_event has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":9086}}}],"partialFingerprints":{"codehealthFindingId/v1":"5182947e981d250c6bc666c462a749bceb3232b13fe838c745466f1e4d80c018"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::views::category_strip_window (cognitive 17): codewhale_tui::tui::views::category_strip_window has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":4910}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e0a1186dc424379d56001d6dfb4ce05a8345e2a9a8181b9bc3591f3a0a69f2"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::widgets::push_command_entry (cognitive 17): codewhale_tui::tui::widgets::push_command_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":3600}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec8932ae546af3eb2771342726ffbbef870a1ed77995499d573ac097c41a74f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::work_surface::model::agents_view_rows (cognitive 17): codewhale_tui::tui::work_surface::model::agents_view_rows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/model.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cfccc814d08bbda7b315de56f05b228b4b31104692b8e45b65dcd4d3b839e8"}},{"ruleId":"D2","level":"warning","message":{"text":"BoundedLineCollector::push (cognitive 17): BoundedLineCollector::push has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"0401b8996148faa4bfa4ff9d37c2b7c6f8d91d8958b70843da94f4c38483328f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui_kit::markdown_render::push_parsed_line (cognitive 17): codewhale_tui_kit::markdown_render::push_parsed_line has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/markdown_render.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0b093cd939b497a7558658b3fd901eb54959689915442fbb25acc6a5ccaea1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui_kit::ui_text::semantic_truncate (cognitive 17): codewhale_tui_kit::ui_text::semantic_truncate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/ui_text.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d6765a7fe66a9b1e550da7b2c1f4161fe4686f6e64b29dd456e66b038d58a1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow::named_fleet::strip_toml_comment (cognitive 17): codewhale_workflow::named_fleet::strip_toml_comment has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (9 pts), if/else 3 (7 pts), 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/workflow/src/named_fleet.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"491f2604506cc43a883dd4bf2582f5b459178c73451fd430703221ff4be7c946"}},{"ruleId":"D2","level":"warning","message":{"text":"PetNative.presentation (cognitive 17): PetNative.presentation has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 4, if/else 3 (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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c93c1eb235d20ab7c558d415380dc5b80eb972ba30be8e3122117e1941a6acc"}},{"ruleId":"D2","level":"warning","message":{"text":"index.pollTelegram (cognitive 17): index.pollTelegram has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d25d7f1b7986629f6563e08394494626c254cc938bbbae3109162b071fde8b1"}},{"ruleId":"D2","level":"warning","message":{"text":"PetNative.presentation (cognitive 17): PetNative.presentation has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 4, if/else 3 (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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7634db94e120351fe84009560461cf6d2efd30e43011c3e93b5f2b1ec00fec"}},{"ruleId":"D2","level":"warning","message":{"text":"ingest.categoryFor (cognitive 17): ingest.categoryFor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 4. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abdd4b0bdc680da083b1cd43b73902dd24739d8f41f7a6193e9127ed1bdd0ba"}},{"ruleId":"D2","level":"warning","message":{"text":"PetNative.presentation (cognitive 17): PetNative.presentation has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 4, if/else 3 (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":"pet/src/core/pet-native.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"3617c44b9f0630dcd5f33ed37b21469a60e6bbc0979adedba6f0b36d02627105"}},{"ruleId":"D2","level":"warning","message":{"text":"page.ContributePage (cognitive 17): page.ContributePage has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 10 (14 pts), boolean chains 2, error handling 1 (nesting depth added 4). Of this number, 11 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/contribute/page.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f179520ecc7ac7610bc8c15575cf6b1aee54a6f9df449b90eb3d939e10578fc"}},{"ruleId":"D2","level":"warning","message":{"text":"connection-banner.ConnectionBanner (cognitive 17): connection-banner.ConnectionBanner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, ternaries 5, boolean chains 3, error handling 1. Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 81, 40, 63, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/connection-banner.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff26832e9ca96707be4b23a0fdd049643d71ccd394c600607828f86c2721e03a"}},{"ruleId":"D2","level":"warning","message":{"text":"cloud-facts.resolveCloudFacts (cognitive 17): cloud-facts.resolveCloudFacts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"260d9f40868b491f289dbde7b7d6db982a594460034a7642198630000f31a213"}},{"ruleId":"D2","level":"warning","message":{"text":"repo-activity-lib.versionedMilestones (cognitive 17): repo-activity-lib.versionedMilestones has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 6). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/repo-activity-lib.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb2197a2962fc9de36efb4770db74f3f4031a5bde943f6e53308e8b9f9adc17"}},{"ruleId":"D2","level":"warning","message":{"text":"sync-repo-stats.searchMerged (cognitive 17): sync-repo-stats.searchMerged has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), ternaries 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":"web/scripts/sync-repo-stats.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"584a2e07b9cf08c99375b40b48ff2f2605170ba4f806c3851bded2706a05fa32"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::constructor (cognitive 17): (anonymous)::constructor has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 1 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4b026859f62d0285649ed1220fabb8d6c09774c7d9749e220ec7b1568a1193"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::recordingChunk (cognitive 17): (anonymous)::recordingChunk has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 6, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2874e0aba6c9e46ce95770f5a71a25e9bf1a914ed8e9cb2fbb82e3bbd2dd54b5"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::step (cognitive 17): (anonymous)::step has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ceae1e09b495d33a2619d6ca786c37887fd0a7d1560d85601224207a25892e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::restore (cognitive 17): (anonymous)::restore has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 15, if/else 1, other 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a282846f865f7c4b619f80cb076c6d44ac3d6038aa9323c6382554c25fb978"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::constructor (cognitive 17): (anonymous)::constructor has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), ternaries 1 (3 pts), loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0a823c7b0dfad659efb58dc412e9e45718964244ffa4580a4e292a4f430ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::recordingChunk (cognitive 17): (anonymous)::recordingChunk has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 6, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e77e7f2b194ee7605732f04c801145dbfcee9ac90d59110fd8ba9e1247439e"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::step (cognitive 17): (anonymous)::step has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8d6263ac9c90f3e54ad0e7ef051208861e43a80bbbf275a53a08b2c043833f"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous)::restore (cognitive 17): (anonymous)::restore has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 15, if/else 1, other 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"74597f80e72de34c214ed493652bcfc600a70e48045f0199f097b4b7c47886ef"}},{"ruleId":"D2","level":"warning","message":{"text":"handleInbound (cognitive 17): handleInbound has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8 (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":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff058bd8ff5f7ec48bc520a52d47a0f9785eb3c61045077bb61a54a68224302"}},{"ruleId":"D2","level":"warning","message":{"text":"acquireStateLock (cognitive 17): acquireStateLock has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 9). Of this number, 13 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4d71ebe50af7c6cad86786961298343a7ef53f4fa0c9dc5dc52723dece6def"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_account_cli::work::bind_github_repo (cognitive 16): codewhale_account_cli::work::bind_github_repo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/work.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7081fda8a653ad3ace7f4765f11eb9b03563dad5a7746bdbe846552292193fa"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteControlController::start_inner_on (cognitive 16): RemoteControlController::start_inner_on has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"675d2d210135ac0f9e8257e6c21e33409772da2a877bf28ba2c2fc9062858662"}},{"ruleId":"D2","level":"warning","message":{"text":"CapturedRuntimeFrontend::serve (cognitive 16): CapturedRuntimeFrontend::serve has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), match/switch 4 (5 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2111fc3789be0cfa3e52970d73a77741b4314ade02b0452bfa4153f24b764f7"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeChatRelayHost::reserve_turn (cognitive 16): RuntimeChatRelayHost::reserve_turn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39c3b9f9d9ddc80bae515729b834443d5d4c571500c327843620dc67f1fc8ea"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::daemon_socket::run_authorized_connection (cognitive 16): codewhale_app_server::daemon_socket::run_authorized_connection has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (8 pts), if/else 5 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/daemon_socket.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1e142599923bc345e8fff27c688966c514c81e26249612b329ac1bc6746710"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::eval::search_files (cognitive 16): codewhale_app_server::eval::search_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/eval.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7fddb65c5066a1bc34c407f6a2194ab9ef64a8051a22c9c8050af98abf7f03"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::exec_agent::summarize_tool_output (cognitive 16): codewhale_app_server::exec_agent::summarize_tool_output has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":3837}}}],"partialFingerprints":{"codehealthFindingId/v1":"676a92fc6373e6600a99c8f3582ed7269cfba2dfa82ba3931a3dda8bc4fa09b1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::status_rows (cognitive 16): codewhale_app_server::runtime_api::git::status_rows has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (6 pts), loops 2 (5 pts), if/else 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"84903e38bbff3118cecace599b73753a40c1f2d626fba860cb0b31de7dfe29e5"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::runtime_api::git::worktree_create (cognitive 16): codewhale_app_server::runtime_api::git::worktree_create has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":2580}}}],"partialFingerprints":{"codehealthFindingId/v1":"16122daf29a335684a645e7fd323748d27ed82f0f05bbef50455ab24a6e5db40"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server::turns::run_native_turn_for (cognitive 16): codewhale_app_server::turns::run_native_turn_for has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/turns.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05cc17ba124a08e2522f4401d14a7f876c742e390a4cb1f862619ecdf09dc31"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::shape (cognitive 16): Builder::shape has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b270ab5b4ca9b5c5a4158eff9991907e4ebb8700afcc7ccb796be5196c69643"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_app_server_protocol::codegen::methods_md (cognitive 16): codewhale_app_server_protocol::codegen::methods_md has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 3, match/switch 1 (3 pts) (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd36ceecdbf08765542006a22ddbf92df22b43bb441372f635ff094fb779f9b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Collector::fleet (cognitive 16): Collector::fleet has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics/stats.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f457e394130ecf139584ab504a7f879a75f20da085202a063f488ea54b69a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_cli::config_bundles::normalize_bundle_key (cognitive 16): codewhale_cli::config_bundles::normalize_bundle_key has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/config_bundles.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"619447d553b196d677c69243791bb0498152a0b5ead7899a84ac7e67ab9e04b8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_commands::debug::change::count_changelog_entries (cognitive 16): codewhale_commands::debug::change::count_changelog_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/change.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42bbd9db83e27551b3891444550cf6e978bb73fcaae0f3498e2deda9311cc65"}},{"ruleId":"D2","level":"warning","message":{"text":"OfferingPricing::rates_and_usage (cognitive 16): OfferingPricing::rates_and_usage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, 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/config/src/pricing.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfc8afdd28d1636020b3f32a08d2b713f538e61cd7368d880f83a87d659effd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_config::config_backup::merge_decor_table (cognitive 16): codewhale_config::config_backup::merge_decor_table has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_backup.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"89720b93e47884a07437127b4f2fd062b565f6f53c3c65ca73f2755c1ad2b455"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_core::tool_parser::parse_cli_style_args (cognitive 16): codewhale_core::tool_parser::parse_cli_style_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/tool_parser.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"811c80bc7f8c0083b112968f3bd8155a952aa0aa64953fe542ce7ba2e720ee5e"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetDenialGuard::observe (cognitive 16): FleetDenialGuard::observe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/dispatch.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"127639a637829ea63f73798d6a9d9d5258cec2b7bc494720693afdf7bb62886f"}},{"ruleId":"D2","level":"warning","message":{"text":"Engine::discover_mcp_for_tool_search (cognitive 16): Engine::discover_mcp_for_tool_search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 6, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"5457c9248cd0dda04b7c4b00900b9e4fcb695fb7c2fc90d9ca16ded35985878c"}},{"ruleId":"D2","level":"warning","message":{"text":"OwnerRegistry::unregister (cognitive 16): OwnerRegistry::unregister has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d352c112221ee390673e46b4f4a93cd5f12671f02204a2166dbc5b5d3913ea7f"}},{"ruleId":"D2","level":"warning","message":{"text":"FleetManager::status_from_state (cognitive 16): FleetManager::status_from_state has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (4 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b7a0085927c329c286fabb3dcb9338d4e523afdfb4c903c122f8995ef8a24c"}},{"ruleId":"D2","level":"warning","message":{"text":"McpHttpClient::client_for_target (cognitive 16): McpHttpClient::client_for_target has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 8, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/http_client.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f7e7b7e342ab5de60e430a875372bb8783c22d5517258ff69a5f1370420833"}},{"ruleId":"D2","level":"warning","message":{"text":"McpConnection::discover_tools (cognitive 16): McpConnection::discover_tools has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (McpConnection::discover_resources, McpConnection::discover_resource_templates, McpConnection::discover_prompts) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c64075f86e52402d2d006f4a5fe946382222836c35e77e39093dc0ddb38bf7"}},{"ruleId":"D2","level":"warning","message":{"text":"McpConnection::discover_resources (cognitive 16): McpConnection::discover_resources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (McpConnection::discover_tools, McpConnection::discover_resource_templates, McpConnection::discover_prompts) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacd03e54eb3d01a6eaaa22c5fb7e14677098bc57ad4ce85ffc329a4c7dd1808"}},{"ruleId":"D2","level":"warning","message":{"text":"McpConnection::discover_resource_templates (cognitive 16): McpConnection::discover_resource_templates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (McpConnection::discover_tools, McpConnection::discover_resources, McpConnection::discover_prompts) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd9a0b4a31d62782a638647fb8b53882fe9af1c0d57fe65c1ac7a515b2ff169"}},{"ruleId":"D2","level":"warning","message":{"text":"McpConnection::discover_prompts (cognitive 16): McpConnection::discover_prompts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (McpConnection::discover_tools, McpConnection::discover_resources, McpConnection::discover_resource_templates) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":2674}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed705ea3e202a41ff1ef2b9b7c56f0bb0fa6853cd82d60623646de022cec2f8"}},{"ruleId":"D2","level":"warning","message":{"text":"McpPool::model_server_instructions_for (cognitive 16): McpPool::model_server_instructions_for has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":5700}}}],"partialFingerprints":{"codehealthFindingId/v1":"995d9496a1d31fb56754cf6d62ec32c15646c0c72cfcf5b8916f8638f71812b1"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::bridge_external_permission (cognitive 16): RuntimeThreadManager::bridge_external_permission has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (7 pts), match/switch 5 (7 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1288541278f6456d9ace658cf187c66b4e849fe5bc77a7b6e825182e4448808"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::settle_external_turn (cognitive 16): RuntimeThreadManager::settle_external_turn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"8741de185a080b80774abc4c6feca703a1b88233c1d7421ba2d9d3c14df78238"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::settle_dynamic_tools_for_terminal_turn (cognitive 16): RuntimeThreadManager::settle_dynamic_tools_for_terminal_turn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7716}}}],"partialFingerprints":{"codehealthFindingId/v1":"c003fe09956dfb3c67ff5c2cb744d7ca5bf9c91f5fe8c3ba1a7b39e3ed7c4d93"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::publish_fork (cognitive 16): RuntimeThreadManager::publish_fork has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11575}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dd542a943cfb69845a691efd04fe0b88187a3f2245256393c53340f2af8ed0"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeThreadManager::register_runtime_usage_sink (cognitive 16): RuntimeThreadManager::register_runtime_usage_sink has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9857c47c4f2fed8d229d3cebe74aee05b459ca7c6ffe3f587e809f4b31d6be3b"}},{"ruleId":"D2","level":"warning","message":{"text":"PresentTool::execute (cognitive 16): PresentTool::execute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/present.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcb5c3f12e68e768fb49eca2bac2f8f94401a47b5849aa60ec5a3bc9ba4f396"}},{"ruleId":"D2","level":"warning","message":{"text":"BashTool::execute_wait (cognitive 16): BashTool::execute_wait has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":6996}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7372004e95f2eb7bbc887179b081ae6d8db8016ebc3b4fab875f1cf5fd2feb7"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSearchTool::run_firecrawl_search_at_for_context (cognitive 16): WebSearchTool::run_firecrawl_search_at_for_context has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e5b3583a391a3978a619880ddcf30a3b29ee03ab6db34247f8a4a76644fa36"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::listed_deepseek_efforts_by_model_id (cognitive 16): codewhale_engine::client::listed_deepseek_efforts_by_model_id has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":5660}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26cfa493abac03d3e2b7bf4324f8051753a1763bd7a8be5eb68315cfddd9881"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::client::chat::message_content_for_inspect (cognitive 16): codewhale_engine::client::chat::message_content_for_inspect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":2245}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf9ae216da4aded5fe1b77bff484d377b9dc7d2b854408ac7cf194d8e57ab97"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::native_presets_for_plugins (cognitive 16): codewhale_engine::extension_host::native_presets_for_plugins has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":3730}}}],"partialFingerprints":{"codehealthFindingId/v1":"34407d637aa47cb1eb69b5dfbb8727f622d49bd71028409ec572038e8aa7705c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::supervisor::wrap_host (cognitive 16): codewhale_engine::extension_host::supervisor::wrap_host has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d7b210d874db6068b69054d704cff359091ce525569c5b8c4d82221ac633b0"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::extension_host::windows::token_has_lpac_attribute (cognitive 16): codewhale_engine::extension_host::windows::token_has_lpac_attribute has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca456f19b62feb48a5f974979a9c87cc3f2f4f47f10e2552e39dd921d8ee4ff"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::fleet::acp::drive (cognitive 16): codewhale_engine::fleet::acp::drive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/acp.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"1440ea4545c676751876d9329c03c2a77b069208510b52856f9606f93fe50d96"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::fleet::host::signal_unix_session (cognitive 16): codewhale_engine::fleet::host::signal_unix_session has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/host.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef349ffbf9c73d1c57b5f5be2fdb223e2c9dff9b11c5eeeae497abf0414f78c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::git_status::normalize_observed_git_repo (cognitive 16): codewhale_engine::git_status::normalize_observed_git_repo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 7 (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/engine/src/git_status.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7edd095db3d71b528925a5e50cb4de314216133f63335616e99b5a5ffa4c08"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::hooks::config::load_plugin_hook_component (cognitive 16): codewhale_engine::hooks::config::load_plugin_hook_component has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (6 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/config.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87fa9a0826b785d715b0305a0599faf83b0936af781e252509b1ece35a9f92a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::hooks::executor::generic_unavailable_detail (cognitive 16): codewhale_engine::hooks::executor::generic_unavailable_detail has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ffc89de847976f9085c4d5ebc40de521f69fde4195d20012ba2e1d3c1ac474"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::llm_client::rate_limit::body_delay (cognitive 16): codewhale_engine::llm_client::rate_limit::body_delay has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/llm_client/rate_limit.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb1e89e9d2b2367f5b7df25db4aaacbd49ec0c6ae5bb901cb08c0f68b43e4eb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::local_ollama::probe_live_local_ollama_catalog (cognitive 16): codewhale_engine::local_ollama::probe_live_local_ollama_catalog has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 5 (7 pts), loops 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/local_ollama.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0099c6c146656c1798c76e5875a4f9e1d4d75e9f9437da129003c91641605ba"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::prompts::translation_target_language_for_tag (cognitive 16): codewhale_engine::prompts::translation_target_language_for_tag has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e36108a55ed9c5a6f36d5cc789976fe891f2d4d6a4b457d066a0a6b72ff80c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::provider_readiness::auth_class_for_provider (cognitive 16): codewhale_engine::provider_readiness::auth_class_for_provider has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 5, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_readiness.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3596fe499199d0691846c8841d2b1cee23e0d156075ec918c5e11c9b539127e6"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::session_manager::extract_leading_messages (cognitive 16): codewhale_engine::session_manager::extract_leading_messages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":7277}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f42f5b98b9ed215f8b22d472801da32e7abee32c18302eadd1f65dea603796"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::session_resume::decide_auto_resume (cognitive 16): codewhale_engine::session_resume::decide_auto_resume has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_resume.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ea716ad1a3c4daeb5288a1c4648cd61938a45c277becb6b5f2aef6ba572c91"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::superfast::evaluate (cognitive 16): codewhale_engine::superfast::evaluate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/superfast.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce967d5b0b5f6bc73113fd4854492aa030f3477e787207c402a922268a1d681"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::approval_summary::delegated_authority_fields (cognitive 16): codewhale_engine::tools::approval_summary::delegated_authority_fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/approval_summary.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87eccab10ca06089c39f802867b533025ee6907a515e707c898ec8d950944cb"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::file::clean_pdf_text (cognitive 16): codewhale_engine::tools::file::clean_pdf_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6369a0c66a64fb1dfbc2b3b01b0fd2c854e7df95d19e0799ee893f002ebdce"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::git::render_commit_plan (cognitive 16): codewhale_engine::tools::git::render_commit_plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"1465c63c6d31542a422204472bcef2c9d2cfde0aeafdb752efc05d2f3800ef4f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::github::cli::host_target (cognitive 16): codewhale_engine::tools::github::cli::host_target has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/cli.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c04141b9441a02e2c722320f0b42bf4a340645200c9199707842e1d5a383bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::handle::parse_projection (cognitive 16): codewhale_engine::tools::handle::parse_projection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/handle.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7fa9a942eafb84b345156efa8b8b40d546e5762b5f54f6737caeeda24e180f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::shell::resolve_readonly_program_from_path (cognitive 16): codewhale_engine::tools::shell::resolve_readonly_program_from_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":5030}}}],"partialFingerprints":{"codehealthFindingId/v1":"9740686b14f9f2de69e2af5a2b18a6cd20dc015c3a342fa703580a1cbef15bae"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::load_subagent_transcript_projection (cognitive 16): codewhale_engine::tools::subagent::load_subagent_transcript_projection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":12689}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4871a7742efee7d30889925e02061e4c68aff4db3f1be27921508ecfe80b20b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::resolve_path_for_containment (cognitive 16): codewhale_engine::tools::subagent::resolve_path_for_containment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":12901}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c60af8a0d00964b4aa9bd101ab5b3b20f5e76bf45c58147b328a352ba53e770"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::ensure_subagent_store_cutover (cognitive 16): codewhale_engine::tools::subagent::ensure_subagent_store_cutover has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":13469}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebd560171661a800aeed81b1ad112d7238f251241d68cb661f0357886a5f4dc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::subagent::bind_shortlisted_task_model (cognitive 16): codewhale_engine::tools::subagent::bind_shortlisted_task_model has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 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, 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":19874}}}],"partialFingerprints":{"codehealthFindingId/v1":"05d4e7ba1ab53beca1c15d620b13d38ca4e61c6ea6de65e4d90dd8d7d71cd171"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::web::extract::extract_document_with_pdf_command (cognitive 16): codewhale_engine::tools::web::extract::extract_document_with_pdf_command has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/extract.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ed10b5f05c8e06edcc381667a3e04403e4b0daf48a22b71047f60253ff94f4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_engine::tools::workflow_plan_approval::analyze_workflow_launch (cognitive 16): codewhale_engine::tools::workflow_plan_approval::analyze_workflow_launch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow_plan_approval.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5c9599c483a1c05320dfffb3a8b2146defedb9de640bd1bfaba395ba43af04"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::agent_segment_verdict (cognitive 16): codewhale_execpolicy::command_safety::agent_segment_verdict has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"40671b29636791e7b3530b1fea3f96749cce6c15d758cbbd49a1c23438fcdb9d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_execpolicy::command_safety::github_command_targets_unsupported_host (cognitive 16): codewhale_execpolicy::command_safety::github_command_targets_unsupported_host has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"052ac99327a765f8de2ed78cbe3ee014db7f55807d4b0bd54e239a35888106ae"}},{"ruleId":"D2","level":"warning","message":{"text":"WriterState::run (cognitive 16): WriterState::run has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/hooks/src/lifecycle_outbox.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"26760d4474c595f6281d187b8db1f1aba4c1f5e618ae217463d6a5858d0d8957"}},{"ruleId":"D2","level":"warning","message":{"text":"ControlReceipt::render (cognitive 16): ControlReceipt::render has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/lane/src/control.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60aa958c21d986734509621e10cf10d862029d63beb9d013cca3f537e53fd81"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_models::schema_sanitize::enforce_strict_subset (cognitive 16): codewhale_models::schema_sanitize::enforce_strict_subset has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/schema_sanitize.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f586d10e83e75d798f7556ca8f759d08085183c7d0fb62fc4bb68d77b5c8f96"}},{"ruleId":"D2","level":"warning","message":{"text":"PluginManifest::inventory (cognitive 16): PluginManifest::inventory has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (5 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/plugins/src/manifest.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac8c1f15e95d65605f801a8f52c517ac5990fd17e42b09e659241c9d228ee20"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_plugins::export::export_plugin_bundle (cognitive 16): codewhale_plugins::export::export_plugin_bundle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/export.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be54ae82db872127c4d89d37bde3db5155924c45a9d7c9d21e2144bec1769c4"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::config::validate_kimi_code_api_model_id (cognitive 16): codewhale_runtime::config::validate_kimi_code_api_model_id has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":9706}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7f70db060300bbc57e93171217ab21719f0d0d5939b800f717001841ea8083"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_runtime::config::strip_external_credential_consent (cognitive 16): codewhale_runtime::config::strip_external_credential_consent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":11014}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da82cc4ed35515470d92d28ee8573488a945d4a8b04e0d54354071b060a0c9b"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_skill_install::skill_parse::legacy_skill_name_segment (cognitive 16): codewhale_skill_install::skill_parse::legacy_skill_name_segment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/skill_parse.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"40983ee1b334d4620a43ec2bd5459e787011d01e56b067d321f68d8fc01fe10f"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionLifecycleAdapter::tree_body (cognitive 16): SessionLifecycleAdapter::tree_body has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 4 (6 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6cd75faf79cdf2883d645c8e132970b74ff8715978fd80f4bd64553d8aefc4"}},{"ruleId":"D2","level":"warning","message":{"text":"AppHotbarAction::dispatch (cognitive 16): AppHotbarAction::dispatch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/actions.rs"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8af938a2c57085eaaf8f0b0614b7ea8626a9a2c6c72d6907cc138c9e29f4ca8"}},{"ruleId":"D2","level":"warning","message":{"text":"LaunchResumeConfirmView::render (cognitive 16): LaunchResumeConfirmView::render has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 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":"crates/tui/src/tui/launch_resume_confirm.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"b810500918f808bc200cd4a11bc3550d0b2cfbe0b80423b65c450de7300318b5"}},{"ruleId":"D2","level":"warning","message":{"text":"PagerPage::search (cognitive 16): PagerPage::search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbdd965bdefbc46de843951ca64626be8f240e0b4648580e12679b6572e6b096"}},{"ruleId":"D2","level":"warning","message":{"text":"ConfigView::new_for_app (cognitive 16): ConfigView::new_for_app has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 7 (8 pts), if/else 5 (6 pts), boolean chains 1, loops 1 (nesting depth added 2). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep 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/tui/src/tui/views/mod.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"968efaf4cb8548a93548ef0b2905b6b83f5e6548dbb78f5d6bda0a85d6542a90"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillsManagerView::emit_action (cognitive 16): SkillsManagerView::emit_action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 4 (7 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/skills_manager.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"73125e340ed6abb2ff6e642b58a26147c663a360fd261d35df1d87934dffdd15"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatWidget::render_underwater_field (cognitive 16): ChatWidget::render_underwater_field has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/transcript_legacy.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a41cea850a7a76e930404604ce3ef4c7170810476a729ccb314f3dade63f2db"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::doctor_model_pin_drift (cognitive 16): codewhale_tui::doctor_model_pin_drift has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":8090}}}],"partialFingerprints":{"codehealthFindingId/v1":"611bc62d9925bd39e27e38310b5ac773a784e33df32cf3ccad65c439349472a7"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::run_sessions_scrub_secrets_blocking (cognitive 16): codewhale_tui::run_sessions_scrub_secrets_blocking has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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/tui/src/lib.rs"},"region":{"startLine":10151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebc6175b32377903ba2e1b6f24b3d1051ee13322c974dc9b25ab9292ef50062"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::core::constitution::suggestions_text (cognitive 16): codewhale_tui::commands::groups::core::constitution::suggestions_text has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (6 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/constitution.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34c2442b9299a1d9434ee631c9913244f2a13381a0359c7d97acffc55a85c01"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::commands::groups::session::structcopy::collect_retained_key_stats (cognitive 16): codewhale_tui::commands::groups::session::structcopy::collect_retained_key_stats has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/structcopy.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3c75cba220ffb6c09f88e09a958b6b975082bff56126304d39b5544b7dcecc"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::integrations::cli::print_status (cognitive 16): codewhale_tui::integrations::cli::print_status has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/cli.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f767730ab7aa408ef85084c8d2bc21578f99f253db7024374ed8d0ee10bef1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::app::composer::match_osc8_fragment (cognitive 16): codewhale_tui::tui::app::composer::match_osc8_fragment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 5, 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/tui/src/tui/app/composer.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b49c06a01c9351705cd7c84cf8a74e6fbecc7ea2fecabf88226189f8f6f2ef"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::approval::build_impact_summary (cognitive 16): codewhale_tui::tui::approval::build_impact_summary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5ded9457f6cf36691a9ff93c12b598ecf6d8fed4b4a3bc28ac2657018cde26"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::approval::previews::changes_preview_lines (cognitive 16): codewhale_tui::tui::approval::previews::changes_preview_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval/previews.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5274abcffdf92b6f5bd001021b4d80ebd5ce5f9e59c7e5b2b8645317498d2bf"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::approval::previews::split_shell_display_line (cognitive 16): codewhale_tui::tui::approval::previews::split_shell_display_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval/previews.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a606ac74a05c96c907326e88d18d5b151650a8074e818b5fafc6eaeff61d447c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::history::tool_run::detect_tool_runs_from_slices (cognitive 16): codewhale_tui::tui::history::tool_run::detect_tool_runs_from_slices has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/tool_run.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b9fc43f6a29786a82002d7753f9d2392589d2fe6cd8a4560ff7e8fd0af9e01"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::mouse_ui::handle_slash_autocomplete_mouse (cognitive 16): codewhale_tui::tui::mouse_ui::handle_slash_autocomplete_mouse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/mouse_ui.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc5412a1981454e1f60930aaf99e18d41e9da44f0ec45843ab89f1499bb370f"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::session_picker::message_text_for_history (cognitive 16): codewhale_tui::tui::session_picker::message_text_for_history has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1d7ed1fc4a3b9e4b47b88ac847968506ce89c08db9d3d35dc00fd846069cd1"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::startup_input::decode (cognitive 16): codewhale_tui::tui::startup_input::decode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (6 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/startup_input.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"be61c9acad234152a62f6803a22bd78a8df7a958cabb157361dc32cc04438c06"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::tool_routing::web_search_presentation (cognitive 16): codewhale_tui::tui::tool_routing::web_search_presentation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 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/tui/src/tui/tool_routing.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de677146b47285836042254c09226891d44a05cf9003a45f97ef66ca9c3d2fd"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::apply::apply_provider_picker_api_key_with_verifier (cognitive 16): codewhale_tui::tui::ui::apply::apply_provider_picker_api_key_with_verifier has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":4074}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3a77dea484035dc62952ab68c807f17a85fb1137c3dddab988a5919db386bf"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::event_loop::handle_transcript_space (cognitive 16): codewhale_tui::tui::ui::event_loop::handle_transcript_space has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"2834a7b2fb53a2a87dad3bc322a7b35525251e45a61cc7c92c94ec5c333f9e6d"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::ui::task_projection::start_automation_scan (cognitive 16): codewhale_tui::tui::ui::task_projection::start_automation_scan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/task_projection.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ce430e37c40f7c6e7149a42e780aa860bcc1db9c160128d6403dda1ca60bec"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::underwater::launch_fit (cognitive 16): codewhale_tui::tui::underwater::launch_fit has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/underwater.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"73053095862ab70e2bdc6038c989ea8373901b5bfb1f51b03ce5c9d0fb47d620"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::views::canonical_config_choice (cognitive 16): codewhale_tui::tui::views::canonical_config_choice has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":4080}}}],"partialFingerprints":{"codehealthFindingId/v1":"c326c8899db8cdde6ff1e308a7add32d98651451c730129e7130bf24fa47572c"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::views::subagent_view_agents (cognitive 16): codewhale_tui::tui::views::subagent_view_agents has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (7 pts), if/else 2 (6 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/tui/src/tui/views/mod.rs"},"region":{"startLine":6004}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4d1f134037500e3331c6d41adcc076a264d794ff0c16dae47a01aa64f16a36"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::widgets::apply_selection (cognitive 16): codewhale_tui::tui::widgets::apply_selection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (4 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/tui/src/tui/widgets/mod.rs"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"1640129b5d211f5ab99c70bd01be52bc899ded1221dbb58753dcede509abf200"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::widgets::transcript_legacy::apply_selection (cognitive 16): codewhale_tui::tui::widgets::transcript_legacy::apply_selection has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (4 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/tui/src/tui/widgets/transcript_legacy.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce42c4056c69593a62970a1cf33ca872a391def35bc704ee31346c6b4ff080a"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_tui::tui::widgets::workflow_panel::pack_receipt_lines (cognitive 16): codewhale_tui::tui::widgets::workflow_panel::pack_receipt_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad314bc1d1bf427ce95c0897c14f0caff925b1d802dca5de9d609b2d6732a47"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayNormalizer::scalar (cognitive 16): DisplayNormalizer::scalar has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/ui_text.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea8912aa8890061422f2539c58f18fe69631b80fddfe0303daf29e883ae99f8"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow::js_authoring::extract_workflow_object (cognitive 16): codewhale_workflow::js_authoring::extract_workflow_object has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/js_authoring.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"7350b21480a8eda517c75ee1a995abdff4e2633603ad6a576c6d64c050dd4a40"}},{"ruleId":"D2","level":"warning","message":{"text":"codewhale_workflow_js::vm::normalize_task_paths (cognitive 16): codewhale_workflow_js::vm::normalize_task_paths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/vm.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"c834e16155e1d378121e86e3ce4510c18667ed8d08ffb2b644614fd6972e0cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"harness._bounded_terminal (cognitive 16): harness._bounded_terminal has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/verifiers-codewhale/codewhale_harness/harness.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c35c57a6ec76661cef268f3b06912c850a95f5d3296ba677767f1c35f1f9781"}},{"ruleId":"D2","level":"warning","message":{"text":"PetHabitatStore.write (cognitive 16): PetHabitatStore.write has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetHabitatStore.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd48437bce5baed342206c3c39aabc0fd6f84eeb698a23280763c371ea78f7c1"}},{"ruleId":"D2","level":"warning","message":{"text":"PetHost.suspend (cognitive 16): PetHost.suspend has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetHost.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec1be0ce4c5abdf2b9dcd61c6cb00091084274dc5eca50d1699253444a470b3"}},{"ruleId":"D2","level":"warning","message":{"text":"main.swift.top-level code (cognitive 16): main.swift.top-level code has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/main.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5724db6a18d48b4bd165b43a862d90f99fcc2b3610e2e14692dada59af24210a"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSim.step (cognitive 16): PetSim.step has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 6, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"0716169aa89845990e82e0a7dc03ff731d7f2639e557cf1dcc25729287490cd0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.handleIncomingUpdate (cognitive 16): index.handleIncomingUpdate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ecc1d0baa8b6c557f892b2f83fe289ee70bfede0386232904270f33191bfe7"}},{"ruleId":"D2","level":"warning","message":{"text":"qr.placeData (cognitive 16): qr.placeData has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), ternaries 1 (3 pts) (nesting depth added 9). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f52c143fa5e1d03fb29f55ffebbdec2fa923e81ad88420cbbebf11489961c3"}},{"ruleId":"D2","level":"warning","message":{"text":"qr.penalty::scanForFinderLike (cognitive 16): qr.penalty::scanForFinderLike has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 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. This shape REPEATS in the file: one other method here (qr.penalty) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f88521408d4a37b12de8e31ad67f486998f589101c1d56335fc1153db0188352"}},{"ruleId":"D2","level":"warning","message":{"text":"index.ensureThread (cognitive 16): index.ensureThread has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 6, ternaries 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"2485231d4368e595e8a1b017fb6ef6c2f272195d8e6fc0ffa482fa6bad3a2f09"}},{"ruleId":"D2","level":"warning","message":{"text":"install.isRetryable (cognitive 16): install.isRetryable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be9aee22170c8d36bd323b4fa006b706a498577424c8e8951202d6b9b965b18"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSim.step (cognitive 16): PetSim.step has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 6, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7dd23a38a36ea5e6f8d0341c1ffd4c513e07039dda1432f519f8611b6bae16e"}},{"ruleId":"D2","level":"warning","message":{"text":"PetSim.step (cognitive 16): PetSim.step has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 6, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-sim.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0f7080200cf18f7b89d1f4614cc35e41fefc222a08ce7dcdba50fc5149fdca"}},{"ruleId":"D2","level":"warning","message":{"text":"pet.get\u003CHTMLInputElement\u003E(\u0027file\u0027).onchange (cognitive 16): pet.get\u003CHTMLInputElement\u003E(\u0027file\u0027).onchange has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/ui/pet.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd81a9d2446da83fc71f562376350c329e3aac4b3070ff8f7ba3cd898b3c07e"}},{"ruleId":"D2","level":"warning","message":{"text":"check-docs.main (cognitive 16): check-docs.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (5 pts), boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-docs.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38ed7005414d8466e02a62ec35e04175681360568e430305e6355d7ad8f8b69"}},{"ruleId":"D2","level":"warning","message":{"text":"createOcean::step (cognitive 16): createOcean::step has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/scene.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b316d1e8ff4e53425d128dea9b6fba06078e21222f65984de2cbad8d6b5f9e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ensureShape (cognitive 16): ensureShape has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3303374993035cd9402e472f7941b179752171f4d4df9fc018febe0a6673f0"}},{"ruleId":"D2","level":"warning","message":{"text":"handleCallbackQuery (cognitive 16): handleCallbackQuery has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 5, ternaries 4, error handling 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":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdd6f09db4cee21a23a88e99bdda70713a7d21dbe6dca505f664389e66d1997"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::event_loop::run_event_loop: FunctionTooLong \u2014 codewhale_tui::tui::ui::event_loop::run_event_loop runs 3774 significant 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 3674 over it, 37.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"609552e38ccefdb99e400770a98e8e3f53873675acce238e79db9f8bdda9f2f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: subagent/mod.rs: FileTooLong \u2014 14840 significant 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 287 free functions. The bar is 500 significant lines; this is 14340 over it, 29.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f5c13069f8c40183c06823e2d051a9d8063e96a045643f46df6101e5848c4c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RuntimeThreadManager: ClassTooLong \u2014 11491 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 290 methods, 5 blocks, lines 392-19703. The bar is 400 significant lines; this is 11091 over it, 28.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":3456}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d85be9afc66f758f20f9135b5d5d31064953be192ea24e6dd9a476a76d88606"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_threads/manager.rs: FileTooLong \u2014 14297 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: RuntimeThreadManager (5 blocks, 392-19703), declaring 86 free functions. The bar is 500 significant lines; this is 13797 over it, 28.59\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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3294777fed6a4912f6ea09aa09cfa7c409701df115394fa0326ca28052d8db50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime_api.rs: FileTooLong \u2014 10656 significant 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 319 free functions. The bar is 500 significant lines; this is 10156 over it, 21.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21dd0bf76f97602d784901dd1bcaa8dfa1399082d0902df3841d6bf79757573"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 10332 significant 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 312 free functions. The bar is 500 significant lines; this is 9832 over it, 20.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"096b772d9ab1b22d4d8a553df6801d2678ae9838837b9e4e35d9719cb9e88b9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config.rs: FileTooLong \u2014 7755 significant 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 192 free functions. The bar is 500 significant lines; this is 7255 over it, 15.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/runtime/src/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0e86246350573282b77a8d1566706daa3949105e44167d6567ecae2091c1ba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.monitor_turn: MethodTooLong \u2014 monitor_turn runs 1550 significant 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 1450 over it, 15.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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16827}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba81c744d247c27ed2cc69c2667ae89e455885d1fe986fccf32c9c3cfe7957a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/engine.rs: FileTooLong \u2014 7642 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: Engine (2 blocks, 1051-10554), declaring 40 free functions. The bar is 500 significant lines; this is 7142 over it, 15.28\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/engine/src/core/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc410080e5eeaff37709bf7f4c25c9de52dd1c736e9101140078e841e730eed6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Engine: ClassTooLong \u2014 6032 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 270 methods, 2 blocks, lines 1051-10554. The bar is 400 significant lines; this is 5632 over it, 15.08\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/engine/src/core/engine.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d348aee66fcf87c23dd39c3109384e46e5a03c13a6acdb6ffa09c05bec4def"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SubAgentManager: ClassTooLong \u2014 5330 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 200 methods, 2 blocks, lines 3973-11764. The bar is 400 significant lines; this is 4930 over it, 13.33\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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ee3b36a321f448aae2ea45cf13d33326566a440c74fc95be35dd0840a08e4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pet_watch/pet-native.js: FileTooLong \u2014 6658 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 6158 over it, 13.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61a14bd6115c747b2781cda94c0d053c58cee4fe3d8b8f3f3a4cd6626814f55"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Resources/pet-native.js: FileTooLong \u2014 6658 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 6158 over it, 13.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c809fd8d339500bcc2a674ac76b6b0b864bdd18433dfc280c6c972f4bdea1d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 386 stored fields beside 353 methods. The bar is 30 stored fields; this is 356 over it, 12.87\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/tui/src/tui/app.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c5e12dfbfa0b26262c009e1849a9981f53fe9cabbe083ebd886c021ddb2ad5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::handlers::handle_view_events: FunctionTooLong \u2014 codewhale_tui::tui::ui::handlers::handle_view_events runs 1257 significant 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 1157 over it, 12.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"1868cd2091e252ebec1543dc26a95e435d06557067656773b861ef4f894b1f6a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 353 methods, declared across 8 files: tui/app.rs (254), app/composer.rs (70), app/status.rs (14), tui/plugin_suggestions.rs (8), \u002B4 more file(s). The bar is 30 methods; this is 323 over it, 11.77\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/tui/src/tui/app.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65e36bed83fb446289c4ae6e427498271a40edfdd218bb52d23381231bf6883"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.startBrowserClient: FunctionTooLong \u2014 startBrowserClient runs 1176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1076 over it, 11.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"43aed78bc9699fba74719076a5c1a9ca06b5a0b4bdbfff07d80130f57344181a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::apply::apply_command_result_inner: FunctionTooLong \u2014 codewhale_tui::tui::ui::apply::apply_command_result_inner runs 1176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1076 over it, 11.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d525eda600e3d82d2679875024e16aa85500d716148dab9ee433602c3b8b12f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mcp.rs: FileTooLong \u2014 5761 significant 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 106 free functions. The bar is 500 significant lines; this is 5261 over it, 11.52\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/engine/src/mcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb0718125b21edce45364f4769c6bf65936cd55f0f4a0388f9cd4acd3198704"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/event_loop.rs: FileTooLong \u2014 5593 significant 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 58 free functions. The bar is 500 significant lines; this is 5093 over it, 11.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/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"913db6862409dee8dbb644a6f3ff3d041e1f7115c165e940767ec5f161129226"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/shell.rs: FileTooLong \u2014 5373 significant 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 100 free functions. The bar is 500 significant lines; this is 4873 over it, 10.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bac448a49a8f673d6c37400668f77e551efaec4e7230d09414d6f4acad6965f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session_manager.rs: FileTooLong \u2014 4945 significant 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 69 free functions. The bar is 500 significant lines; this is 4445 over it, 9.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/engine/src/session_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7896ad71e33755e8555f7574e4e5f2dd80299648779374c5a4b886c7f99c7840"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.new_with_plugin_registry: MethodTooLong \u2014 new_with_plugin_registry runs 977 significant 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 877 over it, 9.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/init.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a6a11614241b7b297a8c97d34cd90a6d2ed8428e1c509db702daa5c686bf9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client.rs: FileTooLong \u2014 4844 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 88 free functions. The bar is 500 significant lines; this is 4344 over it, 9.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9227e7ffd8430674611657bae55a8ff1d22608fc5a597b96429ca9729c8b3bf6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RuntimeThreadManager: TooManyMethods \u2014 290 methods, declared across 2 files: runtime_threads/manager.rs (274), manager/external_agent.rs (16). The bar is 30 methods; this is 260 over it, 9.67\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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":3456}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a2b0731f2e8da19660ffd391d0c93351bfc9f42f991477a8baed110220f468"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/app.rs: FileTooLong \u2014 4789 significant 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 4289 over it, 9.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fea23a43240ef16a127d410e01a170a395d978ed03d24f55e5d2393133f2dd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 4734 significant 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 159 free functions. The bar is 500 significant lines; this is 4234 over it, 9.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f79c9b05ad57d8af108aa7929ddac80f6b6bfed77cb534e201d8670e348bd99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: views/mod.rs: FileTooLong \u2014 4631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 4131 over it, 9.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/tui/src/tui/views/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfe5c4752f1d3316264a5fe1e588aae7a1b8204b46672a3a358d7c84d59d602"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_doctor: FunctionTooLong \u2014 codewhale_tui::run_doctor runs 908 significant 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 808 over it, 9.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/tui/src/lib.rs"},"region":{"startLine":5300}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ad1d407bd959fb7437f85ac814b2fbfcad55a058f894a20c46d84351a8d264"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Engine: TooManyMethods \u2014 270 methods, declared across 18 files: core/engine.rs (157), engine/turn_loop.rs (32), engine/compaction.rs (19), engine/child_host.rs (12), \u002B14 more file(s). The bar is 30 methods; this is 240 over it, 9.00\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e5802ff185cde3d74d0ee7190e29072529557156b3a0e17a3399fd2a5a1959"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/turn_loop.rs: FileTooLong \u2014 4463 significant 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 78% of them inside a single declaration: Engine (3 blocks, 425-8949), declaring 48 free functions. The bar is 500 significant lines; this is 3963 over it, 8.93\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/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"130f26d062502b4016e49c260e1153373b99ce3df841f09e54d5cf802efb5737"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workflow/mod.rs: FileTooLong \u2014 4244 significant 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 99 free functions. The bar is 500 significant lines; this is 3744 over it, 8.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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee5912ca399658c5c956f61a910227b040079a06026de3f233b42c31342c62e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime_threads.rs: FileTooLong \u2014 4152 significant 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 57 free functions. The bar is 500 significant lines; this is 3652 over it, 8.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5aeb558e24ff52ed0f463da37da900281025bfc8e93b86df1e1e72f264bdf1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.handle_admitted_operation: MethodTooLong \u2014 handle_admitted_operation runs 830 significant 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 730 over it, 8.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":6815}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a82c55a6a22d5abd8609fc543295de800a26c82bbe5cf1f13dadc6128095511"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/v2.rs: FileTooLong \u2014 4089 significant 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 3589 over it, 8.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/v2.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d9b074a17e455d5102acf492c028a1d59594286416192a6ae16aa22e96d966"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/provider_picker.rs: FileTooLong \u2014 3971 significant 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 66% of them inside a single declaration: ProviderPickerView (3 blocks, 266-5620), declaring 36 free functions. The bar is 500 significant lines; this is 3471 over it, 7.94\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/tui/src/tui/provider_picker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4004200a0ef2a0b0350cf5797f39a46b544332d52afbe51ca6bf0f66dc12de9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: setup/mod.rs: FileTooLong \u2014 3963 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 3463 over it, 7.93\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/tui/src/tui/setup/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a6483e7345572cf77484b79c7319ecaf8c8e1322cc03239f927adabc0ab8b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.execute_planned_tools: MethodTooLong \u2014 execute_planned_tools runs 790 significant 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 690 over it, 7.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":2747}}}],"partialFingerprints":{"codehealthFindingId/v1":"a407cc80de1244fc6e81eb6d397cc4fd86d598f60cec816d01a9f72c969475bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.run_owned: MethodTooLong \u2014 run_owned runs 777 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 677 over it, 7.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":3888}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59baa1971b8ab494d295c1c9ee9b982a9281a80d6c1e0c3bee42b423e8ed8b8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Config: ClassTooLong \u2014 3086 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 176 methods, 4 blocks, lines 1975-11715. The bar is 400 significant lines; this is 2686 over it, 7.72\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/runtime/src/config.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"893a7ea21f1aee90eaa3f2b0967e6adbe3f7d5cd1b69e92aeaa23c75a877f44d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::config_main_host::set_config_value: FunctionTooLong \u2014 codewhale_tui::commands::config_main_host::set_config_value runs 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) in one body. The bar is 100 significant lines; this is 655 over it, 7.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_main_host.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2440124481658b5a0a804eddd563011c71c3798a302ea096a8eee2b311320f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/contract.rs: FileTooLong \u2014 3690 significant 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 73 free functions. The bar is 500 significant lines; this is 3190 over it, 7.38\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/tui/src/commands/contract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"889ec58d39d4e439ffc4424d2253297195c3b616feee1d50800e905a3cb7e661"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/remote_control.rs: FileTooLong \u2014 3679 significant 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 74 free functions. The bar is 500 significant lines; this is 3179 over it, 7.36\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/app-server/src/remote_control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70b8b85fdd39348bd5efc2306cb8995421d1afb0b605b954dba11ba846ef0d1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.run_model_step: MethodTooLong \u2014 run_model_step runs 715 significant 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 615 over it, 7.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/model_step.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"108490a04a52c571817a8e75b603655d2d800ff691658575d663eb7e1b9482e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/model_picker.rs: FileTooLong \u2014 3463 significant 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 72 free functions. The bar is 500 significant lines; this is 2963 over it, 6.93\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/tui/src/tui/model_picker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e271a3ec571a176f90b6ca435329c04376f04682cb8c271420bbd0ddc953f15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/apply.rs: FileTooLong \u2014 3440 significant 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 57 free functions. The bar is 500 significant lines; this is 2940 over it, 6.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/tui/src/tui/ui/apply.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07459e768ebaff8ebd17148fcd7b93ecf0469f889930010beab07d3153b63ff7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionManager: ClassTooLong \u2014 2738 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 153 methods, 2 blocks, lines 2482-6644. The bar is 400 significant lines; this is 2338 over it, 6.85\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/engine/src/session_manager.rs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f0c49c4dad5f31ce131dc6633e226c68ff7fa1bc1ad154e2b2f3700530ed70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/oauth.rs: FileTooLong \u2014 3412 significant 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 133 free functions. The bar is 500 significant lines; this is 2912 over it, 6.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/runtime/src/oauth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10c712a40694700add7bde9bc4e134adb60fef57ed8a76e0b7d45d616bc6d3e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SubAgentManager: TooManyMethods \u2014 200 methods. The bar is 30 methods; this is 170 over it, 6.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a610a1608b994ff2c8894b3df571ec11519a2816004d89cb1fa65a56f3fb5cb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProviderPickerView: ClassTooLong \u2014 2609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 95 methods, 3 blocks, lines 266-5620. The bar is 400 significant lines; this is 2209 over it, 6.52\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/tui/src/tui/provider_picker.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a448b27bc1b759d68bc52898d308c2811f43fb4eb481060a576f47ace709ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.start_turn_with_narrowing: MethodTooLong \u2014 start_turn_with_narrowing runs 648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 548 over it, 6.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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13895}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ab73df9f6d1277a95e8b8cf8f4d47cc182663b98cafa640b1011c8307e97aa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CodewhaleClient: ClassTooLong \u2014 2549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 101 methods, 7 blocks, lines 214-7164. The bar is 400 significant lines; this is 2149 over it, 6.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/engine/src/client.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dde86d96a16e174cedfeec16821621024886ca82d45f62f912b5ecec95f65e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BashTool.execute: MethodTooLong \u2014 execute runs 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 521 over it, 6.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":6110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2659d320cc9cf2e69131b4686e9785d0ee3b7bc79dd2b31801ec5a3ec17a963c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/cost_status.rs: FileTooLong \u2014 3058 significant 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 58 free functions. The bar is 500 significant lines; this is 2558 over it, 6.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/engine/src/cost_status.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c19d696c1283ccb5d5eb67ead80c87f51526abdd4ab549fb7e76e929e504e27"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Config: TooManyMethods \u2014 176 methods. The bar is 30 methods; this is 146 over it, 5.87\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/runtime/src/config.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"db219705544b367f874fb03df6227a9e05f5458110538d1df9c47419869ecd09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2919 significant 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 64 free functions. The bar is 500 significant lines; this is 2419 over it, 5.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb439e41c1400d978d323cd60c420069e9f16dbb01fcf8552761b0375ea26a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/task_manager.rs: FileTooLong \u2014 2912 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 2412 over it, 5.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/engine/src/task_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e8b0fbdfc65edbdd72b7c3db8ecadda2a051a18687d88e7e5cfec1fecf89be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::core::protocol_parity::event_to_protocol: FunctionTooLong \u2014 codewhale_engine::core::protocol_parity::event_to_protocol runs 576 significant 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 476 over it, 5.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/protocol_parity.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b33cbb9a1008f18b916eb5b393e97e8d924d79935a1080dd692cfc66ea405a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigView.new_for_app: MethodTooLong \u2014 new_for_app runs 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 471 over it, 5.71\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/tui/src/tui/views/mod.rs"},"region":{"startLine":2319}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daf987366a20d611788e1b75958941a0ffda0d89899c4d4d0156c68c0daa759"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::thread_history::mutate_in_owner: FunctionTooLong \u2014 codewhale_app_server::runtime_api::thread_history::mutate_in_owner runs 565 significant 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 465 over it, 5.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/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4041b12e0e2072d49797e28950d7e6a37dcf4be746ee52a7c8ff9b19340d0a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.plan_tool_calls: MethodTooLong \u2014 plan_tool_calls runs 563 significant 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 463 over it, 5.63\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/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bd86bd43bcf3e14128b840921586c434a59acbf131a819663753f39e5cbe09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/chat.rs: FileTooLong \u2014 2810 significant 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 2310 over it, 5.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89db584513deac27d6bf9e7dbc5a1c64a374b921d8a58f0f3ff28ed00997f3a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/web_search.rs: FileTooLong \u2014 2783 significant 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 83 free functions. The bar is 500 significant lines; this is 2283 over it, 5.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e3f5f7574bc5310a7db2278efc1300f28772c52c1cf8aa48b5add4ceb26967"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_async_main_dispatch: FunctionTooLong \u2014 codewhale_tui::run_async_main_dispatch runs 555 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 455 over it, 5.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":2715}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90a4c69d9fabab8f3cc536660e8f29a56ac2e281702bde09b8ce8b5290d5059"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/automation_manager.rs: FileTooLong \u2014 2757 significant 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 50 free functions. The bar is 500 significant lines; this is 2257 over it, 5.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/engine/src/automation_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca24e23e944b05587764d58576eef2f8eed60e9333c5050443acb0b0be7fb4f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubAgentManager.prepare_background_with_assignment_options: MethodTooLong \u2014 prepare_background_with_assignment_options runs 547 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 447 over it, 5.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":9652}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c34c4ae691b4671206620db4e710bdda3920d4dc103ea9bd09f80c995d7576b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension_host/mod.rs: FileTooLong \u2014 2663 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 2163 over it, 5.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/engine/src/extension_host/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"820d261ada382415b4380d19c02c149ed4e908bc25b86ff3031ef5bd097639d9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConfigView: ClassTooLong \u2014 2118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 51 methods, 5 blocks, lines 2259-5944. The bar is 400 significant lines; this is 1718 over it, 5.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa52a8f534527eddbeed154c9c6df1d79aa8d3263ca77a8411754f10036f3a2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/file.rs: FileTooLong \u2014 2642 significant 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 104 free functions. The bar is 500 significant lines; this is 2142 over it, 5.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7547ccfa4184c558432b13b7c4c0a3f70bf4a29dbeec944d14d5b6eb112a62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/handlers.rs: FileTooLong \u2014 2572 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 2072 over it, 5.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c0b5b7f0a1a29e9e04a2b22328b4701a7afd038a6e8b792ac8e9fc13aa62cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: install/dsh.rs: FileTooLong \u2014 2571 significant 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 2071 over it, 5.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18ecc599c6c7486244e30e39c3b2241702908fbb00a3c8692a7b5576f86c661"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionManager: TooManyMethods \u2014 153 methods. The bar is 30 methods; this is 123 over it, 5.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9c600b21552c33507194cde6b97944c2f459f6b5375b85704cb9fdf941f262"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/history.rs: FileTooLong \u2014 2520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 54 free functions. The bar is 500 significant lines; this is 2020 over it, 5.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d131552233168e338d922432d6c96b62fe94458add383728f2244ee2cecea6b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::config::apply_env_overrides_unlocked: FunctionTooLong \u2014 codewhale_runtime::config::apply_env_overrides_unlocked runs 501 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 401 over it, 5.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8267}}}],"partialFingerprints":{"codehealthFindingId/v1":"d992553e951f89e285f3a59e07a66d72571d34da9d705b78436aa9271c8e6f7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::setup::constitution_ratification_text: FunctionTooLong \u2014 codewhale_tui::tui::setup::constitution_ratification_text runs 483 significant 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 383 over it, 4.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":4412}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f815caf965bc415b25d8a33fa787ac88f0be3014d71f78776be239fb3ddda7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.prepare_model_step: MethodTooLong \u2014 prepare_model_step runs 476 significant 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 376 over it, 4.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/preparation.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f73781a007e71d532e0798e7d9a15fed8a7ad736bdb81901f97131c71803d5d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RuntimeThreadStore: ClassTooLong \u2014 1895 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 89 methods, 2 blocks, lines 1665-4489. The bar is 400 significant lines; this is 1495 over it, 4.74\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/engine/src/runtime_threads.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"622ccc9f0a54ec7da09a192f644866498d91263c0f5d1bf226caa84c47214bad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/registry.rs: FileTooLong \u2014 2358 significant 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 65 free functions. The bar is 500 significant lines; this is 1858 over it, 4.72\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/plugins/src/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad1daf83a2e5ec447e8cf2b89ecdbbfdce9fee524044d785d3a91c764ff10af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/exec_agent.rs: FileTooLong \u2014 2330 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 1830 over it, 4.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b10be043223f5e6f1c5c2c2244508a9ff9106796a815dac55214608daff4986"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/mod.rs: FileTooLong \u2014 2330 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 64 free functions. The bar is 500 significant lines; this is 1830 over it, 4.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96119e9ac24e827f1f9a98b5c9fe09a061665bd5e5053a56fedfac08ec952896"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_account_cli::computer::run: FunctionTooLong \u2014 codewhale_account_cli::computer::run runs 444 significant 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 344 over it, 4.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/computer.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4974b7718848b046e2e6bd6baa68f693db0bacf520b260137041fbd5f047b4b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/manager.rs: FileTooLong \u2014 2210 significant 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: FleetManager (3 blocks, 44-2508), declaring 32 free functions. The bar is 500 significant lines; this is 1710 over it, 4.42\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/engine/src/fleet/manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c661da6f6162672dd514d15dae649dea0300a2973b00c2e3f134ba47ffce2696"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.new_admitted_with_subagent_manager: MethodTooLong \u2014 new_admitted_with_subagent_manager runs 442 significant 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 342 over it, 4.42\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/engine/src/core/engine.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1955aaf8a6d39464ba445e819b2fc657537fdd88e8903250f1648df5accfd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hooks/executor.rs: FileTooLong \u2014 2180 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 1680 over it, 4.36\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/engine/src/hooks/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8ea54f765963dc0a34d42a41e66436347115fb0514f90941de6538365e380f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FleetManager: ClassTooLong \u2014 1701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 60 methods, 3 blocks, lines 44-2508. The bar is 400 significant lines; this is 1301 over it, 4.25\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/engine/src/fleet/manager.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39150b61f5dabfb4dbc112f28a4f1e6bbe5b1cc77b1f29851cedd5f14f6082f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: work_surface/model.rs: FileTooLong \u2014 2118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 82 free functions. The bar is 500 significant lines; this is 1618 over it, 4.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9868ab78ebc82786aacf9d93bc6e94abef180ba45f624dbdaf697b10539b7b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_review: FunctionTooLong \u2014 codewhale_tui::run_review runs 423 significant 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 323 over it, 4.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/tui/src/lib.rs"},"region":{"startLine":11313}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be3ad419264d351c6d4e25641c531000202a8bd29e39d40fc0c8d7f454fcbf3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: views/fleet_setup.rs: FileTooLong \u2014 2081 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: FleetSetupView (4 blocks, 721-2832). The bar is 500 significant lines; this is 1581 over it, 4.16\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/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f7c9d571217260d73d51ab63d652291563319b6837d448c3ef1f921af4a19d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/ledger.rs: FileTooLong \u2014 2080 significant 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 1580 over it, 4.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f91a992eab9264ef93aea4e39f019beac8c15fc2a93b85795a87522e547bd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.seed_thread_from_messages_with_history_operation: MethodTooLong \u2014 seed_thread_from_messages_with_history_operation runs 416 significant 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 316 over it, 4.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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11649}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a696f977be0be776b03fd9689a6cfb6ddd7837846c831f0e245197fbfb65b6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RemoteControlController: ClassTooLong \u2014 1628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 86 methods, 4 blocks, lines 802-3196. The bar is 400 significant lines; this is 1228 over it, 4.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"6257b73dde2e4487709513b109ecfd0921c7e8f287613eadf991e7e6b40c3a11"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_api/git.rs: FileTooLong \u2014 2025 significant 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 69 free functions. The bar is 500 significant lines; this is 1525 over it, 4.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4a4849d28c195901880a9fb1ac7e88eaeb6e8bd9efdf4e900548095080a1f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.process_stream: MethodTooLong \u2014 process_stream runs 405 significant 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 305 over it, 4.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/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4903}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b94d408a4da2df660b94193b0ffa7ea7fe2e24b24bcfea529f7b67bb9879cbb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.build_request_manifest: MethodTooLong \u2014 build_request_manifest runs 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 304 over it, 4.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/preview.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"21026d5521e8433d03cabee251ac9e97a2c2cc2346e86c5a8fdd21f87056f36b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProviderPickerView.handle_key: MethodTooLong \u2014 handle_key runs 401 significant 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 301 over it, 4.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":4856}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a6d106b29b7a1c42536d84b19b63fbb555145924e2ec15600302a1c660e9b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_account_cli::run_agents: FunctionTooLong \u2014 codewhale_account_cli::run_agents runs 397 significant 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 297 over it, 3.97\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/account-cli/src/lib.rs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"834b6d153aba037f5b5b54bf4284735ed592b48029c5c865a3a0af5245d26247"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/config_main_host.rs: FileTooLong \u2014 1955 significant 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 45 free functions. The bar is 500 significant lines; this is 1455 over it, 3.91\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/tui/src/commands/config_main_host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe18bc97fd2031167f2903e4ea3997c257e5b3c535ad56913ef24c86de5cdcc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::pet_watch::owner::run_world: FunctionTooLong \u2014 codewhale_tui::tui::pet_watch::owner::run_world runs 391 significant 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 291 over it, 3.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/owner.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ea4fd06bf971c6eb1ebac62065f11ad5e4e97b9072325b08284de3f9b18c74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.build_turn_tool_registry_and_catalog: MethodTooLong \u2014 build_turn_tool_registry_and_catalog runs 389 significant 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 289 over it, 3.89\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/engine/src/core/engine.rs"},"region":{"startLine":6212}}}],"partialFingerprints":{"codehealthFindingId/v1":"69abd0607d7359a6dadb604cf5d3177ae2cf3dec0d56aa5c6e301919b25e4cc4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ComposerWidget.render: MethodTooLong \u2014 render runs 385 significant 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 285 over it, 3.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3565888fd2182ab81c721dbb4c3df42a4cbe25ef56d850e5f72a8e7edbbdf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::run: FunctionTooLong \u2014 codewhale_cli::run runs 384 significant 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 284 over it, 3.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ac5194909e8a85427ebc523b3b77c7dd7d3022e62bacae660ea717b01accbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.ensure_engine_loaded: MethodTooLong \u2014 ensure_engine_loaded runs 383 significant 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 283 over it, 3.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":15184}}}],"partialFingerprints":{"codehealthFindingId/v1":"2effc454d9f6946e13210ad290d86a91aa4a4c76bd67b0ff77e86fc573ed89cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::event_loop::run_tui: FunctionTooLong \u2014 codewhale_tui::tui::ui::event_loop::run_tui runs 380 significant 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 280 over it, 3.80\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/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5be88ac570a77e684d708c567e6fe2a3272c82e9f719856f7f10dfe5d544a8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_api/plugins.rs: FileTooLong \u2014 1862 significant 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 73 free functions. The bar is 500 significant lines; this is 1362 over it, 3.72\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/app-server/src/runtime_api/plugins.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5a4bbea10d3481f4d5308307adbd5c89c81c4fe67a144b82e466b997213f3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: subagent/engine.rs: FileTooLong \u2014 1846 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1346 over it, 3.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaba74bf8a8b45571a5f1324a8d842342b2055aa894ba928b167bbc29b759978"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ModelPickerView: ClassTooLong \u2014 1469 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 6 blocks, lines 213-4828. The bar is 400 significant lines; this is 1069 over it, 3.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"747216b0ea64f5f70ddee00f5d9ce99b5d40e55dc46b7e2f6f3e570c03131daf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_web/app.mjs: FileTooLong \u2014 1818 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 65% of them inside a single declaration: startBrowserClient (868-2382). The bar is 500 significant lines; this is 1318 over it, 3.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"388c0875354d16339247ab9b2fb3bbc06a5525c1817bd6a2240d46fedc9d7d56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/settings.rs: FileTooLong \u2014 1818 significant 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 53 free functions. The bar is 500 significant lines; this is 1318 over it, 3.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/runtime/src/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6491ee32015ea339835eca443b6eb3bf6b7966e665df39abff3705fdf57e2d4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/update.rs: FileTooLong \u2014 1815 significant 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 84 free functions. The bar is 500 significant lines; this is 1315 over it, 3.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aa36bfdb8866b9a1df3fc0d28f04930677f720544cef996b19b6a3286156cd2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProviderDashboardRow.from_config_with_provider_id: MethodTooLong \u2014 from_config_with_provider_id runs 362 significant 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 262 over it, 3.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"c557b4adbfc3580fe931a1a26e6ec69f56a572409c89d2fa9fc51fe8ba7a812a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: McpPool: TooManyMethods \u2014 108 methods. The bar is 30 methods; this is 78 over it, 3.60\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/engine/src/mcp.rs"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"be87f88b18dffcc1d7c973d8e4d82b53b1afb6a01acae36b02499566a4ccb40d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FleetSetupView: ClassTooLong \u2014 1440 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 57 methods, 4 blocks, lines 721-2832. The bar is 400 significant lines; this is 1040 over it, 3.60\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/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90679aa01ea480c6ba1eb2388025ec5b2dcce538256eadd9c549b44c3a8d388"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::frame::render: FunctionTooLong \u2014 codewhale_tui::tui::ui::frame::render runs 360 significant 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 260 over it, 3.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/tui/src/tui/ui/frame.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbd8b62a7592f3025c718e23c5feac44d199c7a2c132b7ef52d79d97a250ea9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ShellManager: ClassTooLong \u2014 1415 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 56 methods, 3 blocks, lines 1998-3983. The bar is 400 significant lines; this is 1015 over it, 3.54\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/engine/src/tools/shell.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f299d2312663272fa5ea2e0c49b5db19767514b0b6a54a5a41d2e2cb3943ee7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/oauth.rs: FileTooLong \u2014 1762 significant 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 77 free functions. The bar is 500 significant lines; this is 1262 over it, 3.52\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/engine/src/mcp/oauth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"471fbbc664ef8c83096c15bd9fe92009dbc6836beec09bb2874594584dca839c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_api/thread_history.rs: FileTooLong \u2014 1751 significant 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 1251 over it, 3.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25a936833922ae584f4662977791d52043c4d9152294be3230e79d891857283"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Config: TooManyFields \u2014 105 stored fields beside 176 methods. The bar is 30 stored fields; this is 75 over it, 3.50\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/runtime/src/config.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d64881c8d0d3e520f22b264b9bae3b0b8494ae79527b78569fc6706750d3252"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: scene.createOcean: FunctionTooLong \u2014 createOcean runs 348 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 248 over it, 3.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/scene.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac0ed78af12f2d5da653e63dd3195cb05f0228673a0226cd5494e49b7000aad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: views/extensions.rs: FileTooLong \u2014 1739 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1239 over it, 3.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/extensions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5348532fbfaa9f680a6506539a6b3c2dc406c23c076d1cdf6874c28d34d3784"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/workflow_panel.rs: FileTooLong \u2014 1732 significant 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 1232 over it, 3.46\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/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd19255704fddef57baab6de60ceddfa44fa2d52f45d1277cd9a7be6a8144de"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SetupWizardView: ClassTooLong \u2014 1376 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 72 methods, 4 blocks, lines 161-4200. The bar is 400 significant lines; this is 976 over it, 3.44\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/tui/src/tui/setup/mod.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a90cde87a7f89e0a67d6fdff0b57d6b56d4c59afc6164f370d1acdcd2f54453"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shell_expand.rs: FileTooLong \u2014 1708 significant 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 1208 over it, 3.42\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/execpolicy/src/shell_expand.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbee41e690337cb86220e6597eb2e6412d933ef499b51d3fa9bc406526259090"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TaskManager: ClassTooLong \u2014 1365 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 60 methods, 2 blocks, lines 1789-3925. The bar is 400 significant lines; this is 965 over it, 3.41\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/engine/src/task_manager.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63048a6099be4f4fe699e10a3b6539f58afb0ad02207b7ac3a0f4ef91dcd859"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodewhaleClient.handle_responses_stream: MethodTooLong \u2014 handle_responses_stream runs 340 significant 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 240 over it, 3.40\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/engine/src/client/responses.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9c5a13dbc3ae57c320850c7f56b0ff99da10bd11f8b111f3d176e3a1fa2e45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_mcp_command: FunctionTooLong \u2014 codewhale_tui::run_mcp_command runs 338 significant 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 238 over it, 3.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/tui/src/lib.rs"},"region":{"startLine":13157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9379ec93c6a7e0b48bb3bfe1f3b3d20abfdd0d55a24ef46a8e31e1c4a79fff66"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CodewhaleClient: TooManyMethods \u2014 101 methods, declared across 6 files: src/client.rs (88), client/anthropic.rs (5), client/chat.rs (3), client/responses.rs (2), \u002B2 more file(s). The bar is 30 methods; this is 71 over it, 3.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/engine/src/client.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"53633020aec4306aa3c7a632f7645842d03caab4c33397e0231d732148536d0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::spawn_subagent_from_input: FunctionTooLong \u2014 codewhale_engine::tools::subagent::spawn_subagent_from_input runs 336 significant 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 236 over it, 3.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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":15581}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c1877ce54daa21979d992106b26b79a3839559556315ccd96f57b9b7da7537"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: EnvRuntimeOverrides: TooManyFields \u2014 100 stored fields beside 5 methods. The bar is 30 stored fields; this is 70 over it, 3.33\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/config/src/env_overrides.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda9c34d75bd27ce39a13edf9479ba4159eb60bd0e497cb432cb0414d194a04c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1663 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 1163 over it, 3.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/workflow/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"752f71451c42eca1c20a5b3e5700c2a9b0dea3c669adcdc7b3f37d431e9a8c9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::client::chat::build_chat_messages_with_reasoning: FunctionTooLong \u2014 codewhale_engine::client::chat::build_chat_messages_with_reasoning runs 332 significant 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 232 over it, 3.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"7838334793029363d74cb5951ed4bca3bc2a134435f9bf85ad8c8d256bfc6925"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/private_directory.rs: FileTooLong \u2014 1655 significant 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 39 free functions. The bar is 500 significant lines; this is 1155 over it, 3.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8559c41ced098fea14b39c9a4e974e0fc7860f72fb74ac6338f8da1b475eeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: chat.chatScript: FunctionTooLong \u2014 chatScript runs 327 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 227 over it, 3.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":"extensions/vscode/src/chat.ts"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"250e95d0d7d6b4672bebf51496ceecfe8468f66718cbd5be8f9c495922dfb6ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::remote_control::relay_worker: FunctionTooLong \u2014 codewhale_app_server::remote_control::relay_worker runs 326 significant 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 226 over it, 3.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/app-server/src/remote_control.rs"},"region":{"startLine":3451}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a77c6a474079f6dbb0559455b38c5b43d3c36f1c7c92f8250ce45563366fa95"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigView.render_settings_shell: MethodTooLong \u2014 render_settings_shell runs 325 significant 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 225 over it, 3.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"53aa743978ecf3a88fed68de55ef3ed4d8f6c31796766f7b76f98c5f65c388e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/provider_lake.rs: FileTooLong \u2014 1621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 60 free functions. The bar is 500 significant lines; this is 1121 over it, 3.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be1654f3295671449654f62bb67a73f4d76e8f2936fa8c85cae63f03cb3b937"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server_protocol::v2::round_trip: FunctionTooLong \u2014 codewhale_app_server_protocol::v2::round_trip runs 324 significant 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 224 over it, 3.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/v2.rs"},"region":{"startLine":4847}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9ab63c66ff5fe612409e0d0bfc582963155cfa4bc17563ce3653a24acd5a6b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChatWidget.new_with_ocean_elapsed: MethodTooLong \u2014 new_with_ocean_elapsed runs 324 significant 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 224 over it, 3.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/transcript_legacy.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"807464f50a493be4823ec7609b854f482b5b6c3d6d82a4a3912093b4c3cb060d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/markdown_render.rs: FileTooLong \u2014 1618 significant 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 57 free functions. The bar is 500 significant lines; this is 1118 over it, 3.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/markdown_render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"340ca47bd5d0e53bf1ef4f9fb45456d94ffb6ff3a2f57e2bac398624fcfaffc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::extension_host::mcp_http::fetch: FunctionTooLong \u2014 codewhale_engine::extension_host::mcp_http::fetch runs 323 significant 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 223 over it, 3.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/engine/src/extension_host/mcp_http.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a95e028f791028e58995f602dc2ffc737d09094eb0297f7a6c47da7be25f51"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: manager/external_agent.rs: FileTooLong \u2014 1609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: RuntimeThreadManager (698-2040). The bar is 500 significant lines; this is 1109 over it, 3.22\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/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e164db698031ec5f5828a0824867db592104b2aae816f26075d43179dd0272"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension_host/supervisor.rs: FileTooLong \u2014 1604 significant 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 1104 over it, 3.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92976fd46075af01d1075b58498188443322017a27939755562b9caaa3e40a3f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/project_context.rs: FileTooLong \u2014 1587 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 1087 over it, 3.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3489c7b11810d3c3626e27efd05dac025a2e2fc4a848cea36751febaacc82c79"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/frame.rs: FileTooLong \u2014 1587 significant 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 38 free functions. The bar is 500 significant lines; this is 1087 over it, 3.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/frame.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bacf65d37749b5ed581c10271f0a58b9cb554e8d9dd3fee6e21f8edf8e861f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.execute_tool_admitted: MethodTooLong \u2014 execute_tool_admitted runs 317 significant 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 217 over it, 3.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/engine/src/core/engine/tool_execution.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ea6a0a582950fe68018b2ec8cd0d0179c9565e54449f7f791f5dc9761092fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProviderPickerView: TooManyMethods \u2014 95 methods. The bar is 30 methods; this is 65 over it, 3.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ea9de04f9ad65b9a51e7cc75f95f87b3e0f4095cd14b379995a2f7d79fdbc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/review.rs: FileTooLong \u2014 1570 significant 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 52 free functions. The bar is 500 significant lines; this is 1070 over it, 3.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38974893b01ee26a3fd2580a4a456a035d94605ec516f849f0793d197d3b83d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/model_routing.rs: FileTooLong \u2014 1562 significant 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 45 free functions. The bar is 500 significant lines; this is 1062 over it, 3.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/engine/src/model_routing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e385796fcdf5a86f8413b20a88b3c0fa0d62d79cd6637a815d72eba97bef88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/command_safety.rs: FileTooLong \u2014 1555 significant 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 66 free functions. The bar is 500 significant lines; this is 1055 over it, 3.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"769bb8dd41dd54b79433c2ea4dee688192e56e43ce5b6d7317afa5b041ed6a47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubAgentStoreAuthority.merge_publish: MethodTooLong \u2014 merge_publish runs 306 significant 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 206 over it, 3.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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":13776}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ba17737382983cd4064f1241e47f55792bfc03932a4ce9fe2582c054dbdd16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::work_surface::render::render: FunctionTooLong \u2014 codewhale_tui::tui::work_surface::render::render runs 306 significant 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 206 over it, 3.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/tui/src/tui/work_surface/render/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffe1cdcc9e4cb0ab4bf71213e1cdbf05d7bc4dc357b743ae7d23febb28773ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/mouse_ui.rs: FileTooLong \u2014 1526 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 56 free functions. The bar is 500 significant lines; this is 1026 over it, 3.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/mouse_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21eb5dfdaa8da7839984493a2752bf3239901c29f276bdea6356ce35222776a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: OwnerRegistry: ClassTooLong \u2014 1204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 55 methods, 2 blocks, lines 255-1954. The bar is 400 significant lines; this is 804 over it, 3.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef36c6517e59551e3c064fcc928cb84e959e4afbc260dfe6315db7450e27fb8e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/repo.rs: FileTooLong \u2014 1503 significant 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 1003 over it, 3.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"728bc7eb0b77a74ea1288bbb5b80c99c74cf46cf47e8fd64c0ab467a6c870ace"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Engine: TooManyFields \u2014 90 stored fields beside 270 methods. The bar is 30 stored fields; this is 60 over it, 3.00\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/engine/src/core/engine.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"803fe57c5be2e9e1408e215a057ce4f86d491050d14c298032f98884c32ac518"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.update_thread_under_history_guard: MethodTooLong \u2014 update_thread_under_history_guard runs 300 significant 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 200 over it, 3.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":9120}}}],"partialFingerprints":{"codehealthFindingId/v1":"365c433e92cb0dea92a2838694333f9cbe25ccba60e6ea00d9e70c6fdc5ea569"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: authority/auto_review.rs: FileTooLong \u2014 1490 significant 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 54 free functions. The bar is 500 significant lines; this is 990 over it, 2.98\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/engine/src/core/authority/auto_review.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d227737cb93693e6706e9b68238341db4474b7204327ce01fd5203b43f90f9dd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RuntimeThreadStore: TooManyMethods \u2014 89 methods, declared across 2 files: src/runtime_threads.rs (88), runtime_threads/job_operations.rs (1). The bar is 30 methods; this is 59 over it, 2.97\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/engine/src/runtime_threads.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb16c9e403349c010c13612b1410f037d350017ba022d40786066ed31c8c5e78"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: EngineConfig: TooManyFields \u2014 89 stored fields. The bar is 30 stored fields; this is 59 over it, 2.97\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b914d40d95db6f05c188325143aa88568a74468da478f8ed0765686c70e4172f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/receipts.rs: FileTooLong \u2014 1471 significant 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 39 free functions. The bar is 500 significant lines; this is 971 over it, 2.94\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2e7c4c2c6687d4ccd55ed909c2106bdb9feb746589f7ce6b058ebbab0a453a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::handlers::handle_mcp_ui_action: FunctionTooLong \u2014 codewhale_tui::tui::ui::handlers::handle_mcp_ui_action runs 294 significant 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 194 over it, 2.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c0c44ab4e335e140a46c98c1fc4b07c7e04b8d71f2bc64bdf7bfcae7f0a623"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/provider_catalog_live.rs: FileTooLong \u2014 1467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 967 over it, 2.93\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/engine/src/provider_catalog_live.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00da8fed2696b3f89757f21d58fb887ffac731ea3fea08444a29785ea7121e48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::prepare_mounted_session: FunctionTooLong \u2014 codewhale_tui::prepare_mounted_session runs 287 significant 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 187 over it, 2.87\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/tui/src/lib.rs"},"region":{"startLine":10911}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b7e6f4e177ce76d0377e22c03df895c8a388fdbdac485a13cb8b7631c4a939"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RemoteControlController: TooManyMethods \u2014 86 methods. The bar is 30 methods; this is 56 over it, 2.87\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/app-server/src/remote_control.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fed8df50b1d653b560335a5cc2ddb6415d5f07421c96fa74e0c8230bdda9c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/control.rs: FileTooLong \u2014 1431 significant 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 931 over it, 2.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b454f229b9833e2680ae462ae70756d71fad64dd845832259238f6ab91a2d33f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AutomationManager: ClassTooLong \u2014 1140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 74 methods, 2 blocks, lines 1212-2849. The bar is 400 significant lines; this is 740 over it, 2.85\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/engine/src/automation_manager.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5327ae31ab301ad2b292ca5e1d086f0bb2327c2cc0dfeb3b7813b0743468e66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension_host/registry.rs: FileTooLong \u2014 1416 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: OwnerRegistry (2 blocks, 255-1954). The bar is 500 significant lines; this is 916 over it, 2.83\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/engine/src/extension_host/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4eb35f08134fe81b415926bad725c24e33b3a8041c6089469b6f57a29fcefa9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 40 free functions. The bar is 500 significant lines; this is 905 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/skills/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f74d83f4ded41b66af1b92e7dc558609bac7b62331533e51487928cf9b620ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/tool_routing.rs: FileTooLong \u2014 1405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 905 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/tui/src/tui/tool_routing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a9a6d3c13e2b862b84b305c593ece669aa7e5b03167ebd8333f8432d936943"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::underwater::launch_empty_state: FunctionTooLong \u2014 codewhale_tui::tui::underwater::launch_empty_state runs 281 significant 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 181 over it, 2.81\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/tui/src/tui/underwater.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74ea65639b24979c2173eb457557c4dcfe8bc79355f15f9bbd0ac868c5f1edf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExtensionHostManager: ClassTooLong \u2014 1123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 53 methods, 3 blocks, lines 1513-3937. The bar is 400 significant lines; this is 723 over it, 2.81\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/engine/src/extension_host/mod.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc371ec91cb12c802cc4e7c86bff13ae210057ba56fce4d56bd0ead6e6d3ad5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BashTool: ClassTooLong \u2014 1120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 4 blocks, lines 5836-7430. The bar is 400 significant lines; this is 720 over it, 2.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":5836}}}],"partialFingerprints":{"codehealthFindingId/v1":"118bce77d15b7b67b3cbb1a59a01232e6acefc330b6bd48161acbc9120212443"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/session_state.rs: FileTooLong \u2014 1391 significant 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 52 free functions. The bar is 500 significant lines; this is 891 over it, 2.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/session_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb186b679f7ec2ecea968c08ce3c007f70d832457b236067247bb10bbf0ef2e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::thread_history::import_into_owner: FunctionTooLong \u2014 codewhale_app_server::runtime_api::thread_history::import_into_owner runs 277 significant 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 177 over it, 2.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5550e33376c3de6d090f683247e92b26266d44d16d57c2b2da70bf943977bc6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.continue_model_step: MethodTooLong \u2014 continue_model_step runs 276 significant 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 176 over it, 2.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/continuation.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0d7fb626204d74448cffba44cd92e61462bb649388d4a473e66b23725c6047"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_fleet_command: FunctionTooLong \u2014 codewhale_tui::run_fleet_command runs 276 significant 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 176 over it, 2.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":3966}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4231f835c4b8681fd9daec08505b9bc2eeb0a8269ad7ea0fd8b6493f5d0df4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/compaction.rs: FileTooLong \u2014 1367 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 62 free functions. The bar is 500 significant lines; this is 867 over it, 2.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dfb9a27b2a8cc1ac2463965b2c44e7211a25f8f9537f5b7d35407cd7241ee5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::remote_control_bridge::drain_remote_control_events: FunctionTooLong \u2014 codewhale_tui::tui::ui::remote_control_bridge::drain_remote_control_events runs 273 significant 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 173 over it, 2.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/remote_control_bridge.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9c85f977c667eb6a2a38c9eaa20ec6852004ad3127ba15cf870aa85c57bbd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/mutation.rs: FileTooLong \u2014 1356 significant 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 856 over it, 2.71\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/skills/src/mutation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4018e35958aec741910bdadd2fac4e36ec15e25335fca56462d61dd84ad9c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime_chat_relay.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). 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/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f9620f9396a864101a57902b31f51f06d3417bcd2b321c66e1d4b37bf3fffd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: llm_client/mod.rs: FileTooLong \u2014 1332 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 832 over it, 2.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/llm_client/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e10cdf047f4beffce32215a69b9e86a62fddb7bd9ea467149a13c1c3c897b6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config.resolve_active_route_api_key: MethodTooLong \u2014 resolve_active_route_api_key runs 266 significant 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 166 over it, 2.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":6315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4ab017a7d838c30fabe5808d95e1a473510399e6bf5aa1d43ab6715a7f1d4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension_host/windows.rs: FileTooLong \u2014 1325 significant 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 825 over it, 2.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"345652a38836a1daa0dfbe5cbe28e75a0159a6b4127b62b4a870264194f06d43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/web_run.rs: FileTooLong \u2014 1321 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 41 free functions. The bar is 500 significant lines; this is 821 over it, 2.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/engine/src/tools/web_run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3180e9122ea0249a0e8f63941718768234dede15dde4888f1d49a8e9a63b6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.recover_context_overflow: MethodTooLong \u2014 recover_context_overflow runs 264 significant 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 164 over it, 2.64\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/engine/src/core/engine/compaction.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"805d8cfa7100f449f5f78cae6973a8424b25ee672ca1312b69168e28a84a999b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: StatusMessages: TooManyFields \u2014 79 stored fields beside 2 methods. The bar is 30 stored fields; this is 49 over it, 2.63\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/tui/src/commands/groups/config/policy_messages.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d54691b4d5abfd3f5714f12a0167922f5f3b14fe63ecec9f745060af5ac1d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProviderPickerView.render_list: MethodTooLong \u2014 render_list runs 263 significant 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 163 over it, 2.63\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/tui/src/tui/provider_picker.rs"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"be50fcc53fe7828a8f3227b9f76cc2ef167668518d4f922c7adc9fff2cdbe21f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::project_context::project_instruction_sources_with_settings: FunctionTooLong \u2014 codewhale_engine::project_context::project_instruction_sources_with_settings runs 262 significant 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 162 over it, 2.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a771f3691fa6ee3f5a476cfb3f0dde0a5361841c9706cb8b05abf88d312c6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/pager.rs: FileTooLong \u2014 1305 significant 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 805 over it, 2.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7ceb370899627cf18773d4643d45eb4dcc122e65dcefc6b7edeb75337c1463"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::pet_watch::full::render: FunctionTooLong \u2014 codewhale_tui::tui::pet_watch::full::render runs 261 significant 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 161 over it, 2.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/full.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0650abfe60499a983038b9cd6bafb6bab37944c9129c40dad70babd4eb2e8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/install.js: FileTooLong \u2014 1303 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 803 over it, 2.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"075b29ebd7e90372e3575b1bc63799867dbf334dd83b9f2adae044e3c7d193c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.run_inline_repl_phase: MethodTooLong \u2014 run_inline_repl_phase runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/inline_repl.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"015b83fadd408ac0ef0bd60a0154f1877bbcd12ff7ba409a58e1d85f4dac45b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StateStore.migrate_schema: MethodTooLong \u2014 migrate_schema runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/state/src/lib.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"175827ac1e00debd518c89de9cd98cf57cc0873f237e4605a4a4b5b966c3765c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Settings: ClassTooLong \u2014 1025 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 31 methods, 4 blocks, lines 243-2282. The bar is 400 significant lines; this is 625 over it, 2.56\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/runtime/src/settings.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bac2b1caad251eb3bd0e437f6bce4ab83b97bc28307a8d162e4eb6c488e131"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/composer.rs: FileTooLong \u2014 1273 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: App (719-2170). The bar is 500 significant lines; this is 773 over it, 2.55\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5218b9f7f79ffa7ef08d1ba42e487e93510dd0379b4ef4fcebc072dac2977e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/manifest.rs: FileTooLong \u2014 1265 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 765 over it, 2.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/plugins/src/manifest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"349d3b8bcb5b424acd80f5c63a3cfe5b3b2aa04856bb5a7b22094e54f2563c66"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkflowPanel: ClassTooLong \u2014 1009 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 2 blocks, lines 680-2089. The bar is 400 significant lines; this is 609 over it, 2.52\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/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0282f97fae376ed404ebe5f80c7557cf853661b6acdd24fe4271489fc684b75"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pricing.rs: FileTooLong \u2014 1257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 757 over it, 2.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/engine/src/pricing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7220f9cb542c4db5239824fd1ab2800c40edf908694403fb188c2c2f26fa0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.execute_structured_review: MethodTooLong \u2014 execute_structured_review runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/review.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"3491160ecc908837aaa35d2656c0e4eebdcc3284fadfd7bafaa454dec3bb9b2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/vm.rs: FileTooLong \u2014 1250 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 750 over it, 2.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/vm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f1a07e3ef2ed223caddbf6766d700674e8b8cff47ec7fda85d6cd3635c4577"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::install::dsh::convert_package: FunctionTooLong \u2014 codewhale_plugins::install::dsh::convert_package runs 249 significant 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 149 over it, 2.49\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/plugins/src/install/dsh.rs"},"region":{"startLine":2983}}}],"partialFingerprints":{"codehealthFindingId/v1":"93921fd29200e93e21b00b0b7407e16a6ead9084856bb39738db7b9b46db9ef1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: route.POST: FunctionTooLong \u2014 POST runs 249 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 149 over it, 2.49\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":"web/app/api/admin/post/route.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e04ecd7b1ebf24afd93eee53119748946d315fe90d02c336926337cf5b974f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension_host/core_call.rs: FileTooLong \u2014 1240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: CoreCalls (2 blocks, 545-1637). The bar is 500 significant lines; this is 740 over it, 2.48\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/engine/src/extension_host/core_call.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5383626f7bef7d009eb7790e02e587624aa17981faf4b0cfecfd5798ab8fcb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.create_thread_with_reserved_id: MethodTooLong \u2014 create_thread_with_reserved_id runs 248 significant 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 148 over it, 2.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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7876}}}],"partialFingerprints":{"codehealthFindingId/v1":"64167eedf7bbaba455c142183b1e64125d0382a74f4d0c925152acd330fccc06"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebRunTool.execute: MethodTooLong \u2014 execute runs 247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd241b95479415a1df407839cf0fb6f4b157bac84886a0be0ebdc2a4dc2c833"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AutomationManager: TooManyMethods \u2014 74 methods. The bar is 30 methods; this is 44 over it, 2.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece71490b18d00cf923f7fea9525f079a100f5cf145f8ccf975ac66d4b0d7bf5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigToml.resolve_runtime_options_with_secrets: MethodTooLong \u2014 resolve_runtime_options_with_secrets runs 246 significant 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 146 over it, 2.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_resolve.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b83b3a59021b3ea1eacd4f45873bd6c2dea6af383d60d402584cf0001bf199"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.start_external_turn: MethodTooLong \u2014 start_external_turn runs 245 significant 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 145 over it, 2.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/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"26063df2db0e4b6f514f879ea297fd854d3d416f377fbb1eaa692ae53de51850"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/underwater.rs: FileTooLong \u2014 1221 significant 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 38 free functions. The bar is 500 significant lines; this is 721 over it, 2.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/underwater.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"154267a03a700eaeefcb829cfd313d00b512ba448e5be791b01d076acd640a17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.run_auto_compaction: MethodTooLong \u2014 run_auto_compaction runs 244 significant 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 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/compaction.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa415fda6b360e8b8fc1d52dccdfb3d42d1d78d21bdf8ae12f4edcc32212d70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: install.httpRequest: FunctionTooLong \u2014 httpRequest runs 244 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacb4637d2ba428b39fecea38442b3ad0ac51b1dc87f8324e92a7b857b35dd64"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/dispatch.rs: FileTooLong \u2014 1218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 718 over it, 2.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c75b616bcafae52bf44bcfc9e23fd8db4dffaa204d345a076c6165d6abcfcf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodewhaleClient.prepare_outbound_request_body: MethodTooLong \u2014 prepare_outbound_request_body runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":3261}}}],"partialFingerprints":{"codehealthFindingId/v1":"672855100309a93d046eba084df3587884118c628d7f36db814cad0cf8052c53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.gate_nested_call: MethodTooLong \u2014 gate_nested_call runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4130}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d4e7275d54af109861b7941d06d0c0f2eb13b5565950dbca6e04ec0a14f794"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::tool_routing::handle_tool_call_complete: FunctionTooLong \u2014 codewhale_tui::tui::tool_routing::handle_tool_call_complete runs 242 significant 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 142 over it, 2.42\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/tui/src/tui/tool_routing.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"9577d71d9019c8077b360ca26841eda4d6bdc1ceb31610e4c560eb4e96959aba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/host.rs: FileTooLong \u2014 1206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 706 over it, 2.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d967efa16e45c23c05e3baa6e2051afda5b0df137da26360407640bc1a915a08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/registry.rs: FileTooLong \u2014 1205 significant 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 705 over it, 2.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"266cec0e6e1b15fc8bd418d358a9acd50556967c14bad39c3f386fe08b66a197"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/redact.rs: FileTooLong \u2014 1202 significant 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 57 free functions. The bar is 500 significant lines; this is 702 over it, 2.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daca88ce80d57b0f12536d3603bc26bda0cc46a7a2e4a0c0183c794ae94c3d7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/work.rs: FileTooLong \u2014 1201 significant 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 32 free functions. The bar is 500 significant lines; this is 701 over it, 2.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/work.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e923e787e3b8423a95cb23d66c7d894c3651a8edb845722406e70bf0a80218b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SetupWizardView: TooManyMethods \u2014 72 methods. The bar is 30 methods; this is 42 over it, 2.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7741cb0a2ad9069df568ff062e034ca5f265ecb2ee9f6cddd249187538d4c91f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/session_picker.rs: FileTooLong \u2014 1193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 66% of them inside a single declaration: SessionPickerView (3 blocks, 119-1406). The bar is 500 significant lines; this is 693 over it, 2.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4bfe2659d3f49e713903762d044b6e11b7d527e48d99462422ad40b5b62d11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::client::reasoning_effort::apply_reasoning_effort: FunctionTooLong \u2014 codewhale_engine::client::reasoning_effort::apply_reasoning_effort runs 238 significant 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 138 over it, 2.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/engine/src/client/reasoning_effort.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"771e77f9cff6a18dd7ae7fb5dd54144c0ee2859e3503a82aeeec00464d654301"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShellManager.spawn_background_sandboxed: MethodTooLong \u2014 spawn_background_sandboxed runs 238 significant 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 138 over it, 2.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/engine/src/tools/shell.rs"},"region":{"startLine":2833}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9208f8830bd51b129b1297081ce8e8814ba3372204b5882b7c851bdc54a6408"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::run_subagent_task_inner: FunctionTooLong \u2014 codewhale_engine::tools::subagent::run_subagent_task_inner runs 237 significant 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 137 over it, 2.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":17045}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d31ff2b8a5902c0919641cbec9a19e05f3f43075b449579b7c753ee0147fff8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Settings: TooManyFields \u2014 71 stored fields beside 31 methods. The bar is 30 stored fields; this is 41 over it, 2.37\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/runtime/src/settings.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e6df0bd0606f6fc577d36ecb5d6894ea4d06e29099aa7471e1a1fd199fcb1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: work_graph/runtime.rs: FileTooLong \u2014 1176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 676 over it, 2.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1571cc5ab61a5dd2a7b5a3b0291721e22f0e0899ef423f889c4f6e446f86ce2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/verifier.rs: FileTooLong \u2014 1169 significant 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 669 over it, 2.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/engine/src/tools/verifier.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"158a9c8c96132901c855c5e42c0e37ebf7e33eb6cfd0e51765e3f395b95c2289"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/metrics.rs: FileTooLong \u2014 1168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 668 over it, 2.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/cli/src/metrics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be27f4da876ab1be9da70e0994814f51322926ef14488c31843a1f1d8672fc0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: StateStore (2 blocks, 251-1682). The bar is 500 significant lines; this is 666 over it, 2.33\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/state/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1595da2cd76ecf5eebb2235fd78954787d930f72c3c3d5a43d51db26bf565eed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/themes.rs: FileTooLong \u2014 1164 significant 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 664 over it, 2.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/palette/src/themes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9098006a8e56b40770968c04489e9ae5868859d0952afee49aa4859e04d9b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/tool_catalog.rs: FileTooLong \u2014 1162 significant 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 50 free functions. The bar is 500 significant lines; this is 662 over it, 2.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"483c53e07e3488a690122ca28232ad0991cca3569a67aa25870a51c37c8a434f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::integrations::cli::run_dsh: FunctionTooLong \u2014 codewhale_tui::integrations::cli::run_dsh runs 232 significant 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 132 over it, 2.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/cli.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cc4db3ac4265464864bea868bc06ae9951baa2bd6d54ae9083a4517e5d5f68"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtensionsView.render: MethodTooLong \u2014 render runs 231 significant 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 131 over it, 2.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/tui/src/tui/views/extensions.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef47b667626c57b1529557b61e03b9e6e2cdff01d8941d233ad91ca6d6ba2a65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/activity_detail.rs: FileTooLong \u2014 1152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 652 over it, 2.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/activity_detail.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61cb03814da87cecbc60fbbf3f02cdfb8ea35893175de3b922988f71e2059e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::apply::apply_loaded_session_with_goal: FunctionTooLong \u2014 codewhale_tui::tui::ui::apply::apply_loaded_session_with_goal runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":4552}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cde0adaa62f7bbea23a2f1b474712b45cbff6717fab7af0d9930d74e43e318"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/settings_schema.rs: FileTooLong \u2014 1148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 648 over it, 2.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/settings_schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa5f4a539cb7fc8e6c6ca057bd0799c7f609d035aa6d64d5ca43de21d7ee0ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.run_extension_command_inner: MethodTooLong \u2014 run_extension_command_inner runs 229 significant 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 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16f4fc9486f9bfaa75c32eb29016fb90fda5a4245ec4b6e24b0ef64c7c525c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::config_main_host::config_editability_audit: FunctionTooLong \u2014 codewhale_tui::commands::config_main_host::config_editability_audit runs 229 significant 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 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_main_host.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c312a0464649440a6767739771064e40d2c67a1f0b7f8e2e872da9f245a5f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ambient_life::build_frame_marks: FunctionTooLong \u2014 codewhale_tui::tui::ambient_life::build_frame_marks runs 229 significant 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 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ambient_life.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"24aef55569503575088019847ce176d4b5f782f40f60c428cad3a02e192fb30d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::model_picker::effective_picker_metadata_with_codex: FunctionTooLong \u2014 codewhale_tui::tui::model_picker::effective_picker_metadata_with_codex runs 229 significant 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 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":3673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edb637e26f34e3101b4105a2733a5240315cb14ea3a7e54a21a2a982cfa3dee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: coord/ledger.rs: FileTooLong \u2014 1143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: CoordinationLedger (3 blocks, 388-1297). The bar is 500 significant lines; this is 643 over it, 2.29\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfe9159486351f70170b02c3e788d6a59907078ba1be7354863705b50a6fa28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodewhaleClient.from_admitted: MethodTooLong \u2014 from_admitted runs 228 significant 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 128 over it, 2.28\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/engine/src/client.rs"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"416cf7b59671bd9a0e849b2f904cb81d54942cc56dd56d01de3d3751c6d356e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/compaction.rs: FileTooLong \u2014 1136 significant 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 92% of them inside a single declaration: Engine (83-1424). The bar is 500 significant lines; this is 636 over it, 2.27\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/engine/src/core/engine/compaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa82de035b1e27d59cd8308d6b46fb3acd2287e579e99c366d898f27ab13cfc5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: history/latex_render.rs: FileTooLong \u2014 1135 significant 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 635 over it, 2.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac1611303a09729628a7b5ab6b1146898058e78a3677f7b380ecaeb3ab775c0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HostProcess.spawn: MethodTooLong \u2014 spawn runs 226 significant 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 126 over it, 2.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/engine/src/extension_host/supervisor.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee790613ad55b00cb336046d64e5aae95da17850357c3847d9c9e94e2a75d5f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::receipts::assemble: FunctionTooLong \u2014 codewhale_engine::receipts::assemble runs 226 significant 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 126 over it, 2.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/engine/src/receipts.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4647d974c2b6615655cd0346e4cf9d1a2c42a8b74fbdd941bed1963401fc70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::pet_watch::live::run: FunctionTooLong \u2014 codewhale_tui::tui::pet_watch::live::run runs 226 significant 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 126 over it, 2.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/tui/src/tui/pet_watch/live.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d65129408f213d176d9625c1ece99af41b65ad18f4981428a6a3f05d22e8cc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadStore.checkpoint_tail: MethodTooLong \u2014 checkpoint_tail runs 225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"d315ea37adeaa214fc663a312e24c553049d71ac6e60455a05ff292cc09d551e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/thread_control.rs: FileTooLong \u2014 1120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 620 over it, 2.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/thread_control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7751a55939ffbcb042f24c19b1d505190bba51b31c25e9b4a52e88a0151bd7e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::config_main_host::show_single_setting: FunctionTooLong \u2014 codewhale_tui::commands::config_main_host::show_single_setting runs 224 significant 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 124 over it, 2.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_main_host.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c52c9e781b3bae6890f6093df325a42d90e25559629ac91f9f04b4b73f8be7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReviewTool.execute: MethodTooLong \u2014 execute runs 223 significant 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 123 over it, 2.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/engine/src/tools/review.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"8241fec78dd66e3a6e6b61bce7a039ce9b304742293345536d7fb4f6749524fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::mouse_ui::handle_mouse_event: FunctionTooLong \u2014 codewhale_tui::tui::mouse_ui::handle_mouse_event runs 222 significant 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 122 over it, 2.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/tui/src/tui/mouse_ui.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5790cf9f1090da9e75e47af0b5e44027a17c7e4ce0e1fb0d371e65e8334a335a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::views::extensions::mcp_model: FunctionTooLong \u2014 codewhale_tui::tui::views::extensions::mcp_model runs 222 significant 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 122 over it, 2.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/tui/src/tui/views/extensions.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"56db38bd95e88f7f14e0d474878ccf658132d31c648b5c232bd47a084451d3e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config_bundles.rs: FileTooLong \u2014 1105 significant 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 50 free functions. The bar is 500 significant lines; this is 605 over it, 2.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/config_bundles.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da6adeec3ebf77ec66431cc79b46c6e587765594bee716d9bb727f829f1f51d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension_host/execution.rs: FileTooLong \u2014 1092 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 592 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"160e9f9f7b756dec470e65bea4e321fab19c6f24fb28515d42e6b2f41ab056d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.mjs: FileTooLong \u2014 1091 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 591 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e924eeb870d2db82887af148d7786a4a1ec9c8124c04bcf658e3bd32e3920779"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::compaction::create_summary: FunctionTooLong \u2014 codewhale_engine::compaction::create_summary runs 218 significant 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 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction.rs"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adf842a31ea08bf61812bd4aae1f79abf5f771c1bb3a166834e35c149f3d2d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtensionHostManager.activate_owner: MethodTooLong \u2014 activate_owner runs 218 significant 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 118 over it, 2.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":2462}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e99cf46a6eb33f6f5cbed27d9067f2f8478a29947a06daad2a58a7596507709"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/worker_runtime.rs: FileTooLong \u2014 1089 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 589 over it, 2.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/worker_runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8198988bc458796b9476864754f5495d2915ef14cd35f29f75e7cc2cd18746b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/chat.ts: FileTooLong \u2014 1085 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 585 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9bb602bbab34f8f3cf1ef08ac13b841b19cfcb16fca9a1fb7f1b3df66ca788"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SetupRuntimeFacts.from_app_config: MethodTooLong \u2014 from_app_config runs 217 significant 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 117 over it, 2.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/tui/src/tui/setup/mod.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce601334e4d0cb60ad2286e2a0ee53c931743020bf1d75c0e0a8f243ed069bf4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CoreCalls: ClassTooLong \u2014 865 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 2 blocks, lines 545-1637. The bar is 400 significant lines; this is 465 over it, 2.16\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/engine/src/extension_host/core_call.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"e955a5abad095a26be1ac8620132a6dda62e93aef33016778fd677a5760b199b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModelPickerView.render_route: MethodTooLong \u2014 render_route runs 216 significant 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 116 over it, 2.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/tui/src/tui/model_picker.rs"},"region":{"startLine":4546}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce40ed04ad85bda37984edac847a18e941756cd2025aed6eee4bf5a6e9f8650"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/goal.rs: FileTooLong \u2014 1076 significant 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 576 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/engine/src/tools/goal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4845c31d8341581a402c791e37ce33f01e9b0f70f5a372793b896c2389259490"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModelInventory.from_config_scoped: MethodTooLong \u2014 from_config_scoped runs 215 significant 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 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_inventory.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"f751e76603d209964c34e98e4857d6196b5799745e6e5df58d2cf18536099d1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::engine::drive_child_actor: FunctionTooLong \u2014 codewhale_engine::tools::subagent::engine::drive_child_actor runs 215 significant 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 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"de35d1eb10ef002d6bc29ae72bbb4e52e8da3014eeaabe266a08ac59aeed4da6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodewhaleClient.handle_chat_completion_stream: MethodTooLong \u2014 handle_chat_completion_stream runs 214 significant 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 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7aa7abf046a9f1725d324089a20239f120942b645375a7f03a5b81f59dda18"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.prepare_fork_from_cutoff: MethodTooLong \u2014 prepare_fork_from_cutoff runs 214 significant 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 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11216}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f53a90b3ecf396ae6943006c1b91118de84b9a9168d727d6d4b692c62e041c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::tool_routing::handle_tool_call_started: FunctionTooLong \u2014 codewhale_tui::tui::tool_routing::handle_tool_call_started runs 214 significant 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 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/tool_routing.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9624a37a2ad25d9390b44a0ea03ba93ceaea37103db7accd771d936d909bdb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime_handoff.rs: FileTooLong \u2014 1066 significant 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 64 free functions. The bar is 500 significant lines; this is 566 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_handoff.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0687860f233f4d2127eac25d8a659b1ff9ac3ff22277b07069cbeb5f868fb14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension_host/protocol.rs: FileTooLong \u2014 1065 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 565 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/protocol.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d08e9284fa9a68f6b0482b124fe4067c6114fc2e4a818d03a79a4c3d9dcb75d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.handle_manual_compaction: MethodTooLong \u2014 handle_manual_compaction runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/compaction.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1130b16967516b1672eb0476525e07c6d41a3d926a05dd71bb5e847b2295834"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::parse_spawn_request: FunctionTooLong \u2014 codewhale_engine::tools::subagent::parse_spawn_request runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":18678}}}],"partialFingerprints":{"codehealthFindingId/v1":"20365ec8a7d7a1aa2364a630c6b112d9adaf93a28aa00de86f14522f7a41758e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::contract::debug_operations::plan_undo_range: FunctionTooLong \u2014 codewhale_tui::commands::contract::debug_operations::plan_undo_range runs 213 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 113 over it, 2.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/debug_operations.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bf84f8c35b5f219112a265dc6f2f108beba9c1a05916ed4d7afe28974c13be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/terminal_session.rs: FileTooLong \u2014 1063 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 563 over it, 2.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/terminal_session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33f5fba0c8d55d01e6a4d3d93eba8188ac9527629e216003bfa57623bbf2593"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/protocol_parity.rs: FileTooLong \u2014 1062 significant 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 562 over it, 2.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/engine/src/core/protocol_parity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"878eaae199c9239593803c2bbb5def1882d3cb39184f4d3e05f8bc7f33c58f02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SdkTransport.exchange: MethodTooLong \u2014 exchange runs 212 significant 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 112 over it, 2.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/engine/src/extension_host/mcp.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe3afc468418f0532198d408ee118a869ca94fc106c9b6718521d93ed46af42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/exact.rs: FileTooLong \u2014 1056 significant 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 556 over it, 2.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/exact.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"454b0a53fbf4cfb6c1c4160a869b3bbb756847adc4fbb28320502f770a58f4d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::review_core::run_review_core: FunctionTooLong \u2014 codewhale_engine::tools::review_core::run_review_core runs 211 significant 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 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ec3842a13ee987704814a628045f6a3ebc388ca71b5aad985ea15453f486ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Settings.command_report: MethodTooLong \u2014 command_report runs 211 significant 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 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f424211adc72026668398231d0068a879eff8858f59165180e470755fd2646"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: docs-search.DocsSearch: FunctionTooLong \u2014 DocsSearch runs 211 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b467fca208971ddc0fbad98a3d64124c40ec3b0e828f2eab986d4a6d9f69ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: metrics/stats.rs: FileTooLong \u2014 1040 significant 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 540 over it, 2.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/cli/src/metrics/stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6f8312858977666afff8f10b9d2a9b82e1b190779ad538eb47834f3c797298"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::work_surface::input::handle_mouse: FunctionTooLong \u2014 codewhale_tui::tui::work_surface::input::handle_mouse runs 208 significant 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 108 over it, 2.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/tui/src/tui/work_surface/input.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e6c89908c1c2f143460e603548a9784c092692100413ca8aabc758c6baf944"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_api/sessions.rs: FileTooLong \u2014 1037 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 537 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/sessions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3d57b62db2b47014d5f2a9530938cd1a4e5e895b91b0557be9e97660cd47fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/review_core.rs: FileTooLong \u2014 1033 significant 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 533 over it, 2.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ec3859c33d8bb679a92c2b26cf4998f288819e8e1cf3bc1329a69c449927cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeChatRelayHost.apply_prompt: MethodTooLong \u2014 apply_prompt runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a3cdacbe803b6e51ba8619596f59f2d329c7af548a129feaa7a84db0cbb7bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::run_auth_command_with_secrets_and_runtime: FunctionTooLong \u2014 codewhale_cli::run_auth_command_with_secrets_and_runtime runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":4993}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfd2004cb49b87bd6144c249d2c56454ff1e33b36a8ace20be25898e8bb2f31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::context_report::base_source_entries: FunctionTooLong \u2014 codewhale_tui::context_report::base_source_entries runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/context_report.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57da8a9e2077ee44104ef36d54d3ec8d10829e89ba5c4853cdc535c20752ba5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/facets.rs: FileTooLong \u2014 1029 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 529 over it, 2.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/command-contract/src/facets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5701c689fe9547bac16964600a5edec0d3502cd6fa05f407a683c76ca4da6675"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FleetDetailView: ClassTooLong \u2014 823 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 34 methods, 4 blocks, lines 95-1272. The bar is 400 significant lines; this is 423 over it, 2.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4160eeeedf1f6a0e59b097afc0fa1acf616fde4401290ab4a8707ce4a86a8d44"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WebSearchTool: ClassTooLong \u2014 816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 565-1697. The bar is 400 significant lines; this is 416 over it, 2.04\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/engine/src/tools/web_search.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c97aed49ba5c269ba4adfd08f7846f4313547216b90da818e90c75537d0fb40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: subagent/coord.rs: FileTooLong \u2014 1020 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 520 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d0fc265430625896cfd896441b5419e77de8dbd5c3eca4a822ed8c4bbe08b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/tasks.rs: FileTooLong \u2014 1020 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 520 over it, 2.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/tasks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"566206b9d35028cb1c2224ab9bb9eaa68afc08e955fd9224cbf18c909c379c47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoreCalls.serve_subagent: MethodTooLong \u2014 serve_subagent runs 204 significant 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 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"34766c2e4ca980881ba7c2f1d04e9c8dae869471d17164374eca706f71be8962"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::provider_routes::switch_provider_inner: FunctionTooLong \u2014 codewhale_tui::tui::ui::provider_routes::switch_provider_inner runs 204 significant 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 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/provider_routes.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"02320b8164456eabdb8b2dba358bb33a01300fe5b22eb8850df353fd5ad30400"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SubAgentWorkflowDriver: ClassTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 4 blocks, lines 3978-5224. The bar is 400 significant lines; this is 414 over it, 2.04\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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":3978}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f882cfc04cb42d7f990d2c25cad3ff5002a2fe95e1c211c0911b572ec0e47c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/acp.rs: FileTooLong \u2014 1016 significant 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 516 over it, 2.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/engine/src/fleet/acp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"586fd8384b99b446f39445a14eb0b55297e66b3b938d7d1732dcc76fb8348f19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::plugin_index::get_plugin_index: FunctionTooLong \u2014 codewhale_app_server::runtime_api::plugin_index::get_plugin_index runs 203 significant 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 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plugin_index.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca55d9e72a2cfb22aa88163a18b1034ab56948fe8953ccca78cf42a4d0010d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension_host/mcp.rs: FileTooLong \u2014 1014 significant 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 514 over it, 2.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/engine/src/extension_host/mcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2ec550069f0fe73adfa53f584b6695f55b50527ccf9510879b8ffbabbd5973"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/agent_plugin.rs: FileTooLong \u2014 1012 significant 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 512 over it, 2.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/agent_plugin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8418e05f1263d8647f31025052e194bdc97e5819b8357948aa632b8d3d4043"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubAgentManager.resume_from_checkpoint_with_policy: MethodTooLong \u2014 resume_from_checkpoint_with_policy runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":8807}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aac6a9c195e400ba311409fa25e0262d4739d7983729fe5ee5cfd692ae4e9f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/working_set.rs: FileTooLong \u2014 1003 significant 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 503 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/working_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fce9ec3925cb1ce1064e7ba8567c7ebec3da67463305ff43d084f9af76c1a7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FleetManager: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\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/engine/src/fleet/manager.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"187235cbd561024ee8822e0a2e47f1ae66e89f2c8b45e8d3a23a579687f2a61e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TaskManager: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\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/engine/src/task_manager.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61f9dd1444190ce825dce7501d63374f78a7003d072b49b54348d829e80ba0a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SnapshotRepo: TooManyMethods \u2014 60 methods, declared across 2 files: src/repo.rs (56), src/delta.rs (4). The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"61432f5598da8dc09bcb007358087c1a6b8863493f6880c344ab27ebb11383fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_account_cli::run_with: FunctionTooLong \u2014 codewhale_account_cli::run_with runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b425aa47106acad1ce0fd262742ad4c8cf0a2b4fa7f27e2524170761bcc12b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PagerView.handle_key: MethodTooLong \u2014 handle_key runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e352a696fb0e24b865bcf890d030d1ca5d92647da4e543b0113b883ca407e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_api/computer_display.rs: FileTooLong \u2014 998 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 498 over it, 2.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/computer_display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"008260ddf9785992add380f5715f4f5c6a810d320aafccc2dda65fdb428a66c8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PluginRegistry: ClassTooLong \u2014 798 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 53 methods, 2 blocks, lines 248-1379. The bar is 400 significant lines; this is 398 over it, 2.00\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/plugins/src/registry.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d4ce82b1769e75d6fbe5963f0599476883d67e17c03981b4eb2743cc288928"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::client::chat::parse_sse_chunk_with_reasoning_style: FunctionTooLong \u2014 codewhale_engine::client::chat::parse_sse_chunk_with_reasoning_style runs 199 significant 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 99 over it, 1.99\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/engine/src/client/chat.rs"},"region":{"startLine":4185}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e048bbfc306997f5cf7fbad619e53a99d1d2e48d8c1990b6bfac938518f13e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeWorkerEventSink.publish: MethodTooLong \u2014 publish runs 199 significant 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 99 over it, 1.99\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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":3140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bff8e174c9b1f6b6578fe1d380b805e68d5f023c1ac3a3bcbbaa6511b82799"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::web_search::run_scrape_search_with_endpoints: FunctionTooLong \u2014 codewhale_engine::tools::web_search::run_scrape_search_with_endpoints runs 199 significant 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 99 over it, 1.99\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/engine/src/tools/web_search.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1862db017dd832ac4754b1b33e70a76e2451d63d313761aa773e8107b8f039f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RouteResolver.resolve_scoped: MethodTooLong \u2014 resolve_scoped runs 198 significant 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 98 over it, 1.98\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/config/src/route/resolver.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"2902ed337e9378f8d59dd8b45ac3bf730b84e071056927af28bf340aede73bd5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Settings.set: MethodTooLong \u2014 set runs 198 significant 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 98 over it, 1.98\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/runtime/src/settings.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b9b17fd6e1ab853145b80bb6af613ae7ee259cba9fd928c755258cea8787ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TranscriptViewCache.ensure_iter: MethodTooLong \u2014 ensure_iter runs 198 significant 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 98 over it, 1.98\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/tui/src/tui/transcript.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c12e4943f8de90cacd9a43092f89e5bac07d22420d6e009bcd2e8a45610d169"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/diff_render.rs: FileTooLong \u2014 988 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 33 free functions. The bar is 500 significant lines; this is 488 over it, 1.98\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/tui-kit/src/diff_render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c82412de06a04469041bdf6d1a3e6b93e585211035f75c32504c4a9a82a668"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StateStore: ClassTooLong \u2014 789 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 2 blocks, lines 251-1682. The bar is 400 significant lines; this is 389 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/state/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ee56d9784c73d8b0c0f0ae61960818d4168abaf8f941ce27ffdf2dfa5be2bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/codemode.rs: FileTooLong \u2014 986 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 486 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/codemode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaca0c2c70e17aead6a8735fc02827e26089cef0d51418a183c436a49406c08"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionPickerView: ClassTooLong \u2014 788 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 3 blocks, lines 119-1406. The bar is 400 significant lines; this is 388 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5517dc8b6c2eaafe86b02bfe8480f64d1e13b210b1b61e62e6ee0ca588286a88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/init.rs: FileTooLong \u2014 985 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: App (9-1264). The bar is 500 significant lines; this is 485 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/tui/src/tui/app/init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af2e1ca26904205382a80a1bcbd3d7af36c392ce9911993b902cfb233b5d955"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/operate.rs: FileTooLong \u2014 984 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 484 over it, 1.97\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/operate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc89c3b46393c97576090d66b13487f06b9b6af779ed2f5eabc269e8c709e625"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ToolRegistryBuilder: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"265d0f534389bc1c75062c4c9b465010b24ec7e2a4bc02f84608adb184ab33bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/file_mention.rs: FileTooLong \u2014 980 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 480 over it, 1.96\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/tui/src/tui/file_mention.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99749c4c79f6e71b2eb547aa91e307cc850aa9a0ef94fd56b4bed4187be58533"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::contract::scan_managed_plugins_portable: FunctionTooLong \u2014 codewhale_tui::commands::contract::scan_managed_plugins_portable runs 196 significant 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 96 over it, 1.96\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/tui/src/commands/contract.rs"},"region":{"startLine":4058}}}],"partialFingerprints":{"codehealthFindingId/v1":"3004334dc3066eb72a4ef72bda4adee29b7436c22a6db7be619328315e0a5043"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/install.rs: FileTooLong \u2014 977 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 41 free functions. The bar is 500 significant lines; this is 477 over it, 1.95\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/skill-install/src/install.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2cc10194e430925e1d80aceb8a47d550bf3aebb4ebf318d2e5d8ec6078db4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::run_config_command: FunctionTooLong \u2014 codewhale_cli::run_config_command runs 195 significant 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 95 over it, 1.95\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/cli/src/lib.rs"},"region":{"startLine":5509}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aba3c43f2bffbdddf32358676560e02c7152a6d77fbc76043c3ae3ebcb70774"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.run_turn: MethodTooLong \u2014 run_turn runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1536}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10c4bbda95b50b640106d783a9b08079e30b6b39676ed4a5fa3019c0464a4bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_doctor_json: FunctionTooLong \u2014 codewhale_tui::run_doctor_json runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":8607}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e398da155999d0ee8c851a8e3aa129c76ba9927c67418a43f40b706f21f6ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.HomePage: FunctionTooLong \u2014 HomePage runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/page.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"66881b49a3c5a954fbb0217f22de7006c6f259e75bdeedd89b1432a49107504c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: automations/editor.rs: FileTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: AutomationEditor (2 blocks, 319-1241). The bar is 500 significant lines; this is 460 over it, 1.92\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/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"352f8a72f3a6c04a8c1d49bd74c8c7590ec678ea78a721cb9addf1040add43ac"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FleetSetupView: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\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/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3180aa2091398cf6aa32e298e3126e29b388051d4137d816cce49686ce76ca6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension_host/dsh_network.rs: FileTooLong \u2014 950 significant 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 450 over it, 1.90\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/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8878de3b0bf3e47d83d302bd117904566b765415f6a23c60e0cf3a380dbbb9f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.rs: FileTooLong \u2014 949 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: Store (4 blocks, 166-1199). The bar is 500 significant lines; this is 449 over it, 1.90\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/memory/src/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a07b2036b68e5af2a013a69f8608a470252066162426a751bd688616a70b597"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/config.rs: FileTooLong \u2014 947 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 447 over it, 1.89\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47fe6e8bd848ddba0ca7f45eaa754a3415e888573fc6dc28fb0d8ce9174e23a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_api/jobs.rs: FileTooLong \u2014 942 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 442 over it, 1.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/app-server/src/runtime_api/jobs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"662146afc6a3ab253831e876d3472c04b323c526ee28111c338b1b5d6c00c965"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::marketplace::parsers::codewhale::parse_codewhale_entry: FunctionTooLong \u2014 codewhale_plugins::marketplace::parsers::codewhale::parse_codewhale_entry runs 187 significant 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 87 over it, 1.87\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/plugins/src/marketplace/parsers/codewhale.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c725863e45aca7c8405c2beffeb6f07f33c05ff24b38c0bdf12b0a34986df9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ShellManager: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\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/engine/src/tools/shell.rs"},"region":{"startLine":1998}}}],"partialFingerprints":{"codehealthFindingId/v1":"79986ca9974be5c50188d778507bd7bf306d42303d84a43b1e01d40b21a6bec8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/ui.rs: FileTooLong \u2014 933 significant 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 32 free functions. The bar is 500 significant lines; this is 433 over it, 1.87\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/tui/src/tui/ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"008803311e91c8d94a65e1135a5571e49678ed8867d4d5706183154bba667884"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/profile.rs: FileTooLong \u2014 929 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 429 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/profile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96eab8ed3a5ce12f9389d4dce2f5c03e0c3875e2e136679e3ea264fd7608b795"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PagerView: ClassTooLong \u2014 743 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 3 blocks, lines 646-1736. The bar is 400 significant lines; this is 343 over it, 1.86\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/tui/src/tui/pager.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be034d845c15fc2f6518f152a017a3500b78b43ac9f23f7fb32fe191f314691"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/constitution.rs: FileTooLong \u2014 925 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 425 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/constitution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0057908a58e0b4a809785f50874686cfc596dc354be83f2fa3ceeba9bcdca3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoreCalls.begin_scoped: MethodTooLong \u2014 begin_scoped runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a7b6105f26f96ff22ba2ea0836b2335cd7d344b3083ef5bb128032540b52ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.route_engine_events: MethodTooLong \u2014 route_engine_events runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":15694}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e15c2b5104f289c7e0f8726aed33f8bbe69471f1b9d170052e33495202cbef7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::install::dsh::native_composition_files: FunctionTooLong \u2014 codewhale_plugins::install::dsh::native_composition_files runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d2cf085142c69507b353149e81ad77fff3cf96bb10a342a1391cd3ad48f059"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 924 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 424 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dependencies/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"027d2ea840918f376f74c338ba46491eace67067d67516c02f555fbd9f95242d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hotbar/actions.rs: FileTooLong \u2014 923 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 423 over it, 1.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/actions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24bae3eca7f49c8a516b227a80a264f5fd2baf75f6b672dbb6877886250df3c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OwnerRegistry: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\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/engine/src/extension_host/registry.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fea6e386f101263f87f86c2069d47f3e3654cd0f894b7248e8690aa3032ed4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.mjs: FileTooLong \u2014 915 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 415 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad990df401f3cd2dae2c6ea3c0b29cf2ef919839be4b0858f16fdbc3e39381b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubAgentManager.cleanup_inner: MethodTooLong \u2014 cleanup_inner runs 183 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":11113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72439c2a8a91d98ab872f64e823a69d512456554effbb2b9a82cf6ad8ee8994"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: mobile-menu.MobileMenu: FunctionTooLong \u2014 MobileMenu runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/mobile-menu.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1434c9c25bd7e9982a5d4d0272f53ec203251221b09e6f03cbb2e17c7e5e7890"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/schema_sanitize.rs: FileTooLong \u2014 910 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 410 over it, 1.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/models/src/schema_sanitize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe4967b5831b0a8e16d5da8692e02e960c743bb1f73a2e9c6afa9d091066be1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: views/fleet_detail.rs: FileTooLong \u2014 910 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: FleetDetailView (4 blocks, 95-1272). The bar is 500 significant lines; this is 410 over it, 1.82\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/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2e8be234c1e3f9a8e13b3da8af3aecda3b378f5c28e475b765d75b039b1143"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.process_tool_results: MethodTooLong \u2014 process_tool_results runs 182 significant 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 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":4521}}}],"partialFingerprints":{"codehealthFindingId/v1":"030f2de87bc039142abb28b995e1186e5aedb4c2070a5ad39827d472591937ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::config::merge_config: FunctionTooLong \u2014 codewhale_runtime::config::merge_config runs 182 significant 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 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":10093}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7be80203f365e7e41d1f7b482e91593feeed764edb49ffa6ae4820f547e472"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.InstallPage: FunctionTooLong \u2014 InstallPage runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/install/page.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4e4a0aa183bd77b6f089d7656dbe7a53764be7f72ede3e8a97fa8347818061"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PromptRun.project_event: MethodTooLong \u2014 project_event runs 181 significant 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 81 over it, 1.81\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/app-server/src/acp_server/runtime.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"18548a493bfc8893b31082400a25de0e5548588414edfb66187c1cb3eabc4233"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.run_tool_batch_phase: MethodTooLong \u2014 run_tool_batch_phase runs 181 significant 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 81 over it, 1.81\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/engine/src/core/engine/turn_loop/tool_batch.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"caedf222f877b364da5d6311bf4c693caa5481d229f6df3eab71729fe76d0035"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/catalog.rs: FileTooLong \u2014 902 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 402 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/config/src/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f30db55195d979ca7ee0b9fb334c076aec628f0704e47020e0ef6d1831c1355"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/methods.rs: FileTooLong \u2014 901 significant 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 401 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/app-server-protocol/src/methods.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4c8501f62812bfc92020c9fe3146687d977c2ed4998e1cac6b38a2ffaac958"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/responses.rs: FileTooLong \u2014 900 significant 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 400 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/engine/src/client/responses.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"755d7edc6a2c273460588dc56d3f2918282f5f0cce98d95e96791f4a79aa4298"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::workflow::start_workflow: FunctionTooLong \u2014 codewhale_engine::tools::workflow::start_workflow runs 180 significant 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 80 over it, 1.80\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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc705099335541b014a3de87b610b68f5daeef293e1f4000895a576433e82d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_memory::run: FunctionTooLong \u2014 codewhale_memory::run runs 180 significant 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 80 over it, 1.80\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/memory/src/main.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3729bc04192cec7dc06d3943b6df5ed607e6e4e34c031d143f75d4b918092790"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigView.render: MethodTooLong \u2014 render runs 180 significant 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 80 over it, 1.80\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/tui/src/tui/views/mod.rs"},"region":{"startLine":4467}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aef80d1cd00b50d34e01df44bfb1a166dd52c2c7562cc10c74c96d2109e01b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkflowPanel.apply_event: MethodTooLong \u2014 apply_event runs 180 significant 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 80 over it, 1.80\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/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"386bad1de4f54c7694d2f4a15e01d046bb70abe29d3e276775d06019d98f514a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/provider_routes.rs: FileTooLong \u2014 899 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 399 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/tui/src/tui/ui/provider_routes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a26ef6f637fcb85f379249201d1f73616be84e25ee4e463e0138a3aa86f2f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/prompts.rs: FileTooLong \u2014 895 significant 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 57 free functions. The bar is 500 significant lines; this is 395 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3a172848852f8334c2a61e7d0f19e3a0e733cbfd00b9bbaeecec42d3677d52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DebugDiagnosticsAdapter.cache_telemetry: MethodTooLong \u2014 cache_telemetry runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/debug_diagnostics.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf23bf9951b82140332bec43dd1c757d33bd8ad9e3dc6f677a8d8572894e516d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AutomationEditor: ClassTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 23 methods, 2 blocks, lines 319-1241. The bar is 400 significant lines; this is 312 over it, 1.78\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/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca68638fef4674c78d022e4e1bae032694e8817de8d79bc7e734d693bd575d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::workflow::run_workflow_vm: FunctionTooLong \u2014 codewhale_engine::tools::workflow::run_workflow_vm runs 178 significant 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 78 over it, 1.78\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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"3422d6453569352bdb59490747cdb4821ec8bab296374135099d0816c46615ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::core::protocol_parity::op_to_protocol: FunctionTooLong \u2014 codewhale_engine::core::protocol_parity::op_to_protocol runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/protocol_parity.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9642f65f34b75f806bd3fab3ed48e2eaff57f3c277e936b963d7d420ccf345"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubAgentWorkflowDriver.spawn_task_admitted: MethodTooLong \u2014 spawn_task_admitted runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":4779}}}],"partialFingerprints":{"codehealthFindingId/v1":"3637e235c082a329777ca7579597b226a0aa2fd7efbdef8a8f5a16c346721a2b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ExtensionHostManager: TooManyMethods \u2014 53 methods, declared across 3 files: extension_host/mod.rs (36), extension_host/execution.rs (11), extension_host/dsh_remote.rs (6). The bar is 30 methods; this is 23 over it, 1.77\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/engine/src/extension_host/mod.rs"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37f8c20a91eebdfdaf1453866aee46203938dca0ed56d9e21fb10aec8de24ef"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PluginRegistry: TooManyMethods \u2014 53 methods, declared across 2 files: src/registry.rs (52), registry/gc.rs (1). The bar is 30 methods; this is 23 over it, 1.77\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/plugins/src/registry.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf55da099f9b3a00766396bf9a09b9e3bf824ef8c1ae902fd3b7494dc27ec30d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ProvidersToml: TooManyFields \u2014 53 stored fields beside 3 methods. The bar is 30 stored fields; this is 23 over it, 1.77\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/config/src/provider_toml.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"672938ac65bf9a8db0fb811fc0ba685223aa09f499918189f045769598c895e5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ProvidersConfig: TooManyFields \u2014 53 stored fields beside 2 methods. The bar is 30 stored fields; this is 23 over it, 1.77\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/runtime/src/config.rs"},"region":{"startLine":2849}}}],"partialFingerprints":{"codehealthFindingId/v1":"9272548ffa2ef554ff675c0c0be96d5d2770b99c135dca9d8a241dab4cd13ac1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SetupRuntimeFacts: TooManyFields \u2014 53 stored fields beside 1 method. The bar is 30 stored fields; this is 23 over it, 1.77\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/tui/src/tui/setup/mod.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1bd1c66ddecd48786170d34db152962ea2d82348e2a9ae1309f4a41c938119"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentTool.execute: MethodTooLong \u2014 execute runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":14815}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8dd59113a728f745277eb0fd9a4d64d6e201b280d8bcd2aa664605c9be6164"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::work_graph::validate::check_structural: FunctionTooLong \u2014 codewhale_engine::work_graph::validate::check_structural runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/validate.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04503861aada24883527b36f92d20175330f4d942421adb8e38908178708786"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/route_runtime.rs: FileTooLong \u2014 878 significant 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 378 over it, 1.76\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02507c7b20158e60add062d42536213e79ce4fce8f074101919e14529b439cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/transcript.rs: FileTooLong \u2014 877 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 63% of them inside a single declaration: TranscriptViewCache (118-949). The bar is 500 significant lines; this is 377 over it, 1.75\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/tui/src/tui/transcript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f73ae0c096cf75545f2865fafb93ccf31bebc54e3a8124a8b75a5c24424e4c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::daemon_socket::platform::bind_with_owner: FunctionTooLong \u2014 codewhale_app_server::daemon_socket::platform::bind_with_owner runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/daemon_socket.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac02bfda37a1403f6700c5bacbf8af77d238cac2cc16c7cee2df8a2bbf2997a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodewhaleClient.build_anthropic_wire_body: MethodTooLong \u2014 build_anthropic_wire_body runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcd3d7e022ebc7a71e01c32893571bcbf1021fbb6b7816af594025a59f0415d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::verifier::run_gate: FunctionTooLong \u2014 codewhale_engine::tools::verifier::run_gate runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/verifier.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7e86722562334a26efd5f0a43907110ff6ff6ba5ee76a1b091bd5a4bfaab00"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::work_surface::model::ordered_rows: FunctionTooLong \u2014 codewhale_tui::tui::work_surface::model::ordered_rows runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/model.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc76c3890e3bd8b63b5579299aa3cf64b8c596b8d038f453b58546382bd63709"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CoordinationLedger: ClassTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 3 blocks, lines 388-1297. The bar is 400 significant lines; this is 297 over it, 1.74\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/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"a935cbd822ef2b3f472ceb02ca87368b84531137b368bda218271526eca1a542"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AccountClient.connect_models_with_cancel: MethodTooLong \u2014 connect_models_with_cancel runs 174 significant 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 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/session.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"a563c70928013632f8d8ba8961b29b34b4f8f6c173f0b39559e23784e37b6378"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.settle_claimed_turn_failure: MethodTooLong \u2014 settle_claimed_turn_failure runs 174 significant 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 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12693}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6e338b9d8e277ba4c36cf3470fdd2238cb502085a85d217ddef2a4a7469da3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ApprovalWidget.build_inline_parts: MethodTooLong \u2014 build_inline_parts runs 174 significant 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 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb21dd98d757a48e720b57dd1d812da82e6cc866a08fe11f24f24e2adaf24e3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SessionState: TooManyFields \u2014 52 stored fields beside 10 methods. The bar is 30 stored fields; this is 22 over it, 1.73\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/tui/src/tui/app.rs"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b2cd9e2ce5db23ee0359888cfd00728a0c856339c141d445e8f4be0ce0cd4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/stdio.rs: FileTooLong \u2014 866 significant 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 366 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/stdio.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da782c9c06ded065342ccc6f166ab76bb07bcf2a2fc17bf276c361b0f01b2075"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/installs.rs: FileTooLong \u2014 866 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 37 free functions. The bar is 500 significant lines; this is 366 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/installs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d336d1ca03b753af2a83972894132b35c66732841f23eff62386f97d614cda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_config::cloud_facts::verify::verify_envelope: FunctionTooLong \u2014 codewhale_config::cloud_facts::verify::verify_envelope runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/cloud_facts/verify.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7720dcbebeda00ed37e64874738c84821a2bc9b8ff29709bda1958e76987d5c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::client::responses::convert_messages_to_responses_input: FunctionTooLong \u2014 codewhale_engine::client::responses::convert_messages_to_responses_input runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/responses.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd8770aedf81d24313508444ffb355f9fd9e55ec9cd6f9cbf0886e083e7bce8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.persist_runtime_checkpoint: MethodTooLong \u2014 persist_runtime_checkpoint runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16615}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e92de9ebff25807337a5b54da96cb0fb343286dc7d3179f129f013fde6e27e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StatusMessages.load: MethodTooLong \u2014 load runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/policy_messages.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"774cc5b9e48bc01c7ea2fe2451ac76126842bf29b6e7bfa0c188d964e73c424c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_workflow_tool_command_inner: FunctionTooLong \u2014 codewhale_tui::run_workflow_tool_command_inner runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":14968}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c238a4c44663a508f59fe27fb4c1281a0280d837fa13847a241b3ea123de23"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RuntimeChatRelayHost: ClassTooLong \u2014 687 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 2 blocks, lines 134-1344. The bar is 400 significant lines; this is 287 over it, 1.72\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/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"90cccd13ec7b0f35efe8839fe918974d8c0bd8c83a854085a31b7d7581367f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/approval_band_legacy.rs: FileTooLong \u2014 858 significant 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 32 free functions. The bar is 500 significant lines; this is 358 over it, 1.72\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/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"977e72359c6c6b54b03d45ce21642d381e23fb97ebd6445c5937b876339bf1fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::update::uninstall::remove: FunctionTooLong \u2014 codewhale_cli::update::uninstall::remove runs 171 significant 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 71 over it, 1.71\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/cli/src/update/uninstall.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9033960ae02338450386a58de04a075f8eec97e5603bb832804dc57138dfb9c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::install::dsh::load_bundle: FunctionTooLong \u2014 codewhale_plugins::install::dsh::load_bundle runs 171 significant 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 71 over it, 1.71\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/plugins/src/install/dsh.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b609ff8713b6b2199bfcd603dd9cf11604d52ac9884c2c3019f4cb809a4094c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConfigView: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3298eb1f60bb3c2e49a423cba04cebe00b98c26215b61dc7d8ab187e51535fa2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubAgentManager.with_store_transaction: MethodTooLong \u2014 with_store_transaction runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":5999}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9b3c879f5f33fd14e2a4ee068d324e6cfc203fba3be2364a20fa70cd7c8a69"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_skills::render_skills_block_with_configured_root: FunctionTooLong \u2014 codewhale_skills::render_skills_block_with_configured_root runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/lib.rs"},"region":{"startLine":1949}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ade690425b4ba8170ae3f9dd47f2dcb0c5794a2e5eef3b4f8c43088af850d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turn_loop/model_step.rs: FileTooLong \u2014 842 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: Engine (6-1212). The bar is 500 significant lines; this is 342 over it, 1.68\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/engine/src/core/engine/turn_loop/model_step.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5a035b92ad78365e17a8101613f25fcd530502b37734c7d4e3ccbe8cee7f89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::metrics::print_human: FunctionTooLong \u2014 codewhale_cli::metrics::print_human runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4380fd96cfede42edc0624948b22e94a2381065bff8fd5cee89493e2871e9bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::client::catalog_delta_from_models_body: FunctionTooLong \u2014 codewhale_engine::client::catalog_delta_from_models_body runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":6195}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f79033f394764d5f06c8c5342d564b594a5cb40bbc871d9ade8bb16251b75c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetManager.start_leased_workers: MethodTooLong \u2014 start_leased_workers runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"944dbe97bccddd8cdc4da85d0a0f3ee5360948a270a385c1ff065c0e71ec98cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::task_manager::ingest_runtime_event: FunctionTooLong \u2014 codewhale_engine::task_manager::ingest_runtime_event runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc91d7eb9e4a9bf0acd58fc74895c359d3744c4c6044171745cb553efebf33b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExecPolicyEngine.check: MethodTooLong \u2014 check runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/lib.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ca0a9f5232720e0234c7a6058455dadfe27b48738ff06775831dcd03f37ad9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::work_surface::terminal::render: FunctionTooLong \u2014 codewhale_tui::tui::work_surface::terminal::render runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d0361e607ccb47447345d22736b77be5dc716b908ecdaba5ef6b7019e65f83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/daemon_socket.rs: FileTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 339 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/daemon_socket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa4c94c175de6be84cda8963bbe99bd2a64d067088ec223c16a31f1178adcc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime.rs: FileTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 339 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/repl/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44bbd66b7cdf1ebaf969739e0a262f0d8811075ad652f8bb9eeaf740d9db9e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PagerView.render: MethodTooLong \u2014 render runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c823b4194af7294cd05cbd6a848ee36e6c8c3538abad0b557e1bdef26a53c40"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::install::summary::build_summary: FunctionTooLong \u2014 codewhale_plugins::install::summary::build_summary runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/summary.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b9e8e02a1a7a9dcfa951d3ba85cc8777fdaba2e9f3ffd8ffd08160c790b003"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_skill_install::frontmatter::parse_frontmatter: FunctionTooLong \u2014 codewhale_skill_install::frontmatter::parse_frontmatter runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/frontmatter.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"13155c70e54fafcb7583ea3185b992bcd3dd1c6e618d0f71a78aae54e4749e43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui_kit::diff_render::render_diff_into: FunctionTooLong \u2014 codewhale_tui_kit::diff_render::render_diff_into runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9c4ed969548393df563a386437bdb561067dd502a421b3dbef5f7912d71bef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_plugins_cli: FunctionTooLong \u2014 codewhale_tui::run_plugins_cli runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":9552}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe4d6ca96d9bb19f99a5ef961cd448ddcd18a25d5be084fc7b90039bb0fe33b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkflowPanel.from_run_json: MethodTooLong \u2014 from_run_json runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e08a08fc9514de2aadd1556cbd7d08835b03877aca36e42a74f8b383020bd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: views/help.rs: FileTooLong \u2014 829 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 329 over it, 1.66\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad04c656081f6a7b48656c654d1010005b1f3d0fceb0cfc8a1a36b63f7f7b993"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config_resolve.rs: FileTooLong \u2014 828 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: ConfigToml (53-1197). The bar is 500 significant lines; this is 328 over it, 1.66\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/config/src/config_resolve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bfc86111a8258aaba896c9ac753a2baac7281f42f031613f28bc52c78472cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fleet_reasoning.rs: FileTooLong \u2014 826 significant 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 326 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/fleet_reasoning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ff2f213e33ac547eead5e08f9983f3b80b7ceb4e793ae17be1c10d858c4a29"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentsCoordinateTool.mutate_coordination: MethodTooLong \u2014 mutate_coordination 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/engine/src/tools/subagent/coord.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"b128db05ac4dfa166a34d006705b0d336a577d69127d794404fdc8165862ac07"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Store: ClassTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 33 methods, 4 blocks, lines 166-1199. The bar is 400 significant lines; this is 259 over it, 1.65\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/memory/src/store.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91289a2091966acd8a9f14b8c9450bb400f92b7cebbbc2bc8e34a96b7d0874a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/user_constitution.rs: FileTooLong \u2014 823 significant 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 323 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/user_constitution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"515d3354e4f21172b5b24c9429a8156c374007fe5968823bbdc45c1aec8d10bb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.execute_tools_with_nested_gate: MethodTooLong \u2014 execute_tools_with_nested_gate runs 164 significant 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 64 over it, 1.64\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/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"206caa2e6761dddaba1c6bb1258cf2412c804c426aa2c8d24f93949232ac15de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetSetupView.render_review: MethodTooLong \u2014 render_review runs 164 significant 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 64 over it, 1.64\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/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":2548}}}],"partialFingerprints":{"codehealthFindingId/v1":"3addd03fd6de04a8707b9bd1c5d5090631dfe73f6d6aa5ad37be97235e421758"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EngineHandle: TooManyMethods \u2014 49 methods, declared across 2 files: engine/handle.rs (44), core/engine.rs (5). The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62bb323165c0746ff73645e8c7e072f487a0c0d82798c55c4da3a9c7a7d139f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExtensionsView: ClassTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 3 blocks, lines 1630-2564. The bar is 400 significant lines; this is 252 over it, 1.63\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/tui/src/tui/views/extensions.rs"},"region":{"startLine":1630}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f1a9ebeddc0c31d34e665ca37820127f0a96e6e80b99431c7b51f569f069ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::bind_spawn_model_route: FunctionTooLong \u2014 codewhale_engine::tools::subagent::bind_spawn_model_route runs 163 significant 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 63 over it, 1.63\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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":19982}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9623c24474fb083b2621c8451a3a0410a7ea3785571a0e1c589d99cd175286d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UserInputView.render: MethodTooLong \u2014 render runs 163 significant 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 63 over it, 1.63\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/tui/src/tui/user_input.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd75e27e74b364bcd66c92fd2a59f89dce4ff5b535a2b23ed38f968f4c6eded"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/git.rs: FileTooLong \u2014 811 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 311 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c48959a888a2312eb60d4dcfbf95680a7cc03a4d9af49e7cc7b0f4bf22b31f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::provider_readiness::credential_state_for_provider: FunctionTooLong \u2014 codewhale_engine::provider_readiness::credential_state_for_provider runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_readiness.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d3aad8146a94884c463f56536d43ff5455bb0aa1b08dd719f88b3961038a4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.compact_thread: MethodTooLong \u2014 compact_thread runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":14907}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddfa75b20adfcd0d5b46a8ab2e49815bf1bde4e32ba29566bfb8d8bee2f7b77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime.rs: FileTooLong \u2014 809 significant 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 309 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f14c864430a203de16ab82c6337981ce05a494dea054fb9492c9c1569b758d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Broker.authorize_frame: MethodTooLong \u2014 authorize_frame runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"5911c3e1954e3b66362232a8f136c25412956818956b07476d1dcea54ab6f869"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.deliver_agent_mail: MethodTooLong \u2014 deliver_agent_mail runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6344}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fa9eba5b7b44a2cd836e911ade1e356339e39fca65a0931d044bbc266bc569"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/composer_legacy.rs: FileTooLong \u2014 804 significant 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 60% of them inside a single declaration: ComposerWidget (3 blocks, 157-840). The bar is 500 significant lines; this is 304 over it, 1.61\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/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9628af1a4519f913cf4512b251452cdeb689f41ecaa0b0a4a2b27205753c570e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/files.rs: FileTooLong \u2014 804 significant 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 304 over it, 1.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7221f7d7389de62c6244dad66f089fadb999ee8b84e0765456320b115994027"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/acp_server.rs: FileTooLong \u2014 803 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: AcpServer (2 blocks, 172-832). The bar is 500 significant lines; this is 303 over it, 1.61\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/app-server/src/acp_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"faecb97ea5ef6f03bcb9d1ef218788fa1746364ef27cf13d9fef0d5ff5600300"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ProviderPickerView: TooManyFields \u2014 48 stored fields beside 95 methods. The bar is 30 stored fields; this is 18 over it, 1.60\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/tui/src/tui/provider_picker.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ae6a733b3c2f4781e22148feec4eb54d25f648862987387999b9d042703686"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ModelPickerView: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\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/tui/src/tui/model_picker.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f6522709dc27acc76fb4ef49c1b6f7d578dc3650dc9dc5a117996b0acd1c84"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.handle_run_shell_command: MethodTooLong \u2014 handle_run_shell_command 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/engine/src/core/engine.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9b0502985e5916581b42ef07b0c3c7cae0e1feac11f9fca73019310c615951"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::extension_host::execution::run_job: FunctionTooLong \u2014 codewhale_engine::extension_host::execution::run_job 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/engine/src/extension_host/execution.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbe9a3181e3f95365831bbf95645e9a07fcddb03f1f0630e47b2454ec528abf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::build_direct_workflow_tool: FunctionTooLong \u2014 codewhale_tui::build_direct_workflow_tool 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/tui/src/lib.rs"},"region":{"startLine":15231}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fef4f80e5f8b35d93b360f85694052c44392846f3d971c6e2c093e94fdff782"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pet_watch/owner.rs: FileTooLong \u2014 799 significant 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 299 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/owner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b7768b0c7352ab0dec8903e87ad5ac974936abb85f95c3df2baa14c17a70ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/tool_result_retrieval.rs: FileTooLong \u2014 797 significant 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 297 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77423fd3df5b6c1869d1fee2d4f80cbf6b4d5d9fed7370faa9f2ec3110834596"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 797 significant 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 65% of them inside a single declaration: LspManager (3 blocks, 134-1025). The bar is 500 significant lines; this is 297 over it, 1.59\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/lsp/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11694b9b1eff6827cbb2441995ab9e2c0562c431486ac32fdb8925f1bae1bb5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session_reconcile.rs: FileTooLong \u2014 796 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 296 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_reconcile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57108390342f1159bc9033f637afd1283019aab0ef9879172fe7cd2c66a27d96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/apply_patch.rs: FileTooLong \u2014 795 significant 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 295 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/apply_patch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02ae233414678d14cb2980809a7f080a39602ea11680ee46324c935a9ca3733"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.ContributePage: FunctionTooLong \u2014 ContributePage runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/contribute/page.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0958c0ce0ee3721accc64d9ccd5279a873dbd9f96339da643232d982f8209ed"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PrivateDirectory: ClassTooLong \u2014 635 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 9 blocks, lines 39-3133. The bar is 400 significant lines; this is 235 over it, 1.59\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/config/src/private_directory.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae8bca34943eb84df9189f439cfcba424869b57deca4764ce51edb6db267177"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::run_model_command: FunctionTooLong \u2014 codewhale_cli::run_model_command runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":6018}}}],"partialFingerprints":{"codehealthFindingId/v1":"662b0530fba88645ad3905b7677f16985b7a158146f2a2d59731992746f719b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenericToolCell.try_render_as_workflow: MethodTooLong \u2014 try_render_as_workflow runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a95e8892c06cae8a8352191216bce74aa2fbc46a9e585897b9da53efe27a39"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeUsageSource.prepare_observed_kind: MethodTooLong \u2014 prepare_observed_kind runs 157 significant 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 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d42a4a31a50b6f0244aa633c90d36fd86ff1dfc63ef34ba430428d9ea2a5be6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.render: MethodTooLong \u2014 render runs 157 significant 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 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/graphics.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5dc0f1a6e666f4405f134fe8494237c20bc01efa9c1ef927a7e1d0e8561de05"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::event_loop::handle_approval_required_event: FunctionTooLong \u2014 codewhale_tui::tui::ui::event_loop::handle_approval_required_event runs 157 significant 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 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":9086}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5be700f74d22a54864c4739ea8384c3bf09083b778c3ac027500fc41fefcbd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::frame::info_segments: FunctionTooLong \u2014 codewhale_tui::tui::ui::frame::info_segments runs 157 significant 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 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/frame.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7352b06c56c9b5776dc67ae77448e0661e40a53bdf131d3d8c4fd50d9ee71bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorkflowPanel.history_expanded_lines: MethodTooLong \u2014 history_expanded_lines runs 157 significant 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 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9edeba8592fea16f070092e9f27c96bff7eb1f7a05a21229da1cdb637a9f59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: widgets/transcript_legacy.rs: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 284 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/transcript_legacy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5019e97c7964b47593e1b242b6c91cb5ea3bcedd04f14300f468bb0306a2665f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CloudClient: ClassTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 42 methods, 2 blocks, lines 999-1819. The bar is 400 significant lines; this is 226 over it, 1.57\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/account-cli/src/lib.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0d90400e025399c343beef8882b81055013794a43815e456dcead459dbf973"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RlmTool.execute_eval: MethodTooLong \u2014 execute_eval runs 156 significant 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 56 over it, 1.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/engine/src/tools/rlm.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"f535374c4b7715c219156c40fcc31145e1bf7168c769129a75c5bcdcb344da82"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProviderLivePricingQuote.pricing_for_route: MethodTooLong \u2014 pricing_for_route runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"61356c1c56c252746d7c75992e400926fd427959fc595d8831d505e3df55ca8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::provider_lake::runtime_catalog_resolver_for_identity: FunctionTooLong \u2014 codewhale_engine::provider_lake::runtime_catalog_resolver_for_identity runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf7b05930c22959176cfb6d05e8334a2d600c9705953c930ac721fde042ea80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.aggregate_usage: MethodTooLong \u2014 aggregate_usage runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":8561}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56724d54d8f146e1e1e57f115885408f320858032afcf3c345d0932d4aff8ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::views::append_subagent_group: FunctionTooLong \u2014 codewhale_tui::tui::views::append_subagent_group runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":6674}}}],"partialFingerprints":{"codehealthFindingId/v1":"144aae08899bbc09b601c87577c20d1e6378b66f3a796fce1556677b0ca11a58"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: extension.activate: FunctionTooLong \u2014 activate runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/extension.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb89e1582c7f49e4e464ce3c2c860b8d1ca4158918d3ffc9827b0faeacb074ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fleet.rs: FileTooLong \u2014 774 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 274 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/protocol/src/fleet.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d606a64b3c7c59ed7dc23bb541e65a3fa1ebcb32174a856a1f85933ae03e87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/event_msg.rs: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: EventMsg (2 blocks, 304-1088). The bar is 500 significant lines; this is 272 over it, 1.54\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/protocol/src/event_msg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90d1cb7aa78934c0cc1f79f0de077f20ea1d678dac1680e007d3cb1b632b7bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dsh/mod.rs: FileTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 272 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd8fbb8179272a6ea519be34d063f4ddab401709cf9db99993404a79b004da5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetRoster.load_with_personal_dir_and_plugins: MethodTooLong \u2014 load_with_personal_dir_and_plugins runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f5c2008461b9bec99b6d9f7c3580259ec1c174268499a2eacc6e4fa253f063"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GenericToolCell.lines_with_mode_and_locale: MethodTooLong \u2014 lines_with_mode_and_locale runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"127b36966e926cbedfdf47aa6650acdd12c8c1175ce064fa1725fa81d1f117a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/responses_dialect_data.rs: FileTooLong \u2014 769 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 269 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/responses_dialect_data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d8cfd4ae394cce41b58b532768920907ac7245c481e2f5c5733943b48b67e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/context_inspector.rs: FileTooLong \u2014 767 significant 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 267 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/tui/src/tui/context_inspector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3acd4332aa1c9e3eea6cdf5816108ccca20c6a717abe24fae975c82cbb2d151"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: codewhale_tui::tui::notifications: TooManyFunctions \u2014 46 free functions. The bar is 30 free functions; this is 16 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/notifications.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"75bb395edeb1b2bbb7115c3ec7f6a344052498e8723c9c2749a97ada27c14272"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RuntimeCapabilities: TooManyFields \u2014 46 stored fields. The bar is 30 stored fields; this is 16 over it, 1.53\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/runtime.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d70c27222516220863a63dcc3c149391e8facbe2daaba29fa80108b27b0cf20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubAgentsView.render: MethodTooLong \u2014 render runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":6446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc2d58d3f2959ea2310bcc4c59adf8d77226970d2b18b0172425d1e6f03b1d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_sanitize::redact::redact_line: FunctionTooLong \u2014 codewhale_sanitize::redact::redact_line runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d7f2528331e3317ebd6b4d9865d51d45e85326dfa8d766ef56d0c1cee8736d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::work_surface::model::agent_rows: FunctionTooLong \u2014 codewhale_tui::tui::work_surface::model::agent_rows runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/model.rs"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c8edb904150bf27a68627c999a223a2c518c10de7aeb7f1c9390d960d92dde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/subagent_routing.rs: FileTooLong \u2014 754 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 254 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/subagent_routing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a519916020d71ecf45e3fb9048a9a9017f81df372b7b82f5eec60e66e48398a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_api/secrets.rs: FileTooLong \u2014 752 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 252 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/secrets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57a20a1a4513ca3a2ca51f99e816f905fac6108018371ac17db534cdae929ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/store.rs: FileTooLong \u2014 751 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 251 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3b3797d08fff2334984726e00fdf006826979f0daee56e699a49b52f3fde6a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SubAgentRuntime: TooManyFields \u2014 45 stored fields beside 29 methods. The bar is 30 stored fields; this is 15 over it, 1.50\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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":3059}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eda63595807ef6c3ade043850759b3df7a6df3c3558ab703ada6a76c09c2c44"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_account_cli::work::write_work_result: FunctionTooLong \u2014 codewhale_account_cli::work::write_work_result 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/account-cli/src/work.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"146eb73937eed88b01b3251c319514ed4519f1704f4ed6c4717f5fa489d34224"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::groups::core::constitution::format_status: FunctionTooLong \u2014 codewhale_tui::commands::groups::core::constitution::format_status 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/tui/src/commands/groups/core/constitution.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"682e303ba11724472f9dd3c36621cfd1f7062903ebe1c4756ae847a11e046996"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PetEngineTelemetry.observe: MethodTooLong \u2014 observe runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) 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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"3436f5ceffb082e53d2d37127801be37d36e77cb32f1885586a794ccd27b4aed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionPickerView.render: MethodTooLong \u2014 render 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/tui/src/tui/session_picker.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c63399ffa81a428f0d6d49859142ab2889534d966cae7dafe978e84969e866b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_workflow::redaction::redact_for_disclosure: FunctionTooLong \u2014 codewhale_workflow::redaction::redact_for_disclosure 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/workflow/src/redaction.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6491f9b2c866d6daa9dfce940940a186db9fcabcf3517acd4249fa2d46c3a5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PetEngineTelemetry.observe: MethodTooLong \u2014 observe runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"315b08014af7a717319fdb001c6d20e0ebeed3e933939e4b78ca086c622697d0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HotbarSetupView: ClassTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 3 blocks, lines 85-989. The bar is 400 significant lines; this is 196 over it, 1.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/setup.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b51ba04b28f51e3af87c87c3cc710d6231258f7f86f9ceb5df47ff3f7a62357"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plugins/mod.rs: FileTooLong \u2014 745 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 245 over it, 1.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/tui/src/commands/groups/plugins/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a926cf3422855d49e8bed706205993b3e427d5ef35120e7c14848bd5286a25"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::turns::message_native_thread: FunctionTooLong \u2014 codewhale_app_server::turns::message_native_thread runs 149 significant 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 49 over it, 1.49\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/app-server/src/turns.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e658275e8cabff1e843e21e2bb646e97384a74c3f6501a459188120a98222bd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BashTool.execute_wait_many: MethodTooLong \u2014 execute_wait_many runs 149 significant 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 49 over it, 1.49\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/engine/src/tools/shell.rs"},"region":{"startLine":7083}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1a014d89eb4768963032977e1cd015140c7b808ae70c6a52225256536d0d10"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModelPickerView.ensure_projection: MethodTooLong \u2014 ensure_projection runs 149 significant 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 49 over it, 1.49\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/tui/src/tui/model_picker.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"249867124458c260022da0d5af57db4e57511d5bdf03c3eae20e577e6cdd786d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/rlm_host.rs: FileTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 241 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b122c1fafca2780516d4056de90d0b31f16926b26396a162ee681d317a3273a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.mjs: FileTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units). The bar is 500 significant lines; this is 240 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e490988b0e110c5f34b7b2d4b2b076611121a96fa0d6169c66484e074e4218e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime_api/workspace.rs: FileTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 240 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/workspace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39c98dc5e6b3323ae17a16b63506f7ecda8690c925d51cc081bd8c4e0012954"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/image_attach.rs: FileTooLong \u2014 740 significant 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 45 free functions. The bar is 500 significant lines; this is 240 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/image_attach.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ceeb5d0f622da93ac48bbbc136314e0b07c9b8c0642d590d2e0f2f6ce0a7c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_account_cli::work::quote: FunctionTooLong \u2014 codewhale_account_cli::work::quote 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/account-cli/src/work.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a523579c9ffbd86bf6d547af413aa88f26e8e6ad2480545cb6b13c3febaae9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::metrics::read_audit_log: FunctionTooLong \u2014 codewhale_cli::metrics::read_audit_log 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/cli/src/metrics.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9d50a1350bef1ecc0f722c019fa25bd2e3f9859438b45ef6f850e5d9bd35a4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtensionHostManager.execute_launch_for_caller: MethodTooLong \u2014 execute_launch_for_caller 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/engine/src/extension_host/execution.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b9b21680c53092752084a809c492d6faefcb0bcba53f2f1b785da09734be5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MfjsValidationState.validate_schema: MethodTooLong \u2014 validate_schema 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/models/src/schema_sanitize.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98a426d52b5f18dbf18c8b4636a77af85e387546d777c2eab24cbcde0f8cd0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.streamTurnEvents: FunctionTooLong \u2014 streamTurnEvents runs 148 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"752b09b306a30e80a4c188c3486e27f3c128b853f48bf573cb7359d6fe6ee0e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/truncate.rs: FileTooLong \u2014 738 significant 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 238 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/truncate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ed0763c4de3f11a49aa0584701f5b61980da28383ac3699456867eb6ef4d0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/context_report.rs: FileTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 237 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/context_report.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62a42d2ef479afb64fcc8afadd39c7f07d2b0672749ddfdc542786f68ddfc21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/ambient_life.rs: FileTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 237 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ambient_life.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"370e06a6ba704587515476f6f11e812dce1d0e4bf884cac5f9eb15a0884f98c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::config::save_api_key_for_identity_unlocked: FunctionTooLong \u2014 codewhale_runtime::config::save_api_key_for_identity_unlocked runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":11839}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd69269bcaa7a3545505caaf433c1f22ef91d4d2a4ada794fbf9822ee7e5650"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AccountLoginView.render: MethodTooLong \u2014 render runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/account_login.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c00d1f9f1b311de718ffff8bb63c2f303d1bec65931661a9df80cb5f275880"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::apply::apply_model_picker_choice: FunctionTooLong \u2014 codewhale_tui::tui::ui::apply::apply_model_picker_choice runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58351c2fb5823913e563d58aa8784bc2443363843eb15df234841a3ddb7a53f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: codewhale_tui::tui::ui::terminal: TooManyFunctions \u2014 44 free functions. The bar is 30 free functions; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/terminal.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9ae886b696bd4b5258222116f7fcce2506e997aee78439e37251e4afcf7ad8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: WorkSurfaceState: TooManyFields \u2014 44 stored fields beside 11 methods. The bar is 30 stored fields; this is 14 over it, 1.47\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/tui/src/tui/work_surface/model.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ff70e582cfd3ceda4f0ff670c26edeaf7414938f4c823cd45c0a3982d32224"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/anthropic.rs: FileTooLong \u2014 733 significant 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 233 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1417552d6a28950e7be9278ddc5435ec8542e1705b66831e17911aa15efb2497"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 231 over it, 1.46\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/protocol/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aed3fdc03c6d9dc2fdebfad7b85c55b114af49f5554d4475d3111a20b2587ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/extract.rs: FileTooLong \u2014 730 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 230 over it, 1.46\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/engine/src/tools/web/extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd778b81893a0df46625c5b3e488f87a584d99308a30327ef253a592abee535"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::members::start_thread_member: FunctionTooLong \u2014 codewhale_app_server::runtime_api::members::start_thread_member runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/members.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"853da44b4a9be20e04d587dee0e19ae6434e0f86f0db0c0f26d1d1773aa989a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RequestManifest.render_body: MethodTooLong \u2014 render_body runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/request_manifest.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96025f65988ce30fd2396c7b5c2636877ab052a5be753e13a9731e075a002e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PluginManifest.validate_mcp_servers: MethodTooLong \u2014 validate_mcp_servers runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"34896db868a38c6e79248182af6eb1e3690c606e0507c75f060fd9313254fc6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::subagent_routing::record_agent_current_activity: FunctionTooLong \u2014 codewhale_tui::tui::subagent_routing::record_agent_current_activity runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/subagent_routing.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b8fcfff4275171a0afa0e7c442f5bd90585a78499f2ab57d44110a3a51d30b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.PluginsPage: FunctionTooLong \u2014 PluginsPage runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/plugins/page.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbe3d0a0eecbbfce1c3e517c21651ae48d6919d0173dc6133ebb122c7d1beb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: github/report.rs: FileTooLong \u2014 727 significant 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 227 over it, 1.45\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/engine/src/tools/github/report.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23973c18828c20ce7899c562d8b3acf01484bb684036d46607461d5d1e6f5f27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.apply_external_update: MethodTooLong \u2014 apply_external_update 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/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecf7ca4fdd2d748322eaea51f09ffb7bf98876293a4f2e7efb0f5accef634f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoordinationLedger.validate_replay: MethodTooLong \u2014 validate_replay 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/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"e540cc2c48b218fd006dd43292007c21f0353cd74a1759a5bf7771a603d7c881"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::work_graph::migration::import_legacy: FunctionTooLong \u2014 codewhale_engine::work_graph::migration::import_legacy 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/engine/src/work_graph/migration.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa668633d9a5c1ccde972a63ffec8edf7fa747d41371dd9fced128a60b9413b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui_kit::diff_render::wrap_parts: FunctionTooLong \u2014 codewhale_tui_kit::diff_render::wrap_parts 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/tui-kit/src/diff_render.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"899d837c0231a63539dec90c3f55defdfe26a4b6a0492429abbf3a6075e6d09d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: update/uninstall.rs: FileTooLong \u2014 724 significant 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 224 over it, 1.45\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/cli/src/update/uninstall.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c15889be2c6d0bc5f1be60b725d0bcd1b7f04121fab11a3bca75b565ac96b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: registry/gc.rs: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 222 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry/gc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43582e6e303d9b3ca6aaa1337c8a1ccb655189e2f2f59506909c2e08e1c744f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/executor.rs: FileTooLong \u2014 720 significant 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 220 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/executor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb72e9aa72eaaab126d96e125eb84ab5db6c6d35a4b380b0c546230f45a557f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::provider_lake::run_models: FunctionTooLong \u2014 codewhale_engine::provider_lake::run_models runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a7b10eab2db890dfed3b3d83c2abfc80a05e5c22fc3aef7bd03a7006b98385"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::shell::execute_foreground_via_background: FunctionTooLong \u2014 codewhale_engine::tools::shell::execute_foreground_via_background runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":5145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1664fc0c89fd51f3f1aef6672363a867714e023d782d7d899c6785ddb149ba8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::engine::run_child_agent: FunctionTooLong \u2014 codewhale_engine::tools::subagent::engine::run_child_agent runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"d745914c3ae77e01f627b9810b9b838b89cc30fbda4e1b0bfb56219341e835ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::event_loop::apply_engine_session_projection: FunctionTooLong \u2014 codewhale_tui::tui::ui::event_loop::apply_engine_session_projection runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e64cb5d7f9a13a6f13831a615b25ab78b6ce32af4d70e11adc5cda83f282e4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EventMsg: ClassTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 2 blocks, lines 304-1088. The bar is 400 significant lines; this is 174 over it, 1.44\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/protocol/src/event_msg.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82dbcf33d71b42dc5f7bff5842c5f26e2c62075019dda9a47d4338f9d9a5f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: UiTheme: TooManyFields \u2014 43 stored fields beside 4 methods. The bar is 30 stored fields; this is 13 over it, 1.43\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/palette/src/themes.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7298fada928f3e0c93dd4390414502bd44279a5753e567eb2c8313bdd1c0aafc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/legacy_root.rs: FileTooLong \u2014 716 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 216 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/legacy_root.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ee0675451180619be2e3ca9b0253cedf10d8d0f4cd6355483fb04f8cf470ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.handle_child_send_message: MethodTooLong \u2014 handle_child_send_message runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/child_host.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a5f591a62a8df5ce72a2db76937c922359ebf6f48faf00eb43822b78f96726"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.consult_auto_review_guardian: MethodTooLong \u2014 consult_auto_review_guardian runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ff7cbb9b7be36428b421e1a8376803ace1d6cac5bf98bd52b58913bb54323a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.bridge_external_permission: MethodTooLong \u2014 bridge_external_permission runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ff2d5bfcffa35cfcde60153cd22b1c7a38327a1285b98e6e1ad485783a2d38"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/structcopy.rs: FileTooLong \u2014 714 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 214 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/structcopy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef61057cd70c1586c776d21e50f9004d3dac7c43453fd1ad36337984fe1676a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/handle.rs: FileTooLong \u2014 712 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: EngineHandle (2 blocks, 31-1128). The bar is 500 significant lines; this is 212 over it, 1.42\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/engine/src/core/engine/handle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"806992b47fe0fbaf19bf29fd1d2084d304be022b99e7d0ed88130064c447e1bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_commands::diagnostics_reports::tool_snapshot::render_tool_snapshot_text: FunctionTooLong \u2014 codewhale_commands::diagnostics_reports::tool_snapshot::render_tool_snapshot_text runs 142 significant 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 42 over it, 1.42\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/commands/src/diagnostics_reports/tool_snapshot.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0877494eee209938bc22f0e95843e0fc8cd66abd07c34b96ecdf38c03e3a82b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::fleet::control::execute_fleet_control_with: FunctionTooLong \u2014 codewhale_engine::fleet::control::execute_fleet_control_with runs 142 significant 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 42 over it, 1.42\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/engine/src/fleet/control.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c0f1f21783c4dd33688e5e2951006249e99544bfc818216a0381114f711292"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::registry::enforce_tool_authority: FunctionTooLong \u2014 codewhale_engine::tools::registry::enforce_tool_authority runs 142 significant 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 42 over it, 1.42\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/engine/src/tools/registry.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"8274310b7c1115452af0c33e6c23ebe37d5c665401b2a4a0fe3cd91aa0d7c96f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: project_context/budget.rs: FileTooLong \u2014 709 significant 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 209 over it, 1.42\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/engine/src/project_context/budget.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"234fc6d62d71051d6e33d79cc037ca72c78bff03906e2f5058ec1fe6e24fb6f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/command_palette.rs: FileTooLong \u2014 708 significant 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 208 over it, 1.42\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/tui/src/tui/command_palette.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4593cd782369c8bb2a6cfcb3826290f635def8f2840e9217da1056ab4460bd29"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TasksTool: ClassTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 16 methods, 4 blocks, lines 81-968. The bar is 400 significant lines; this is 166 over it, 1.42\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/tasks.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2790f0efe7ae57009c2745e8abbd33670251aa825172c55b1542769208e867cf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorkRuntime: ClassTooLong \u2014 565 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 3 blocks, lines 39-783. The bar is 400 significant lines; this is 165 over it, 1.41\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/engine/src/work_graph/runtime.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0eab3ae0a8b4cd5d35567496ad988a7e9daa20cff07b02ba636a89e283ce7a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 205 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd1b3a53d501034fa95a1edcad5d080ed5aa6f8fc634c61d72987450aa5cba9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: views/fleet_roster.rs: FileTooLong \u2014 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 205 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_roster.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1288429290752d570fa5454031d2fa5e18e6e07256e8be065ee82676c07aeede"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::lifecycle::compact_row: FunctionTooLong \u2014 codewhale_engine::tools::subagent::lifecycle::compact_row 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/engine/src/tools/subagent/lifecycle.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2febcc1e5c2effbfe3710fab89c00a30d4c621078d84d81686158b5a28cb2228"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Components.walk: MethodTooLong \u2014 walk 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/plugins/src/install/dsh.rs"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbee375d29aad6b33152aca7312b63b803826de0950c8aa7da4b6cf611e588b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::config::credential_resolve::resolve_credential_source_with: FunctionTooLong \u2014 codewhale_runtime::config::credential_resolve::resolve_credential_source_with 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/runtime/src/config/credential_resolve.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c2dbebb0478625b3b65d8e01ac4395e9ea2f155265c44028fc062d3ddb37de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hotbar/setup.rs: FileTooLong \u2014 702 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: HotbarSetupView (3 blocks, 85-989). The bar is 500 significant lines; this is 202 over it, 1.40\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/tui/src/tui/hotbar/setup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2b9deed9539fd1e903b8a50d5dde539adf003f0146ea85c4a68bab113aa5ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/request_manifest.rs: FileTooLong \u2014 701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 201 over it, 1.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/request_manifest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a80286efa053ce90dfca4d0e872c9e03b9adf58dd571782d2504bce47c52bec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CodewhaleClient: TooManyFields \u2014 42 stored fields beside 101 methods. The bar is 30 stored fields; this is 12 over it, 1.40\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/engine/src/client.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"768d45b0bbcaa66d004bc2c5803f1cdc931299c6f3ac544ddca4afc9fa7e8aba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CloudClient: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f667ee89c7bdc28ef619ea0705a7eda7dcb75cc02ab2496bf6ee40d20e130e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TurnRecord: TooManyFields \u2014 42 stored fields beside 4 methods. The bar is 30 stored fields; this is 12 over it, 1.40\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/engine/src/runtime_threads.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0ba8f8bd95b4c5b42d3d811052db08e0cc019f70edcd316ef2935d3abc4be5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::remote_control::parse_remote_command: FunctionTooLong \u2014 codewhale_app_server::remote_control::parse_remote_command runs 140 significant 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 40 over it, 1.40\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/app-server/src/remote_control.rs"},"region":{"startLine":4628}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04b1f0b93c52ce99d88cd179e200f7f78041d02a394b3d7eda6b36c00cfc0f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::install::dsh::parse_comparator_token: FunctionTooLong \u2014 codewhale_plugins::install::dsh::parse_comparator_token runs 140 significant 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 40 over it, 1.40\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/plugins/src/install/dsh.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"97130bd148458f9ba1b092cca153587c3de5f71cc8447317578409647d27f3e6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SetupWizardView.handle_key: MethodTooLong \u2014 handle_key runs 140 significant 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 40 over it, 1.40\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/tui/src/tui/setup/mod.rs"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd9f9d383e4edbc23f5135d4504ac46ed50002682f5b870d87d453a0cda0e1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale.fromCodewhaleSession: FunctionTooLong \u2014 fromCodewhaleSession runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"pet/src/core/codewhale.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cd9aaaf41168973c449e786ede36d25052946a39f525f3d7e503969633b40f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Collector: ClassTooLong \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), 17 methods, 2 blocks, lines 187-1069. The bar is 400 significant lines; this is 159 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics/stats.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49d1d63ef752c602126da8b90563ba28a515ae2cb5c51d29a10a19ecd0d8e61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/daemon_client.rs: FileTooLong \u2014 696 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 196 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/daemon_client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c3bcb7b3f47f917407730545afe1e89682deccde19ae5654bf16ae40ff7873"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::daemon_client::platform::probe_frontend: FunctionTooLong \u2014 codewhale_app_server::daemon_client::platform::probe_frontend 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/app-server/src/daemon_client.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"2459087439cf1e5cdc381b3d27366ccd584563ef616215bc29b8728e67988717"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::owner_calls::execute: FunctionTooLong \u2014 codewhale_app_server::runtime_api::owner_calls::execute 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/app-server/src/runtime_api/owner_calls.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea2775a6ab08d8e5cf3bd99710e942d4a95e2848aeb6f3c4777c32b0a5727445"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::runtime_threads::turn_artifacts::artifact_refs_from_tool_metadata: FunctionTooLong \u2014 codewhale_engine::runtime_threads::turn_artifacts::artifact_refs_from_tool_metadata 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/engine/src/runtime_threads/turn_artifacts.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"671048ef083222e4d909e856ae741404b17561d14a0ad327eb79c076ff0e3e51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::frame::build_engine_config: FunctionTooLong \u2014 codewhale_tui::tui::ui::frame::build_engine_config 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/tui/src/tui/ui/frame.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae862973c82960c948ee5095c4f211a443965d363952c249f87211b8205ea5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: admin-client.AdminClient: FunctionTooLong \u2014 AdminClient runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"web/app/[locale]/admin/admin-client.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79777f40f475515b5c331349dd1958d87746c825c03e9da831b74dd77d5c6a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::provider_lake::provider_capability_with_wire: FunctionTooLong \u2014 codewhale_engine::provider_lake::provider_capability_with_wire 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/engine/src/provider_lake.rs"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8dd87b82523f893129758db9017cd9408600dec83feba7830aea21e89cd803"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskManager.run_task: MethodTooLong \u2014 run_task 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/engine/src/task_manager.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf001734b58830923beea7ef46c423f81b539f1144a610ffc0527c496a88e87"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::review::plan_pr_review: FunctionTooLong \u2014 codewhale_engine::tools::review::plan_pr_review 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/engine/src/tools/review.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10825df11d20f503797803285f128446516be7f0b8a1a01a1f7b75fc1b2efda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::groups::config::config::config: FunctionTooLong \u2014 codewhale_tui::commands::groups::config::config::config 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/tui/src/commands/groups/config/config.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"0168829cbfe6991abb5aef950c8ff4528ab08cb80e66ac2d3d35b9df7b7e0599"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProviderPickerView.provider_detail_lines: MethodTooLong \u2014 provider_detail_lines 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/tui/src/tui/provider_picker.rs"},"region":{"startLine":3486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8492fd10865fc12ece642c5dff5f0c0bd6cd54a4535e762c554374ef2573d749"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: history/tool_output.rs: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 189 over it, 1.38\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/tui/src/tui/history/tool_output.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3bba4872575f6ec9ee9864ef723c901aa0be0122c1935e43b195227b6b0956"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TranscriptViewCache: ClassTooLong \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods. The bar is 400 significant lines; this is 151 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/transcript.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"702b5c5586881187f8c588cc5140cde44f47e7f7fba462f916c5313c23752271"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/system.rs: FileTooLong \u2014 685 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 185 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/system.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc56341d2bcb329c9ba8c07bc1f4e9e9d57915fd61ddc79b0c1a9e086d0928e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FleetLedger: 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/engine/src/fleet/ledger.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcff5b8fd905345020860d394282321f8c247bf6efba034b6dfcdb794acdd18"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BackgroundShell: TooManyFields \u2014 41 stored fields beside 24 methods. The bar is 30 stored fields; this is 11 over it, 1.37\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/engine/src/tools/shell.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b2d60166c9627d7877cb3c1cf35f0e97160583fe5cb925050b4f876a7f6727"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: UserThemeColors: TooManyFields \u2014 41 stored fields. The bar is 30 stored fields; this is 11 over it, 1.37\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/palette/src/user_theme.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba8b06b5c8c8658e4cf70f6d775775a5f42f2c11993a7ac3150950c2a2bc8b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RemoteControlController.try_next_event: MethodTooLong \u2014 try_next_event 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/app-server/src/remote_control.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4509ca6f093502c44c7ab049a55f801848ff7271b884208cfd0ccd342e4b190"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionCostSnapshot.project_usage_record_inner: MethodTooLong \u2014 project_usage_record_inner 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/engine/src/session_manager.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d307a976098e23b486edef3cb4c12d08d2bb00b6746e5a6138caa92b0033d4ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::registry::gc::plan: FunctionTooLong \u2014 codewhale_plugins::registry::gc::plan 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/plugins/src/registry/gc.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"187d4d4fc839125d39a5ab3e1b1f11cdc054d602b1bf416cdc9270086442b69f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::command_palette::build_entries_with_plugins: FunctionTooLong \u2014 codewhale_tui::tui::command_palette::build_entries_with_plugins 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/tui/src/tui/command_palette.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c7e40fff020f125719e834b990af99f18b9f31d1c30560d35b8b4b07c300e72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/redaction.rs: FileTooLong \u2014 679 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 179 over it, 1.36\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/workflow/src/redaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3653903c50a7671d7746e4135052fb2deb014d8b300fcbf33a53a6bfa43232"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PluginAdapter: ClassTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 3747-5034. The bar is 400 significant lines; this is 143 over it, 1.36\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/tui/src/commands/contract.rs"},"region":{"startLine":3747}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc03c09a96040766d729968472ef35d852960fc6e46c0f73282bba99742cc6dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/audit.rs: FileTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 178 over it, 1.36\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/skills/src/audit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd965ff49b1917dc5f6849f1ecb4d144bc1d51b34832472bd9d31ebed5d6d6b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 675 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 175 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cloud-facts/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c70ee9635d60d8eb93a165bf96c79e96857ce3c656be01161968fc3c75edad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.recover_interrupted_state: MethodTooLong \u2014 recover_interrupted_state runs 135 significant 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 35 over it, 1.35\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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":19264}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c91d4035c1ee29d9b0f1797895333af29b3a1f1b4b2dc7d0f17bd721920815"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentTool.input_schema: MethodTooLong \u2014 input_schema runs 135 significant 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 35 over it, 1.35\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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":14519}}}],"partialFingerprints":{"codehealthFindingId/v1":"063901dc8002197cca4ea9f6d4e4a3a3e8f5c2fa6c32666ffc008a4d146cad0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::turn_route_plan::plan_turn_route: FunctionTooLong \u2014 codewhale_engine::turn_route_plan::plan_turn_route runs 135 significant 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 35 over it, 1.35\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/engine/src/turn_route_plan.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1229df460a33d26d130ada0546d5b47286e9c25d9528a79f56a20c96123c282c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_execpolicy::command_safety::lex_readonly_command: FunctionTooLong \u2014 codewhale_execpolicy::command_safety::lex_readonly_command runs 135 significant 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 35 over it, 1.35\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/execpolicy/src/command_safety.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"4341ba5c29a949568c2a5299fba70e9e5ccad5fef126275d04a33c6a8bf3318f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::config_main_host::set_subagents_config_value: FunctionTooLong \u2014 codewhale_tui::commands::config_main_host::set_subagents_config_value runs 135 significant 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 35 over it, 1.35\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/tui/src/commands/config_main_host.rs"},"region":{"startLine":1393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1ffe20c8e55b2425b23dfe2c8000906941311761c4a02e17f7bea1f3fe9a22"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ModelPickerView.render_pane: MethodTooLong \u2014 render_pane runs 135 significant 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 35 over it, 1.35\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/tui/src/tui/model_picker.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"488865426890b665b0ae392abebc896bce467c38a78a537ba4c97aa246ebf8f9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetRosterView.render_body: MethodTooLong \u2014 render_body runs 135 significant 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 35 over it, 1.35\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/tui/src/tui/views/fleet_roster.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0169323b84b0e0030301b7b197113231ee74d09f6d28164afa8c962eb6f5c473"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodewhaleRuntimeTrace.append: MethodTooLong \u2014 append runs 135 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\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":"pet/src/core/codewhale.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"489e5d55285caf9edba81a2dbb26471cda0773c50f3d0f5c08a8031f293d7e92"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TaskManager.apply_event_to_task: MethodTooLong \u2014 apply_event_to_task runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":3325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcac90ccd06f38629a90867956b614caa546ddbf0e1c9fe13b8a629827fdb26c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UpdateGoalTool.execute: MethodTooLong \u2014 execute runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/goal.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee0caea506fb136d4a7bed8dcbed3e30a965e789697356b2587ccaaa4b9dd81"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::inspect_agent_from_input: FunctionTooLong \u2014 codewhale_engine::tools::subagent::inspect_agent_from_input runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":15130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da3cafe66888543b9a7786c0742538a20f2f8ec7bdf810838e7f66cdcee4941"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::web_run::run_image_search: FunctionTooLong \u2014 codewhale_engine::tools::web_run::run_image_search runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"94862c575c1b56676bde283af40be319807153499c92df5659adf86e958eb314"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProviderPickerView.render_key_entry: MethodTooLong \u2014 render_key_entry runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":3799}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3a02046f48b70e5e0c94e539470d99d7450d473e938be35a5f4cc46c173bbe"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ChildAuthority: ClassTooLong \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 38 methods, 3 blocks, lines 82-888. The bar is 400 significant lines; this is 135 over it, 1.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f00d5914a439003ed7d23ce3f22acde0b5674c221f5e840c0458c0cedf5f583"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RuntimeThreadManager: TooManyFields \u2014 40 stored fields beside 290 methods. The bar is 30 stored fields; this is 10 over it, 1.33\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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":3456}}}],"partialFingerprints":{"codehealthFindingId/v1":"32620f868aa06fe3d01f9effb5625dd6a2d6f24c9ca573ab6686c2558ae93d37"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: McpConnection: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\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/engine/src/mcp.rs"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7f51c2f0f399de6eadb9320c1229ec8842ce3042ecfe8d80171a07ee59ffc8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Events.host_request: MethodTooLong \u2014 host_request 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/engine/src/extension_host/mod.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2fcdc1026edf9097b7dc4891879d0d218cc8bd9520607c86d36a7d6347f719"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetFile.validate: MethodTooLong \u2014 validate 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/engine/src/fleet/store.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8eb8f02690e74b6954abf5a6355b016b7f7191b443e6daf8b5719cf6300eb2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadStore.visit_diagnostic_records: MethodTooLong \u2014 visit_diagnostic_records 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/engine/src/runtime_threads.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e939471cd810dba60b77fc4f0c86b4d09d962e1a0974db84e6f676386f3c37c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::file_search::search_files: FunctionTooLong \u2014 codewhale_engine::tools::file_search::search_files 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/engine/src/tools/file_search.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"344a45a052442fabf934d75cc79818e928b5232381ef18443c2b22ea5ea1f204"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::oauth::activate_login_locked: FunctionTooLong \u2014 codewhale_runtime::oauth::activate_login_locked 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/runtime/src/oauth.rs"},"region":{"startLine":3937}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e323dda39cf5ed1548b537c63f8b4aee98f2b41346a70dd03b8c5a049d540ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/clipboard.rs: FileTooLong \u2014 664 significant 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 164 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/tui/src/tui/clipboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8789cdcc82f117291a9d139aa96cfc0ef64938d85436410b1c9b2626f22efdf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: work_surface/terminal.rs: FileTooLong \u2014 664 significant 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 164 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/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a8c0b3ba00562c09e170b07aaf07304646466277b5520c29ba79e303e3cde6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AutomationsView: ClassTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 3 blocks, lines 74-857. The bar is 400 significant lines; this is 129 over it, 1.32\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/automations.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8c704843038279cc7c5046f065a774bda099ce42efaa54aa6fdbcec72a9835"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetManager.reconcile_coordination_worker_statuses: MethodTooLong \u2014 reconcile_coordination_worker_statuses runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"d143e7daa6c6fbf796be7d56304c22e88eea8f5f5cfb377f465a9c7cb8d9bb97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::runtime_threads::reconstruct_messages_from_turns_with: FunctionTooLong \u2014 codewhale_engine::runtime_threads::reconstruct_messages_from_turns_with runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":6094}}}],"partialFingerprints":{"codehealthFindingId/v1":"67228cc1093ff2d7226692c3f1ed8371aee1f118189f3d4d2ef490aeed8430a6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GrepFilesTool.execute: MethodTooLong \u2014 execute runs 132 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/search.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34d2dfd66868a5d8dcfa8f16c659054d39d6a1519eac69ea92f9b5f506dad8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 157 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18f25349388eebcc2dc813c9a3937c5337e59dcf3bbaf01de991cba83cd8b32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/read_media.rs: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/read_media.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1a5eb214411447b0977f5255e14fc12366b319f9944f520521198ca10fcd74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::model_routing::auto_route_inventory_recommendation: FunctionTooLong \u2014 codewhale_engine::model_routing::auto_route_inventory_recommendation 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/engine/src/model_routing.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"e784fb698edba168184f2f968daf0978c8befc4bfe2cf4117a8352d6ed4cca65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::provider_lake::update_provider_catalog: FunctionTooLong \u2014 codewhale_engine::provider_lake::update_provider_catalog 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/engine/src/provider_lake.rs"},"region":{"startLine":1800}}}],"partialFingerprints":{"codehealthFindingId/v1":"2add2568e5d3ece28217f9e33abee11859776790d35ac56a8a8a75b4a08c709e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.project_session_cost_for_thread: MethodTooLong \u2014 project_session_cost_for_thread 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":8788}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7251356472a48521b688415e89fc33f37f8193585ad5d29df7748cc402e6d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::task_manager::drive_engine_turn: FunctionTooLong \u2014 codewhale_engine::task_manager::drive_engine_turn 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/engine/src/task_manager.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba6567e37bc7dc55afcfa4300837ef9e1c67506571d761a71c58d03ff3de9bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RetrieveToolResultTool.execute: MethodTooLong \u2014 execute 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/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df3d259eb2e4cd539bf85eb5143b94e7f08e522a35b618cadc45c95ac1d1777"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::truncate::apply_adaptive_evidence_inner: FunctionTooLong \u2014 codewhale_engine::tools::truncate::apply_adaptive_evidence_inner 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/engine/src/tools/truncate.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b0056ebd6757fdf5aa2f0922ff19bdaca7271b24eee64254cc5608c12f7f57"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::web_search::run_backend_search: FunctionTooLong \u2014 codewhale_engine::tools::web_search::run_backend_search 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/engine/src/tools/web_search.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"30daf4706d6890911b1232bd0a106bb59935e6d36dca1f27326d641f259af342"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ApprovalWidget.render: MethodTooLong \u2014 render 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/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79b51e1f61addb3d43baaac6ad093f1c5ef1058e3c6301a47dc2d2f865f6b71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.AppPage: FunctionTooLong \u2014 AppPage runs 131 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"web/app/[locale]/app/page.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f24a27a28743225eb29fcaea4ec17f479f56abc9c0dace6a40c549fa5f9e357"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"947e8338224b8042ae6d4f6f0aa1c5d97db4bccf16ae2df9d68612f85c314498"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LspManager: ClassTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 3 blocks, lines 134-1025. The bar is 400 significant lines; this is 122 over it, 1.31\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/lsp/src/lib.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"07145222421ef030a8b06b843c6be8ee9baf51f085417330755994a253978b00"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/rlm.rs: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: RlmTool (4 blocks, 73-772). The bar is 500 significant lines; this is 151 over it, 1.30\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/engine/src/tools/rlm.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65126b027b58049803b1cef2b86dde0d1295d3047b5d900693bfe80e75e9f655"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/mcp_registry.rs: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 150 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/mcp_registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbce4438bcfda178dd9217498b8e504e2e8632eb08ee5992386950737efa95c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_commands::debug::cache_format::format_cache_history: FunctionTooLong \u2014 codewhale_commands::debug::cache_format::format_cache_history runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache_format.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fa7f1f6aa6a83753858d9d4e274bf36a0f9e28b9f4a13a13338d611bcf4fa1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::marketplace::parsers::claude::parse_claude_entry: FunctionTooLong \u2014 codewhale_plugins::marketplace::parsers::claude::parse_claude_entry runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"147769c0ff5294309c22345c940d28efa59393c91e2548252aca959589967c9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::agent_details::project_agent_details: FunctionTooLong \u2014 codewhale_tui::tui::agent_details::project_agent_details runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_details.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"af427e503fd7ba3c974a12658daaa96e8afd02502e6bd90f1968f0e0a37f4596"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ambient_life::paint_marks: FunctionTooLong \u2014 codewhale_tui::tui::ambient_life::paint_marks runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ambient_life.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"59aa5a176f0744fa7bb76609dc09890dd59f889d01eea564eea1c0ca813e37f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::apply::apply_conversation_undo: FunctionTooLong \u2014 codewhale_tui::tui::ui::apply::apply_conversation_undo runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c5b842b810d36795f7c1b4876ce83263143e45964ad1752c3f06fb4f713ab8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::dispatch::spawned_dispatch_inner: FunctionTooLong \u2014 codewhale_tui::tui::ui::dispatch::spawned_dispatch_inner runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/dispatch.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bbef2907b7a7a5d9b19bc5a4aab59a82622f065d927fb9f9b1fbcd656ea1c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PetEngineTelemetry.observe: MethodTooLong \u2014 observe runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-engine.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b2840feef855db31cffeed603b4d85e5c579522c8cbc639412ba0cdbfbbf00"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TaskRecord: TooManyFields \u2014 39 stored fields. The bar is 30 stored fields; this is 9 over it, 1.30\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/engine/src/task_manager.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c8d58c849ceea2d10e45c2d23f7daa3858a9fffa2520df86945bc85cd6e706"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ambient_life/pet_sim.rs: FileTooLong \u2014 646 significant 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 146 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ambient_life/pet_sim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a03d727b082dc745ec5be8361e844c7e243fecce63e8921d43524f5976ba1c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionManager.apply_late_usage_result: MethodTooLong \u2014 apply_late_usage_result runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":3644}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09c0491e7b3279ba0341f74505f92e78498195a1067ca0302073059db2d95e7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Store.recall_impl: MethodTooLong \u2014 recall_impl runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/memory/src/store.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"423d80514f8481c754ee7116f214a115e5b44e36320058bd7110b7c4ec59f812"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: explorer.RatatuiExplorer: FunctionTooLong \u2014 RatatuiExplorer runs 129 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/ratatui/explorer.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"960202e897618f7e5cd188f0a52b564093a57780bf3e5c0a55e19ca1d788f372"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turn_loop/preparation.rs: FileTooLong \u2014 643 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 100% of them inside a single declaration: Engine (5-927). The bar is 500 significant lines; this is 143 over it, 1.29\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/preparation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c9d47fb9d5f90beee9443a29ca377a9a4f2a90fa0212f6fe776b7993e1cd13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/handle.rs: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 140 over it, 1.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/handle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c0fcc81c664bc2303258997e867bec0be17858dabe334be95f522d82cd5b03"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PythonRuntime.run: MethodTooLong \u2014 run runs 128 significant 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 28 over it, 1.28\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/repl/src/runtime.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"0983c085bab471847e55714c6d39f680c5893f6c0662ee6aa427515736bdf53a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config.validate: MethodTooLong \u2014 validate runs 128 significant 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 28 over it, 1.28\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/runtime/src/config.rs"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"baebe60f755a348601e2a163d6535457a9c4f32e09ce7407059954a0f1c4a5c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ambient_life::pet_sim::gait_target: FunctionTooLong \u2014 codewhale_tui::tui::ambient_life::pet_sim::gait_target runs 128 significant 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 28 over it, 1.28\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/tui/src/tui/ambient_life/pet_sim.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6175f57b08d60ca4da7f879d05fac9c9f3ed7e1ca76e3d82ffedfe774321e1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ChatView: ClassTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 109 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"15884bf0b4cb40703fecdc7ae8397046dde9e14dfb9fecd8adaf861ba78246a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: extension_host/mcp_http.rs: FileTooLong \u2014 636 significant 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 136 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp_http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc39bf7daa25c91cb89b59f955352c98164a94d5326629db3c689b711cc4acc6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtensionHostManager.execute_hook: MethodTooLong \u2014 execute_hook 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/engine/src/extension_host/execution.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1741114bc4c712343acd6a4cc8e38c0629b0938b6a2d0c7baefc22b66eb09b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::route_runtime::plan_limit_overrides: FunctionTooLong \u2014 codewhale_engine::route_runtime::plan_limit_overrides 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/engine/src/route_runtime.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"1121f7c23280970b50830bec2dfd5a3ed9e5d18891d55c04dfc4723c7431b87d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::subagent_session_projection: FunctionTooLong \u2014 codewhale_engine::tools::subagent::subagent_session_projection 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":12356}}}],"partialFingerprints":{"codehealthFindingId/v1":"feb841835eaf293b660101f5423eb6db9be22e406dccec6865935d30b9210812"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::groups::core::core::model: FunctionTooLong \u2014 codewhale_tui::commands::groups::core::core::model 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/tui/src/commands/groups/core/core.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1aff841898103a631a055681cdfa99b0a49c770171167f3786fd3b5763ed02"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChildAuthority: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e828dbf2bd2e670b5af7426cec519e0fafa32581d7a75583bd45aaf8905dced8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/finance.rs: FileTooLong \u2014 632 significant 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 132 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/finance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"642e4192d950bed01615c5bbd079ba177165b12b0a3b4cc3a08462a13d140491"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionLifecycleAdapter: ClassTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 325-975. The bar is 400 significant lines; this is 105 over it, 1.26\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/tui/src/commands/contract.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"174a913a613218242cb6780b95989fd55d7c5617e6dd2b7f71f18bf42d125ffa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/computer.rs: FileTooLong \u2014 630 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 130 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/account-cli/src/computer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c974ca56e8445a79ced7ce1f39bd02a370d4e4a63150d744b6fcb493e52366b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Settings.load_persisted_from_candidates_with_migration_unlocked: MethodTooLong \u2014 load_persisted_from_candidates_with_migration_unlocked 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/runtime/src/settings.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a7273e54fc503e8dbb45e62d54e4054506747bb8ae482907b8ee760dad4eda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_skill_install::install::sync_one_skill: FunctionTooLong \u2014 codewhale_skill_install::install::sync_one_skill 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/skill-install/src/install.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"0725dbaaf96229afb121bf1a12f6b023d4cb6697feee4ad660f18683a43d69bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::coordination_detail::format: FunctionTooLong \u2014 codewhale_tui::tui::coordination_detail::format 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/tui/src/tui/coordination_detail.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce0873ed3e62514be4e17a2aa2f2bbec7e42cf6708419e46ab32b9a0fc200d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: work_graph/model.rs: FileTooLong \u2014 629 significant 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 129 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/engine/src/work_graph/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedbc5d4b8faea6a0b0462f4d9083cb3059ce1b45e940fb5eadfabc7e550938e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/file_picker.rs: FileTooLong \u2014 628 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 128 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_picker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94bbe7059545f28cfa2d77f9bd69c3fa0841a90e823c57a63548d8e74f08776"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: authority/grants.rs: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 126 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/authority/grants.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ee0e1b673294f0a2271f86b3c1a748661c1d1910534451f266f38275776402"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/tool_execution.rs: FileTooLong \u2014 626 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 67% of them inside a single declaration: Engine (366-949). The bar is 500 significant lines; this is 126 over it, 1.25\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/engine/src/core/engine/tool_execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bba36e53134e76433866f43411098182fa0105ed73e2c2848d56ba417658e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.start_mcp_session_boot: MethodTooLong \u2014 start_mcp_session_boot runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":9430}}}],"partialFingerprints":{"codehealthFindingId/v1":"248fd541773ed154871374a9b1824986865a116941d680995e89fe43fe5fa27e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::core::engine::turn_loop::preserve_tool_output_before_fanout: FunctionTooLong \u2014 codewhale_engine::core::engine::turn_loop::preserve_tool_output_before_fanout runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dea24f1d7254b8e5e811690dc0226899f6943c997e2a5eb2ecd0d7e2b9e39f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtensionHostManager.ensure_host: MethodTooLong \u2014 ensure_host runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"52051a308b8410ae247b9277971c49abf614c81ace453aa611e01ee5b7ef53bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionManager.load_session_snapshot_with_limit: MethodTooLong \u2014 load_session_snapshot_with_limit runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":5379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c707a6d9126c195fb0c2c8077b4ddf880e8334af807ec990c6eb6244ccb053f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::config::normalize_model_config: FunctionTooLong \u2014 codewhale_runtime::config::normalize_model_config runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8979}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee573d9feef0004b5a0f94471e2baca5c1515dc98ce2ed5fa52935461ffae4eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::groups::config::status::format_status: FunctionTooLong \u2014 codewhale_tui::commands::groups::config::status::format_status runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/status.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"05016be4407e539190caa02efeddadacf844ca6925fefa946d2bcc1a3ebceef8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExecCell.render_with_locale: MethodTooLong \u2014 render_with_locale runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b39a549185e50ad2e1e4db7d0c49161dd279cff83dbc82d9bf74c1fdd777f4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/fetch.rs: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 123 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/fetch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b38b73e8c58bc6cc8f45db9025e059a34d90f88d8485c014bce2b785511e56"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pet_watch/mod.rs: FileTooLong \u2014 623 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 123 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ee81211202e481569b277ab6732bae0bdb7f9cbbd7e015064ffa99ec9da8c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/adapt.rs: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/adapt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2acd4c449a34e35539cbb7fa27593a4ab8962fd98ef9847517963e05736468"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/export.rs: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9613cfccd7a2d91838d8bb89fe0e88a3b81c3622836f37e1f4714c3b9b184407"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/provider_readiness.rs: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_readiness.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee672a80e2ca9c2267df3365ebb3675a5a82fea6c12ed6ae75af423c7f26cee3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_config::model_normalization::normalize_model_for_provider: FunctionTooLong \u2014 codewhale_config::model_normalization::normalize_model_for_provider runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/model_normalization.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cd4fbd6027376d7eebf1a5f5f2ea18031c6409eb53c8b7860bab373ad844a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.build_tool_context_for_turn: MethodTooLong \u2014 build_tool_context_for_turn runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":8484}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20a0d052f86105afcdf6d31ad4ef2b75f578f5947a596bf2512bf4448266a61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::route_runtime::resolve_runtime_route_for_identity: FunctionTooLong \u2014 codewhale_engine::route_runtime::resolve_runtime_route_for_identity runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_runtime.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a5b1705698cb59b6919e261fb99bbb8712e2d48090363bbc99a3423b26746d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::task_projection::refresh_active_task_panel: FunctionTooLong \u2014 codewhale_tui::tui::ui::task_projection::refresh_active_task_panel runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/task_projection.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdbc3e7bcd6b38e9b642ca43c7458818a3d87eccb63f3f858a429cb252cd7f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lens.rs: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: Store (2 blocks, 113-757). The bar is 500 significant lines; this is 117 over it, 1.23\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/memory/src/lens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4037010b2186d62b8b1ed885362b58b0de45648e7f8e75c090cdccc40354cb6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CatalogOffering: TooManyFields \u2014 37 stored fields beside 11 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/config/src/catalog.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f65d53dfbb71e28ad6cdf577c2d8016547db6a259575a8460972d782580ede3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ConfigStatusView: TooManyFields \u2014 37 stored fields. 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/command-contract/src/config_policy.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"334df0a0806775da0048f0bd25afb526797ae66bc4e8b61115ba17c394355793"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::sessions::save_session_in_runtime: FunctionTooLong \u2014 codewhale_app_server::runtime_api::sessions::save_session_in_runtime 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/app-server/src/runtime_api/sessions.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"6118f19e556e952f83aaac29f3fb0bed54f3859f4787e0175f5502b636b9c249"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::thread_history::snapshot_in_runtime: FunctionTooLong \u2014 codewhale_app_server::runtime_api::thread_history::snapshot_in_runtime 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/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"128fc855fc52095e5ef1b0782764e6a3569be67eb46f772e9e50873e9bd765ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::update::compiled_host::prepare: FunctionTooLong \u2014 codewhale_cli::update::compiled_host::prepare 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/cli/src/update/compiled_host.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e911b83972e9a0feb429fd1474a81b14b8d9bc8e8ad2dcdf284793e6230939e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::coord::wait_for_activity: FunctionTooLong \u2014 codewhale_engine::tools::subagent::coord::wait_for_activity 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/engine/src/tools/subagent/coord.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"6371bfb4ec397fe0f832d2aacbc03739e8a92fbc60e4b4f31681c4af30b2fa61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui_kit::markdown_render::parse_inline_spans: FunctionTooLong \u2014 codewhale_tui_kit::markdown_render::parse_inline_spans 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/tui-kit/src/markdown_render.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"109d4a67ad3ae32152cc2ec03703e683687390f64bdfe6a4cadf0c50a4c728f4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AcpServer: ClassTooLong \u2014 490 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 2 blocks, lines 172-832. The bar is 400 significant lines; this is 90 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/acp_server.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d5a7575d59fb9e5a106c4a5631541626f65404be7150ccb7a638aa01411cf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/child_host.rs: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: Engine (5 blocks, 41-764). The bar is 500 significant lines; this is 112 over it, 1.22\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/engine/src/core/engine/child_host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad841f08628b9090de0cc14133807e15beec918c495775f0671cb93cd25d493"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/route_billing.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/engine/src/route_billing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bb01709674080b46338e71aa24d04d4a7589547d5107f6cf5ed0584e139e7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/user_registry.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/tui/src/commands/user_registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d5fab63257fec26cd467d18e432cd8d8ca25177ec449724b95e2ef0c137af3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: content/faq.tsx: FileTooLong \u2014 610 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 110 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":"web/lib/content/faq.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae10fbb6190f456c53ebf594ee90e17d4d1cc0048324330b1744b461de1da80"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EnvRuntimeOverrides.load: MethodTooLong \u2014 load 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/config/src/env_overrides.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7495a2104f92140e402c286a61a3273f6803b5f13e04c56145503c57e6fd72e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::client::baseten_to_catalog_offering: FunctionTooLong \u2014 codewhale_engine::client::baseten_to_catalog_offering 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/engine/src/client.rs"},"region":{"startLine":6755}}}],"partialFingerprints":{"codehealthFindingId/v1":"7879bcb70dc049355e89e7af2769535b9bc51dc4f359b256f37f68c304fc34c9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoordinationLedger.reconcile: MethodTooLong \u2014 reconcile 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/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd7ae440cb66509621cc2f91b9272a1669ceedb7026966bbdf10f94b878bf081"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProviderPickerView.new_with_runtime_status_and_memory: MethodTooLong \u2014 new_with_runtime_status_and_memory 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/tui/src/tui/provider_picker.rs"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d402ba4acf2e7e619d75eafce871e942d0c2fec4609653ecf7c143000c7aa78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::frame::render_info_row: FunctionTooLong \u2014 codewhale_tui::tui::ui::frame::render_info_row 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/tui/src/tui/ui/frame.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"da889c172d26a6f79f9d46b8390dd0480e4c30118bf14fb572b346f42ee3efd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: product-usage.createUsageRecorder: FunctionTooLong \u2014 createUsageRecorder runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"web/lib/telemetry/product-usage.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0d9791ec0cbe3f76a88ab410df3d0374a9fc5848523e71300fbc42dceadf15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/persistence_actor.rs: FileTooLong \u2014 605 significant 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 105 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/persistence_actor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d445395d5f644e1c2d1fc2835b827dec3d29bb868dfed676d72f9712c0f28ead"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::conformance::mcp::server::answer: FunctionTooLong \u2014 codewhale_tui::conformance::mcp::server::answer runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/conformance/mcp/server.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f916b5bb2eac3c4d3df46c59600e3b55e8970cb526c16b17abd274420ba3ea8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::command_palette::build_mcp_entries: FunctionTooLong \u2014 codewhale_tui::tui::command_palette::build_mcp_entries runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0230decc3fd33e888cfeed78950f1b68e61d0236561d0f4729c21b453754d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HelpView.render: MethodTooLong \u2014 render runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/help.rs"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0e2fc841b1754255963bfca70b5421a3c5f8295182a26b30be59f53479b615"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.ComputerUsePage: FunctionTooLong \u2014 ComputerUsePage runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/computer-use/page.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a62c8572d14861e935e355aa4a855585410811c79ccffcb4054f181944657b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.ModelsPage: FunctionTooLong \u2014 ModelsPage runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/models/page.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c181e155320e20031d500bba8e3005c811fc906206a0c11a58fc1489c48ec6a8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RlmTool: ClassTooLong \u2014 483 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 4 blocks, lines 73-772. The bar is 400 significant lines; this is 83 over it, 1.21\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/engine/src/tools/rlm.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09d6c7db86f691392675d08b5e1094cf33f6de45bb638984b16b05fbe101411"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ToolRegistryBuilder: ClassTooLong \u2014 482 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 59 methods, 3 blocks, lines 892-1760. The bar is 400 significant lines; this is 82 over it, 1.21\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/engine/src/tools/registry.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf46701258456585aa4f5a241832f24c8b1b8631b096876e1b8fb1116ac390a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/events.rs: FileTooLong \u2014 602 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 102 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/events.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb673c02321b9838a39468e695b7795df0cc16f097fbfc0fa0a35ec3ed4b16f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SubAgentManager: TooManyFields \u2014 36 stored fields beside 200 methods. The bar is 30 stored fields; this is 6 over it, 1.20\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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":3973}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f2390a596baf344c2a07fae2cc9f1f56ff55beffad90eab083e467d24c1ec4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: codewhale_tui::tui::ui::overlays: TooManyFunctions \u2014 36 free functions. The bar is 30 free functions; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/overlays.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f5b7c284764e234c8fd886b912035670554e801e777cc3ff45a12cea724428"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetManager.drive_executor_tick: MethodTooLong \u2014 drive_executor_tick runs 120 significant 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 20 over it, 1.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":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"34fa4281e8ae380b450430f04696ca1cb961339f4667a7741ebfc0de7e930b86"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_skills::mutation::install_remote: FunctionTooLong \u2014 codewhale_skills::mutation::install_remote runs 120 significant 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 20 over it, 1.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":"crates/skills/src/mutation.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb60e840b3b62ddba2dcd0b84507323ba3b342daf0da2ca6e0539532dcec0283"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_skills::mutation::update_skill: FunctionTooLong \u2014 codewhale_skills::mutation::update_skill runs 120 significant 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 20 over it, 1.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":"crates/skills/src/mutation.rs"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb22e8f6cb5af6c574688ce65bfef89fe45fbc2727f2eecefce0b5265b5cea8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::context_report::build_headless_context_report: FunctionTooLong \u2014 codewhale_tui::context_report::build_headless_context_report runs 120 significant 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 20 over it, 1.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":"crates/tui/src/context_report.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ef2f17f2f8217357999de50f3696a3d833f4f19966108da718879aff4f502c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client.rs: FileTooLong \u2014 599 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 99 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46349858101666709aaa7fbec16725910ffadca7a094d8f1e23a5dd9d0ee38d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComposerWidget: ClassTooLong \u2014 479 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 3 blocks, lines 157-840. The bar is 400 significant lines; this is 79 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dfe146969d6b1a6707a16f168cbf664642f02eaf64ffce4c970652a4b02b03"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BackgroundShell: ClassTooLong \u2014 476 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 3 blocks, lines 1131-1970. The bar is 400 significant lines; this is 76 over it, 1.19\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/engine/src/tools/shell.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c58cde585ffaaae772f7a14cdae67e266986944e4969c0adb15a3296178a8cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_config::catalog::offerings_from_models_dev: FunctionTooLong \u2014 codewhale_config::catalog::offerings_from_models_dev runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/catalog.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0d33e24759565d54ec5d49687e8236bac2f3f824932d35028ec42a7352c082"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RouteResolver.scope_selector: MethodTooLong \u2014 scope_selector runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/route/resolver.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87e99c5259163c10a51b2795176c5ce61edc65b84983fb9b7ea3d0b268a5faa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::provider_catalog_live::fresh_dispatch_pricing_quote_at: FunctionTooLong \u2014 codewhale_engine::provider_catalog_live::fresh_dispatch_pricing_quote_at runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae94d6495e669ef02c5fead7819943542e3965c334352d71b5d8a9a48ec97412"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::workflow_plan_approval::analyze_plan_object: FunctionTooLong \u2014 codewhale_engine::tools::workflow_plan_approval::analyze_plan_object runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow_plan_approval.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c999f77d93d7b9f7d86cb69e1a29a2c83777cfa9a7944b737bacde5628fd5e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_sandbox_command: FunctionTooLong \u2014 codewhale_tui::run_sandbox_command runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":13752}}}],"partialFingerprints":{"codehealthFindingId/v1":"024a982eeec0962ebe4b3b60b791e3fd92cbb3874616be2b3e15bc2c13050fba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::tool_routing::apply_workflow_run_record: FunctionTooLong \u2014 codewhale_tui::tui::tool_routing::apply_workflow_run_record runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/tool_routing.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4553afa429e0d5164e8d6202687812fc3318e9cbcfceaa7e4b5d936f9e34ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: operate_best_of_n.workflow.default: FunctionTooLong \u2014 default runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/operate_best_of_n.workflow.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b8d47544414df073eea30a792cfd7a6c86882d8d70fbe9235dc353bb6b26e6"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProviderDashboardRow: ClassTooLong \u2014 475 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 2 blocks, lines 346-1247. The bar is 400 significant lines; this is 75 over it, 1.19\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/tui/src/tui/provider_picker.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3907d1d78c1a3ffe2dd7cfdff7befeb8b02c0015fe7240dfa5d8bece6e54401"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ChildJob: ClassTooLong \u2014 473 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 892-1452. The bar is 400 significant lines; this is 73 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b7a8fe52f4d6104a35837b3342d4e96283f7a501e18eb0e4c13f2028c9e325"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: config/policy_messages.rs: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 91 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/policy_messages.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70406177e3ae3bc4b9f8434a38c32c2bc724c00ad8037a44418dbd4bad5d53b2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: NativeMemoryStore: ClassTooLong \u2014 472 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 31 methods, 2 blocks, lines 32-635. The bar is 400 significant lines; this is 72 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/native_memory.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d7abd634e9985b165e4f2eb525c02b46cc0320a55fdad494b55eee557a6675"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExtensionHostManager.reconcile_with_policy: MethodTooLong \u2014 reconcile_with_policy runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":2115}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df25dc979479a9d9c31a94f0ee0af4e833330f705fc5ba7a019940107db7b91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::prompts::system_prompt_with_instruction_assembly_for_host: FunctionTooLong \u2014 codewhale_engine::prompts::system_prompt_with_instruction_assembly_for_host runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2e0a51f6831b3344a1b7e870ca8ddcc6183aba5ee5120644b2cca66064fdb8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShellManager.execute_sync_sandboxed: MethodTooLong \u2014 execute_sync_sandboxed runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70663fdfaa76d8d6940575bfcc957d46e2c4c2e547c5f35d81e60fb90134020"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TmuxRuntime.start: MethodTooLong \u2014 start runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/runtime.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa21c021c9448580177be594d8e80a734f9227923bb388bb7257ce722272629"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommandPaletteView.render: MethodTooLong \u2014 render runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc6c60c7f42f380e0016571766b6fa42f0c67a852c99503d19603e219accc0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::dispatch::prepare_user_dispatch: FunctionTooLong \u2014 codewhale_tui::tui::ui::dispatch::prepare_user_dispatch runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/dispatch.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"d129c5c92753d31d73656edc3d4c73a7005020fa7e8234bfe8bbfc2bd30485e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/context.rs: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 89 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/context.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"625dcf6a0afe486bcf1db4debd2003dd0d602720aabd221311a4766da2db8288"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/workflow_plan_approval.rs: FileTooLong \u2014 585 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 85 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow_plan_approval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"889d0f1bc9a0c62ab26cd4d882642d38bdd6d5c36fa244d775f589e890e1c4b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_account_cli::work::launch: FunctionTooLong \u2014 codewhale_account_cli::work::launch 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/account-cli/src/work.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"178a1a4b8ed898fcdd0a8f1d1acc72c47244ed4fa6c9ec61b436b7c24327209e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::review_core::render_review_summary: FunctionTooLong \u2014 codewhale_engine::tools::review_core::render_review_summary 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/engine/src/tools/review_core.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f917cfcc4daabf3f15b1ecbbfc432bec561ebdc76d7d8497fab1b9bf340ec164"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::subagent::advisor::run_advisor_for_turn: FunctionTooLong \u2014 codewhale_engine::tools::subagent::advisor::run_advisor_for_turn 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/engine/src/tools/subagent/advisor.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"333268096b7eea42b5db5c609573344f3d0aea966585d52817c979601c9d74f5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoordinationLedger.register_claim_in_scope: MethodTooLong \u2014 register_claim_in_scope 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/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04330b6524a746d24235623b97c490f1f7da08964bb66c336e7abc68a4c4c37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChildJob.finish: MethodTooLong \u2014 finish 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/engine/src/tools/subagent/engine.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53b48f0a7a6ea92bb48ed6d40711de1a2f6399f029862af39282f92b97d3e0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::doctor_session_recovery_report: FunctionTooLong \u2014 codewhale_tui::doctor_session_recovery_report 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/tui/src/lib.rs"},"region":{"startLine":7101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6718574e671fa1b7ccc3c7718146d2833022e72c827d175434a167a77347cc02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HistoryCell.lines_with_options_folded: MethodTooLong \u2014 lines_with_options_folded 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/tui/src/tui/history.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39d66dbc75311e8443acd638aa9472d93d479a994833be01a4af265ea266993"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetDetailView.render_overview: MethodTooLong \u2014 render_overview 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/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"14732d32ea0c8b9dd52dee89d76f67b1d2bbccf41f6a666dff6abbe95f4d18f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::views::render_settings_category_strip: FunctionTooLong \u2014 codewhale_tui::tui::views::render_settings_category_strip 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/tui/src/tui/views/mod.rs"},"region":{"startLine":4950}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e20b0ef3e27ed1d044cf9ae6e4d16451848ef1c570d47cf15257238436cd5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: connection-banner.ConnectionBanner: FunctionTooLong \u2014 ConnectionBanner runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"web/components/connection-banner.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6573ed5342a6fb2813b2fa99f3a4c19576b877f56b6456c501e69f652e72002c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/git_history.rs: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 84 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_history.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd4210e9368e47b73c0497e67c675998849a47e4df38b94484c38173f1aa6c3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ModelPickerView: TooManyFields \u2014 35 stored fields beside 48 methods. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f8dce5da5771863452a1ddad07bdaa0b74a9673e7c188b8da4d92a8ef0100a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PagerView: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"7182fe93d0836e7b705059bc2e5884f23cc4f3dacd13e5270cceaf4e1a7256b8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SessionPickerView: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"762ea8796fe3154c3109cccb661bce9653b55b0b72e59557918ae959066f5d60"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CodemodeInvoker: ClassTooLong \u2014 466 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 5 blocks, lines 667-1355. The bar is 400 significant lines; this is 66 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/codemode.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1f60d7443867f1096c85d544655aa3fe483b441ed6fc06061aa698129445bc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ChatWidget: ClassTooLong \u2014 466 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 5 blocks, lines 10-1010. The bar is 400 significant lines; this is 66 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/transcript_legacy.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb713f497ed29ac9eace642acd2123e75db7b1185381ef37873974853337a01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/preview.rs: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: Engine (180-903). The bar is 500 significant lines; this is 82 over it, 1.16\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/engine/src/core/engine/preview.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf65861c85d74cb670bd8a373a651033faae73eca264405252b721c97c3d47f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::xai_auth_status_lines_for_provider: FunctionTooLong \u2014 codewhale_cli::xai_auth_status_lines_for_provider 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/cli/src/lib.rs"},"region":{"startLine":4784}}}],"partialFingerprints":{"codehealthFindingId/v1":"7267c565c0dfa9aeb234fde1969709827eac332b1f866407941190cfcc14c212"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_config::cloud_facts::scope::scoped_view: FunctionTooLong \u2014 codewhale_config::cloud_facts::scope::scoped_view 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/config/src/cloud_facts/scope.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c477ea7cd977744507ee68fb02b2eed6ffe7ca0e59ec6272fd092f9b6bc27e6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::extension_host::windows::edit_acl: FunctionTooLong \u2014 codewhale_engine::extension_host::windows::edit_acl 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/engine/src/extension_host/windows.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"31846bed863459c9f928f617d3a7e53735c046b45bd41b5ffc52ce21ef3198c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::read_media::execute_read_media: FunctionTooLong \u2014 codewhale_engine::tools::read_media::execute_read_media 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/engine/src/tools/read_media.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed17acec4cba0dfd105e527c5b72fc23ec00047249f7d34bbf77016135b192b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubAgentManager.commit_prepared_child: MethodTooLong \u2014 commit_prepared_child 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":10404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a582110d84af48fe31d9816c670b104d1a0fbaf3f0fab906fcbbf6cdb090a48e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui_kit::markdown_render::render_parsed_tagged_with_palette: FunctionTooLong \u2014 codewhale_tui_kit::markdown_render::render_parsed_tagged_with_palette 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/tui-kit/src/markdown_render.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a6869f9faf3dd28d20a28083509ff8326068348911145a88bd6877037ed302"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_setup_status: FunctionTooLong \u2014 codewhale_tui::run_setup_status 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/tui/src/lib.rs"},"region":{"startLine":5018}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44c2a6827d09d5f13f0acaf73af36cd19cdef8edddb79f466592e59faebcb1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::merge_project_config_with_approval_baseline: FunctionTooLong \u2014 codewhale_tui::merge_project_config_with_approval_baseline 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/tui/src/lib.rs"},"region":{"startLine":14262}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ce90af6ee1a8234cafa4a0298bc44af5cdaf7c708db4256dbae2cd9ba0ecd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mcp/external_import.rs: FileTooLong \u2014 579 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 79 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/external_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7de29e07ad74a6ea084061eccdd059b8813866347144be844b89fc99a2c6951"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: views/router_setup.rs: FileTooLong \u2014 578 significant 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 78 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/router_setup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80f2e4a575354970594f86c3f5cada019d06c5a199141f40c82e203a2f3278a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: views/automations.rs: FileTooLong \u2014 577 significant 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 92% of them inside a single declaration: AutomationsView (3 blocks, 74-857). The bar is 500 significant lines; this is 77 over it, 1.15\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/tui/src/tui/views/automations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b2154990a80d54729bcde602ab078fe91e5a494f1bdeb17098933f71a53a97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: render/mod.rs: FileTooLong \u2014 576 significant 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 76 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/tui/src/tui/work_surface/render/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"047a049f155ad8b4c1da8c44ab0c69be2f8137e5b0063edcb0394b68d8c5792d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::apply::apply_goal_snapshot_to_app: FunctionTooLong \u2014 codewhale_tui::tui::ui::apply::apply_goal_snapshot_to_app runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d7a9b0d4f3561d10fd684c9f2d02fd04a6fc829af8471351f8aee428a5027b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pricing.rs: FileTooLong \u2014 574 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: OfferingPricing (2 blocks, 242-765). The bar is 500 significant lines; this is 74 over it, 1.15\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/config/src/pricing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36db2cdc0d3bb6bd92208f209df10c96f1ea19de7e810927169bd7c07d5e5828"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: route/resolver.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: RouteResolver (3 blocks, 81-843). The bar is 500 significant lines; this is 73 over it, 1.15\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/config/src/route/resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f628c60e1422cdce3c8aede5a68ea725c42e7d676d876d19905723deed6b2f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_account_cli::work::bind_github_repo: FunctionTooLong \u2014 codewhale_account_cli::work::bind_github_repo runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/work.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"856200594438f19e0dbd9d82941ad55f036d4892bd8e69f68c7fe1ea82091eb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::update::uninstall::plan_path_blocks: FunctionTooLong \u2014 codewhale_cli::update::uninstall::plan_path_blocks runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update/uninstall.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae2e364338163d44be632f44fabbebcc89f592db74c5fb4cb00c358424fe0a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetManager.start_worker_task: MethodTooLong \u2014 start_worker_task runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede98e7caf01a9cb8afe8b51596359fc59400dd991b7cf314473b7926619b280"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pet_watch/full.rs: FileTooLong \u2014 567 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 67 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/full.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0df726c9b031b76df0028c29f7c700d1d8463f900a4bb101b66445ecc3eb4ae"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CommandContexts: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/command-contract/src/handler.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aed7aa4e13e12ed1e5701c1b4d0f9cb5cb526822443c17e567f00f39d16574"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FleetDetailView: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e9f3547e32f154202d00584c55c04ec643d07e530251b22423f710af3a1742"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ViewStack: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7979b5db563f633dc5d144a632285a7b1976d7a5600ba1402013c544f15eb0df"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: AgentWorkerRecord: TooManyFields \u2014 34 stored fields beside 2 methods. The bar is 30 stored fields; this is 4 over it, 1.13\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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de60bdbf3bf18983987869997111d3c795810de5b91010d965c93b877d485b7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: UserDispatchPrepare: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\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/tui/src/tui/ui/dispatch_prepare.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eb8a2dc290e8866cdddf676e958e2653cbb661099a2e636c79062df9f782b5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UserInputView: ClassTooLong \u2014 452 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 3 blocks, lines 84-738. The bar is 400 significant lines; this is 52 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/user_input.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e778f6a9b89a749a76a12b74df5719f3c77a6e64c25f2a80e4a8a148b966e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::automation_manager::reconcile_run_statuses_shared: FunctionTooLong \u2014 codewhale_engine::automation_manager::reconcile_run_statuses_shared runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3af7abb5823f6ba5e06e3118e3c944722adf8167fb890eda33d414e4416a3a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BrokerSession.spawn_with_auth_context: MethodTooLong \u2014 spawn_with_auth_context runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/process_broker.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34a251055f542ed9ef83d98c5a0114a9fa96c34baccb255bf8c2c59c231336e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.bind_fork_to_own_session: MethodTooLong \u2014 bind_fork_to_own_session runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":10594}}}],"partialFingerprints":{"codehealthFindingId/v1":"5529ee69151613cd2387f07cc46cb1ea7bdcec1a8d7a02a009d88da9a07a1b99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.settle_external_turn: MethodTooLong \u2014 settle_external_turn runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d49442462a3457addaa65e5779bed85c9afc2a0398cef350958bb696cebfe9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::read_media::process_media_file: FunctionTooLong \u2014 codewhale_engine::tools::read_media::process_media_file runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/read_media.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"9595c083a7a558210a87e59bdd8023d8ca323b5bbafd64e9f01bdba20f4de392"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::registry::copy_bundle_directory_fd: FunctionTooLong \u2014 codewhale_plugins::registry::copy_bundle_directory_fd runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":2581}}}],"partialFingerprints":{"codehealthFindingId/v1":"a612289ee1c49df97829d145e660a2add335bff6c5a8e54de46b627e2c1d675f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExploringCell.render_with_locale: MethodTooLong \u2014 render_with_locale runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1db3f1ae47d55102e2a2350617cc47b2e23fd94e0e152dd03bdcf98c1c239ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/doctor.rs: FileTooLong \u2014 562 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 62 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/doctor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eca73840ef01eadec0926b7f2f0efc5f49121a6623c5d25d8e9764ecd1027b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: debug/cache_format.rs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache_format.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"938255727807abac971036c38db793631752ba56814e2e974228a7fe04d19f3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_config::private_directory::open_owned_directory: FunctionTooLong \u2014 codewhale_config::private_directory::open_owned_directory 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/config/src/private_directory.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"beef3c62f94b70d162e611bcd1be9ef12be5e75c808a7c1b96a28b81ce52e5ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CodewhaleClient.translate_prepared_with_usage: MethodTooLong \u2014 translate_prepared_with_usage 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/engine/src/client.rs"},"region":{"startLine":3933}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2b82cf0b93c75939f11f59dfe1d7d1727b8d9b0bbff0fc109d130b6b45405b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::llm_client::rate_limit::provider_error: FunctionTooLong \u2014 codewhale_engine::llm_client::rate_limit::provider_error 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/engine/src/llm_client/rate_limit.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc0449cb443227450abf7221ba36b5dabad86bf3892fa838cffd8b06a5d45a88"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LspManager.intelligence_at_revision: MethodTooLong \u2014 intelligence_at_revision 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/lsp/src/lib.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b842291d18373102c66c984af51370190caa19f44ac6ea6d38ebcc0dabf0ddb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::install::update: FunctionTooLong \u2014 codewhale_plugins::install::update 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/plugins/src/install/mod.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"5003530655e438370a88447766a29a7cd60b8e079e08d75fecb79ccd256b7396"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HostProcess: ClassTooLong \u2014 445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 3 blocks, lines 1574-2386. The bar is 400 significant lines; this is 45 over it, 1.11\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/engine/src/extension_host/supervisor.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcfc09a94d76f57a2710181baae98536a57846d057930ef7866d8839eff2cdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::daemon_socket::attach: FunctionTooLong \u2014 codewhale_app_server::daemon_socket::attach runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/daemon_socket.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af5471e06050d4978fa4605d6054e518ec55d1aaf6e710f0cede5673c1cc2fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::client::chat::parse_chat_message_for_route: FunctionTooLong \u2014 codewhale_engine::client::chat::parse_chat_message_for_route runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":3814}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfbc013b448eb1ab22e0c220e4fb6b4c7ff04af5ba00338fb323a454f20c47f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalProcessFleetHostAdapter.start_with_kind: MethodTooLong \u2014 start_with_kind runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/host.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6186a0b495a071598ac273d79d43318db83f8379a7b03e0875a4e90b8af033"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::review_core::refute_claims: FunctionTooLong \u2014 codewhale_engine::tools::review_core::refute_claims runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"594dd1c245f1c04d4a155eaa692c24215d82db9ff4364d57590f24de1f3cd2fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpeechTool.execute: MethodTooLong \u2014 execute runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/speech.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71157b9ed6f2c641d41391d85fb2465edfa48d1dd5410de9c33622c2951b987"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::truncate::apply_spillover_inner: FunctionTooLong \u2014 codewhale_engine::tools::truncate::apply_spillover_inner runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/truncate.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5edddc7254edeaf0437f21417b7141ed35e954beab2020afaa625056ddbc396"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::contract::key_to_message_id: FunctionTooLong \u2014 codewhale_tui::commands::contract::key_to_message_id runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6973cf60b21caeb8f6ab79141366e2405530a8c4b2e6a41a460f31620ed56c14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::frame::build_preview_request_inputs: FunctionTooLong \u2014 codewhale_tui::tui::ui::frame::build_preview_request_inputs runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/frame.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"932e438dca546a0d759cf50e534048c9af7044b8f9115727278de7fa80c3968a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::views::help::build_entries: FunctionTooLong \u2014 codewhale_tui::tui::views::help::build_entries runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/help.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a5c89b1d02103b29c6e40237f814a871f96c17fc9a3cb40af7e1ad790d9951"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/account_login.rs: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: AccountLoginView (4 blocks, 52-611). The bar is 500 significant lines; this is 54 over it, 1.11\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/tui/src/tui/account_login.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1ea75c8e96a9f2acf76dfbcd83f213f1e45c72cdb85966938dffa38669ea4d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: TooManyMethods \u2014 33 methods, declared across 3 files: src/lens.rs (17), src/store.rs (15), src/hooks.rs (1). The bar is 30 methods; this is 3 over it, 1.10\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/memory/src/store.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea37745c034c48b6f7b0d6541397ab2d4435a158eae055be3ea794ae2c1fe634"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StateStore: TooManyMethods \u2014 33 methods, declared across 2 files: src/lib.rs (29), src/runtime_aliases.rs (4). The bar is 30 methods; this is 3 over it, 1.10\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/state/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"8581fa4c3210288f0311a23c5dc90656a865b45e9e69fcb689692074b2b09a74"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ConstitutionManagerCopy: TooManyFields \u2014 33 stored fields beside 3 methods. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/constitution.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"580f0ddfe8d0c50cec6e5876bc4dec63e533e78b00039fbac2d15b41308f2c97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MoneyUsage.add: MethodTooLong \u2014 add runs 110 significant 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 10 over it, 1.10\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/cli/src/metrics/stats.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fa87268051ffdb222c45176df6b26df719aab6994abfdd4ac8f7d0056bcec2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Collector.finish: MethodTooLong \u2014 finish runs 110 significant 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 10 over it, 1.10\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/cli/src/metrics/stats.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69a057523de6cf5c3663be9e0f32d11da5274c816da27d08f9fd98dd461104d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_commands::debug::cache_format::format_cache_stats: FunctionTooLong \u2014 codewhale_commands::debug::cache_format::format_cache_stats runs 110 significant 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 10 over it, 1.10\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/commands/src/debug/cache_format.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"529af1ecbe50636449e6ea5ec4146dcbc4382dedbdca74fdc35c76a450f3a22b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.prepare_rlm_model_step: MethodTooLong \u2014 prepare_rlm_model_step runs 110 significant 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 10 over it, 1.10\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/engine/src/core/engine/turn_loop/preparation.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f9b704a5016f56983affc852afe37cda637cafa9b9a783c3d6182448c16014"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::fleet::exact::freeze_saved_fleet: FunctionTooLong \u2014 codewhale_engine::fleet::exact::freeze_saved_fleet runs 110 significant 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 10 over it, 1.10\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/engine/src/fleet/exact.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"70841b140b83daee9b9850a1f53360447a6f8e23309f971e67ac80f3cf3f9e56"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::model_routing::auto_route_decision_recommendation: FunctionTooLong \u2014 codewhale_engine::model_routing::auto_route_decision_recommendation runs 110 significant 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 10 over it, 1.10\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/engine/src/model_routing.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"852127e25e442d66b371bc214d666cc858f7fe19d2db7981e09c261b0d5695e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::pet_watch::owner::serve: FunctionTooLong \u2014 codewhale_tui::tui::pet_watch::owner::serve runs 110 significant 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 10 over it, 1.10\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/tui/src/tui/pet_watch/owner.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8568d88e42d64d571b7f66d07fbdb050face9e4f342a845d84def4199cb68f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetSetupView.render: MethodTooLong \u2014 render runs 110 significant 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 10 over it, 1.10\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/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c10fa094d571385ed4970fc522c5b4d0f4a9cc56f77fe9864e5b65af62038b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::work_surface::terminal::poll: FunctionTooLong \u2014 codewhale_tui::tui::work_surface::terminal::poll runs 110 significant 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 10 over it, 1.10\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/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fef7b200387b38566bfdaa4224d8eb3f39fa3615a747990d2ae8f34df6b8bcb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SpawnRequest: TooManyFields \u2014 33 stored fields. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":2089}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9014af7cbe7b817f51fcc3bdb4b17944d036be62c45010ec59cb4328e9da103"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ViewportState: TooManyFields \u2014 33 stored fields. The bar is 30 stored fields; this is 3 over it, 1.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"96138abc296d6e2885aa4fa9c3aef05100498e0aefb684e4d54f0a3a8aba9e41"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RouteResolver: ClassTooLong \u2014 438 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 3 blocks, lines 81-843. The bar is 400 significant lines; this is 38 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/route/resolver.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd1efe4fa21d3c13cb479ab5a568b7b1a57f0ad934f60f282815658245b9e43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/user_input.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: UserInputView (3 blocks, 84-738). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/user_input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69231843ea31f3559beedac2e41c1a05eceeb2a9582999d696e2dd8a57168fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::thread_history::settle_prepared_history_operation: FunctionTooLong \u2014 codewhale_app_server::runtime_api::thread_history::settle_prepared_history_operation runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2e2fde5c8ebafa3aeb8a2fe040f3ac16a0c95b6460c883c24eb20dda8fd56d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_cli::run_lane_command: FunctionTooLong \u2014 codewhale_cli::run_lane_command runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac31de69efd721f2f168ae97693c0e908cc1dadd82ac033b435abb1f7d72f66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::compaction::compact_messages_safe: FunctionTooLong \u2014 codewhale_engine::compaction::compact_messages_safe runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d2893949fba3a4d85d5392d9a54fdfe00f4c2c0548d0011375ad4c1c1e6b6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::core::engine::tool_preparation::prepare_tool_call: FunctionTooLong \u2014 codewhale_engine::core::engine::tool_preparation::prepare_tool_call runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_preparation.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"974ef703cf6ca77d986b0763a3becd5da6401c918b62bbf5f913a1584f073824"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::superfast::evaluate: FunctionTooLong \u2014 codewhale_engine::superfast::evaluate runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/superfast.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d768321672aebe375451f63fd126a1d809434cb30d90c2dfd6c4058138b29773"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FetchUrlTool.execute: MethodTooLong \u2014 execute runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/fetch_url.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6433683c4353b97ad9db6150e2c6fb6e8f77ee8c4acbe8c51a0f9482f17e8dd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoadSkillTool.execute: MethodTooLong \u2014 execute runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/skill.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a496d27f6ccac73167d4c10220786353fe160891e444ad7b49c9e183bc27d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubAgentManager.record_worker_source_admitted: MethodTooLong \u2014 record_worker_source_admitted runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":7632}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbb08b00c26eed0f74ca755625dfad3e31c843c118afc776ce0fae05d387912"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SubAgentManager.followup_child: MethodTooLong \u2014 followup_child runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":8459}}}],"partialFingerprints":{"codehealthFindingId/v1":"b503628020413c3b5f6f4f6e3b601804187b551b9a4accb9b69ee02bd15fa2a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::web::fetch::fetch_attempt: FunctionTooLong \u2014 codewhale_engine::tools::web::fetch::fetch_attempt runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/fetch.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e7888310ea66d17b22ba2e27e0804a7288efba68b17d3d62cccdf7466c1f32"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::marketplace::parsers::kimi::parse_kimi_entry: FunctionTooLong \u2014 codewhale_plugins::marketplace::parsers::kimi::parse_kimi_entry runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/kimi.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afa166e5feeadb28266f9e5c7d8c735090f70f7fde65c4c58d0dd00b4d58e66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::contract::config_policy::project_status: FunctionTooLong \u2014 codewhale_tui::commands::contract::config_policy::project_status runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/config_policy.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6b3a88fd178e4690bdd37ab1c64654f58b6b4130fb4a60a7acad67f1366849"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::integrations::cli::print_status: FunctionTooLong \u2014 codewhale_tui::integrations::cli::print_status runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/cli.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbf734d87f72f30cf7783b9ac37ba695cef14e66762991d4ac5af70950a73b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::integrations::dsh::compute_status: FunctionTooLong \u2014 codewhale_tui::integrations::dsh::compute_status runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/mod.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a7559f6102e47b97c44f8092122fdc8947fd287cbcd7d17d41120e5058181c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::model_picker::assign_default_sections: FunctionTooLong \u2014 codewhale_tui::tui::model_picker::assign_default_sections runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"54533a9bf926b186b1b65b7387042c54ca30a84a52e9046dee183f33bec27679"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::pet_watch::render_tank: FunctionTooLong \u2014 codewhale_tui::tui::pet_watch::render_tank runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/mod.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b579fefc04f0f6b375f51d58c38967c08d2a08e35514a1206e5ebda8ee3b23"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/verify.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/verify.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c485ab9093dfd52cc6dcf59534d42963f864aa243253386902236e4b107e411"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/agent_focus.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 43 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_focus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2726006f4a201606f787025fce80309394ccb42e2e8a4af2b2bd6464014bc6f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pet_watch/live.rs: FileTooLong \u2014 542 significant 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 42 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/tui/src/tui/pet_watch/live.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f8535c1c4542f8e8c3019f24ad37be4e941f4b40b9cf2151880ff7c0043a2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fleet/roster.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: FleetRoster (2 blocks, 78-799). The bar is 500 significant lines; this is 40 over it, 1.08\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/engine/src/fleet/roster.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28af450b0187338a42677b944887ef95f8de55025165adc8cea8559995312047"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_account_cli::run_computer_files: FunctionTooLong \u2014 codewhale_account_cli::run_computer_files 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/account-cli/src/lib.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d1a3503326a2688a477ed00298a5e00301ce1a903f5efa0843bd653e2be86b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::tool_result_retrieval::stream_evidence: FunctionTooLong \u2014 codewhale_engine::tools::tool_result_retrieval::stream_evidence 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/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf9e405b3cf49d5d610c5d2d7943160d6bba6fcdee3c6e5e4ad6182a4f99a91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::install::dsh::parse_yaml: FunctionTooLong \u2014 codewhale_plugins::install::dsh::parse_yaml 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/plugins/src/install/dsh.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f1c21a8215167225039073ec6cfd0395b7cc9f15bec2c493ede633e9b08dcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::tool_history_repair::repair_tool_call_pairs_inner: FunctionTooLong \u2014 codewhale_runtime::tool_history_repair::repair_tool_call_pairs_inner 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/runtime/src/tool_history_repair.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6a6611e6f94943babbfe82d2ae3261916bcb75a33702a5a054399acde3dcb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::groups::skills::skills::list_skills: FunctionTooLong \u2014 codewhale_tui::commands::groups::skills::skills::list_skills 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/tui/src/commands/groups/skills/skills.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"512a24bc6d584eb3564379827c7fe5164cbd4f8edc7b7bbaeecbecca38cce44e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session_tree.rs: FileTooLong \u2014 538 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 38 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/runtime/src/session_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c5ffd26f616425e685f996b7d22d05739c92eb8ae34fab6ecd39d2b86c4820"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/provider_toml.rs: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: ProvidersToml (2 blocks, 197-675). The bar is 500 significant lines; this is 37 over it, 1.07\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/config/src/provider_toml.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0c40b9467472ee05ec11facbf1dfec8b873cfc2057d3459a1f43116c53500d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/account.rs: FileTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 37 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/account.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75beab502cc19e1cc6b64cb0accaf202125f54ce1d8465a4c4440eef8ddd40ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/dispatch.rs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/dispatch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4275c9cb4d393fb0b365e3e89a66b22f89aa9c97ff595d7b0c6410247ddf47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/search.rs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"decd6c61527633c2d0bc24f560c74ba756ca8c523a1a7a95c787427d237f57dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: views/skills_manager.rs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: SkillsManagerView (3 blocks, 64-753). The bar is 500 significant lines; this is 36 over it, 1.07\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/tui/src/tui/views/skills_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a601edac9098839981724dafd2646ed7cb67d2ecc74eba4e9365a76222b15e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HelpView: ClassTooLong \u2014 428 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 4 blocks, lines 130-1355. The bar is 400 significant lines; this is 28 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/help.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"71951e76061ee9f1ef0c1e268823deba47c508ccdb245e1a249f788f5c7eeadd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SdkTransport: ClassTooLong \u2014 428 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 4 blocks, lines 732-1263. The bar is 400 significant lines; this is 28 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp.rs"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75d0dfad772a1e4ec8451b292d71990c484fbc8bc0e793d36c3b19593b67f2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::builtin_commands::assemble_snapshot: FunctionTooLong \u2014 codewhale_app_server::runtime_api::builtin_commands::assemble_snapshot 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/app-server/src/runtime_api/builtin_commands.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dbda24cb091c9e4eb3ee0f2e7a3c5607575cf5f91e39a688c39c530711d796"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::client::responses::build_responses_wire_body: FunctionTooLong \u2014 codewhale_engine::client::responses::build_responses_wire_body 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/engine/src/client/responses.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cccc11cab84bfa97701d80d93eadfedf425d651d720bd33fe8c677cb4f46c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebSearchTool.run_volcengine_search: MethodTooLong \u2014 run_volcengine_search 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/engine/src/tools/web_search.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e08fa6c650c0f2d6e4462876cd1b70ecd7fb41edf56567e3e58309987725f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ToolServer.invoke: MethodTooLong \u2014 invoke 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/memory/src/protocol.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e87159ea3aed31745e80c47faef888689fb5c3b71b437684acd5d1ba146c7e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SkillRootCatalog.build: MethodTooLong \u2014 build 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/skills/src/roots.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc32a71857b53e5761fc940bb6f82521c5a36683af5e728e818f26b3765ee358"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.VocabularyPage: FunctionTooLong \u2014 VocabularyPage runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"web/app/[locale]/docs/vocabulary/page.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fb4f32fffd8b0b794d7dfd2ef68d88ac70673826ebc5314a972b82d9b6dd7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: llms-txt.installLines: FunctionTooLong \u2014 installLines runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"web/lib/llms-txt.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"290324db9d7c4284e90c225b3bbb89c9bf9ef17ec483a388955213a03d60abce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CommandContexts: TooManyFields \u2014 32 stored fields beside 34 methods. The bar is 30 stored fields; this is 2 over it, 1.07\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/command-contract/src/handler.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f0b8ebae76e5dd4473511c82e873dd7ace5d0d4d1ba0b2de57e217fe8e27de"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HookExecutor: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"935d34176c6bd0dc03cfbbaf45854803f9d7d725d1d07c22345b778453a97291"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ThreadStore: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3aa280be5542e5ba0365469d7e71c964bf29b3f1b3f1560a45f716160de3989"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: PetWatch: TooManyFields \u2014 32 stored fields beside 15 methods. The bar is 30 stored fields; this is 2 over it, 1.07\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/tui/src/tui/pet_watch/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"138ce2cf963d4b220a4ce64b7438a95abf479f2ee0609cae68a1a7e2041f49d9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CommandContextBundle: TooManyFields \u2014 32 stored fields beside 1 method. The bar is 30 stored fields; this is 2 over it, 1.07\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/tui/src/commands/contract.rs"},"region":{"startLine":5052}}}],"partialFingerprints":{"codehealthFindingId/v1":"22aef678b5292ceb932f4b335bd553dcdf5e03fb80c0d599b9afa99ff5c78d8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ExecStreamMeta: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\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/app-server/src/exec_agent.rs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"df945c857d7bd92e60f0c26ed154d89630b50e4ab1e6f389bef2dcbbc3b5cd0a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GuiConfigResponse: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\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/app-server/src/runtime_api.rs"},"region":{"startLine":13388}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac8e4035b7e16597066d883e2ef71ba2d51ea8cf9f2fddff363ffd9161dcde6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ContextParts: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\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/command-contract/src/handler.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1ed2bf970b86971cbc0036ad5fb229415f8eabcc37c497854631b81e41a47e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: AccountClient (2 blocks, 60-486). The bar is 500 significant lines; this is 30 over it, 1.06\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/account-cli/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1fd79fbd69309ae4007073ccf49fb893c23ce1969734ec56f29943cd1c5a88"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engine/approval.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: Engine (220-676). The bar is 500 significant lines; this is 30 over it, 1.06\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/engine/src/core/engine/approval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a664a93c5186041137c17d43848c2e655fb90779ee3f2bba9a599c0859cf59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/automation.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 70% of them inside a single declaration: AutomationTool (4 blocks, 59-557). The bar is 500 significant lines; this is 30 over it, 1.06\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/engine/src/tools/automation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a63b0ca6181fc260a8e36f1d69baed55c52c571a0e6c6616a9b316bced4bbf4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: project/init.rs: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/project/init.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48849b20f15126feaec3436a8a3c9632f868d626096c895bb45b9cca6743b1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::remote_setup::bundle::render_runbook: FunctionTooLong \u2014 codewhale_app_server::remote_setup::bundle::render_runbook 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/app-server/src/remote_setup/bundle.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87fb410e4989639095db8f69e17ccb0c9a207c597fff45a35e4923240691ab8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::client::openrouter_to_catalog_offering: FunctionTooLong \u2014 codewhale_engine::client::openrouter_to_catalog_offering 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/engine/src/client.rs"},"region":{"startLine":6926}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2951b0e1e3d226036466c9d4c9742a2f2d9e8aaf085e937a2a8e02b8648424"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.repl_fence_blocked_reason: MethodTooLong \u2014 repl_fence_blocked_reason 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/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7297778b8b53262278e7d0ce1f6d6b211e04bf78f6e5e56b2e9f77bb92a944"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::git::git_commit_plan: FunctionTooLong \u2014 codewhale_engine::tools::git::git_commit_plan 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/engine/src/tools/git.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"1275992ce0a9f5481f8853ed2a2da36d052fe5293de1338c1b7fd5d70ccd4cc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::lsp::execute_read_lints: FunctionTooLong \u2014 codewhale_engine::tools::lsp::execute_read_lints 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/engine/src/tools/lsp.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab12e39acf3702b43e9a2baebdc91db6b491743200a4cd0cf5b9d786f7966e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::workflow::structured_plan_to_workflow_spec: FunctionTooLong \u2014 codewhale_engine::tools::workflow::structured_plan_to_workflow_spec 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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2826}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c6851e3ee17e9c9089ff1c6a9f224282e8c2b9f19289274c2bd4a8373465f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::work_graph::reducer::apply_pure: FunctionTooLong \u2014 codewhale_engine::work_graph::reducer::apply_pure 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/engine/src/work_graph/reducer.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4e920a0539cc1a394962dad58766141b59144ce159044a8d9fa165cb4cfc55"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::config_persistence::migrate_legacy_route_preferences: FunctionTooLong \u2014 codewhale_runtime::config_persistence::migrate_legacy_route_preferences 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/runtime/src/config_persistence.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3fc8b1eb925ecfa7c218e02dc8df20ca359b0beef299f0e69d3c9e0c0e8adc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::commands::groups::plugins::marketplace::render_candidates: FunctionTooLong \u2014 codewhale_tui::commands::groups::plugins::marketplace::render_candidates 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/tui/src/commands/groups/plugins/marketplace.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"8048b67ed2f915d3933fbf7f236f26dbae1389b9114f7237a419cd1f24ec14ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::doctor_setup_report_json: FunctionTooLong \u2014 codewhale_tui::doctor_setup_report_json 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/tui/src/lib.rs"},"region":{"startLine":8346}}}],"partialFingerprints":{"codehealthFindingId/v1":"071d572be2c9329eaf454fd549eccb4203cad99d3b548de4b3180c19abd4e004"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::context_inspector::build_context_inspector_text: FunctionTooLong \u2014 codewhale_tui::tui::context_inspector::build_context_inspector_text 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/tui/src/tui/context_inspector.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5aec7bc0b8d27e3dba0a8fac46838271a2c8d7fb635fa7c8617d97d39c1aad3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SessionPickerView.handle_key: MethodTooLong \u2014 handle_key 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/tui/src/tui/session_picker.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e3cf6c6666fec820431f233b12bd0acd565f687f8483a7f32a13d6cbcdc38b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AccountLoginView: ClassTooLong \u2014 420 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 4 blocks, lines 52-611. The bar is 400 significant lines; this is 20 over it, 1.05\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/account_login.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da63a334de62a803dd29cd34f76d0f0de5a9e2b56a6a320ceed2fc8731fbbad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skills/skills.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 25 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/skills/skills.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0d62dfb13429793f4d2a632fc0836cd57c6a14a9eba36329e6328a9994bc58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AutomationSchedule.next_after_in_timezone: MethodTooLong \u2014 next_after_in_timezone 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/engine/src/automation_manager.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"106bb6bdc2034c76892353dcc78d8226b80746ad9f82b6c1dae33a8743f3b586"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::client::chat::build_chat_wire_body_with_window: FunctionTooLong \u2014 codewhale_engine::client::chat::build_chat_wire_body_with_window 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/engine/src/client/chat.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d836d99ac9d86e9832f96060589e5d11c05a74c1589864ee883566487aa77f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HostToolSpec.execute: MethodTooLong \u2014 execute 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/engine/src/extension_host/tool.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"9795c14958c8f04c8a426d772c85a7bccd24526a70db0a26aab958427e663ed5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::install::dsh::admit_host_compatibility: FunctionTooLong \u2014 codewhale_plugins::install::dsh::admit_host_compatibility 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/plugins/src/install/dsh.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"e292dba2877303e10e28c63c538ed6b23df233e04c4401e40da2982158d2f5b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_plugins::marketplace::parsers::codex::parse_codex_entry: FunctionTooLong \u2014 codewhale_plugins::marketplace::parsers::codex::parse_codex_entry 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/plugins/src/marketplace/parsers/codex.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6340944ea8e1a1cc7160f7736cd9e50112c4b503150696caa454563255ef827"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui_kit::markdown_render::render_line_with_links_tagged: FunctionTooLong \u2014 codewhale_tui_kit::markdown_render::render_line_with_links_tagged 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/tui-kit/src/markdown_render.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb073398340df27fb288dba32dc35c9b1f75cbe196bbddf7c3d616cde9ef2d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_with_args: FunctionTooLong \u2014 codewhale_tui::run_with_args 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/tui/src/lib.rs"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"1585cc3e91f80cdbff130149802b0d198d5ce71592c8611f78fd6df06634770e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::pet_watch::tick: FunctionTooLong \u2014 codewhale_tui::tui::pet_watch::tick 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/tui/src/tui/pet_watch/mod.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"551115f9c8c490a32774b0e35074d60c3299eb32288476f2c898655459dab4e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::views::extensions::marketplace_model: FunctionTooLong \u2014 codewhale_tui::tui::views::extensions::marketplace_model 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/tui/src/tui/views/extensions.rs"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6716315b4c237344ecfed299890bf6ce8831313355a3ffee98decfc7c31fbe6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetDetailView.handle_key: MethodTooLong \u2014 handle_key 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/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fd411d16072d4755fb714b1a5116656ded41f1325d85f19f80abff304ec114"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: faq-search.FaqSearch: FunctionTooLong \u2014 FaqSearch runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"web/components/faq-search.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e395ca2dd907e2658a10199ac1666e60151a7dfa32a5d6b46403de4ce210cab9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime_mobile.html: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_mobile.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df048a9dbc9507a72a54ca725ecec5d09d2347551acb543dc7832affda3a27a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/native_memory.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: NativeMemoryStore (2 blocks, 32-635). The bar is 500 significant lines; this is 22 over it, 1.04\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/runtime/src/native_memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e575d1f0a2cd8285cc91475e9cae3cb1e5778f31285782744bf001bcc3a65b9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/provider_native_search.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"639bae42d36d7ec7bed062cbbfa9e64a9ad90ea965afc7524dd281cde6b05c0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/turn.rs: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/turn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34902a1b5643e6de4a7cbafd19b75d266b14b355c407b2f6e8af528a953bbbf4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/model_inventory.rs: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: ModelInventory (3 blocks, 113-640). The bar is 500 significant lines; this is 20 over it, 1.04\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/engine/src/model_inventory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6020c4d1ae6127392e65e6dad50cde9920833783b6fce4c07f3b0a3e32fa5541"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::computer_display::run_session: FunctionTooLong \u2014 codewhale_app_server::runtime_api::computer_display::run_session runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/computer_display.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42208f49569607f46ad05f9122ce5a329df6bbad1950ca4ba4b09f70af32464"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::core::engine::tool_catalog::execute_tool_search_inner: FunctionTooLong \u2014 codewhale_engine::core::engine::tool_catalog::execute_tool_search_inner runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_catalog.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"433a4a612e4dc58f3a2aa926af65ae8f2c7789c93f55c8c46626624a04d28e76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::extension_host::supervisor::native_runtime_libraries: FunctionTooLong \u2014 codewhale_engine::extension_host::supervisor::native_runtime_libraries runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7795323fde499582c5840f6fdc1a4bd42577ace6539d37883cf03cc2cf33505"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tool_inspection::portable_projection::tool_snapshot: FunctionTooLong \u2014 codewhale_engine::tool_inspection::portable_projection::tool_snapshot runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tool_inspection/portable_projection.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e5b6c0924cff5b69bbb68eceaa6d3c84258f6b50edb991007e39ceeae42566"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_lane::control::lane_one: FunctionTooLong \u2014 codewhale_lane::control::lane_one runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/control.rs"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a50f311906b9944690a39aeed5f79e4d05073580d8ee0d9babdf7147e0867c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::file_mention::stabilize_screenshot_references: FunctionTooLong \u2014 codewhale_tui::tui::file_mention::stabilize_screenshot_references runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfe59f128ad835874a2ea1ee65723a89f95d0cacdecf809e75d724ee1895ee6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::model_picker::render_picker_model_hint: FunctionTooLong \u2014 codewhale_tui::tui::model_picker::render_picker_model_hint runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":4015}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d153c8e41bf972ce4af38483911358fde303ac6e26c1d838e617aff827e6a77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pet-recorder.createPetRecorder: FunctionTooLong \u2014 createPetRecorder runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-recorder.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a91b74ec05ff8e4057ed6b8347ccb4ef6aba3915785c87e785b54b30247eb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/utils.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e18dd676043db1d53abd11d486e615d5d8d6666988b45b9c2097620f235b5b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/schema.ts: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 18 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"713ad8d6e7399a4decff8715f9d85ceedd3699c3f088c92f8ba5d7adc897d421"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/purge.rs: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 17 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/engine/src/purge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e552b9f2ba0430a99213044ca4cc93e2c3b38132f8ce4b020b6099163ef85dfe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NativeMemoryStore: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/native_memory.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"08823ca7ff61c1ab65df43df9291a438e762663dc91693b8ab2783a6f1cfc25d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Settings: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6502fa0580230376b21393ee2e0d7d2e0c7b0e6e9f0c245f9780bb30208ea41d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChatView: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d935ebfbd3d0ba9d2ce64506af525c758233dc41ce01dc2f102172c825678db0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SubAgent: TooManyFields \u2014 31 stored fields beside 2 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":3790}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cea1aa1d9f703716c6d7d01fa1f301c3795babd95f5cea75ae75ad8d9010a67"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::config_rpc::process_app_request: FunctionTooLong \u2014 codewhale_app_server::config_rpc::process_app_request runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/config_rpc.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c037521eeb8ad0094e3e2705ac3f40685f0eb4e4be72bfe5d0380d262713f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_api::sessions::create_session_from_thread: FunctionTooLong \u2014 codewhale_app_server::runtime_api::sessions::create_session_from_thread runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/sessions.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"840a7d4a685baa5c0677d8a7f79423253e0230f4ce1f26c73baa899ef53466af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::thread_control::handle_owned: FunctionTooLong \u2014 codewhale_app_server::thread_control::handle_owned runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/thread_control.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b409718c39fbb66196df9fc90902058842d023fd3bc76723680e5b7478780e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Engine.acp_tool_build_with_mcp: MethodTooLong \u2014 acp_tool_build_with_mcp runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/host_profile.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1897bc5b3cde818e08a9fb43c482afd255469384620a1559109598722a7c4e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::fleet::worker_runtime::fleet_task_to_worker_spec_with_profiles: FunctionTooLong \u2014 codewhale_engine::fleet::worker_runtime::fleet_task_to_worker_spec_with_profiles runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/worker_runtime.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5d72d6e7a2b2b5b9f13e3c4d6ea2082d12031737c9ac16fe220dca8b09f577"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::verifier::start_background_gates: FunctionTooLong \u2014 codewhale_engine::tools::verifier::start_background_gates runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/verifier.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"e929288f7f773036d439d5d569ce621d255f190723cbc4daccae6548f0524e2f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::safe_label::sanitize_persisted_route_label: FunctionTooLong \u2014 codewhale_runtime::safe_label::sanitize_persisted_route_label runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/safe_label.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02c4dff16fb57e316588583612e7f2cd2a78df6e19f0b62e0d5b7be154aa782"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::resolve_credential_diagnostic: FunctionTooLong \u2014 codewhale_tui::resolve_credential_diagnostic runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":4847}}}],"partialFingerprints":{"codehealthFindingId/v1":"041fccfda10b2977f17b5d22892fc46e3f1ad4e30819c1ce95c465fb130d46df"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StatusPickerView.render: MethodTooLong \u2014 render runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/status_picker.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb55f6f226cbc3cfe824740d917e7e9237ea3235dc6155c7663aac55eed2359e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/community-agent.ts: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 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":"web/lib/community-agent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4746e446e49b2301bf5346f1ffed7f241d40a760dea51fab06103f40563b557"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FleetRoster: ClassTooLong \u2014 410 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 2 blocks, lines 78-799. The bar is 400 significant lines; this is 10 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2ef1fbf021a3f686755a00daaed9257bef23ecb89220767a2590f237421367"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PluginManifest: ClassTooLong \u2014 410 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 8 methods, 2 blocks, lines 36-1025. The bar is 400 significant lines; this is 10 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a410adc69fe27f459fcccdac4311d0ca33e07f6f0d5d6a03f97bd4aa97380577"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SkillsManagerView: ClassTooLong \u2014 409 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 3 blocks, lines 64-753. The bar is 400 significant lines; this is 9 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/skills_manager.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6573c08525550d7760c6e0099cea5d2e7dcbb827ec13b40da993b544e5efcb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: install/mod.rs: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab55072daacefae52879be5dec54c9907fb1ba3097bb4734c3ce88a391be220f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_app_server::runtime_chat_relay::project_native_event: FunctionTooLong \u2014 codewhale_app_server::runtime_chat_relay::project_native_event 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/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"b577d58edb98aaceec542b9bf0ed5ae6bfb4da4731e1af227fa8be31e8779be7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_config::legacy_root::plan_scope: FunctionTooLong \u2014 codewhale_config::legacy_root::plan_scope 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/config/src/legacy_root.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b1f676c12e212891cec93333602b8cee1fcd22cf1863002f3b7832e6c7f76a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FleetManager.run_to_completion: MethodTooLong \u2014 run_to_completion 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/engine/src/fleet/manager.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"57358c41b99146fad05af65550e3474fc57e7ce06b5399b6559403ee84bb2912"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.execute_dynamic_tool: MethodTooLong \u2014 execute_dynamic_tool 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":19552}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c21534eb9958b1a1fb1cfa90701e636ff19a5d1f70ebf01cd0c5101f2cb7bde"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::session_export::write_session_archive: FunctionTooLong \u2014 codewhale_engine::session_export::write_session_archive 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/engine/src/session_export.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a37c10985512c8e22056e14c1d6cfb63d83497d093460576b208c7b3abec13c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::oauth::pkce_login_with_selected: FunctionTooLong \u2014 codewhale_runtime::oauth::pkce_login_with_selected 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/runtime/src/oauth.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf50aeea62c16a65684fa938e3f91f6045e9cda24979c797e270482d92dee945"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_speech: FunctionTooLong \u2014 codewhale_tui::run_speech 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/tui/src/lib.rs"},"region":{"startLine":9791}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0526182555fde029e234077dc8ff2994a4d3f615cac4944a34e0f97e8610a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::run_interactive_prepared: FunctionTooLong \u2014 codewhale_tui::run_interactive_prepared 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/tui/src/lib.rs"},"region":{"startLine":14739}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f9b29abac5ce687598f61d228acad012046f56c17e56e5eb8a021f2339c56e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.project: MethodTooLong \u2014 project 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/tui/src/tui/pet_watch/runtime.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29017f304ae0c17b2f2ec13ea9137ec32d3c9b0b2b4c91e2ebb04905cd6d870"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::session_state::reconcile_turn_liveness_with: FunctionTooLong \u2014 codewhale_tui::tui::ui::session_state::reconcile_turn_liveness_with 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/tui/src/tui/ui/session_state.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e0e3bfca5c39eaf0255a72375e66d9b59509ef8afae02d2f7c280864d97bf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SubAgentStoreAuthority: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 2 blocks, lines 13350-14141. The bar is 400 significant lines; this is 7 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":13350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4459c73d84874a6da26c76e6a81c100b6c31a7e2ea1e224b2e2fc4d21c9f7da2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProvidersToml: ClassTooLong \u2014 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 2 blocks, lines 197-675. The bar is 400 significant lines; this is 6 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/provider_toml.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"2606bc640c5f4f0c67697e0c61fbf734d236e4f7c861b6d2aa55cbed5e5e649b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/route_preferences.rs: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_preferences.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba0349568269c41754d4bc261b5a15509b083bfab091462c7ffddac1d0a5d0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: contract/debug_diagnostics.rs: FileTooLong \u2014 507 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/debug_diagnostics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c8034c0a6e6b3127ebccdaaa6474efa76eec7e2f3d5964658885a2d36bc879"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FleetRosterView: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 15 methods, 4 blocks, lines 138-742. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_roster.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd7641f0e7d651b89109fdfe2d00f81491b1c31d4b007e41c6024221e0a087f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AcpServer.session_view: MethodTooLong \u2014 session_view runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/acp_server.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca674776a0b3780d55f9115738606fdc02d0548c96c3d57708a53fb30dfad41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::core::authority::auto_review::windows_session_runtime_risk_scoped: FunctionTooLong \u2014 codewhale_engine::core::authority::auto_review::windows_session_runtime_risk_scoped runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/authority/auto_review.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"f216cb1052e0e9784525d355757ee7c4781d99da62297728abb35b76cf286795"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OwnerRegistry.register_command: MethodTooLong \u2014 register_command runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0d00da04221ced609c195e4faf542d0575c45fd9c3b073702ff79d7f6264cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NativeSandbox.spawn_inner: MethodTooLong \u2014 spawn_inner runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"4954c0cc0b42bee1c544b7c19ac84edec1b513ae1c42fdd81d8eb880a37b7b64"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeThreadManager.async_subagent_wake_op: MethodTooLong \u2014 async_subagent_wake_op runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6693}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2903693588b1303fff63068e5800ddebc8d0cd4a155fd114d12d946c528f1e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::git::plan_commits: FunctionTooLong \u2014 codewhale_engine::tools::git::plan_commits runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bc8ed206f045493e8fa37a05cb11ee795a87407f51858430eba4257349566f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::git_tool::review_scope: FunctionTooLong \u2014 codewhale_engine::tools::git_tool::review_scope runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_tool.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e6560430f7b3a2eab58d83a4b91cd594b3d2dc995f4dbea010f9c3ac01384c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_engine::tools::web_search::finalize_search_response_for_context: FunctionTooLong \u2014 codewhale_engine::tools::web_search::finalize_search_response_for_context runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b9e773c3b1a9428bd8362effd65a54e5f906b87292eab10fdbb59ab01475ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_runtime::process_tree::contained_run_with_limits: FunctionTooLong \u2014 codewhale_runtime::process_tree::contained_run_with_limits runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/process_tree.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d26029f18fa2cce3a2a8eba8893610c8294801028de3afcce31e2832bf0d9d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::history::history_cells_from_message_with_results: FunctionTooLong \u2014 codewhale_tui::tui::history::history_cells_from_message_with_results runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8950b0ee3be47586a4ba8d4d6f00ce057752140e17dbf3812e3e1afd52b73e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::ui::apply::apply_setup_runtime_preset: FunctionTooLong \u2014 codewhale_tui::tui::ui::apply::apply_setup_runtime_preset runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":3625}}}],"partialFingerprints":{"codehealthFindingId/v1":"08dbd5d9c9ca9fc4da59998155d816bebc73889ec573bc02887bf2f8628c2739"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ConfigView.handle_mouse: MethodTooLong \u2014 handle_mouse runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":4335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a76a9a5d6309ae1d60bb4d97abd97fb0d2ba0d15afae1f9bd0b5236d69a6f19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_tui::tui::work_surface::views::git_state_rows: FunctionTooLong \u2014 codewhale_tui::tui::work_surface::views::git_state_rows runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/views.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"012c6ab850427c6416279de40d3b475ab413f3a1b86724e15d91c38b759c8af3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_workflow_js::vm::install_host: FunctionTooLong \u2014 codewhale_workflow_js::vm::install_host runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/vm.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"756d15ab266fb9a70020c97283d3c82ac9bbf3dece3d95abc71fa03cb45d4142"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: codewhale_workflow_js::vm::task_host_inner: FunctionTooLong \u2014 codewhale_workflow_js::vm::task_host_inner runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/vm.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf2b8822e6f0507595d45b9888702a71088914f6b50810c09c0d0a4d4c09a97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: contributor-merch.ContributorMerch: FunctionTooLong \u2014 ContributorMerch runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/contributor-merch.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5fec292faa5be652e8ca769cfb9371351c95355bf5203563c817eb0625983e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tui/control_socket.rs: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/control_socket.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc57911fb969d393626f3de24fdbabaf8704d5c5d2378ae07cb0b1414ad86c5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/git_status.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/git_status.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9f254e579cf7f30aadf2a25a842cc42bcaae4632e883b257a5f8cc656b800a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: github/host.rs: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1576ac71e7f80cd6ad1de477c97b6778f0c300707eaddd844508a20af6aef28"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 23 shared lines): crates/engine/src/mcp.rs:2501-2558 | crates/engine/src/mcp.rs:2564-2613 | crates/engine/src/mcp.rs:2619-2671 | crates/engine/src/mcp.rs:2674-2723 | crates/engine/src/mcp.rs:2725-2778 \u2014 These 5 members are variants of one another: a block of 23 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f973704aedfba806150a4490aa5c4c5c831a936bafb15e57750c7aa955290dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): crates/app-server/src/runtime_api.rs:5760-5830 | crates/engine/src/fleet/control.rs:93-153 \u2014 These two members are variants of one another: 58 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5760}}}],"partialFingerprints":{"codehealthFindingId/v1":"b908c6921b1062a63f63aa15aece5ee88cd686cbb168b16854001b0fd12cc294"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): crates/plugins/src/marketplace/parsers/claude.rs:216-373 | crates/plugins/src/marketplace/parsers/kimi.rs:115-257 \u2014 These two members are variants of one another: 57 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3574fd199025fc3ffe0bab60c1f2bf1226a3ddfdaecd8274d39b3151640b6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (52 shared lines): crates/plugins/src/install/tarball.rs:194-289 | crates/skill-install/src/install.rs:1469-1586 \u2014 These two members are variants of one another: 52 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/tarball.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0e3e8a0efced973bfb71887758622d854f2f1a3a0ad54ed73f35bfc7c57028"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (44 shared lines): crates/tui/src/commands/contract.rs:1257-1337 | crates/tui/src/commands/contract.rs:1451-1524 \u2014 These two members are variants of one another: 44 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"088c5d7a52c8b5671e8c87c9f98871df57b0abf4e756a98d560947b66997ea0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (38 shared lines): crates/engine/src/tools/subagent/coord.rs:790-911 | crates/engine/src/tools/subagent/mod.rs:15400-15512 \u2014 These two members are variants of one another: 38 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f44b32ab7709d7226f8bb5aabf2a09f8e01c58bc6b2aed4f968544822224be"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (38 shared lines): crates/app-server/src/runtime_api.rs:10769-10809 | crates/app-server/src/runtime_api.rs:10816-10858 \u2014 These two members are variants of one another: 38 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":10769}}}],"partialFingerprints":{"codehealthFindingId/v1":"15934c97730c49e1354b900a857f181defed950492c66888cc08665c44614127"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): crates/engine/src/session_manager.rs:4891-4995 | crates/engine/src/session_manager.rs:5384-5545 \u2014 These two members are variants of one another: 35 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":4891}}}],"partialFingerprints":{"codehealthFindingId/v1":"7470d16fcd7ffc8b69898cce5799a24e78a66973b5c91c6dac14f73656521a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (34 shared lines): crates/engine/src/tools/automation.rs:162-259 | crates/engine/src/tools/tasks.rs:220-333 \u2014 These two members are variants of one another: 34 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e46af8906082e9d92f075f55e594990fc3ca0673586720ea43c2aa3c55d6ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (32 shared lines): crates/sanitize/src/redact.rs:1294-1347 | crates/workflow/src/redaction.rs:592-662 \u2014 These two members are variants of one another: 32 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e19764b618c1e944444bf1da0bb872152b2e4eba54d362837cb93abeca48c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): crates/tui/src/tui/widgets/mod.rs:871-946 | crates/tui/src/tui/widgets/transcript_legacy.rs:749-811 \u2014 These two members are one piece of code written twice and then edited apart: 62 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac1aa05da377c75a3955f0aec8ebfda4f4a4279d391fcba5544e541197dc7e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/engine/src/tools/verifier.rs:393-513 | crates/engine/src/tools/verifier.rs:517-571 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/verifier.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bd9cd6ac5a7a45b5efc6226d324f8bb09a07f9e71ca62b619afc7982ade6f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/tui/src/tui/history/latex_render.rs:1355-1401 | crates/tui/src/tui/history/latex_render.rs:1403-1438 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4caa989e908fbf9aba53ab1ea6284f12134de265d49cd0d546206701f10a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): crates/engine/src/core/engine.rs:3030-3089 | crates/engine/src/extension_host/dsh_catalog.rs:234-264 | crates/engine/src/extension_host/mod.rs:2115-2292 | crates/engine/src/extension_host/mod.rs:2781-2942 | crates/engine/src/model_routing.rs:1722-1848 | crates/engine/src/runtime_threads/manager.rs:19093-19180 | crates/engine/src/tools/image_ocr.rs:382-426 | crates/engine/src/tools/session.rs:106-161 | crates/engine/src/tools/session.rs:195-266 | crates/engine/src/tools/tui_help.rs:104-124 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68333400a13e553bd523835152b9275541fdbffd02599a210dfa3d1ce6d7ce3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): crates/engine/src/tools/web_search.rs:719-820 | crates/engine/src/tools/web_search.rs:830-901 | crates/engine/src/tools/web_search.rs:911-995 | crates/engine/src/tools/web_search.rs:1004-1088 | crates/engine/src/tools/web_search.rs:1099-1176 | crates/engine/src/tools/web_search.rs:1184-1236 | crates/engine/src/tools/web_search.rs:1245-1332 | crates/engine/src/tools/web_search.rs:1342-1439 | crates/engine/src/tools/web_search.rs:1448-1542 | crates/engine/src/tools/web_search.rs:1551-1696 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac59715c50814fba513099194ab6f5750b04a3def8a3c144e60eb2800e58061"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): crates/app-server/src/runtime_api.rs:6369-6449 | crates/app-server/src/runtime_api.rs:7335-7351 | crates/app-server/src/runtime_api.rs:12944-12973 | crates/app-server/src/runtime_api.rs:13023-13055 | crates/app-server/src/runtime_api.rs:13069-13115 | crates/app-server/src/runtime_api/mcp_import.rs:29-45 | crates/app-server/src/runtime_api/mcp_import.rs:74-100 | crates/app-server/src/runtime_api/secrets.rs:318-439 | crates/app-server/src/runtime_api/secrets.rs:922-1025 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":6369}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e45fe463da6e89ac2fb8844d60a330af01f0ad57619e761eda3e5c82a6683d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): crates/engine/src/codex_model_cache.rs:62-121 | crates/engine/src/core/authority/auto_review.rs:460-487 | crates/engine/src/extension_host/mod.rs:868-888 | crates/engine/src/extension_host/mod.rs:3653-3689 | crates/engine/src/extension_host/supervisor.rs:1734-1774 | crates/engine/src/runtime_threads/manager.rs:16062-16092 | crates/engine/src/runtime_threads/manager.rs:19814-19824 | crates/engine/src/superfast.rs:349-483 | crates/engine/src/tools/subagent/engine.rs:2203-2270 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/codex_model_cache.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e806a846bae97f1c48e2ba8397a173f7af93f46e705d6bd13c0d862492a0de11"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/engine/src/automation_manager.rs:1911-1987 | crates/engine/src/runtime_threads.rs:3428-3463 | crates/engine/src/runtime_threads.rs:3475-3513 | crates/engine/src/runtime_threads.rs:3515-3570 | crates/engine/src/runtime_threads.rs:3663-3706 | crates/engine/src/runtime_threads.rs:3910-4025 | crates/engine/src/runtime_threads.rs:5959-5982 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fa5edd3b3282f8ace94570dd1a41c73445c839c786581c77e5214eb608dc7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/app-server/src/mcp_server.rs:260-307 | crates/app-server/src/runtime_api.rs:5983-6064 | crates/app-server/src/runtime_api.rs:9997-10037 | crates/app-server/src/runtime_api/constitution.rs:13-41 | crates/app-server/src/runtime_api/external_agents.rs:331-345 | crates/app-server/src/runtime_api/turn_artifacts.rs:366-459 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/mcp_server.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdaa57148a36650e87d841e136b1b2ec79bc628e99e5823671c94a29c4179c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/app-server/src/runtime_api/diagnostics.rs:177-192 | crates/cloud-facts/src/lib.rs:309-366 | crates/engine/src/provider_catalog_live.rs:786-905 | crates/engine/src/session_manager.rs:888-905 | crates/plugins/src/registry.rs:1739-1761 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/diagnostics.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0e9188b41201bbef8f058f01272e0ad8f6b277dc57dd9396db48716b38e9f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/commands/src/debug/change.rs:173-209 | crates/commands/src/debug/change.rs:215-247 | crates/commands/src/debug/change.rs:255-278 | crates/commands/src/debug/change.rs:340-358 | crates/commands/src/debug/change.rs:360-384 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/change.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ad52ca0e7f46ae620dc5743c02c00c32ebaa62be5cb7b33efcbb48f579a690"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/engine/src/fleet/ledger.rs:871-904 | crates/engine/src/fleet/ledger.rs:919-963 | crates/engine/src/fleet/ledger.rs:977-1010 | crates/engine/src/fleet/ledger.rs:1052-1177 | crates/engine/src/fleet/ledger.rs:1210-1254 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48e1537bdbc431cb04ed69f7f4f070af7e96bdf1adfc756aa067eafc818ebb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/app-server/src/remote_control.rs:3372-3396 | crates/engine/src/compaction.rs:2279-2294 | crates/engine/src/compaction/last_round.rs:409-424 | crates/engine/src/superfast.rs:257-270 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":3372}}}],"partialFingerprints":{"codehealthFindingId/v1":"87271d68378c8d628ef07c231f4250f853d1e895928733d120babdbf40714aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/config/src/base_url_resolution.rs:32-47 | crates/config/src/provider.rs:457-471 | crates/config/src/provider.rs:476-492 | crates/runtime/src/config.rs:9269-9284 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab6b3e0a93a0a2a0b63f05ac1b9435f10d5055f43af5c9a4bddbe0840c71851"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/config/src/private_directory.rs:1734-1865 | crates/config/src/private_directory.rs:1868-1958 | crates/engine/src/tools/github/report.rs:1272-1341 | crates/runtime/src/external_credentials.rs:456-534 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee7831fbdef3d2cbb467e250167e4bc2ad8ff0b29de652ff3d229f849043b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/client.rs:3870-3931 | crates/engine/src/core/engine/rlm_host.rs:721-767 | crates/engine/src/cost_status.rs:1613-1651 | crates/engine/src/tools/subagent/engine.rs:1503-1546 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":3870}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ce8880b02079f3b676bb8dd733323b9ba64a15120f75f089d87c17871f3349"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/core/engine/context.rs:90-98 | crates/engine/src/purge.rs:266-274 | crates/engine/src/rlm/session.rs:403-411 | crates/notify/src/payload.rs:271-279 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/context.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"db646268f9c7aac64c6fc7c166a8b2d4b21c51ee5ce06cd908baed94d3345fa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/extension_host/core_call.rs:969-1039 | crates/engine/src/extension_host/core_call.rs:1048-1146 | crates/engine/src/extension_host/core_call.rs:1432-1544 | crates/engine/src/extension_host/core_call.rs:1556-1636 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5589c9e01a29a7f99ce24a21a3b97480800e173f377ec2c5b01eb864e0534da"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/tools/git.rs:104-141 | crates/engine/src/tools/git.rs:203-248 | crates/engine/src/tools/git_history.rs:89-144 | crates/engine/src/tools/git_history.rs:211-261 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f182d9073a5b889b5669053a618b8a03c635a29dffb7415e9a442aa0badd04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/tui/src/commands/config_main_host.rs:950-1006 | crates/tui/src/commands/config_main_host.rs:1008-1063 | crates/tui/src/commands/config_main_host.rs:1110-1163 | crates/tui/src/commands/config_main_host.rs:1670-2753 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_main_host.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bf6d44c7679914ba19fafdb7f7a52bab17a6d6c7d17a2331bc7d7bea7040b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/tui/src/commands/contract.rs:4524-4570 | crates/tui/src/commands/contract.rs:4572-4606 | crates/tui/src/commands/contract.rs:4608-4644 | crates/tui/src/commands/contract.rs:4796-4833 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":4524}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad93823ebaa62ed1859900cc67d367e547fbe34c550029342f3e0d80d1b7fefc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/tui/src/lib.rs:7961-8082 | crates/tui/src/lib.rs:8168-8217 | crates/tui/src/lib.rs:8872-8961 | crates/tui/src/lib.rs:8963-9022 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":7961}}}],"partialFingerprints":{"codehealthFindingId/v1":"0778392f7483c7391f3ef7e0230214ea0e78b81b16415d6dfa47816e4802f458"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/tui/src/tui/setup/mod.rs:3272-3375 | crates/tui/src/tui/views/fleet_roster.rs:554-741 | crates/tui/src/tui/views/fleet_setup.rs:2548-2774 | crates/tui/src/tui/views/fleet_setup.rs:2838-2854 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":3272}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b9df2b068bb7e3397b0d9938f5ed126b3e7bd5cdc8ddf28211a6965c2629d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/tui/src/tui/ui.rs:569-598 | crates/tui/src/tui/ui/apply.rs:1099-1217 | crates/tui/src/tui/ui/provider_routes.rs:725-991 | crates/tui/src/tui/ui/session_state.rs:1135-1177 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e022fb9f53c09018df804c48832a7701b72c10563dffd25e88f2a8c5e20ee12"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/tui/src/tui/views/fleet_detail.rs:970-1024 | crates/tui/src/tui/views/fleet_list.rs:383-434 | crates/tui/src/tui/views/fleet_roster.rs:465-539 | crates/tui/src/tui/views/workflows_manager.rs:551-574 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfc1b609bdb85e9c4c70217296bcab9cde4165d749036c8c408f558213eea40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (501 corresponding lines): crates/tui/src/tui/widgets/mod.rs:181-725 | crates/tui/src/tui/widgets/transcript_legacy.rs:130-630 \u2014 These two members are one piece of code written twice and then edited apart: 501 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a570571c79d60081eb1c7384257b6d344efec02cec454d36b3181654fce3b2dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (228 corresponding lines): crates/tui/src/tui/widgets/approval_band_legacy.rs:79-335 | crates/tui/src/tui/widgets/mod.rs:1605-1832 \u2014 These two members are one piece of code written twice and then edited apart: 228 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69d6631b4b6395140192c984f2dc7451a4b19200c84a02ddcb6577e64598e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (95 corresponding lines): crates/plugins/src/marketplace/parsers/claude.rs:72-188 | crates/plugins/src/marketplace/parsers/codewhale.rs:46-140 \u2014 These two members are one piece of code written twice and then edited apart: 95 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"066478a455325052615a5346ea55fe39a72b9be8195405b628d40bab87116cca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): crates/tui/src/tui/session_picker.rs:693-770 | crates/tui/src/tui/session_picker.rs:785-848 \u2014 These two members are one piece of code written twice and then edited apart: 64 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"744ea523501e86dce230d2e827b818f37a08771f1a309fda0f8382dcd59fd536"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/tui/src/commands/debug_group.rs:43-67 | crates/tui/src/commands/session_group.rs:43-71 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/debug_group.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6ffee29f232504ed70844afbcb4a83373a75aa58948f5ef130bf5439723ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (70 corresponding lines): crates/tui/src/tui/setup/tools_mcp.rs:265-337 | crates/tui/src/tui/setup/tools_mcp.rs:353-422 \u2014 These two members are one piece of code written twice and then edited apart: 70 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/tools_mcp.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa42f4cb904fe89fe3dc7e2b750a53f5189f1aa47dd17f7f612541cb7394487a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): crates/runtime/src/config.rs:3518-3600 | crates/runtime/src/config.rs:3611-3675 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1b45e0a2f5d9b6d38f0410a8cee9a329d35a6d529834f8591f2e0f14ad9b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/config/src/windows_identity.rs:19-72 | crates/runtime/src/external_credentials.rs:544-597 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/windows_identity.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2644fb885142654bb355226c114e86601a86996b42e3d1ff485452713c3a96d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): crates/tui/src/tui/widgets/approval_band_legacy.rs:683-739 | crates/tui/src/tui/widgets/mod.rs:1871-1937 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e704aeec5b193502667a3b113a4b0de9dc29f8a6af398b709b4173dcc1a8153"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/engine/src/core/engine/tool_catalog.rs:1781-1823 | crates/engine/src/tools/js_execution.rs:151-198 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_catalog.rs"},"region":{"startLine":1781}}}],"partialFingerprints":{"codehealthFindingId/v1":"4025d05d48f6cfe83a48810f4b8f0aea58d5d767a63dcc639ec2b9dd4f08a974"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 52\u002B corresponding lines): crates/engine/src/extension_host/avatars.rs:112-163 | crates/engine/src/extension_host/native_mcp.rs:123-176 | crates/engine/src/extension_host/skills.rs:76-141 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 52 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/avatars.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8184a415f16e1b0de8697d199578f3f94bae1fef5c32f87c866c6d332cf20fc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): crates/tui/src/tui/ui/handlers.rs:347-402 | crates/tui/src/tui/ui/handlers.rs:415-497 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dea5d9b831ad79a229a01c1efb4744c6ccabe53a457bcac8371edee407ca25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/config/src/xai_credentials.rs:383-435 | crates/config/src/xai_credentials.rs:441-490 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/xai_credentials.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd35411722a8a2748f9c7fb9ac5e57fdcfcc2c25b9c9d5f6f0e977f572ce7bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/engine/src/core/engine.rs:2049-2085 | crates/engine/src/core/engine.rs:2125-2168 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"af18f260e3c2ed111e075bc94bbac7c9febfefbfa451be96ccf1f9a702e350c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/state/src/lib.rs:986-1022 | crates/state/src/lib.rs:1193-1244 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/state/src/lib.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"4768031e9db1d732c0dab58b1fcb207050f86b17314b7842a731048981e9d60d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/engine/src/runtime_threads/manager.rs:5222-5268 | crates/engine/src/runtime_threads/manager.rs:5280-5324 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":5222}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cb269dcc2f5a972d8f01ea3d87d56a84b0e6b549dbaa2181e8c8aee0f1a3a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/workflow/src/fleet_snapshot.rs:220-261 | crates/workflow/src/fleet_snapshot.rs:266-317 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/fleet_snapshot.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0779082dc086529eb1111562696f639c92dd18a6a53812ba31f246aa50dbfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/engine/src/automation_manager.rs:1224-1266 | crates/engine/src/provider_catalog_live.rs:733-784 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"327dde8d03993b76e12aafa2e853b80f908f9ec9e4692e94be9a1bd9aea51b0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/engine/src/tools/terminal_session.rs:1258-1294 | crates/engine/src/tools/terminal_session.rs:1311-1343 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/terminal_session.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a317b99b21ceb7fdd99cbcf6f41045036437cdc3bd3974a22778e6314c8d8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/lane/src/runtime.rs:243-284 | crates/lane/src/runtime.rs:383-416 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/runtime.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"69114846ac568c62c8eabb2b037faab351c66c921d6b5910cd4ae477c8c7713e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/engine/src/core/engine/tool_catalog.rs:979-1018 | crates/engine/src/core/engine/tool_catalog.rs:1049-1086 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_catalog.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ed59e77a00e0428817a356aa5dcf9c2d7988f461ad2ee766e74daabd2868e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): crates/engine/src/hooks/executor.rs:2068-2132 | crates/engine/src/hooks/executor.rs:2144-2186 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9949b10b94cf16a50580ba933790ee4efac8c171f337c3b6d658c54a140a8c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/tui/src/tui/widgets/mod.rs:2767-2807 | crates/tui/src/tui/widgets/transcript_legacy.rs:1060-1094 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":2767}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e43edb68652f2a7725f6b59d8d93cfb80c919c6c9faece74a199046f24f21a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/engine/src/tools/spec.rs:462-498 | crates/workflow-js/src/vm.rs:1520-1562 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/spec.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a9bb5d4f9dc3b1e43adbc0ad08c1989aa2469a140f6b2e94d97ee27bcd132e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/engine/src/tools/web_run.rs:1728-1755 | crates/engine/src/tools/web_run.rs:1779-1811 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2e8894537f02809e01d11bdf6e6fc26723063e780f5c41ad6ddfc2cba3df46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/engine/src/client.rs:6453-6494 | crates/engine/src/client.rs:6531-6565 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":6453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a357d2af562f55858aa1ced551671694a26867e9a8f241cc2531731f624c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/engine/src/core/engine/rlm_host.rs:798-838 | crates/engine/src/tools/subagent/engine.rs:1547-1585 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e664cf9ecc675d9c61812237ea51f034c6a11a0de89c43b17a049dc6fed9af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): crates/engine/src/tools/web_search.rs:2969-3011 | crates/engine/src/tools/web_search.rs:3026-3062 | crates/engine/src/tools/web_search.rs:3337-3370 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2969}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82adc19d4f72f7e5cb29adf190fefc575d81c180d017c52ada5ebeb97be7728"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/engine/src/extension_host/execution.rs:919-959 | crates/engine/src/extension_host/execution.rs:965-1017 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/execution.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f282354ead790da8450ce7a4cfaf4b42a8f70a89747329f0872474e494c7a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/runtime/src/native_memory.rs:135-161 | crates/runtime/src/native_memory.rs:171-206 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/native_memory.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b5ecce0dff3e128045d0a01621aba6b7af343bb0a9f26e907d49b85889eb33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/execpolicy/src/bash_arity.rs:305-348 | crates/execpolicy/src/command_safety.rs:270-302 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/bash_arity.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c56e6f30870588e713b7dd3fabcedabb1e068075dcbf28cdb951458eb1e2e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/engine/src/work_graph/runtime.rs:536-562 | crates/engine/src/work_graph/runtime.rs:570-598 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/runtime.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ea2b723b86669add1294495dc57fd5a7943608354bd762d0b150b1851d9ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/tui/src/tui/views/mod.rs:346-377 | crates/tui/src/tui/views/mod.rs:442-475 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"36479b1909016e833ca87ad9c34768364ca0a2a115c69f412541f52b2d5ed30f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): pet/rs/main.rs:12-21 | pet/tui/src/main.rs:24-33 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/rs/main.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c46d9a48dda0a690dab9825807d26c9fb0feebf0b2d8f36c0bbf4f8d88f2f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/engine/src/tools/fetch_url.rs:513-543 | crates/engine/src/tools/subagent/mod.rs:19080-19112 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/fetch_url.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3cb0e5f3662e356a3f3704bd1962f52a598b5bf06087d4fe7664b22e847e5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/tui/src/commands/contract/debug_diagnostics.rs:557-591 | crates/tui/src/commands/contract/debug_diagnostics.rs:593-630 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/debug_diagnostics.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"234cc47d45ca0fef6a5e04037722f53f38b2e62c2a07014e3842a228dd74292b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/tui/src/tui/ui/apply.rs:4469-4501 | crates/tui/src/tui/ui/apply.rs:4507-4537 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":4469}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4abde97f44caa1d9827869823652cfa1c841747352da55f547f5abadfed91d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 34\u002B corresponding lines): crates/app-server/src/runtime_api.rs:6607-6646 | crates/app-server/src/runtime_api.rs:6654-6687 | crates/app-server/src/runtime_api.rs:6695-6728 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 34 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":6607}}}],"partialFingerprints":{"codehealthFindingId/v1":"617e0443bdccb513adc16fdcc548fd3cfad59e0366c61da0c70edaf237732499"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/cli/src/lib.rs:3525-3546 | crates/runtime/src/oauth.rs:4342-4363 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":3525}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa80120e37a91a270c8fd7fa34f67867cd9e3d7a674c9cb5d2bbd1e7b8582f5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/secrets/src/lib.rs:189-226 | crates/secrets/src/lib.rs:230-262 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a592503337092b61dabd1e8a3377bd174b119f856b80f3393d49a832d816db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/plugins/src/manifest.rs:1598-1622 | crates/plugins/src/registry.rs:2521-2547 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":1598}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a2dac940660455dc37c502342ecd6bdd0ab4f395533bdbadf7c3cff68d15d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): crates/tui/src/tui/provider_picker.rs:3732-3760 | crates/tui/src/tui/provider_picker.rs:3762-3797 | crates/tui/src/tui/provider_picker.rs:4328-4365 | crates/tui/src/tui/provider_picker.rs:4367-4409 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":3732}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8674d36071c422f233e15f1d8b2d1617a4a339586076d42894cde79cfcc09c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/cli/src/metrics.rs:914-950 | crates/cli/src/metrics.rs:1141-1181 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"a030435651dde39066f48d630aa7e46cfb6421159397579d5b4b6216ca37d528"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/tui/src/tui/history.rs:399-433 | crates/tui/src/tui/history.rs:703-746 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a61fca2d8a186c74d5dd1b50802fe1243b3cabc69441eb7e4a09b2bb1fa023c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/engine/src/reasoning_preference.rs:402-431 | crates/tui/src/tui/model_picker.rs:4988-5030 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/reasoning_preference.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee08563bf56c6435444784df29f505dc38b94bdbdcf0a6775380b4a3edaac76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/engine/src/extension_host/dsh_terminal.rs:360-385 | crates/engine/src/extension_host/dsh_workspace.rs:396-421 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_terminal.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7cc0635926c4b9e7cc376ac4e2b98cb7f33a4c6e37b23094cfd2c014f17598"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/app-server/src/runtime_api.rs:3663-3693 | crates/app-server/src/runtime_api/web.rs:198-224 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":3663}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b652c5b95c4fcd2ace6639aaf24c8a69dc55f9c21224aa67bcff76041d7874"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/engine/src/tools/subagent/mod.rs:17735-17758 | crates/engine/src/tools/subagent/mod.rs:17760-17780 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":17735}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95585dbbddf9798dce38fb4735985ea35e5a2e39f05492a265e3508d9eee364"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/engine/src/tools/subagent/coord.rs:921-955 | crates/engine/src/tools/subagent/mod.rs:15538-15579 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aadc31b9736448bb906510cce53e67ca9ce00d8f0af4df747a5a1efaa1ed912"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/engine/src/tools/terminal_session.rs:1360-1383 | crates/engine/src/tools/terminal_session.rs:1400-1428 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/terminal_session.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"308109daf340993181afa0c4bdb521dfab1af786cacb115b65b95318c26b2ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/engine/src/tools/automation.rs:305-324 | crates/engine/src/tools/tasks.rs:385-406 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"94921132fcd39b489705bfdf545c258bb270c15460f0a1cfbe8c688b2f5a7bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/engine/src/client/provider_native_search/kimi.rs:270-301 | crates/engine/src/client/provider_native_search/zai.rs:24-54 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search/kimi.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"185208eb0dcef7f2c784a511815b01e570ac08e39018b06031eeb39dc686d0d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/engine/src/runtime_threads/manager.rs:7357-7384 | crates/engine/src/runtime_threads/manager.rs:7389-7419 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66587c8c96eb0058868193cb63df448d80b593b93e66a159c8d6b7d4e3c033e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/app-server/src/runtime_chat_relay.rs:1855-1881 | crates/util/src/lock.rs:42-78 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e15dd1e75e01656f951cbb1efe63621f802e0f6e0b3d2dd4f7d3d58a264c50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/engine/src/work_graph/runtime.rs:468-487 | crates/engine/src/work_graph/runtime.rs:496-515 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/runtime.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"1264f5fef61e997399f4b3d5297509d481e4f9e964a225e16171f1b434d2140b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/engine/src/runtime_threads/manager.rs:3864-3897 | crates/engine/src/runtime_threads/manager.rs:5371-5416 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":3864}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1013ad2a99d5d8ff3290644a1a9b084979f5b4365298e7d7d7b149f25eb7b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/engine/src/session_manager.rs:4827-4848 | crates/engine/src/session_manager.rs:6211-6235 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":4827}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc94357678519fb9e6c1992b29ad2580f0e1533cd9b9e29f6461790174fee64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/runtime/src/config.rs:12066-12091 | crates/runtime/src/config.rs:12099-12123 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":12066}}}],"partialFingerprints":{"codehealthFindingId/v1":"19583d3075fa4e51c7c147b2e8575caa46dadb2774c49f28392380de8be5d1ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/tui/src/commands/contract.rs:3422-3452 | crates/tui/src/commands/contract.rs:3458-3488 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":3422}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24c96309c70ef19af0df9b7efaec9ede90a8453aa480c7ecee049fe68b8ec11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/app-server/src/runtime_api/mobile.rs:99-125 | crates/app-server/src/runtime_api/web.rs:83-114 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/mobile.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0596fe4289ecdca21f0aa1c109d326518d23966de30bc2b2c4414c6046bd29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/tui/src/tui/file_picker.rs:590-623 | crates/tui/src/tui/session_picker.rs:1030-1065 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_picker.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"1876deaf1f3bc94db1ea5805fde6e22c50a1100c4c21ffeeebd08cd816729ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/tui/src/tui/widgets/composer_legacy.rs:907-935 | crates/tui/src/tui/widgets/composer_legacy.rs:945-985 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d80aba383af9fe1ba42203ffc6574d1e88a2b3c837f0c29749d8c1d9eea6e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/skills/src/mutation.rs:1758-1785 | crates/skills/src/mutation.rs:1791-1817 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/mutation.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e3c48e8ac97e083eef40369b6d548902b6b62823925add0c88a4de0fff4e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/tui/src/commands/contract.rs:3494-3517 | crates/tui/src/commands/contract.rs:3523-3546 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":3494}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3224442d2e457e999364ae334d4d4da90f56a7def01640760f8038fc520129"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/tui/src/tui/history/file_mutation.rs:281-311 | crates/tui/src/tui/work_surface/model.rs:2548-2573 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/file_mutation.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"44037592b94ba6aaefe79b62e1e3c86720a6c1c7fb5fd10cc28b8e60f5a5f5ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/engine/src/runtime_threads/job_operations.rs:209-230 | crates/engine/src/runtime_threads/job_operations.rs:388-412 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/job_operations.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc2dc464eac788e076a9bb383b1de122258bca629dbd6893ef24167cb401b39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/engine/src/task_manager.rs:4185-4209 | crates/engine/src/task_manager.rs:4216-4241 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":4185}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e3711118e2b0e844b2741d2129f20b5a7e056a1743ad48eb3493f6854393f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/engine/src/core/engine.rs:5912-5951 | crates/engine/src/core/engine.rs:6016-6041 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5912}}}],"partialFingerprints":{"codehealthFindingId/v1":"a442ba95d3ee02f4394bd608d4a498164021a5a77099c54b6326b622b6f96d8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/engine/src/hooks/executor.rs:1220-1252 | crates/engine/src/hooks/executor.rs:1373-1403 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"313feb9472e973d9e900e347d5ca39e97ef72f4eb298b988d047be917929951f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/engine/src/tools/file.rs:3795-3827 | crates/engine/src/tools/file.rs:3864-3889 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":3795}}}],"partialFingerprints":{"codehealthFindingId/v1":"d330c22147d5dabaf79ca073358cc1bb428407b71f16c5a3bddc948225fadf4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/tui/src/tui/views/fleet_setup.rs:1587-1613 | crates/tui/src/tui/views/fleet_setup.rs:1631-1657 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7229e69a76fbfdffbb9851b60db03af5fab1e9cf14ace0aedaac1cdee00f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/config/src/permissions.rs:370-393 | crates/config/src/permissions.rs:395-421 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/permissions.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c35448fa54933d987584d45b9fa000fe275d2d5f07a8ec3bd98836d384ae95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): crates/config/src/path_io.rs:51-80 | crates/engine/src/mcp.rs:7999-8025 | crates/engine/src/runtime_threads.rs:5676-5705 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/path_io.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdf76e3cabdb738fc3fb7bf0374875451b35ea8f0c9de89b5f2cd2921bcdb04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): crates/runtime/src/session_diagnostics.rs:380-406 | crates/runtime/src/session_diagnostics.rs:412-438 | crates/runtime/src/session_diagnostics.rs:444-470 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/session_diagnostics.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d3eca8096ef75438f4e458bcad10d5bddb8d60a0108f2258d8147f91db37a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/sanitize/src/redact.rs:495-517 | crates/workflow/src/redaction.rs:505-527 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2392f9b58fafa9cde4483f898ac6f5885ae8ad94590285ec1735c3bbced588"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/state/src/lib.rs:1060-1086 | crates/state/src/lib.rs:1379-1403 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/state/src/lib.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"378e9b1f9d21416068b1db1bbee1fed58a64a05566314e2a7956846f0b5899f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/lib.rs:1011-1017 | crates/tui/src/lib.rs:1039-1046 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae05732eef4dfe5899f3ff881f260926dfb8ffceac4d70c577cacbb7aadba0e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/app-server/src/remote_setup/mod.rs:250-272 | crates/tui/src/lib.rs:11284-11311 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_setup/mod.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"33301e904a0bbf4cefcfc0e3da3e2e737d971c37b50414a1feb1ec6b8c0333b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/app-server/src/runtime_api.rs:3711-3736 | crates/app-server/src/runtime_api/web.rs:229-250 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"466dda6813c7a38d63537ada9afcbeb1d2711897e8adbc7cccceedc0aa4f75ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/tui/src/commands/groups/skills/skills.rs:749-778 | crates/tui/src/commands/groups/skills/skills.rs:786-811 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/skills/skills.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a74299c6330062eb2b1111f633238c0a141768417668c6f19d5166dc7467a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/tui/src/tui/ui/event_loop.rs:8137-8176 | crates/tui/src/tui/ui/event_loop.rs:8295-8337 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":8137}}}],"partialFingerprints":{"codehealthFindingId/v1":"494b0ac10c4b6bee2dbe341e38072b972d33b1a25aa226a8f959213b570eddfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/lane/src/worktree.rs:33-55 | crates/runtime/src/continual_harness.rs:272-295 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/worktree.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f71779eb8fdb7039d74f64ed01dab5bb4be9d7c909e0f29b7163a16aa27ebec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/config/src/models_dev.rs:115-134 | crates/config/src/models_dev.rs:142-167 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/models_dev.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeec3f9735cde9ad8707e3d2df72a1afb999089234f7636d642b0e2a07c0117e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/engine/src/fleet/manager.rs:2402-2437 | crates/engine/src/fleet/scheduler.rs:572-600 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe2ca3ceeaa94d5227253c1ce69abb8acc9b50ff0d21df8d56cd33c7c02d6ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/tui/src/tui/file_mention.rs:423-438 | crates/tui/src/tui/slash_menu.rs:290-304 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"170ebb3970e64dd6a9c292f83261e74e5b0760ee04977c494e520cc68267c2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/cli/src/update.rs:2155-2178 | crates/cli/src/update.rs:2315-2338 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update.rs"},"region":{"startLine":2155}}}],"partialFingerprints":{"codehealthFindingId/v1":"22854a88b4498addfa70e85aef820e6db299eb8651dc14cb9a8cddccb46b2d3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/engine/src/tools/validate_data.rs:328-344 | crates/engine/src/tools/validate_data.rs:346-363 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/validate_data.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"f285e41370a5f457c861c2f99d4a4bdda2a3b03a406ce9d0b6e1dbc65ae8c286"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/workflow/src/named_fleet.rs:181-207 | crates/workflow/src/named_fleet.rs:566-587 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/named_fleet.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacf689f313ae52d55c2d3210cb3d37bcc4c3410ce23666e36163ca6f71c8c3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/app-server/src/runtime_api.rs:14407-14430 | crates/app-server/src/runtime_api/plugins.rs:2380-2399 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":14407}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7f9f8611fb8a816d3eef339348db895d8046b013d41c44cbca4ba650e99246"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/app-server/src/http.rs:233-256 | crates/app-server/src/runtime_api.rs:14786-14826 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/http.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5a91d6aea1b7329dd11f7ae9cccae553d3ab217810e44c54588e37a97d2910"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): crates/engine/src/tools/file.rs:4028-4052 | crates/engine/src/tools/file_search.rs:169-200 | crates/engine/src/tools/search.rs:316-340 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":4028}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45f0797f8fb57b1f33fb496734f31600c43a622e09842d8fcba3e51180fff0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/engine/src/tools/shell.rs:7754-7787 | crates/tui/src/commands/groups/memory/note.rs:65-92 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":7754}}}],"partialFingerprints":{"codehealthFindingId/v1":"579a1c0e5b8a931a891f87c6c5d9b793028a18e3e7035c196d141bb40ecc7c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/tui-kit/src/ui_text.rs:27-63 | crates/tui/src/tui/context_menu.rs:670-701 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/ui_text.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9571beea71257fa8feb68ca4ef8904e26360a1031a3a1be6880d09aebf5663d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/tui/src/tui/app/composer.rs:1336-1363 | crates/tui/src/tui/app/composer.rs:1367-1395 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"1636d6d2234ecba62fc095b3436c077a6460072e3080f6419dc030a012dd5623"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/config/src/private_directory.rs:1333-1360 | crates/engine/src/tools/github/report.rs:1175-1203 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfe6837620895ad236503ad8d0c476fe1b1eefff096da13a7b3d73ace2c1309"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/config/src/xai_credentials.rs:493-518 | crates/config/src/xai_credentials.rs:524-549 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/xai_credentials.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"5590e2efd96fd2b07a0fbd3b1f1c7efad1f7791f9db2a2dedb2b20904f258f71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): crates/engine/src/fleet/manager.rs:1958-1981 | crates/engine/src/fleet/manager.rs:1987-2015 | crates/engine/src/fleet/manager.rs:2020-2044 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"843e40e657c9cf877fdf9dde67c5c3a1aaf6ea9ad6ec4e4c01e05976aca79e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/engine/src/runtime_threads/manager.rs:6236-6259 | crates/engine/src/runtime_threads/manager.rs:6314-6339 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6236}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c135ba6d43bc7c085b2b40039fc88cfb70c72c739992ed180e0df08e1afa078"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/runtime/src/native_memory.rs:549-577 | crates/runtime/src/native_memory.rs:578-596 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/native_memory.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d73255e2523902df564ccf8a99cca4b5fa15022c3ac3012dbd623347f12ad14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/tui/src/tui/setup/fleet_draft.rs:270-291 | crates/tui/src/tui/setup/model_draft.rs:175-195 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/fleet_draft.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58ca41ba4ee9ea67b3b731f4fbcbe79b6c7d977c1b2435c1827142063e05355"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/config/src/display_redaction.rs:52-73 | crates/runtime/src/config.rs:10006-10027 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/display_redaction.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5438f120c4fc9063fbac8f9b1ba6698039c86b6a2d944c4ca1a577473af549"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/engine/src/tools/git_history.rs:693-719 | crates/engine/src/tools/git_history.rs:725-752 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_history.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"9755331b8c5e431ec2bc58c7ee2291c3eee1eafbb868bca31b7a3c6c5ec6d4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/models/src/hand_pricing.rs:279-306 | crates/models/src/hand_pricing.rs:358-387 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/hand_pricing.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbf049fbfff590b4fca292df792bd1dad5efe9b9e3b8c228e52f6e52f095145"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/engine/src/fleet/manager.rs:1574-1607 | crates/engine/src/fleet/scheduler.rs:109-137 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1574}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6466950bf4b4e031b4bb302cd82f8ae56b51459b779fbbe4ccdffdb334b254"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/engine/src/mcp.rs:5896-5920 | crates/engine/src/mcp.rs:5925-5948 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":5896}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2ee5590d02c6a6085bbbfbbfb2db67952c44bb09c638d6fbb6d1b6b1657211"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/engine/src/cost_status.rs:1248-1269 | crates/engine/src/cost_status.rs:2693-2710 | crates/engine/src/cost_status.rs:2760-2777 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f7d91dc6edb29b891ec5345914844a90a1e1f25fe695d091cf58743fe50f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): crates/engine/src/runtime_threads/manager.rs:9736-9765 | crates/engine/src/runtime_threads/manager.rs:9773-9798 | crates/engine/src/runtime_threads/manager.rs:9807-9835 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":9736}}}],"partialFingerprints":{"codehealthFindingId/v1":"8774993918d80c580a2405e6951c326ad9c203713c1c9a08502f51966d0eba9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/engine/src/tools/plan.rs:279-302 | crates/engine/src/work_graph/compat.rs:35-51 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plan.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e7762bf8f7e9c36663da3750ee39c87a7b870ffd2808cf91b65b82998a2141"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/sandbox/src/shell_dispatcher.rs:257-280 | crates/util/src/utils.rs:739-767 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sandbox/src/shell_dispatcher.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0da26bf6865c7f8a8b05df41ab69c86ee9622ce3a311fae2d94bb489095d32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/app-server/src/acp_server/connection.rs:301-322 | crates/engine/src/fleet/acp.rs:796-819 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/acp_server/connection.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c998fbbc43a662d8f6a96c390a2e1c3b2b9434f9ebcd9a449e00dba0bc05d16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/engine/src/tools/codemode.rs:330-350 | crates/engine/src/tools/codemode.rs:358-380 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/codemode.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aba317fda5119c0448edcc01e591473e62e75b75c43071c30689a166b102af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/engine/src/cost_status.rs:1974-2001 | crates/engine/src/cost_status.rs:2005-2033 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"8138035cb1237f8760ae86300d4bdc5ccc8bd15adcc775126dff7cd51498ad3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/engine/src/session_reconcile.rs:295-316 | crates/engine/src/session_reconcile.rs:449-472 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_reconcile.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ca68b35741ab01cfae823b0330641f96af461ffa09eb0c6faafba68226b8ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/engine/src/automation_manager.rs:2972-2989 | crates/engine/src/task_manager.rs:509-526 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2972}}}],"partialFingerprints":{"codehealthFindingId/v1":"205e0e9dddc51515692020044208fe9d179e2ecc7160dfb3cae1d390c61eb790"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/cli/src/lib.rs:3506-3523 | crates/runtime/src/oauth.rs:80-96 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":3506}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eee3ea3583e153889ffeb691c1007b9475ff9d21d443959aa41b863f98bc78a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/config/src/private_directory.rs:219-239 | crates/config/src/private_directory.rs:248-262 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b3f78fe527d592129d6a785158a01f65f4ab1f9db8f5dcf4aeef16c5b19d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/engine/src/core/engine.rs:5956-5981 | crates/engine/src/core/engine.rs:5987-6012 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5956}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf4b3e25399f23c4429fc75e2784c1515321d669e627802e3db5e1ea1e6987b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/engine/src/mcp.rs:3717-3738 | crates/engine/src/mcp.rs:3745-3766 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":3717}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d0f38ef1e4e25e768ca1a9db3a4589ba24399eabf2cc75604433a31df6198c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/app-server/src/http.rs:262-289 | crates/app-server/src/runtime_api/auth.rs:320-343 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/http.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab913c433ba31c2170349d73023b97d85570b76552883754cf39707a54e50dba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/tools/plan.rs:307-325 | crates/engine/src/work_graph/compat.rs:17-32 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plan.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a31a12ef4b3a7d8e0f622357497adfeb78d6ef5843c6e244ba4d8a1761df98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/tui/src/tui/setup/mod.rs:2529-2552 | crates/tui/src/tui/setup/mod.rs:2569-2596 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":2529}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7008da01ba0f6392aee263bdf921d1c652a63e99fc9dfafefde422374ee8d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): pet/swift/PetHost.swift:191-199 | pet/swift/PetHost.swift:200-208 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetHost.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"36477e4deca20c4cf821d52a0bcdf97cff694b0357cdf41c756be9bb9a93b0b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/engine/src/mcp/oauth.rs:1757-1775 | crates/engine/src/mcp/oauth.rs:1786-1807 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/oauth.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c06d796d9b7ba85c082ea00b52c01a18ab9946968db6b41a4f6b37c86f4ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/engine/src/runtime_threads.rs:5749-5772 | crates/runtime/src/skill_state.rs:245-269 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":5749}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6d28ad3009808a33e52a3b7a9f2dea4ae4e9411648d41b4c36607018acb855"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/engine/src/tools/github/report.rs:286-306 | crates/engine/src/tools/github/report.rs:326-348 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/report.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6625c9c4a1b6bb34c17e782702837f415484b0061002dbdff2b79ce085942bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/tools/validate_data.rs:216-225 | crates/engine/src/tools/validate_data.rs:226-238 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/validate_data.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2358b33a5a82af6e472c3fdc1c31ff743b3f13c88ad927eb6fc1438d5821858"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/engine/src/tools/web_search.rs:2904-2924 | crates/engine/src/tools/web_search.rs:2926-2945 | crates/engine/src/tools/web_search.rs:2947-2967 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2904}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de560c807cd93000345fc53800cb1ecba8a1a590c3bbc162d06dda18ffcc92a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/engine/src/runtime_threads/manager.rs:4791-4813 | crates/engine/src/runtime_threads/manager/external_agent.rs:2019-2039 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":4791}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dad83295893d42656e0f75c6f709f14612df1532113ef3eb64b8c2fb348dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/engine/src/client/chat.rs:2295-2318 | crates/engine/src/client/chat.rs:2320-2340 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":2295}}}],"partialFingerprints":{"codehealthFindingId/v1":"831d35b394f644a6b52a100085bccf199f124879038a3817a6b8cad8e5444ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/runtime/src/config/paths.rs:98-122 | crates/runtime/src/config/paths.rs:246-269 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config/paths.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"305cc5b9b56af168f95a7ed90f1be7c7154a103882e242e5d0640345517cff39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/tui/src/commands/groups/core/translate.rs:28-48 | crates/tui/src/commands/groups/core/voice.rs:98-118 | crates/tui/src/commands/groups/core/voice.rs:120-140 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/translate.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c12f2b75074f7b02005e602b54215198bdf9dfbf09da52caab7ce3b3310df6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/tui/src/commands/groups/session/export.rs:857-873 | crates/tui/src/commands/groups/session/export_html.rs:110-127 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/export.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6f2040e6545b546a6ddc9963721fdd82f3cc1518b735a23e6953202ffd8c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/tui/src/lib.rs:7585-7612 | crates/tui/src/tui/setup/mod.rs:5426-5445 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":7585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad7a28c5f120e604dab753bf4a1caf3d098efebbf5d8a6ebe5e8e03fd2b2b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/util/src/bundle_file.rs:30-51 | crates/util/src/bundle_file.rs:59-77 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/bundle_file.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24d122fb26fe6dbe620ec13ef47dff3fc32ab2767b3a21e6537a8e589fcbe2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/engine/src/fleet/host.rs:1587-1606 | crates/engine/src/tools/shell.rs:746-769 | crates/runtime/src/process_tree.rs:574-593 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/host.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6318509225f39f5555462f5c3b54d8a95f02ca1d7b06f9383ba620425c4410c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/engine/src/tools/web_search.rs:3141-3159 | crates/engine/src/tools/web_search.rs:3207-3225 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":3141}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e8fec0cefe459e8d2e70bc7dc0fa003897592a80d7d55871db4f91f060db91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/engine/src/tools/workflow/mod.rs:6044-6062 | crates/engine/src/tools/workflow/mod.rs:6166-6184 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":6044}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9ebbdea339e6b7d7e20b89c7dc21e7fa2a96adf7150526abb64928f206f3d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/engine/src/runtime_threads/manager.rs:11123-11161 | crates/engine/src/runtime_threads/manager.rs:11182-11205 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11123}}}],"partialFingerprints":{"codehealthFindingId/v1":"683969977faa2a2bb5f4f48ca4561d1f044ad0482a7774f45ea3687001fe824e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/memory/src/store.rs:743-757 | crates/memory/src/store.rs:758-777 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/memory/src/store.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f60635052e0eb7419d9325cf3a8780b1559247d127218a8852ea0550a60934b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/app-server/src/runtime_api/git.rs:2071-2083 | crates/app-server/src/runtime_api/git.rs:2089-2107 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcf29801737ab6b68261df781cafd83e6d0d59b299b5da7df8b8ee9f5d47dc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/app-server/src/runtime_api/mobile.rs:161-178 | crates/app-server/src/runtime_api/mobile.rs:186-214 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/mobile.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51681ace53bfb229467bd52528ced0893aa1bd7de439054adeb8ea291422d0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/automation_manager.rs:1566-1581 | crates/engine/src/automation_manager.rs:2087-2106 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"f089b4da7f3d8230353349576b095f9875affcd7899264f4a8a08a6a7ed30693"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/client/anthropic.rs:922-937 | crates/engine/src/client/responses.rs:931-947 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"955a35b5a792a960fa9af4506a1a94bc1e716949f5b586ffecc69db3dbd5182c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/tui/src/lib.rs:12312-12327 | crates/tui/src/lib.rs:12332-12353 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":12312}}}],"partialFingerprints":{"codehealthFindingId/v1":"127e6917d69c3aa067aae1e5d4ac3a2fb424fda9e1f9cbeee7de25cc0ae0b6fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/workflow/src/lib.rs:1089-1110 | crates/workflow/src/lib.rs:1116-1136 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/lib.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef85cecd4d8eeb24173b26ff2cc7123f148d08b9e97114fea963e3b56f437e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/plugins/src/matcher.rs:146-163 | crates/skill-install/src/recommend.rs:206-224 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/matcher.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8cabef9a65c150b850f61644b526403141e8744788455306c3901eb965a779"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): crates/engine/src/runtime_threads.rs:2158-2178 | crates/engine/src/runtime_threads.rs:2307-2330 | crates/engine/src/runtime_threads/job_operations.rs:190-207 | crates/engine/src/runtime_threads/job_operations.rs:369-386 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":2158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba55d0d90462beb57a820a96761d47f9816aa9ba0bdbb74bdad653588fcfbde7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/app-server/src/runtime_api.rs:5181-5196 | crates/app-server/src/runtime_api.rs:5413-5430 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8164abae3c5184756906dad90da7971ddd952a2039d94cc6b09480a2cf76ad56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/config/src/credentials.rs:248-270 | crates/config/src/permissions.rs:285-300 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/credentials.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed1e63d8bc17e98dcbb107887676fd4f613bdc615fc34d72c7564fdf0498437"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/config/src/model_normalization.rs:12-33 | crates/runtime/src/config.rs:265-287 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/model_normalization.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc5451128993fd1191f59205c3dda15fe55440e6b5b40cc532a59a6c646c404"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/config/src/persistence.rs:114-128 | crates/runtime/src/settings.rs:2567-2581 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/persistence.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf356df0d2ee65938ac96b50f2e521e7e5bbf008092e0ac2f070bd01684eec02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/core/events.rs:1231-1244 | crates/models/src/tool_projection.rs:17-43 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/events.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d1a2b5ad4632a789d42c8360219d307f177ab12e2f0ef181c8a80fc9fc01d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/reasoning_preference.rs:433-446 | crates/tui/src/tui/model_picker.rs:5032-5047 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/reasoning_preference.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c77f2b9e7f316f021035bce9eb3b91b34a992824cccadde0ec62b4fac53a498"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/app-server/src/runtime_api.rs:5255-5273 | crates/app-server/src/runtime_api.rs:5278-5292 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8456631907e15e54b238bbe09d65ad80fca0b923c5e6e717778f69e1780dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/tui/src/tui/app/composer.rs:1039-1063 | crates/tui/src/tui/app/composer.rs:1065-1088 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a871285c478d45b84ba3028effa1f213bc7ffee29b1738ac002eb99043c61d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): crates/app-server/src/runtime_api/plans.rs:311-337 | crates/app-server/src/runtime_api/plans.rs:344-363 | crates/app-server/src/runtime_api/plans.rs:369-391 | crates/app-server/src/runtime_api/plans.rs:398-418 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plans.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3517670e4533259ff4fa41bdec682d77e978cf8fefc8abfdff3b9210e98b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/tools/review.rs:450-463 | crates/engine/src/tools/review.rs:468-483 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f635cde047b04cd70349fa30c15c09dd91ffa78f1af2c4de105bf30dcafc23e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/tui/src/integrations/dsh/bundle.rs:329-340 | crates/tui/src/integrations/dsh/bundle.rs:342-363 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/bundle.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce1e7cd13c367ba185e42252d0d834e73457512b2d9963c4f247ad21f6ac0ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/tui/src/tui/clipboard.rs:476-500 | crates/tui/src/tui/clipboard.rs:502-522 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/clipboard.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4c8087f77d4fd3cc5c70ac5021554b9b5bd552b0f2769ce381d03d3f07cd37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/app-server/src/runtime_api.rs:12691-12715 | crates/app-server/src/runtime_api.rs:12725-12740 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":12691}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bd0a89c693ba12d07e9eb1dc538b01977a4850d8ce8625583cafd85b87e056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/engine/src/runtime_threads.rs:3330-3356 | crates/engine/src/runtime_threads.rs:3380-3413 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":3330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b985590e0576281dd665feadd305744edc2007c1e5520e14d9ace62214ce1c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/engine/src/tools/subagent/coord/ledger.rs:1318-1340 | crates/workflow-js/src/vm.rs:1375-1392 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"230c0c9384214cb653b6a4b45d6b54ab17be152e531238d2e2da069082455cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): crates/tui/src/tui/approval/elevation.rs:231-252 | crates/tui/src/tui/approval/view.rs:459-481 | crates/tui/src/tui/views/mode_picker.rs:111-133 | crates/tui/src/tui/views/status_picker.rs:183-205 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval/elevation.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cd531657c33b91e7ec350bed75fb254f410eb7e68bdd18847f002d4d304f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/config/src/base_url_resolution.rs:64-76 | crates/runtime/src/config.rs:9291-9306 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f7d98edc7f34aed3b10eaed585995b2df203a49da670201fd176bf9e324f14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/runtime/src/config.rs:8122-8138 | crates/runtime/src/config.rs:8232-8252 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8122}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdba357052d819b827497fb280afbe8b5922968d50025880d60104aaaa6e9591"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/tui/src/tui/app/composer.rs:724-747 | crates/tui/src/tui/app/composer.rs:1013-1037 | crates/tui/src/tui/app/composer.rs:1264-1281 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a6d4f383aeaf720e77c095a3574bfddeb78fcaadea3de1ab77147e298089b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/app-server/src/runtime_api.rs:7939-7959 | crates/app-server/src/runtime_api.rs:7966-7989 | crates/app-server/src/runtime_api.rs:7996-8019 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":7939}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d1ec0c106b551e41e7c7c49ef12fc796a2b35e631761f259234928fff2883a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/cli/src/config_bundles.rs:1535-1559 | crates/tui/src/integrations/cli.rs:44-62 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/config_bundles.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed7c4da206fc9e3aa8f3f7436ab6e3ad9413f9aa537a65578d61474ea57ae73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/config/src/setup_state.rs:651-675 | crates/engine/src/automation_manager.rs:2438-2458 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/setup_state.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e02ead0138a81845709ba75fc709ecd15f1a38963b22307faf8adca501b6a0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/session_manager.rs:2646-2663 | crates/engine/src/session_manager.rs:2688-2701 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b1db2399b82d319031a2ac6fcc213f20268dad57ea638506880f7a22f33dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/tui/src/tui/widgets/approval_band_legacy.rs:902-918 | crates/tui/src/tui/widgets/mod.rs:2106-2121 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb0cecb9117b0688a610d6dd3d77625930e0601bfb27ddd5f1918940316b8f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/engine/src/runtime_threads/manager.rs:3696-3712 | crates/engine/src/runtime_threads/manager.rs:3718-3734 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":3696}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfd08bc4fc536b418a4d50002658727be5ea58525de1fc7be3c34d0c42d2667"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/app-server/src/remote_control.rs:4920-4940 | crates/engine/src/client.rs:1100-1117 | crates/engine/src/models_dev_live.rs:489-509 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":4920}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa1e06aa3bed79c2dda8e663cb587a0c77ba9e3c88be99538c1d28a119c681f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/app-server/src/remote_setup/mod.rs:153-172 | crates/app-server/src/remote_setup/mod.rs:174-193 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_setup/mod.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"959be6f2208da1ef1a3e31a7104669fdff0daa4bdb87d3c73de272fa2e6c16b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/app-server/src/runtime_api.rs:6463-6480 | crates/tui/src/commands/contract.rs:3019-3034 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":6463}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c137a31b3bacddb16d52163fb7c410f12e56862d00209a9a5deda25854824c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/config/src/model_normalization.rs:39-67 | crates/runtime/src/config.rs:9176-9211 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/model_normalization.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbce4ad61f9afba139a49f664fc03b03ab185d23a6b7a0411d79fe40939c8071"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/engine/src/fleet/profile.rs:1343-1367 | crates/engine/src/session_manager.rs:7213-7236 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/profile.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9e1bd8b33caf0096bc7c88052538cb5f7d20cc8b831367eb9e72666780fced"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/plugins/src/install/mod.rs:814-826 | crates/skill-install/src/install.rs:544-556 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/mod.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c565b48f885669c87b350e824854a774f962da0bea9e60ba7a1a6d9958f23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/tui/src/commands/groups/core/anchor.rs:87-103 | crates/tui/src/commands/groups/memory/note.rs:116-131 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/anchor.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6271b8a10c816ca8101123bbd6e90951df0dd6ebf1bf507a3e290393e9b3f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/tui/src/tui/agent_details.rs:433-453 | crates/tui/src/tui/sidebar.rs:240-262 | crates/tui/src/tui/work_surface/model.rs:2227-2250 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_details.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"5935bc7f56ad32f55de93055622b4181335a5054907f360e72687f9debf58b03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/cost_status.rs:3425-3440 | crates/engine/src/pricing.rs:311-326 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":3425}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f19d1264dc0d4f7c010c48fd4b1398bd74558890a3c4a8f5c723a3a267b69c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/engine/src/fleet/executor.rs:130-151 | crates/engine/src/fleet/executor.rs:164-190 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/executor.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7350765470b2900f286d5204a161de8a84d988cc704bd2dd310ff5b5365e7f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/tui/src/tui/model_picker.rs:1242-1263 | crates/tui/src/tui/model_picker.rs:1265-1286 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"03421bdb805e544c80467a8871308e8e58f3669bd96d519830d6b476d1618dbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/tui/src/tui/setup/mod.rs:2391-2406 | crates/tui/src/tui/setup/mod.rs:2408-2423 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":2391}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cb818fd91eb245665942213e1ed52b91aabfb232b6001e7f25296bd8c1910f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/app-server/src/runtime_api/git.rs:214-225 | crates/app-server/src/runtime_api/git.rs:227-241 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc096cc2a912de16f9c1a6228ca245c6ecaead232f8cbcd8f9d90dc14069e191"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/secrets/src/lib.rs:1075-1097 | crates/secrets/src/lib.rs:1108-1132 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bdbe4bc7d0b3ed0762fd15d3b4fdbed5f95cbf465c245b457327b3f749e998"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/engine/src/core/engine/rlm_host.rs:845-859 | crates/engine/src/cost_status.rs:3622-3634 | crates/engine/src/tools/subagent/engine.rs:50-62 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d564963c0728fe359176fcbdee9e3993edda083f29104f120c22482b6e695f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/tools/workflow/mod.rs:2975-2991 | crates/workflow/src/elevation.rs:219-231 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2975}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6dec4cd74e2b57f9afab07543cf0b7c49f62a7e4d050a7252374a53ab447b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/engine/src/client/chat.rs:4059-4080 | crates/engine/src/client/chat.rs:4088-4109 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":4059}}}],"partialFingerprints":{"codehealthFindingId/v1":"482cab9987b8feb3b0f7d276b923617e8b1d11deb85bd5cda1d66649b11be3b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/tui-kit/src/markdown_render.rs:281-304 | crates/tui-kit/src/markdown_render.rs:517-535 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/markdown_render.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0ae4b1b3e76557ff6fd50f764e1921b102b8f0f1cc178ee7030eed6f8fc73c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): crates/tui/src/tui/model_picker.rs:2141-2167 | crates/tui/src/tui/underwater.rs:1010-1032 | crates/tui/src/tui/worktree_manager.rs:520-540 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b002371050c31916ce38d39563c2735acfd27829d1a6951e36ca3d913b6e3a1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/app-server/src/runtime_api/memory_lens.rs:163-182 | crates/app-server/src/runtime_api/memory_lens.rs:186-201 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/memory_lens.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22307e8092f94f2086e7476aff04c747970c490412778ce5bd07178f5d3cabe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): crates/engine/src/client.rs:3096-3119 | crates/engine/src/tools/verify.rs:598-626 | crates/tui/src/tui/setup/fleet_draft.rs:222-243 | crates/tui/src/tui/setup/model_draft.rs:126-147 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":3096}}}],"partialFingerprints":{"codehealthFindingId/v1":"307124f4765247cb5acc6944c1ebfda8d8a368844f241fc04f43494ecaa1a056"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/engine/src/core/engine.rs:10621-10643 | crates/engine/src/core/engine/token_estimate_cache.rs:122-142 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":10621}}}],"partialFingerprints":{"codehealthFindingId/v1":"21775f03152128e4b0b2c8ce638e82f44b611dea3aac38feaf0c63f592f57f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/release/src/autoupdate.rs:235-242 | crates/release/src/check.rs:149-160 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/autoupdate.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a071d2a3f3867f7fc19c56c92826ae75d4cefebff5502d3cf03469b763fe6e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/tui/src/tui/ui/apply.rs:3438-3455 | crates/tui/src/tui/ui/overlays.rs:472-492 | crates/tui/src/tui/ui/session_state.rs:1296-1317 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":3438}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd962efd63f6cef68ce2f89386bb6981956582a4937bb8760e088df4c7fbde26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/tools/plan.rs:134-148 | crates/engine/src/work_graph/model.rs:764-777 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plan.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d72392a5eebc1ef7758bd8c5e67b32f4e93d1bce67ee8cf39c404d8f30b8159"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/protocol/src/agent_mail.rs:531-553 | crates/protocol/src/agent_mail.rs:560-586 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/protocol/src/agent_mail.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a608d728da038eac930655a30fdfc1bb1312b62664bddc125b6d220604ac6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/runtime/src/config.rs:5256-5275 | crates/runtime/src/config.rs:5284-5303 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6203c814fdd60e0d16ef7d45f5c059728b12305cc1883b0fc290e69dd5424dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/engine/src/tools/codemode.rs:129-163 | crates/engine/src/tools/js_execution.rs:99-128 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/codemode.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca73af948aeae24b6e8bed41f545ad3a5863efd0b99c6cca16c9b5cf432169ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/tui/src/tui/app/composer.rs:1914-1934 | crates/tui/src/tui/app/composer.rs:1955-1974 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"82004478e65f769a3d800d0e970e28e5e88c2ef021629234ba7ccc078b46f3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/snapshot/src/repo.rs:1554-1575 | crates/snapshot/src/repo.rs:2086-2103 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a256f9be72186e2f0139c1cb624c24459b52e93759012a3807248aabfce225a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/tui/src/tui/pager.rs:315-330 | crates/tui/src/tui/pager.rs:337-358 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pager.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8507c7bbfdf1caad1383e103aef54cf99beaccd4b96d3c71d124dc7c6b8679ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/tui/src/commands/groups/session/structcopy.rs:688-703 | crates/tui/src/commands/groups/session/structcopy.rs:743-760 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/structcopy.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9e2fa5ca8f9e4f1b86e3fcf9bda080bdf4167d2c223a5fc9c88e34ded234f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/tui/src/tui/account_login.rs:328-336 | crates/tui/src/tui/account_login.rs:673-681 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/account_login.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"74475cb4da4d51c5935c55ed8bbce27d68e2b2885d7606ac12fbf5f203a4650f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/tui/src/tui/session_picker.rs:34-46 | crates/tui/src/tui/user_input.rs:19-29 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b8711f2ddc7137eec289cd7c8fc8deed7c9dff6af332235a67861c3cecb058"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): crates/app-server/src/remote_control.rs:360-382 | crates/app-server/src/runtime_chat_relay.rs:1885-1905 | crates/engine/src/session_manager.rs:2507-2530 | crates/runtime/src/workspace_lease.rs:503-527 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e7530c6b693474ee032c22685a1b327007b9c6c456c32267e6d02d19c18753"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/mcp.rs:7978-7991 | crates/engine/src/mcp.rs:8041-8057 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":7978}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e1555c602263955fc0e341e3b6397bbe7249b999279bfcf9b5c23d3d2b28a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/snapshot/src/repo.rs:1098-1122 | crates/snapshot/src/repo.rs:1597-1626 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62ca8ae7541fc12b881593e926e8d9dcbaceda70ea4714f6ac6297d27def0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/tui/src/tui/views/fleet_detail.rs:672-692 | crates/tui/src/tui/views/fleet_detail.rs:694-710 | crates/tui/src/tui/views/fleet_detail.rs:712-727 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48d83ec0ab618d05ce176643708c73fe973e7025715ec78fd870ae4e15a3fe1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/engine/src/tools/subagent/mod.rs:12220-12234 | crates/engine/src/tools/subagent/mod.rs:12240-12257 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":12220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b32d709ae12e38cd2140c99dd7ada88fe77417abcb5797fd4175960a70d804a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/config/src/config_document.rs:453-469 | crates/config/src/private_directory.rs:1674-1690 | crates/runtime/src/external_credentials.rs:368-384 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_document.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabbdc10316aec90ed1956a40ad9cab8cecd2ab07c56dff361ff616d713dddba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/tui/src/commands/groups/config/permissions.rs:32-45 | crates/tui/src/commands/groups/config/status.rs:37-50 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/permissions.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc10c9cf4cde0e46bc2c0b58ed97e39def910f0791af53cd373bb8147d8f6cdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/app-server/src/runtime_api/listener.rs:65-83 | crates/app-server/src/runtime_api/listener.rs:91-108 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/listener.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a05ef183a5319993b77f1509dd40cdf42900d93648c1f06e023abbebda5c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/mcp.rs:6777-6792 | crates/engine/src/mcp.rs:6966-6981 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":6777}}}],"partialFingerprints":{"codehealthFindingId/v1":"360747e0aff22af4cbfcde532929ab4ab858ec8da6c14b9d274261dd94f70ac2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/engine/src/model_routing.rs:2183-2200 | crates/tui/src/tui/auto_router.rs:50-68 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_routing.rs"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"62cae44705f6b04a821816f82c159456427210b84c2619980567519553b9a9f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/runtime_threads/manager.rs:5055-5067 | crates/engine/src/runtime_threads/manager.rs:5069-5081 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":5055}}}],"partialFingerprints":{"codehealthFindingId/v1":"0385ad6fa9e8804cef85834ef6ea2494887280e4748190b33555ebd9247c990c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/plugins/src/registry.rs:1037-1051 | crates/plugins/src/registry.rs:1176-1191 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd7103650a04581edaa50b02d79ef24604652fe67c0c4dfff18b93abc174fe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/tui/src/commands/groups/skills/skills.rs:819-834 | crates/tui/src/commands/groups/skills/skills.rs:838-850 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/skills/skills.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b938a07e517a84903235298f2d3a1fc6b78f4f1f026c5a47a5a85d69d2193f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/engine/src/core/authority/grants.rs:747-773 | crates/engine/src/core/authority/grants.rs:776-798 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/authority/grants.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b60f79de2d9d3556c673d80e4a7d456c2782b4c1146188fdc0d48802277548"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/config/src/config_backup.rs:63-84 | crates/config/src/config_backup.rs:90-112 | crates/config/src/config_backup.rs:206-227 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_backup.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"369b4e930148c0567900dd5105f18dcef8155e42a7b349e02605d267c21d2391"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/tools/registry.rs:1231-1241 | crates/engine/src/tools/registry.rs:1262-1272 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e951fc3c19c9f0df836daf044f84596e6d0977602aeed5db7286e46b6633ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/tools/validate_data.rs:286-298 | crates/engine/src/tools/validate_data.rs:300-312 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/validate_data.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d608ab09f0b663482ef476a98c1720d50b4aacfdc845e8b9d86d5feb61441a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/tools/verify.rs:865-879 | crates/engine/src/tools/web_search.rs:3374-3387 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/verify.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"af49ee640325ee0536dcc71837646308b357b5d0305159115b1c11f09756a152"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/plugins/src/install/place.rs:210-227 | crates/skill-install/src/install.rs:1633-1646 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/place.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf6607d766eb2a53d1845bb0c2954d8d9034c120c303261073d76e83f739a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tui/src/commands/groups/core/fleet.rs:209-219 | crates/tui/src/commands/groups/core/fleet.rs:221-230 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/fleet.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c498d02cb30fdeef45a63a47a447e5225f4a00dd52ca4974f298e0f61088b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): crates/tui/src/tui/setup/mod.rs:2506-2520 | crates/tui/src/tui/setup/mod.rs:2554-2567 | crates/tui/src/tui/setup/mod.rs:2638-2651 | crates/tui/src/tui/setup/mod.rs:2671-2690 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":2506}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bea883c39058ae9493dc2f009b04d77d2db5789bd31a5e63170b7c51b79d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/config/src/resolve.rs:94-106 | crates/config/src/resolve.rs:113-125 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/resolve.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b439db27425354bb0e9e33e56420fd0a8de3b4840c3e142f07fb5f69e71be21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tui/src/tui/views/mod.rs:1503-1512 | crates/tui/src/tui/views/mod.rs:1517-1526 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a20a9881bcb645f6bf2f1e1f15f6d69a7d71b2ba5d88135fa9de6fc84eaa116"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/account-cli/src/lib.rs:1884-1897 | crates/account-cli/src/lib.rs:1899-1915 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b12fbcc04ef2c4a2756a73e06680f041ff5299ec93d464f9f772805065b5ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/app-server/src/websocket.rs:27-40 | crates/app-server/src/websocket.rs:58-71 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/websocket.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c6a840f1760fe52fd2a8e3e5d8eda3c46a4666c0345a4668fb9f88e49e471e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/tui/src/tui/app.rs:3769-3793 | crates/tui/src/tui/app.rs:3795-3815 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ece7646a08117ce9b034e833a1262880941585164a1c4abbc7a91854bc7a32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/engine/src/runtime_handoff.rs:1232-1253 | crates/models/src/turn_classify.rs:61-93 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_handoff.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b69a8ec8955469ac54396346df2ef2504648c3fc2f414d700cf4744c5cbc2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/engine/src/session_manager.rs:3152-3163 | crates/engine/src/session_manager.rs:3221-3232 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":3152}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b4a2c8568209b42d526c2e6df20d6c9e44dbe2b72a765bb6537eb5518d0209"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/tui/src/tui/provider_picker.rs:2342-2355 | crates/tui/src/tui/provider_picker.rs:2711-2723 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5c0dae0c65184fc73fb0e0a74230b49076d4210a82da583dbd292e2852d33a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/tui/src/tui/ui/handlers.rs:37-51 | crates/tui/src/tui/ui/handlers.rs:61-79 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"32678bf0a7708ddab55ee55ff2549698545a7ced35ea767f13d7e03bd265c4ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/command-contract/src/types.rs:25-33 | crates/config/src/app_mode.rs:17-29 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/command-contract/src/types.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"da840ae6f2ca1d7c4ee9f3617c0e618d87f21b137a0d97164e47ab2c47ca5652"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/plugins/src/matcher.rs:127-144 | crates/skill-install/src/recommend.rs:156-166 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/matcher.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed76b1ddebc9914ece83defae8dd2a69e56472e5b887fce4d7d5b00b886d17e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/tui/src/commands/contract.rs:2743-2756 | crates/tui/src/commands/contract.rs:2808-2819 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":2743}}}],"partialFingerprints":{"codehealthFindingId/v1":"438384737fc0b33916d423460979c556d464a24a53f7570f434a87e0d6fbdcd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/tui/src/tui/ui/overlays.rs:254-273 | crates/tui/src/tui/ui/overlays.rs:284-300 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/overlays.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c40056c7842a9e91dad5aa57b619b4950168649ff81e55f6b2f94ba5bedc40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/cost_status.rs:125-143 | crates/engine/src/session_manager.rs:1967-1982 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfb5d1941d9b6de361b2260cee00d004e21994325a8bf941826f6d5a7288591"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/tui/src/tui/app/composer.rs:670-684 | crates/tui/src/tui/app/composer.rs:1716-1729 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a4d4bd0ee973f6a8f3ca6588597e3509449a29372c743f0a1425eb6fdd49170"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/tui/src/tui/views/fleet_list.rs:192-210 | crates/tui/src/tui/views/fleet_list.rs:212-229 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_list.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"45483f4e5f1df3efa10549fe42e77f56141068dab54766b30110eb11e9ec747e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/engine/src/fleet/profile.rs:1054-1072 | crates/tui/src/lib.rs:14924-14938 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/profile.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"377e1a2e1170d6adc33bb29ca3d13852b550a3efcb430c0890fd4ca59d49cc42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/tools/speech.rs:652-669 | crates/engine/src/tools/web/guard.rs:34-49 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/speech.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0fc96e2c6bf38568094d153e1402a0ec131fde00841945ebef58b2a85ed26a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/runtime/src/config/paths.rs:156-171 | crates/runtime/src/config/paths.rs:173-188 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config/paths.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3f86b5146e3c87cca571615998484fe1869a878f25e464813d9c8e6c8cf143"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tui/src/commands/groups/memory/note.rs:105-114 | crates/tui/src/commands/groups/utility/attachment.rs:48-62 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/memory/note.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8329be6ffac062fc7b638458c3c748bd27682d8b12125c8a854cbc928352b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/tui/src/tui/setup/mod.rs:2310-2332 | crates/tui/src/tui/setup/mod.rs:2339-2360 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":2310}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f1c33545288169585cf49cf1fe3deb19f44c756c7740ebcbda48f849e443db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/client/anthropic.rs:352-365 | crates/engine/src/client/anthropic.rs:375-392 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"31349d39d43dbc41de33a183dc082ffb58290e231452f9650addc16c1c319b27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/engine/src/extension_host/registry.rs:1852-1862 | crates/engine/src/extension_host/registry.rs:1864-1871 | crates/engine/src/extension_host/registry.rs:1917-1924 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":1852}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9c0d36a96cf276ed43b0165fa5f403eabee806807feb8e9c1a730ecce28741"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/hooks/executor.rs:456-466 | crates/tui/src/tui/ui/observer_hooks.rs:296-307 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2afc38914dd6fbb246cf75f2e17249e85912dce86e2784c6434955cef075a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/tools/run_tool.rs:155-168 | crates/engine/src/tools/web_tool.rs:201-214 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/run_tool.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f89145616d32963e137a0b66da471f6020236bd96faea16c8e464f7c6918acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/tools/web_search.rs:98-105 | crates/engine/src/tools/web_search.rs:108-115 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8a3d057e17fcd5fb4209268424e108e3783223e85d1c94ac9d3420d0be785b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/engine/src/tools/web_search.rs:3013-3024 | crates/engine/src/tools/web_search.rs:3120-3134 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":3013}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64c603a213b95a15323495e3831be04aa03badac9df85d1c91f2c7857d6ce9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/runtime/src/working_set.rs:883-895 | crates/tui/src/commands/groups/utility/attachment.rs:74-85 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/working_set.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"299aa336636849901814be5fd437a5a8ba69d384df0c622ecda261736a9f3716"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/app-server/src/remote_control.rs:1896-1915 | crates/app-server/src/remote_control.rs:2490-2512 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":1896}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cfa9efc6f23163f57f7b51ed2d9e78e5f073d77573608be5b577e26d7da710"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/cli/src/update.rs:2404-2410 | crates/dependencies/src/lib.rs:466-472 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update.rs"},"region":{"startLine":2404}}}],"partialFingerprints":{"codehealthFindingId/v1":"1798938ae0f9acad87fe7fd94f1f3a9b8d801f26212ebec5861d058be09df4ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): crates/engine/src/runtime_threads/manager.rs:10742-10753 | crates/engine/src/runtime_threads/manager.rs:10920-10934 | crates/engine/src/runtime_threads/manager.rs:10984-11001 | crates/engine/src/runtime_threads/manager.rs:11013-11028 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":10742}}}],"partialFingerprints":{"codehealthFindingId/v1":"7415f56c6b13252bf4ef4de944d2f91cc9d46bd91a83d5dc93265262b8ae03f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/telemetry_notice.rs:343-353 | crates/engine/src/work_graph/runtime.rs:1040-1051 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/telemetry_notice.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f4136b1c8ed3a1bc74bde2c6f5bbe1f7516c443472139213a8013194a84265"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/tools/web/contract.rs:40-56 | crates/runtime/src/config/search.rs:95-110 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/contract.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c557ad3462f0a7d681a7e1bb2337cb3c0833d0771bb7fa23b5085d83326ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/tui/src/tui/app.rs:4058-4079 | crates/tui/src/tui/app.rs:4085-4107 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":4058}}}],"partialFingerprints":{"codehealthFindingId/v1":"706ddebd9f4226d1d56f424844054cb7d3fb618dc1507af90931b282821dacb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/app-server/src/runtime_api.rs:3771-3788 | crates/app-server/src/runtime_api/web.rs:321-341 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":3771}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef8663b00c10ca027f942bb52e0d042eceecaf5803c20169ea1c24710bc55bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/task_manager.rs:4288-4296 | crates/runtime/src/workspace_trust.rs:172-180 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":4288}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc1ae5876562a2a5e60db1a338c0055a6997e13e0e9a324ade5919cba0280bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 16\u002B corresponding lines): crates/engine/src/tools/automation.rs:100-118 | crates/engine/src/tools/github/mod.rs:98-116 | crates/engine/src/tools/rlm.rs:96-114 | crates/engine/src/tools/send_later.rs:63-78 | crates/engine/src/tools/tasks.rs:139-157 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"42efde9af3d7c48f9665a80a82308070e03ef7aeadabb0460b834c368c6e3eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/tools/github/shape.rs:162-175 | crates/engine/src/tools/tasks.rs:1369-1386 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/shape.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5346995d1b093fb97d4d020e7f551183718961ca90f58795eff1dc43354e83b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/sanitize/src/redact.rs:822-837 | crates/workflow/src/redaction.rs:571-585 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1663205d9ed70f66f8553546185fa8dadc1f275f32efaef542f364a144fc1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/tui/src/tui/widgets/agent_card.rs:401-417 | crates/tui/src/tui/widgets/workflow_panel.rs:429-446 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/agent_card.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d9e8602d0f44678d988103a09c70a53556298c82bda83409d0a3888d7eb33f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/workflow-js/src/vm.rs:712-721 | crates/workflow-js/src/vm.rs:934-943 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/vm.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9772dabacaad0bf7b5c949d8feee5274c1df07c4e761737e4849743e0df11a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/workflow/src/named_fleet.rs:57-67 | crates/workflow/src/reasoning_router.rs:377-385 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/named_fleet.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4fe48602c572ba51b276bbe3d6d834c6215ca84e1b4ca55de5aaac11b0d158"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/config/src/path_io.rs:136-151 | crates/config/src/path_io.rs:154-166 | crates/engine/src/hooks/config.rs:12-24 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/path_io.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a96cd33bf41c17ec4e54cb7d4fcd7a02d9a51729d4a321c602c4c8ef4f50eb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/hooks/executor.rs:1254-1272 | crates/engine/src/hooks/executor.rs:1405-1414 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2b963b6b7f1045fb2afe7dd9b2bc928723c1b72ed8cc54ebdddbe7dcd6130e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/plugins/src/agent_plugin.rs:598-609 | crates/skill-install/src/skill_parse.rs:219-230 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/agent_plugin.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7d3a604cf66fa116bead590c242f29bb7f00f143e495654134f7aedf391bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/tui/src/tui/app.rs:7514-7524 | crates/tui/src/tui/ui/session_state.rs:103-120 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":7514}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6e129f0d480c4abf11eefeca518a6b91c6458de2f90b96c2a8f6fc35c91a2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/core/src/fragments.rs:157-172 | crates/runtime/src/model_context/fragment.rs:162-179 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fragments.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"093bc5c8d462a05b527b2bcf0ece45939b92b88e806dcd6934a26e0d090373d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/core/src/secret_eq.rs:11-19 | crates/tui/src/tui/pet_watch/owner.rs:177-185 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/secret_eq.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3915f454f3f21504ebb16ca5c2062ab980c216d04f43c5c38690eab7832128e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 7\u002B corresponding lines): crates/engine/src/core/engine/handle.rs:1041-1047 | crates/engine/src/core/engine/handle.rs:1052-1058 | crates/engine/src/core/engine/handle.rs:1074-1080 | crates/engine/src/core/engine/handle.rs:1089-1096 | crates/engine/src/core/engine/handle.rs:1102-1113 | crates/engine/src/core/engine/handle.rs:1120-1127 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/handle.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"509457e93c01b505efe9149065ba7147340c58a47865a95b6a6b9a41c5c38f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/engine/src/extension_host/mod.rs:2077-2088 | crates/engine/src/extension_host/mod.rs:2092-2104 | crates/engine/src/extension_host/mod.rs:3572-3584 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c69e14ad57446bc1caf027b4c0318ad6ed56e875edcac8b0100a66cddcc9bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/runtime/src/config.rs:4965-4977 | crates/runtime/src/config.rs:5022-5039 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":4965}}}],"partialFingerprints":{"codehealthFindingId/v1":"7246e4297ea82c8eddf33461b38e3ad1333724020c83369a2c306809c5917cc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/sanitize/src/redact.rs:1542-1549 | crates/sanitize/src/redact.rs:1673-1680 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6bbf0714ba53769046253ed940acd7ca76c2dbf57d80b23328daa8b24e97d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/app-server/src/runtime_api/plugins.rs:576-586 | crates/plugins/src/install/dsh.rs:1182-1194 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plugins.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc0a8345958b7df731c0444399ce547a89a9cfe619e6afba096d78bc08f6247"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/engine/src/provider_catalog_live.rs:596-610 | crates/runtime/src/catalog_cache.rs:15-29 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"2395bb0e51eedb2495f7266298a19bba9aa5132cc69f7d4e4d298cfb80efeaf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/runtime_threads.rs:6074-6081 | crates/lane/src/runtime.rs:227-233 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":6074}}}],"partialFingerprints":{"codehealthFindingId/v1":"143d1fc868ea16b4b953d39265141825d120ddb8816978139a005885adede944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/tui/src/commands/groups/project/goal.rs:169-184 | crates/tui/src/commands/groups/project/goal.rs:192-213 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/project/goal.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"347616069467b99363eef45103c5a081add01f26659de656eccba792bf4dd10d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/tui/src/tui/views/help.rs:315-329 | crates/tui/src/tui/views/mod.rs:3410-3426 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/help.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b5aea8ad90cde57fecde86a7c8ddc47e1518db2148bb1515cfc77e5ec7943f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/commands/src/debug/cache_format.rs:768-778 | crates/tui/src/commands/groups/core/modeldb.rs:147-158 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache_format.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aef200bf9edabdedf35cf748f4f82c23391667f085accfff9579adcac236c66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/dependencies/src/lib.rs:1417-1430 | crates/dependencies/src/lib.rs:1441-1459 | crates/dependencies/src/lib.rs:1487-1500 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dependencies/src/lib.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce35cdcc2fc5d9b2fdc11d2be385971160e8c63e5d967fa7888b737f0d5a9798"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/plugins/src/manifest.rs:1011-1024 | crates/tui/src/lib.rs:12280-12300 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"9728205e11080bcf40c9e8e7eba7026c2453b430dfd2e8c1450bed8af68ac154"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/telemetry/src/decision.rs:352-366 | crates/telemetry/src/decision.rs:386-397 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/telemetry/src/decision.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"435c0fca5103130bab7faac5f102778011a24bee3bc8883e420bfb72ffac3e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/runtime/src/credentials/store.rs:187-202 | crates/runtime/src/credentials/store.rs:284-296 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/credentials/store.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"51baf090732e72994b8398b23256edecb7bf943d8d2b34b82074fcfce4e51cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/runtime/src/skill_state.rs:272-284 | crates/runtime/src/skill_state.rs:287-300 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/skill_state.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c58131b6288f5a07fae7c28af034fcf99fccab9474e74689cbf43aa15506d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/tui/src/commands/config_host.rs:198-212 | crates/tui/src/commands/config_host.rs:214-228 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_host.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2669fdc58c9aa38a9843f719e89d8b30c98f3abfa6ab400adce021c4ff07098"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/tui/src/tui/ui/fatal_signal_guard.rs:201-215 | crates/tui/src/tui/ui/job_control_guard.rs:231-244 | crates/tui/src/tui/ui/job_control_guard.rs:250-259 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/fatal_signal_guard.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"56367d69a227a542d3f4fab04161d9f9226c052e4a0f3e602ba6b769a73c2b80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/tui/src/tui/ui/terminal.rs:555-584 | crates/tui/src/tui/ui/terminal.rs:586-606 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/terminal.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62bdb1e955dec9be53260f8e3c2b1944e9a4dd18ac8499b8a8a0ed7bf8ed550"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/tui/src/tui/widgets/composer_legacy.rs:233-245 | crates/tui/src/tui/widgets/mod.rs:1239-1251 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9032a231852cc78ed379881f0fed513b28d398fdab3db50af61d8d00f43be8ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/automation_manager.rs:2881-2897 | crates/engine/src/automation_manager.rs:3103-3118 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d26256cef35b7765fc8f271cca45e98726851421d7ebb1165d57eafee40da72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): crates/engine/src/extension_host/registry.rs:1004-1018 | crates/engine/src/extension_host/registry.rs:1815-1829 | crates/engine/src/extension_host/registry.rs:1875-1891 | crates/engine/src/extension_host/registry.rs:1901-1913 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e27d77ff58840bd9c9afe1d2c5e352dbf0683b25dab37cde53b4fa7bdc491a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/lsp/src/registry.rs:33-47 | crates/lsp/src/registry.rs:53-67 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/registry.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d988c6c8a9af19aaef6f63bf8d9689c5d93781ec821249a0b67476bfe7d41d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/protocol/src/agent_mail.rs:424-435 | crates/protocol/src/agent_mail.rs:439-449 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/protocol/src/agent_mail.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7221495edca9df96619749479bd791dbaa7f3cc8f34214ea040703fc462b9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/runtime/src/config.rs:7351-7362 | crates/runtime/src/config.rs:7370-7381 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":7351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eeaa04ab763a6e13d26e635f6361cf14ce727455d974ad47d42fdb95ca3f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tui-kit/src/diff_render.rs:119-128 | crates/tui-kit/src/diff_render.rs:136-146 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff71ce05f82fd6788c173917d1f81e1243cc741127b5ba251624b0d73465901"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/extension_host/mcp.rs:225-237 | crates/engine/src/extension_host/mcp.rs:238-253 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"599a80a74cd620f057bbb123493c230a46d99f6d3288b3aad50aa1939b906318"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/engine/src/hooks/executor.rs:1328-1342 | crates/engine/src/hooks/executor.rs:1548-1562 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"61304eecf3c58e645bd8a43f451a08ae29adc62c4ed4838e4054567a68c04783"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/mcp.rs:3374-3393 | crates/engine/src/mcp.rs:5579-5589 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":3374}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c83b0d3fe60980216492d47131a16a44ba909c81a47c677f2c4d72d279f721"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/mcp.rs:5023-5033 | crates/engine/src/mcp.rs:5175-5185 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":5023}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ca7378ea22569118f154f0053e6fc8fb13d586d3960ee5af7aa8b3db44037b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/engine/src/tools/automation.rs:261-280 | crates/engine/src/tools/tasks.rs:335-351 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82ebafcd4c49789fa831144ebe84758a3be6ad5aceb3c9ef0757428362b7953"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/engine/src/work_graph/digest.rs:77-91 | crates/engine/src/work_graph/runtime.rs:1057-1071 | crates/tui/src/tui/work_surface/model.rs:2794-2809 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/digest.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda9cfbc46dcaff04b157f6c55bf3fc27a613d8747cb42cb9cd7fd616ca9a887"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/workflow/src/lib.rs:2002-2014 | crates/workflow/src/reasoning_router.rs:387-400 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/lib.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed69865124681ca1e90a9066e570f4b1389f6fb387d6f9c7db443095d205c15d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/app-server/src/runtime_api/auth.rs:142-152 | crates/app-server/src/runtime_api/computer_display.rs:1105-1115 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/auth.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e695e52845162c140d9775a79646d1ebfe17864e282df6bc02409ec460cfb5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/automation_manager.rs:2341-2348 | crates/runtime/src/workspace_trust.rs:164-170 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58f63d2d36b3e084823b7ad2efac496f8b07b9497ac462de836ed620dff8722"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/compaction/last_round.rs:365-375 | crates/engine/src/compaction/last_round.rs:388-398 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction/last_round.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d44ee147ee0bbd5f37af91447b647347bdb56843c89040ccf096754aa2f580"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/extension_host/dsh_network.rs:342-348 | crates/engine/src/extension_host/dsh_network.rs:356-367 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"874bb938d14a139abdd2c7da1262de5cc7c1fb3dd3f3332fa3476a05570e1bc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/operate.rs:603-616 | crates/engine/src/operate.rs:620-633 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/operate.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63fd9df7d558447a7300b6c9a73d5a6b785233dbfb6b859998246279484700a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/engine/src/repo_law.rs:163-174 | crates/tools/src/patch_preflight.rs:400-414 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/repo_law.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab579a2bbd703b398b42e890834a9e72e3b84dff00b8ed2fec412f97a86be738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/plugins/src/registry.rs:1381-1394 | crates/runtime/src/skill_state.rs:179-190 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"3020dedb56889e0281c15afbad395408f74c7c12697f40561795e27812f5476f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/runtime/src/artifacts.rs:153-164 | crates/runtime/src/artifacts.rs:242-253 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/artifacts.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3762cd2f936801a1e39d00170cf248a78abb12e558ef25d81d1b45364b7609c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/automation_manager.rs:3192-3203 | crates/engine/src/automation_manager.rs:3315-3323 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffa944950300170a81d248babc2b09ab58af0fecb1b156e384b2ce43ea7e97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/engine/src/mcp.rs:5865-5879 | crates/engine/src/mcp.rs:5882-5894 | crates/engine/src/mcp.rs:6045-6057 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":5865}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fc26a4e54f17ad26cd02859772a34d438f156b11a16678a162aae1bee8bb87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/runtime/src/config.rs:3300-3310 | crates/runtime/src/settings.rs:2926-2936 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3300}}}],"partialFingerprints":{"codehealthFindingId/v1":"8664ce98333455f7b7b8210b831d555c8ee835ba416b65389bae39d7b7c75ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/runtime/src/config.rs:5079-5088 | crates/runtime/src/config.rs:5092-5101 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":5079}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2664c737c47c1cb23cf1e40b262129e81fa50449de4e014f6251af636a2994"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/skills/src/lib.rs:246-259 | crates/skills/src/lib.rs:272-284 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"682db26736b99a35bb1950425b34073f0591e63cac100eabd440b3b4e5ff6602"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/commands/contract/config_main.rs:296-304 | crates/tui/src/commands/contract/config_main.rs:306-312 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/config_main.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"48aeb316008197c0d8ce1e4e619e075c55f277879c8508ea68a8e69ffb71d2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/commands/groups/core/fleet.rs:83-89 | crates/tui/src/commands/groups/core/lane.rs:28-39 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/fleet.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f94423b4003f534ee691b281fa0ac57a08e0d908e261d12f9b8fa8323a5f79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/tui/src/tui/setup/mod.rs:2121-2137 | crates/tui/src/tui/setup/model_draft.rs:74-91 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a42f8fae36f484018c54b667fc06d7c5a0b469c96f42f1b60c7d41caa93665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/app-server/src/runtime_api.rs:10268-10291 | crates/app-server/src/runtime_api.rs:10537-10556 | crates/app-server/src/runtime_api/review.rs:8-31 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":10268}}}],"partialFingerprints":{"codehealthFindingId/v1":"143ff5280ddf5f4f25c08011c6e5ed28a8acf2d0f9419866490e2644a570d512"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/app-server/src/runtime_api/git.rs:613-626 | crates/snapshot/src/delta.rs:74-84 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c62902eb39511d938347ec70c69c772fa7b27d2e553c349f0f2eb7a8fe583b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): crates/commands/src/debug/cache.rs:47-56 | crates/commands/src/debug/undo.rs:118-130 | crates/tui/src/commands/groups/project/goal.rs:295-305 | crates/tui/src/commands/groups/session/color.rs:39-48 | crates/tui/src/commands/groups/session/remote_env.rs:46-55 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2120bce46da198187e132d3f39cdbac1e3b6b6879e0b32757147febeb220f94c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 20\u002B corresponding lines): crates/dependencies/src/lib.rs:273-295 | crates/dependencies/src/lib.rs:324-343 | crates/dependencies/src/lib.rs:350-369 | crates/dependencies/src/lib.rs:420-439 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dependencies/src/lib.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d55ea9c851b0e6848e01d2b3eb5413640edd6b7ad604f3d9a665dcaaa3d49ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/client.rs:1602-1616 | crates/engine/src/client.rs:1622-1634 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"53881199d6b950555a0914813947d46c82e9961a0e6334c5ff491d84fa459dc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/operate.rs:636-650 | crates/engine/src/operate.rs:866-876 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/operate.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff1ed0eeb5a662a942378c50ab34ec20ba3f9b1a75d99f8928a76167dfb783f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/runtime_threads/manager/history.rs:8-17 | crates/engine/src/tools/github/host.rs:636-647 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager/history.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7a3274b81588260208b899226c0ccd72bf52dca6c33fe4e847643b95728484"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/task_manager.rs:2621-2635 | crates/engine/src/task_manager.rs:2660-2669 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":2621}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a68516d12077955ff27cba4423a17a8399709c48f4a3279091ce7172f2f8a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/notify/src/payload.rs:322-340 | crates/notify/src/payload.rs:375-403 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/notify/src/payload.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"964f0ffa2b8c92cfaa2fe6c84130dc5936e740094634d06bff3d548183592bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tui/src/commands/contract.rs:2821-2830 | crates/tui/src/commands/contract.rs:2832-2841 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"5666071911894ba0901692ed2d5852012d8ff5a3e981af8534313f65b1cc7503"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/tui/src/commands/groups/memory/memory.rs:183-192 | crates/tui/src/commands/groups/project/init.rs:849-860 | crates/tui/src/commands/groups/utility/attachment.rs:33-42 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/memory/memory.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"850a5187fadd59f996c56517e5c1192bb85ac89a7a097534413d98f7ebbd53a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/tui/src/commands/groups/session/export.rs:221-235 | crates/tui/src/integrations/dsh/identity.rs:213-223 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/export.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"a350e8c931a496ff514e761e0307a9fed9a43c7d946a86add0afe8b8559c3151"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/tui/src/tui/ui.rs:1236-1250 | crates/tui/src/tui/ui.rs:1252-1265 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui.rs"},"region":{"startLine":1236}}}],"partialFingerprints":{"codehealthFindingId/v1":"378ca830917e9d47c53bcc6c7768cd0b1d0b261cc4930d110e697beda474a8b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/client/chat.rs:3687-3696 | crates/tui/src/tui/provider_picker.rs:1520-1534 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":3687}}}],"partialFingerprints":{"codehealthFindingId/v1":"74238b8328496e3e955349a6d708bacb79a056bd5f6d3e92f804b52f024667cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/engine/src/runtime_handoff.rs:512-533 | crates/engine/src/runtime_handoff.rs:556-579 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_handoff.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1271d8effabf8f095203e2586430bf871352a79e9e6c0f59f0a42e7a900ba46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/session_projection.rs:324-339 | crates/tui/src/tui/widgets/mod.rs:3086-3102 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_projection.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6244152499c17a2a37f5c8b92ad10a52aba683419c1d23b75e9ef85babb057"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/net/src/network_policy.rs:288-310 | crates/net/src/network_policy.rs:313-328 | crates/net/src/network_policy.rs:355-370 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/src/network_policy.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba64f020e69bae72de080d154f3c2aba272434a680999e19636ac5eaf1372eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/snapshot/src/repo.rs:1914-1923 | crates/snapshot/src/repo.rs:2107-2118 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39be43157b3d1e9a059c0f517b62a656443caae08ba719b7bec19fe510bfd7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/tui/src/commands/contract.rs:2290-2302 | crates/tui/src/commands/contract.rs:2304-2311 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd47aae0ea37581242c82c5d7f1e223331d62347c91cd726b5bf00edab84f88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/app-server/src/lib.rs:107-118 | crates/app-server/src/lib.rs:143-154 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/lib.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ac7e8ed156b9f495e0df7f307f7542aaeda07e3c7f4d7ce4cf91ba60f10b452"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/app-server/src/runtime_api.rs:5711-5721 | crates/engine/src/fleet/alerts.rs:300-310 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5711}}}],"partialFingerprints":{"codehealthFindingId/v1":"51052c86669a2d0defe1392672f1f90d64f4b9fc13355edaa1630ed80e3dcf13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/app-server/src/runtime_chat_relay.rs:420-433 | crates/app-server/src/runtime_chat_relay.rs:435-445 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cddf41ac0c40b8c27049ba581c0f0b35f28c9c17de9824b209394fbe524817e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/config/src/settings_schema.rs:1579-1587 | crates/config/src/settings_schema.rs:1590-1602 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/settings_schema.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1840632ad0ab869127d143db1c3241af5270148835fcd39f58095b4ec9ebc314"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/engine/src/mcp/http_client.rs:686-698 | crates/engine/src/mcp/http_client.rs:700-711 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/http_client.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d175f5abb124e0bb531e8ccb21f8399dbf5db5a37eaad33a06999eeab156d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/engine/src/tools/spec.rs:449-460 | crates/engine/src/tools/subagent/coord/ledger.rs:1342-1353 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/spec.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f094cc8354ce7bc8b8b2c8c0c6a53336866c71a44c6f4804eba63e231a9c206"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/tui/src/commands/groups/core/help.rs:33-42 | crates/tui/src/commands/groups/core/home.rs:68-79 | crates/tui/src/commands/groups/core/links.rs:33-44 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/help.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef984260aeb4f77ab5e4b76ebfddf07e2a43f5d0466f9c5ace87c88afc72013d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/tui/src/integrations/dsh/bundle.rs:101-115 | crates/tui/src/integrations/dsh/detect.rs:175-189 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/bundle.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac11b11fc8e8fba3321bd0b24105fcabee204fdbde0135a58bb19fd5646ce6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/tui/src/lib.rs:10530-10542 | crates/tui/src/lib.rs:10589-10601 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":10530}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ce76bb07841107c12844b0b4dc28c5fcfa527ab0b360da1e7036586706b0ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/app-server/src/runtime_api/lsp.rs:240-255 | crates/app-server/src/runtime_api/lsp.rs:260-275 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/lsp.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"991351939428aa824443799196f59e039341f5f71fe091e1b6dd7eb6e9ec7d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/config/src/notifications.rs:661-670 | crates/workflow/src/fleet_exact.rs:133-142 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/notifications.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca82842d9f251bb270b8df85cfdc78d50c1f9c1bd31e824e238b93cb366a7acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/core/engine/turn_loop.rs:5856-5864 | crates/tui/src/tui/work_surface/model.rs:2575-2584 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":5856}}}],"partialFingerprints":{"codehealthFindingId/v1":"51773ba8b9fbfad32e10b80ffc4865b280e55ab6684600e157c441c5e3473916"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/fleet/executor.rs:459-466 | crates/engine/src/image_attach.rs:1214-1221 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/executor.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4e7c121f59d019c2b7e11839a84e7af837108be5ee928d3d337b45202f36e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/fleet/identity.rs:438-454 | crates/execpolicy/src/command_safety.rs:2381-2393 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/identity.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bbb409ee3f74971406080af5b8513044fcb878ffd39c70a2435a7c1615a49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/fleet/profile.rs:1003-1015 | crates/engine/src/fleet/profile.rs:1037-1049 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/profile.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"450993c28728ee8404ef3962c3e2ba18f48e12027d1743cd4bc637afefd9039d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/engine/src/tools/file.rs:2124-2148 | crates/engine/src/tools/file.rs:3109-3132 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b835695afc07d596d32055a29de2adef56bf29393df2f054f9f5d655e9607f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/engine/src/tools/spec.rs:505-519 | crates/engine/src/tools/subagent/coord/ledger.rs:1299-1311 | crates/engine/src/tools/subagent/coord/ledger.rs:1359-1371 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/spec.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6be09237fb5e37dac188372735b3cc8a3d5e3af3a71f0c6b80f213ab6d0438e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/plugins/src/registry.rs:1728-1734 | crates/runtime/src/skill_state.rs:237-243 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cca86fc844224d3554fc96695ed4be07397a34713e04742b64f2c75c2925be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/release/src/lib.rs:73-84 | crates/release/src/lib.rs:87-98 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/lib.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2c4dcefa66e1ac4ec336d305146ce6ea676dae4caedab697c0e5e7c4bfc417"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tui/src/tui/history.rs:3567-3576 | crates/tui/src/tui/history.rs:3578-3587 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":3567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac44854b5fa3194455885d95ccdd04222c9b8a1542534f84a64f6a9b587d5875"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/tui/src/tui/session_picker.rs:404-414 | crates/tui/src/tui/session_picker.rs:773-783 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"916b3a16e2c5e8eb823146129b43df12cbb8da1e81aef10c82922166cb9397a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/app-server/src/remote_control.rs:4435-4442 | crates/app-server/src/remote_control.rs:4445-4455 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":4435}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b66ba8244fbbffed896ab945f235d3129c9caf00a802848e8e2b1218319a137"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/engine/src/extension_host/execution.rs:398-409 | crates/engine/src/extension_host/execution.rs:410-422 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/execution.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b56aa9a49e2e3783625f46716fff7478e9fa1f0395c6c5f17e8b53eb935d3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/engine/src/runtime_handoff.rs:877-897 | crates/models/src/turn_classify.rs:23-41 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_handoff.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5736a2abc27328b45bf947fa9c702b5fc2a5e96f594272a528867f4e748bb79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/tools/subagent/mod.rs:3042-3055 | crates/engine/src/tools/subagent/mod.rs:5955-5971 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":3042}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbc8e796cf08c4a91101fbf652a1569684e1cc7a415ce8f4a7ac64b00707b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/engine/src/tools/web/citations.rs:175-196 | crates/engine/src/work_graph/model.rs:457-480 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/citations.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"02661a4b933fee608f0475dc8710e18bc3557d4e4c9c25dd2817ac8648eec0aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/tools/workflow/journal.rs:55-70 | crates/engine/src/tools/workflow/journal.rs:72-84 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b289bbc0a48b603e77b732277b3293cef0f4d68226159f695f06d4ffc5bbb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/plugins/src/activation.rs:190-210 | crates/plugins/src/activation.rs:215-235 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/activation.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09da9026a0e6cce5036cf5433df02e9616491de81da58414247778bb7791fb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/plugins/src/marketplace/document.rs:287-304 | crates/tui/src/commands/groups/plugins/marketplace.rs:429-447 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/document.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3778616e1502105f0fbed4570d595667f5a3bdc0bf472731967e268fe68bf2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/runtime/src/settings.rs:2954-2968 | crates/runtime/src/settings.rs:3166-3182 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":2954}}}],"partialFingerprints":{"codehealthFindingId/v1":"0761bb24aaeb801c4c42f117fc2ff4145a75a30ad250281b56a68003486e8fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/tui/src/tui/agent_details.rs:400-413 | crates/tui/src/tui/agent_details.rs:415-428 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_details.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"688a07e27295f66b804d403676c25de34147b377212427e3988b19169e50b54a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/tui/src/tui/widgets/workflow_panel.rs:1820-1833 | crates/tui/src/tui/widgets/workflow_panel.rs:1841-1854 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"12dbcfb48824c79ea3c5ac4e83878026e2f242de4c29fc988c1c997741360333"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/app-server/src/remote_control.rs:5215-5225 | crates/runtime/src/catalog_cache.rs:31-38 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":5215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8413f3185c8ecbcf565afb26a863cf58da6d9fff794f5099d03d01f0a440af08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/app-server/src/runtime_api.rs:7085-7104 | crates/app-server/src/runtime_api.rs:7109-7125 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":7085}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ade061ac383f674ceec608c8b77a41cff7369f81df99e780a43bc8d9c045dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/app-server/src/runtime_chat_relay.rs:1971-1981 | crates/app-server/src/runtime_chat_relay.rs:1983-1993 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dee65cf3e6f6e1c953fed7350d8ec67785cffa10ebb30790d22b318ead3b132"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/session_manager.rs:908-922 | crates/plugins/src/registry.rs:1764-1777 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9354574c116477ff9aa35d695d33aabc3ca8e645553f82b00bde0b60a96e2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/execpolicy/src/lib.rs:1011-1022 | crates/execpolicy/src/shell_expand.rs:2138-2150 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/lib.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5babe025e3fc688a35227c1b799c512bf912e5ea19ed5cdcac60ebbb3a1c0ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/snapshot/src/delta.rs:63-72 | crates/snapshot/src/repo.rs:2357-2366 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/delta.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce360be5450bf2d88ce37d34f2f6f4a06b74659c5cdca2ba1de500d72169b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tui/src/tui/hotbar/actions.rs:1095-1105 | crates/tui/src/tui/hotbar/actions.rs:1339-1348 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/actions.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"066befb77c191e898f36f152a8db017fcadeab1d94b92ccbec7b5c91e4bf9fbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/tui/src/tui/setup/mod.rs:4154-4164 | crates/tui/src/tui/setup/mod.rs:4189-4199 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":4154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b23bfdcd77c5ca3d02789aafd096376581d9d105efb2ee4cb5368cb0a9c1282"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/app-server-protocol/src/v2.rs:4222-4230 | crates/app-server-protocol/src/v2.rs:4504-4512 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/v2.rs"},"region":{"startLine":4222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb862a9e50c914be0b5870a1200694312fce8bbb78f55fcb973829609333abb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/app-server/src/remote_control.rs:401-408 | crates/app-server/src/remote_control.rs:3303-3310 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"915968f78dab0b047a221a1897b6ea7c3e64ca4d6a696646f12f46d6a528af8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/app-server/src/remote_control.rs:981-994 | crates/app-server/src/remote_control.rs:2030-2040 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1945282020559cde256e63fd0e45c346fd4eb5746858b6d1899eee18b6de9c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/config/src/private_directory.rs:1986-1993 | crates/tui/src/commands/contract/core_navigation.rs:175-181 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"736a5d6347be97f73e54b24539db6012bd81a9adc31a19023766b4a03658cfc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/engine/src/client/test_cases_01.rs:347-360 | crates/engine/src/tools/review_core.rs:604-619 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d3834f3978aba531706c42cd32a02972a1b1398a5d93c0edd888397c44d731"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/core/engine/rlm_host.rs:710-720 | crates/engine/src/tools/subagent/engine.rs:1491-1502 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfd9b8777a3dc4809df890232e251586fc8f1d42f863e30db570f2c0c3d9641"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/tui/src/commands/contract.rs:3754-3766 | crates/tui/src/commands/contract.rs:3771-3783 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":3754}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3b0529ef2360869cf47f4f6c9bf7a24911f410c673cbd772d28760d4714512"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/tui/src/commands/contract/config_main.rs:498-512 | crates/tui/src/commands/contract/config_main.rs:514-527 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/config_main.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"da08d4e220af7eaa72c41eac7b4724940e9736b18c5b0da151d68daf0a95617b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/tui/src/tui/file_picker.rs:491-506 | crates/tui/src/tui/session_picker.rs:479-493 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_picker.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dd371dfb59d58ae9bb4b058a58586c3d28e1d8f9cfcf6b3f5655b5a9c3df06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/tui/src/tui/sidebar.rs:222-235 | crates/tui/src/tui/work_surface/model.rs:2266-2279 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/sidebar.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"07529bd9d985b49413f01257d214227a49137ee040006f660f15a23509331538"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/tui/src/tui/views/automations.rs:787-797 | crates/tui/src/tui/views/workflows_manager.rs:539-549 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/automations.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"c622999ed920109a9e7a1fba4bc6a634cc9928a4b8c43f704e565b33bc5c607c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/app-server/src/runtime_api.rs:10429-10438 | crates/app-server/src/runtime_api.rs:10443-10452 | crates/app-server/src/runtime_api.rs:10473-10482 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":10429}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa83fd286a5d7777abf53960f964072d235abe835dc32bb62f5510f4ee022f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/app-server/src/runtime_api/mobile.rs:263-270 | crates/app-server/src/runtime_api/web.rs:290-297 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/mobile.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c8a6602d8b81fa290f8f3b4e52668f43e3fad2c13509a3be3a3492af298d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/cli/src/lib.rs:3259-3270 | crates/cli/src/lib.rs:5315-5326 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":3259}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f78ef05d4f5607d14d35e1f06e07f18bd24d029d08c0ed86c5ce841c5805a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/automation_manager.rs:2693-2702 | crates/engine/src/task_manager.rs:3915-3924 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2693}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5eef3d8c6d30b19b6e24f1a656be23e24b9e4726fadb19f144b6a0a53e8d1da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/client/chat.rs:620-635 | crates/engine/src/client/chat.rs:650-659 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"192a6849c5da3452b1ce403f2ae00d8efa8eda07373a54c848eec9f2904a6bbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/mcp.rs:8027-8039 | crates/engine/src/tools/subagent/mod.rs:13024-13041 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":8027}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cede6c2aaa85b9236a1e8c59afd47e7a7cb89908a228139c6ede57d0d79a6bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/engine/src/runtime_threads/manager.rs:6604-6615 | crates/engine/src/runtime_threads/manager.rs:19020-19031 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b004f0740ea35df6189368f9a29a2a46fd3cae82051f9780b3d0907ffaf2dee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/runtime_threads/manager.rs:19835-19843 | crates/util/src/utils.rs:813-821 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":19835}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fb2a422def314381d4fd80f85af8a33dbdab31273bdb845e81429804526e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/plugins/src/marketplace/parsers/claude.rs:194-207 | crates/plugins/src/marketplace/parsers/codex.rs:137-150 | crates/plugins/src/marketplace/parsers/dsh.rs:193-206 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb78b974f8e6371f7091b514a51d4cb7c85b434aa51267abe172a294728acaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tui/src/tui/ui/terminal.rs:13-22 | crates/tui/src/tui/ui/terminal.rs:27-36 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/terminal.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"173fccd1451922fd2848eca69f0ab9c1a28c6c73b0dd9bf80a7209c3bc95902e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/util/src/files.rs:409-418 | crates/util/src/files.rs:996-1005 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/files.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad79510617567767c1a5f9c74c60f7ff91517b3a5ebd0494e51ae112baec6b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/app-server/src/exec_agent.rs:3131-3141 | crates/app-server/src/runtime_api.rs:5578-5585 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":3131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0afa8c54b1946196961a13e3841c6a8b0734fc03e55397ef4740106567ed6cc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/config/src/base_url_resolution.rs:429-441 | crates/config/src/base_url_resolution.rs:445-457 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"33483f0f6637acc9711a41fe15aa765408f245a78f713f63d5b96c97abdb9577"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/config/src/config_migration.rs:9-22 | crates/config/src/state_dirs.rs:76-89 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_migration.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7129d625f820e65f7785b3a71f0b0ff4fb661c46df68cfdfe9d2b982d1d7a1e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/engine/src/extension_host/ticket.rs:192-203 | crates/engine/src/tools/subagent/mod.rs:4583-4593 | crates/tui/src/tui/pending_requests.rs:159-169 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/ticket.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"93945cb7bad942cbb862fe29ade5f9951394f6931364b1d295070a2e6d0ec67e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/engine/src/fleet/manager.rs:2518-2531 | crates/engine/src/fleet/manager.rs:2533-2544 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8aee3bb47cb555feb97b71dc157e52d913167c527f929ce4e2bf2bc1f5cdaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/rlm/bridge.rs:411-423 | crates/engine/src/rlm/bridge.rs:445-457 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/rlm/bridge.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"170f1bbbad25c6f3804adb65849050c8dce4c54138e80d84ee027c22cdbe0108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/rlm/turn.rs:311-320 | crates/engine/src/todo_snapshot.rs:369-377 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/rlm/turn.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf67aa8cb06bda746ce24c152f4eca3b2c5d17119de91f8d5d84f3efb91a1433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/execpolicy/src/lib.rs:825-835 | crates/engine/src/core/authority/auto_review.rs:2259-2269 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/lib.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4238a4b0209833c9ce8b91d5289e5d9c7b312128866d11d5ceeb3be715c08e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/plugins/src/registry/gc.rs:1118-1128 | crates/tui/src/lib.rs:10435-10445 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry/gc.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da1eea25b2a6b63176b09b3412a4ac393d251e033a006b80ae748a6507aff3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/runtime/src/config.rs:8254-8265 | crates/runtime/src/settings.rs:924-943 | crates/runtime/src/settings.rs:1211-1221 | crates/runtime/src/settings.rs:1487-1494 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8254}}}],"partialFingerprints":{"codehealthFindingId/v1":"8934f117f2ec407f1b3900b3118ed26e3d1aa297cb337914fc65ce28e8b3f97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tui/src/lib.rs:10140-10149 | crates/tui/src/lib.rs:10215-10224 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":10140}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da0d44895e453b06659a92c3b4a8af1ccbcefaa20455befd3c0d15d34d3a657"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/tui/src/tui/key_shortcuts.rs:85-92 | crates/tui/src/tui/key_shortcuts.rs:148-155 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/key_shortcuts.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e99da7318535ed8f1ec07d96be3c40b0d00b4b83d13de835f4b1720c17572c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/tui/src/tui/ui/overlays.rs:363-374 | crates/tui/src/tui/ui/overlays.rs:376-384 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/overlays.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0ad930e42d37d65e4c50d681869462e876e58810eb4fc04e99ee29d24decea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/app-server/src/exec_agent.rs:3284-3297 | crates/engine/src/compaction.rs:646-655 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":3284}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3308d995d10bc47306eda220dc235e8d22ba0426e503e6c476931a63635f84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): crates/app-server/src/remote_control.rs:3421-3430 | crates/app-server/src/runtime_chat_relay.rs:1655-1662 | crates/app-server/src/runtime_chat_relay.rs:1664-1673 | crates/plugins/src/manifest.rs:1673-1683 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":3421}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9345263c653d1b48f89a1cb9519282181e6186fb74241e4cf0cc97056f45ecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/app-server/src/runtime_api.rs:14848-14860 | crates/app-server/src/runtime_api.rs:14862-14874 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":14848}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1716b034e45dbcdc90711473789610c97b40d693d205e7306a88fa1012384c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/app-server/src/runtime_api/plugins.rs:565-574 | crates/app-server/src/runtime_api/workspace.rs:585-593 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plugins.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a993e3a9b394d7941008a9b25eab1ce3f0194a95e38f88166c9533581de372a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/cli/src/config_bundles.rs:942-953 | crates/account-cli/src/lib.rs:3588-3597 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/config_bundles.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"920d2313506d403401bdac33b7f3e45e5734f93a02ff531ab15f4844a58652a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/engine/src/extension_host/registry.rs:290-295 | crates/engine/src/extension_host/registry.rs:299-304 | crates/engine/src/extension_host/tier.rs:108-113 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5ae69ad1b54391ff1f23f6b8de5b6d65acb1a39a126c013f1814b52604363b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/engine/src/project_context.rs:1082-1096 | crates/engine/src/project_context.rs:1102-1116 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1f262992d8cfc89e4dbee8a33f4c4edb7acbb6531459ffd9853aedab4f443d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/runtime/src/config.rs:7190-7201 | crates/runtime/src/config.rs:7221-7228 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":7190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbb1dcc66dbe870f51ff0a3c137d4631009675f0747278db71f295f89383b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/runtime/src/retry_status.rs:101-108 | crates/runtime/src/retry_status.rs:111-118 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/retry_status.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"752a74c131a8049513a0d6428bed59537b0fc5082a46afdfb01a63dc2aca75e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/snapshot/src/repo.rs:2189-2200 | crates/runtime/src/private_log.rs:21-30 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":2189}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc26b18a7199402a6aa0a30d6785519aab329579b096dc2177a1150f3caf5af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/core/src/context_reference.rs:107-114 | crates/plugins/src/manifest.rs:1410-1419 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/context_reference.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b2bf4067d7924f2165b4115dce07b5e46e7e15870139399aa1148f731b68c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/engine/src/core/engine/approval_publication.rs:109-120 | crates/engine/src/tools/subagent/mod.rs:1822-1833 | crates/engine/src/tools/subagent/mod.rs:1835-1846 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/approval_publication.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"140cbc718e11b9688b3b813b21853f9c5867ed0f61f0774c6213fd2d8912a4aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/llm_client/mod.rs:1271-1281 | crates/engine/src/tools/registry.rs:1763-1776 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/llm_client/mod.rs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"9796e80d5a172aa568f591c2979e4d9bc1e1537f972eed6f7270e375d81025b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/receipts.rs:1699-1709 | crates/engine/src/tools/web_search.rs:3251-3259 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts.rs"},"region":{"startLine":1699}}}],"partialFingerprints":{"codehealthFindingId/v1":"a856d8b89e46cf0aa17b90d91d8f4d7ab9931b25daa509939f72e5b6d4220654"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/tui/src/tui/shell_key_routing.rs:709-716 | crates/tui/src/tui/shell_key_routing.rs:736-746 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/shell_key_routing.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3c77b9a876091d0a0ac6712da60ef2e14d89bd9b08de37c6b17d194be76f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/tui/src/tui/widgets/workflow_panel.rs:1969-1977 | crates/engine/src/tools/workflow/mod.rs:898-906 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":1969}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fdd4eacf2c1609d4a09ac640a928784b46c009efd2d8e92ce23f655d86a79b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/engine/src/core/turn.rs:429-436 | crates/engine/src/tools/workflow/usage.rs:83-89 | crates/models/src/schema_sanitize.rs:401-407 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/turn.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f751325aa81a608ac7153eccb5fc1986cb1549b3130d279af5d625d978c46ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/mcp/oauth.rs:1914-1921 | crates/engine/src/tools/fetch_url.rs:487-493 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/oauth.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f067b117cf4a0e82fe1012a984fe1c5f52545cf93b4d0647fa5e40331b111b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/runtime_threads.rs:4787-4797 | crates/plugins/src/registry.rs:2001-2010 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":4787}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9415f22abf91222549baf707dcf722db5870bb318150ea4ad257af570c116d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/runtime_threads/manager.rs:4986-4992 | crates/engine/src/runtime_threads/manager.rs:5043-5053 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":4986}}}],"partialFingerprints":{"codehealthFindingId/v1":"c278cb9bf1a6c9577281b38a72ea1bad05a8aab57a237f8622f955ff0a1d3e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/engine/src/tools/approval_summary.rs:654-662 | crates/engine/src/tools/subagent/mod.rs:4113-4125 | crates/skills/src/lib.rs:2226-2238 | crates/tui/src/commands/groups/core/hooks.rs:320-331 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/approval_summary.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9315aad898af7824214d991a8652fda0944cc229841941e84cbb1fb8e82b7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/tools/handle.rs:894-903 | crates/tools/src/lib.rs:218-227 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/handle.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"855e9fb1f527922d902787766827cba14be3cb992cd5b6a8b27b1b75de631d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/engine/src/tools/resource_admission.rs:355-360 | crates/engine/src/tools/resource_admission.rs:411-426 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/resource_admission.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43e0d23514369f808e1a9559c8c9d1e07b82062d2b25e2d745e74f216818861"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/engine/src/tools/subagent/advisor.rs:285-300 | crates/tui/src/commands/groups/skills/restore.rs:179-193 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/advisor.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89592d58e5b60fa4fb58df7aac259f3272d553bc7528cf43b45fec57f5b8166"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/tools/verify.rs:149-159 | crates/engine/src/tools/review.rs:249-259 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/verify.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf89ddc40c755e82a5580a113e4c0093e8275a2a324942ada8ebc69f101bcf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/plugins/src/install/stage.rs:46-57 | crates/plugins/src/registry.rs:1902-1913 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/stage.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"938f9488535cd0bae3b0b78b2fd700208ed9ca97046e2adab10680fdb1881b67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/tui/src/tui/onboarding/mod.rs:186-195 | crates/tui/src/tui/onboarding/welcome.rs:50-59 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/onboarding/mod.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a3bdb44be4767ddd9ef2e1ae5f1a471c0623151a48d5bae7ffc8a3ba63b4bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/session_projection.rs:209-219 | crates/app-server/src/runtime_api.rs:11814-11821 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_projection.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d70741e440e909ff417a7849e028829d5413db484301dffabda32dae9d88b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/engine/src/tools/review_core.rs:512-520 | crates/engine/src/tools/workflow/mod.rs:5266-5274 | crates/engine/src/tools/workflow_plan_approval.rs:778-787 | crates/tui/src/commands/groups/core/stash.rs:114-122 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"80149260bbf26a6f43945e3f04025da8c5856437e11249ed94a2dad1674389eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/runtime/src/config/paths.rs:20-31 | crates/runtime/src/config/paths.rs:68-81 | crates/runtime/src/config/paths.rs:134-143 | crates/runtime/src/config/paths.rs:233-244 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config/paths.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbf0fc13e41927adb6b62fb8f2ad4332adef3b0c93511cf5f47b6dafa620b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/tui/src/tui/app.rs:5595-5603 | crates/tui/src/tui/app.rs:5609-5619 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":5595}}}],"partialFingerprints":{"codehealthFindingId/v1":"771b90c877ee32192961435f5ccad89b438c6fa8ec025c4469b83cae59e5a269"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/workflow/src/redaction.rs:253-261 | crates/sanitize/src/redact.rs:528-536 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/redaction.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0d6b6b056963ee11c0fca8adcf872d383aceaafc7872aa8fb630d492e880c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/fleet/profile.rs:55-61 | crates/runtime/src/audit.rs:84-94 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/profile.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7ee226fea1861afbc408b23f1ec5274524a055a55af6ed86823051efecde8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/operate.rs:1031-1038 | crates/engine/src/fleet/ledger.rs:482-489 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/operate.rs"},"region":{"startLine":1031}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0ba7b0b197d1567ca3126554d12d76a718c25b4176d5a7f9168704013410ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/tui/src/commands/groups/core/lane.rs:41-64 | crates/tui/src/commands/groups/core/fleet.rs:51-80 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/lane.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f60f8db5b629ff1c5bd6654c3759146bc81977d8d24863554ec41e65a0f6de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/workflow-js/src/driver.rs:349-361 | crates/workflow/src/role_resolve.rs:111-123 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/driver.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f4f74c9c80800d289c0b63169c9db03fcd3eac6397eb25ef0e914072170585"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): pet/swift/PetNativeCore.swift:86-90 | pet/swift/PetNativeCore.swift:105-111 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetNativeCore.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecac42219317e26c568c9d9f63d2a5ab3254a528207a1f67d197e446d43f021d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): crates/account-cli/src/lib.rs:1929-1940 | crates/account-cli/src/lib.rs:3946-3956 | crates/account-cli/src/machine.rs:489-500 | crates/app-server/src/runtime_api.rs:4820-4833 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd5c170a532f75715072732d5b11160c76f92789ea758f63d11703f7a747863"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/app-server/src/runtime_api.rs:10043-10051 | crates/engine/src/tools/github/report.rs:151-158 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":10043}}}],"partialFingerprints":{"codehealthFindingId/v1":"041a4bec0536877f3d4565439a7febcd3923efef520cc67a1d27b485cc3d7110"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/operate.rs:993-999 | crates/lane/src/registry.rs:159-166 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/operate.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc032d928e9386f2cf072667237475227a409c957341dad7c67335caaf6e9189"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/runtime_threads.rs:5897-5911 | crates/config/src/path_io.rs:125-133 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":5897}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e20f01749dc157f3ae47539421d22c841d649709f687fce9e64dd027bed0bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/tui/src/commands/contract.rs:4493-4500 | crates/tui/src/commands/contract.rs:4502-4509 | crates/tui/src/commands/contract.rs:4511-4518 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":4493}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc32501242327d808bb7620880177912dde772a28fd9e13d63b5c0ec1a6db8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/tui/src/tui/agent_details.rs:102-114 | crates/tui/src/tui/ui/overlays.rs:694-706 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_details.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2809d268c10c4e0c038fcd462f46a44a55692f435f21369f9b831edccfa3dba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/tui/src/tui/model_picker.rs:961-969 | crates/tui/src/tui/model_picker.rs:1060-1068 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c92069ed6e3a1e14fe8c710512166bc6b216021e85df07d56ab73cea1a8652"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/engine/src/session_peek.rs:193-199 | crates/engine/src/tools/subagent/mod.rs:17726-17733 | crates/workflow-js/src/schema.rs:94-104 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_peek.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28f27a2818d0a9c0138dd63a37cbdabd4043329a63fe25b666c33c76e2e9e6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/engine/src/tools/plan.rs:579-590 | crates/engine/src/tools/verify.rs:836-847 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plan.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19650235e761a15e56d764ffc4a8b53313dcfbb81dd927806db86f596d194ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/tools/subagent/mod.rs:541-548 | crates/runtime/src/logging.rs:18-26 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bc855c61422f56469bbc80c512ca68e31d02ae82f26ce84d25b75ee3b527ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/telemetry/src/lib.rs:237-246 | crates/telemetry/src/actor.rs:208-214 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/telemetry/src/lib.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e946e09c55e42c6f5b29f6938cb5a8943c1caa5f918c866927955ec8a7f078"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/commands/contract/core_navigation.rs:167-173 | crates/tui/src/commands/groups/memory/note.rs:53-59 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/core_navigation.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7be93d24d97fa4ffb9562b5780b96ea31cb6a3e1cf22454ef46cbaa0e402f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/tui/src/commands/user_commands.rs:153-158 | crates/engine/src/tools/web/extract.rs:553-558 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/user_commands.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6579d9fe34e6651030cbbf58aabdac8f5877336cfc0df75afca46dacfa96f81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/config/src/base_url_resolution.rs:82-91 | crates/runtime/src/config.rs:9312-9321 | crates/runtime/src/config.rs:9327-9336 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcb8874308cf91a2c6ffa943b72ce5414a6df6d29c3a3655b905b6d65a9aa6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/engine/src/fleet/executor.rs:1162-1174 | crates/engine/src/tools/subagent/mod.rs:13257-13265 | crates/runtime/src/continual_harness.rs:405-413 | crates/tui/src/tui/context_inspector.rs:752-763 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/executor.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea36264c4daeeb121bcd3ded5ee68d0a6166f065fc12b138f1fb9ba8cbb6b3af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/tools/resource_admission.rs:328-335 | crates/runtime/src/runtime_log.rs:249-255 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/resource_admission.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e87148aa9e9d3588dfa83ffcc3c303f19485b6c697bc8081eeffa9abc957a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/runtime/src/config.rs:3851-3863 | crates/runtime/src/config.rs:7713-7725 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23f8d615e5144f2614e25634157657229324a2f6dfcdc0d39d695241ff8d92e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/tui/src/tui/file_mention.rs:1350-1359 | crates/tui/src/tui/slash_menu.rs:234-241 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbc6e0780e500dc643ba0092d6e2ae056e345a00cca52fbe5f34c8ff55262fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/tui/provider_picker.rs:4664-4670 | crates/tui/src/tui/views/fleet_list.rs:157-163 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":4664}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbea3eb5006c9b65afa6201ea6bc96d846a6e3c9c054c1f66f06cf517e3e2bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/engine/src/compaction/last_round.rs:334-350 | crates/engine/src/compaction.rs:1252-1267 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction/last_round.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7e68490b003696829683e4170762497e47b4f9729677b3adb32385c9347fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/provider_lake.rs:1178-1186 | crates/tui/src/tui/model_picker.rs:2937-2948 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b08886f2712c0cf45ea77d87f658fbf69cac4440301d494664ff6a4f23479c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/telemetry/src/envelope.rs:165-171 | crates/build-support/src/lib.rs:202-208 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/telemetry/src/envelope.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"346c874cd0508cc8290315d28ed19fa1cb47f1128ee0881013f774d7f6fe8aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/runtime_threads/manager.rs:398-409 | crates/engine/src/client.rs:365-374 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba0a8db88e102e15d624159be797e56a13ac31ae446ee57975f3d2f352ba2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/tui/src/commands/groups/core/constitution.rs:403-411 | crates/tui/src/tui/ui/overlays.rs:321-332 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/constitution.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c2d2b78d283df3847f09abf629a9b6ddd295f401819bbc381a277fff4d104e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/app-server/src/runtime_api/workspace.rs:367-373 | crates/engine/src/tools/resource_admission.rs:442-451 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/workspace.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"569ef6002fc0208e7d08667980266b85a0169388c24f4d7b543d2cbe7eb3afa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/extension_host/protocol.rs:571-582 | crates/plugins/src/host_services.rs:30-40 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/protocol.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79eb89ea844d7add7b56e2f47c99e9d8443b17df9448996f4953365e82358ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/project_context.rs:1941-1959 | crates/runtime/src/config.rs:7941-7951 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbeeff3f7c38415056e26035c91a51c51d0b26495006ebaa4515ff0a6b0a218"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/engine/src/prompts.rs:630-638 | crates/runtime/src/settings.rs:3204-3212 | crates/runtime/src/working_set.rs:1141-1152 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"119d7d21c8200dad6d2af1ad11273eba8d588955c37a201b0d0ef85b63564317"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/tui/hotbar/actions.rs:1431-1440 | crates/tui/src/tui/provider_picker.rs:1485-1491 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/actions.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"16885716f942d22d0c4c4d6567bd086331fae7dc44117ae0f2974d4e5dd6035f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/account-cli/src/work.rs:154-160 | crates/app-server/src/remote_control.rs:5208-5213 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/work.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"612b4e627c3f1b8ac90152e1cbc38e0e70cb1553fac556ed634f96c75dfb0fd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/app-server/src/runtime_api.rs:12449-12458 | crates/tui/src/tui/views/fleet_setup.rs:472-477 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":12449}}}],"partialFingerprints":{"codehealthFindingId/v1":"474eed3295a8a68ebf8d2650d4a83a32671211da54199128950b9e731d48d754"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/config/src/user_constitution.rs:1446-1455 | crates/engine/src/prompts/base_preview.rs:452-461 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/user_constitution.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea9794632a8c7dc8450ac683fe4d83348bb3cba5becd71e03eb7b314b6af4e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/engine/src/provider_catalog_live.rs:724-731 | crates/plugins/src/registry.rs:1622-1629 | crates/runtime/src/skill_state.rs:228-235 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5cb5830a25d67cd3130df5e680e90c0ec8945ae085aa835f06b5442573b635"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/task_manager.rs:2299-2308 | crates/account-cli/src/lib.rs:3615-3624 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ccda737cfcdf7aaf20c5e06e1189e709ae9c036df0c724acd7935759f1ff192"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/runtime/src/config.rs:2561-2569 | crates/runtime/src/oauth.rs:3078-3087 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b72f86893da6ec8ed8f7310a545b44972fc414792dfa55b3e9495142a516b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/tui/src/tui/views/fleet_setup.rs:559-562 | crates/tui/src/tui/work_surface/model.rs:103-106 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e765df57205367ec9cd54e441e693311408e0615839184f6c8f24b045f6b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/app-server/src/runtime_api/computer_display.rs:1364-1370 | crates/cli/src/update.rs:2265-2271 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/computer_display.rs"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3e02ca1120d9458e043877628bc4de55000902285e5c4aedf53072789ece2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/client/deepseek_effort.rs:115-121 | crates/workflow/src/fleet_exact.rs:82-88 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/deepseek_effort.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"04df3ff5f50863b496845e60c37101b0006ed85fe98c3823de610f2702468133"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/engine/src/fleet/agents.rs:336-341 | crates/sandbox/src/bwrap.rs:303-308 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/agents.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"478928273c695abfd135279b22f458225a97903bb76451f7e1072f0092fe0c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/project_context_cache.rs:189-196 | crates/plugins/src/manifest.rs:1756-1764 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context_cache.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"671afe8d1eb17498754b797e6ff674306852617b37330ab70c122453f81d8b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/tools/review.rs:2168-2175 | crates/engine/src/tools/verify.rs:817-824 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"939647c18c0fb65e731e8fd9fba6c4c364d5166b6f2cdc4b194a955fd1f6aae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/commands/src/diagnostics_reports/receipts.rs:545-550 | crates/tui/src/commands/groups/session/export.rs:912-919 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/diagnostics_reports/receipts.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fc316b4a662012bf27cd6067e0211133673db8a8c1a2e3bf4c12fe6632ab66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/engine/src/tools/subagent/mod.rs:22156-22165 | crates/tui/src/tui/sidebar.rs:211-220 | crates/tui/src/tui/work_surface/model.rs:2291-2300 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":22156}}}],"partialFingerprints":{"codehealthFindingId/v1":"382c0cb099331cbc45ab95289b09d599ff05e9612ac939f160129bdb6e200f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/tui/src/tui/views/mode_picker.rs:58-69 | crates/tui/src/tui/views/status_picker.rs:96-107 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mode_picker.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f3753f70030bafd8e9cde6d8f84baa80f72e4991c04d94f6a7f2a393a06bf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/commands/src/debug/cache_format.rs:359-367 | crates/tui/src/tui/footer_ui.rs:159-167 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache_format.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46e3150b8f0c796d0042d2237788135f3078b110502589185671d4e7057d8fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/engine/src/tools/automation.rs:688-700 | crates/models/src/schema_sanitize.rs:321-332 | crates/plugins/src/marketplace/parsers/dsh.rs:559-570 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"108b3e857ae334abc829b4c94220296200df2fff5c27752d253f46ddca2b68da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): crates/engine/src/tools/file_tool.rs:271-281 | crates/engine/src/tools/git_tool.rs:53-63 | crates/engine/src/tools/run_tool.rs:51-59 | crates/engine/src/tools/web_tool.rs:52-60 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file_tool.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ccb364dfd8f2a58a4488e2812a3bae0eca73ca2898955cb233e3a6568bb3ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/tui/src/tui/model_picker.rs:131-134 | crates/tui/src/tui/views/fleet_setup.rs:564-567 | crates/tui/src/tui/work_surface/model.rs:109-112 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b138afc21c2f8cc83d12f7a2400a847dc2834a387fb5f827f86468bf0f8e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/config/src/service_toml.rs:194-204 | crates/net/src/network_policy.rs:142-151 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/service_toml.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff04c96ec51a52d4793cc86620683bc4d36a3d7d58b5dac4ab8194d0dd4daea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/engine/src/core/engine.rs:10556-10563 | crates/tui/src/lib.rs:4587-4592 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":10556}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cecd93bf74a46382ede21bb1675dd7efa8915efc561df62f348f8b95cd3b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/engine/src/extension_host/command.rs:213-224 | crates/engine/src/extension_host/mod.rs:206-216 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/command.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe79d9c056c78dcb1b34e17a0ab2ff7df97eb106bd86ff2eed4d4c64b15257c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/config/src/cloud_facts/overlay.rs:43-50 | crates/engine/src/models_dev_live.rs:214-223 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/cloud_facts/overlay.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2caecb88fd1a4ca2ec66373b81c9663a1ebbebc14310bc5c12c0697618f21a57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/compaction.rs:963-971 | crates/tui/src/tui/views/mod.rs:6980-6988 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction.rs"},"region":{"startLine":963}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f09e1a26c36c28cccad52adaaae01f740ef3cfec92f1b23f788ec82f10f259"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/runtime_threads/manager.rs:1400-1408 | crates/plugins/src/marketplace/document.rs:35-41 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03863fbf2cb0fcef83d10790fb2b8edd0a8c86664452ae0262fd5ef8b180efb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/tools/file.rs:328-338 | crates/sandbox/src/read_guard.rs:839-847 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e84a9c5a17da89e11bfc3f117aa24bbfbe3cd70612cfbfc438fbd6fd7fc9768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/tui/src/commands/contract.rs:1914-1919 | crates/tui/src/commands/groups/core/workflow.rs:135-143 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":1914}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bc7b2ca40ecdd46d35de34e4e759f3efe7d3999f51d8985c56d23375a21d36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/commands/groups/utility/automation.rs:32-38 | crates/tui/src/commands/groups/utility/mcp.rs:38-44 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/utility/automation.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a085bea236d2fbba310f25fab17c3cb35ba012d897fe4ea7042a5619ec6e6bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/app-server/src/runtime_chat_relay.rs:2021-2026 | crates/engine/src/runtime_threads.rs:4921-4926 | crates/runtime/src/native_memory.rs:636-645 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df0bd2ebe371fdcc5e3532344c9d01c24804504483c2d88542dcea1a5d2d0dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): crates/engine/src/extension_host/dsh_remote.rs:694-698 | crates/engine/src/tools/review.rs:1430-1434 | crates/plugins/src/marketplace/store.rs:335-343 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_remote.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fb6ea87585b02760f04b11d4a267882827a7c35681e02966c7093f8e8832f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/engine/src/tool_inspection.rs:628-635 | crates/engine/src/tools/lsp.rs:177-181 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tool_inspection.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7562ef39a64f1c6ec82cffcedb8ae930e00031fa9023f0ce706396af40f22d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/tools/subagent/budget_handback.rs:51-57 | crates/engine/src/tools/subagent/mod.rs:12651-12657 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/budget_handback.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea06714ea035cb0bcc6a9c67c93bb1ed4ddcf59a250ceb31ff6ba1b2432e97f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/commands/groups/project/share.rs:247-253 | crates/tui/src/commands/groups/session/export.rs:68-74 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/project/share.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e89e594b47b224badd6e2118e47b80fc98cfddd37e152fb387c600e3a121bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/tui/src/tui/app/composer.rs:42-50 | crates/tui/src/tui/composer_ui.rs:149-157 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9210160d1b6e6d17172a4c2a43f6ff57fda1d1f7f21b3d9b1fa705a58fb9d28a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/account-cli/src/lib.rs:3963-3971 | crates/app-server/src/runtime_api/external_agents.rs:30-37 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":3963}}}],"partialFingerprints":{"codehealthFindingId/v1":"416be1ea06da73febbbe4a04df0d4d9cfe4ba7edb6e495b6ee0359381ce948e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/app-server/src/runtime_api/external_agent_options.rs:20-26 | crates/runtime/src/codex_model_roster.rs:218-224 | crates/runtime/src/oauth.rs:2384-2391 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/external_agent_options.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"949f4b803953ae983d437007e5b9fe3d7c659adc1325bb8dad326425fd6500e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/hooks/executor.rs:743-750 | crates/engine/src/tools/approval_cache.rs:604-611 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1e24fcdb5ef032bcc4bf95e65eb3c96887cc8a133e72566634432bc99cc489"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/engine/src/tools/workflow/journal.rs:128-131 | crates/engine/src/tools/workflow/mod.rs:2338-2342 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0df318089eb632bc4f4485678d63438e334ad04c75a09a1d8eb4a903a3607d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/protocol/src/journal.rs:76-83 | crates/runtime/src/session_tree.rs:214-221 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/protocol/src/journal.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"38529c86b1f83783467fbe515634a291d4223a554ded0aa9d4c21b3cc8f15ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/app-server/src/runtime_api.rs:11972-11977 | crates/skills/src/roots.rs:548-556 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11972}}}],"partialFingerprints":{"codehealthFindingId/v1":"9650ced74e787a77e797e9c58afdbbb081783631ec05163d3c7be35eb37b850e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/app-server/src/runtime_api.rs:11979-11988 | crates/cli/src/lib.rs:1551-1557 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11979}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f73502d27345c19bdfa990ab7cc81f903b62aa865d8680a4875420530593ab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/engine/src/tools/git_history.rs:913-922 | crates/engine/src/tools/test_runner.rs:204-213 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_history.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"7198a213f4322b0b58aac3c7f5f5b360d9e60f33840ceb1a1de9bd4c943dacbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/tools/rlm.rs:280-286 | crates/engine/src/tools/tasks.rs:353-360 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/rlm.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b3b2eeb820223d67c919f90f61d2481968c256a8f2f9a86a8b76d437ee65c71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/tui/src/tui/widgets/approval_band_legacy.rs:741-744 | crates/tui/src/tui/widgets/mod.rs:1945-1948 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"438475acae38cdba1b841a4e1561281fa2ae94816262be5f396cb4b08c60f3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/cloud-facts/src/lib.rs:173-177 | crates/engine/src/model_inventory.rs:769-773 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cloud-facts/src/lib.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8569028c2ae19c84dd3ac25aaa7b88fa0b88ba138c3dc358212c4c90c179fbc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/config/src/cloud_facts/scope.rs:66-72 | crates/tui/src/tui/pet_watch/owner.rs:169-175 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/cloud_facts/scope.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc34324eaaa64ab753e626c3a6ee12d2c31059b436cec916a9dee980d4c400d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/engine/src/session_image_prune.rs:41-45 | crates/tui/src/tui/app.rs:5363-5367 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_image_prune.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a8d030c4b237d86bc63d9612321946de661cfdbe29dcbef3362ed2c5ebc5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/tools/large_output_router.rs:220-227 | crates/engine/src/tools/shell.rs:4376-4383 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/large_output_router.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b900da65642f982ae2c215f71b062dba21a17c1ab7a64081c18050800671e0dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/runtime/src/oauth.rs:3468-3472 | crates/tui/src/commands/groups/session/export.rs:612-616 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/oauth.rs"},"region":{"startLine":3468}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a760bed29ad93134a15e295bcb13c32d8d98003d639e7a98cbd1768ba1a12b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/tui/hotbar/setup.rs:64-70 | crates/tui/src/tui/views/extensions.rs:35-41 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/setup.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d6e2be8bddaf026a74a7a955bde1f5676e0f9ce6fe35d43af06ac67159ee85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/engine/src/fleet/roster.rs:618-623 | crates/engine/src/fleet/store.rs:535-540 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc86263d67c229493b066f489a638f7e975c4237ae6c4ae11107bb2a9f52b28f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/rlm/session.rs:281-288 | crates/engine/src/work_graph/liveness.rs:33-42 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/rlm/session.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"469782bdda64d213e8239bdc1c76013b04f7d6c0c0dee880d203cf0a7da6c233"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/engine/src/tools/runtime_mcp.rs:188-200 | crates/runtime/src/artifacts.rs:42-53 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/runtime_mcp.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad448ad1a2950e2015443dfff37c011fcc1e9923d1f783845e4efa772f46a7ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/tools/subagent/mod.rs:13165-13173 | crates/tui/src/lib.rs:14488-14495 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":13165}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7aa84d74b64ecfdd42e859b3944f425496f915ae0e38084fe151fc0979a4fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/app-server/src/runtime_api/plugins.rs:454-458 | crates/engine/src/tools/file_search.rs:454-458 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plugins.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47c1245ca8c91e6963ba7b38e74ca09e90b83b28d2be0e4629c6dcd71aa7455"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/engine/src/mcp.rs:7186-7191 | crates/tui/src/tui/views/help.rs:964-969 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":7186}}}],"partialFingerprints":{"codehealthFindingId/v1":"de80ebcd738d0484ebbd131c2ed2e712f9bf12c465956999a4eb412c058046b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/engine/src/tools/mcp_registry.rs:902-917 | crates/engine/src/tools/tui_help.rs:78-90 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/mcp_registry.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15c999a68b5953d568009adabd22062bacdb0f1d6ec5edbfae6a4423bee40e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/net/src/network_policy.rs:811-814 | crates/tui/src/commands/groups/utility/network.rs:291-294 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/net/src/network_policy.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca7fdd9827e924be3c62e0e50c77d30b9c9121505ff34ef084f7beab1e2f0f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/runtime/src/working_set.rs:1516-1537 | crates/sanitize/src/sanitize.rs:442-450 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/working_set.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"f59737f3bd47c0fedda9704073fc8d41c8afe53f7c9d189bc30242c7cd0212e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/app-server/src/runtime_api/jobs.rs:128-135 | crates/app-server/src/runtime_api/turn_artifacts.rs:39-46 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/jobs.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"107bb5206acfbd90bfc0ca154b5a8d53a97f2a077162bd883275c3aebdd941c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/config/src/provider_kind.rs:320-326 | crates/config/src/responses_dialect.rs:428-434 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/provider_kind.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39a74586aca577100010793ba356d81e61be5b428fae27137cff6870f1dfa82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/engine/src/core/protocol_parity.rs:76-84 | crates/tui/src/commands/config_main_host.rs:562-570 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/protocol_parity.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf510dd7bc32cae3789fc724f357b8ea95506a03c20c087c573f5a7c43707f17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/fleet/identity.rs:230-237 | crates/engine/src/fleet/worker_runtime.rs:1338-1345 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/identity.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f366605332e5976e94cc25cdbf92503a833ebaa2b68df5201a202f25c0e343d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/engine/src/fleet/profile.rs:1333-1338 | crates/engine/src/runtime_threads/manager/external_agent.rs:417-421 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/profile.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b0c0c8290d17425953393e92fc54a8866588c39643505655a8402e40fa79d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/engine/src/model_profile.rs:400-407 | crates/execpolicy/src/shell_expand.rs:2130-2136 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_profile.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef30c4889cc9cd1166e437b7135470e53360ac6cd06281d65d1d87b893299a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/engine/src/tools/automation.rs:291-296 | crates/engine/src/tools/github/mod.rs:186-192 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5882f3ed5f382313da434d1d2fffd1cc50bf38c859647be0f302960093dcbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/engine/src/tools/review_pr.rs:54-56 | crates/snapshot/src/repo.rs:49-51 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_pr.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f963593e0789c101912195cc5bc2bef2177694f63e73695be9dc344a4db1ff7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/tools/subagent/governor.rs:79-86 | crates/engine/src/tools/subagent/mod.rs:18189-18196 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/governor.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3784323701af22c2f171c7e1dfdc450beb12c25cb86fa0775d148d185a640bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/tui/src/tui/work_surface/input.rs:557-562 | crates/workflow/src/fleet_snapshot.rs:408-414 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/input.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00b487521dd7db93b05b4305ae6847563b95e89bd1581aaa8977565e924c483"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/app-server/src/runtime_api/thread_history.rs:886-890 | crates/engine/src/runtime_threads/manager/history.rs:42-47 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ba143c1675a015c4aabc805af747f3dd6eaf70d866ba295bd58fac85d2851"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/cli/src/update/compiled_host.rs:49-54 | crates/engine/src/tools/truncate.rs:221-225 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update/compiled_host.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1a81b18df7218f4ef703f179485591376ca0efc3d1e3d3ea33fc784b05be38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/engine/src/automation_manager.rs:3086-3088 | crates/util/src/lock.rs:16-18 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3086}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7d0315205411302af72af13d4eb1d11792a7fc02a35e3e12f23d6633bddf71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/client/anthropic.rs:612-619 | crates/engine/src/client/provider_native_search.rs:414-421 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"089a6c328fad4e9effa3baa73173280beac14821c62da8ed68cca2458edc78f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/engine/src/tools/execution_envelope.rs:249-253 | crates/tui/src/tui/setup/fleet_draft.rs:69-75 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/execution_envelope.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f28246789e04566f68053d3fece85673ee50172f29bdc0b75fe3522644a272"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/engine/src/client/ollama_catalog.rs:24-28 | crates/plugins/src/recommend.rs:160-163 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/ollama_catalog.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"051c02e679cae322d53e28c833cacf173e57d38a3b240b28f09955744f6f6293"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/engine/src/mcp.rs:1352-1357 | crates/engine/src/tools/rlm.rs:902-907 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"847a279179a08504c0ee4e3a6a0839314735baef66d901f8441db255111081ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): crates/engine/src/runtime_threads/turn_artifacts.rs:185-191 | crates/engine/src/tools/subagent/mod.rs:13371-13377 | crates/runtime/src/artifacts.rs:55-60 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/turn_artifacts.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40d4ca6b827bb6e57d8e083632b9602624f57a9f958bf68577b0a46b050e1c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/commands/groups/core/provider.rs:148-154 | crates/tui/src/tui/model_picker.rs:2957-2970 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/provider.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bbe691a88b119bdd788bd703c22b3f21ddace32de1560546556477c28b723d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui/src/commands/groups/session/color.rs:27-33 | crates/tui/src/commands/groups/session/remote_env.rs:34-40 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/color.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffe1ed638a376259a09fe6e9cca6797b08db9ed7078bd8466dfbe5759b3b81f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/tui/src/tui/views/extensions.rs:88-90 | crates/tui/src/tui/views/mod.rs:2157-2159 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/extensions.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2859001fea0b6ea6e3d2835301b65c6ec5e411c6af338b25743870b7001a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): crates/app-server/src/runtime_api/auth.rs:60-66 | crates/engine/src/extension_host/dsh_remote.rs:704-710 | crates/engine/src/extension_host/registry.rs:281-288 | crates/engine/src/extension_host/ticket.rs:212-219 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/auth.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3187c083430890b13e5c7efaed52136cef903e3133d52b07647cf1c0439c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/config/src/user_constitution.rs:1395-1402 | crates/tui/src/tui/approval.rs:365-372 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/user_constitution.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c45760b544b347806dc5a84c4bab7b80342d395b7715531c4b809268ae61d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/engine/src/tools/mcp_registry.rs:393-396 | crates/release/src/check.rs:128-131 | crates/release/src/launch.rs:80-83 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/mcp_registry.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd250fa1eac9e5223e96abb5f8338101e03ccd9291582e8b7acfde0a053cf01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/engine/src/tools/plan.rs:572-577 | crates/tui/src/tui/tool_routing.rs:1919-1924 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plan.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7672a9f9fb4e2ad13f0719bc3e20b787dc8dc8fbb65311e00dca7b811cf78a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/tools/run_tool.rs:35-42 | crates/engine/src/tools/web_tool.rs:36-43 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/run_tool.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8c5e98aa4be5590074ddec65badf4d9235c77151f0b42820ad18e1ba6d8866"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/runtime/src/config_persistence.rs:543-546 | crates/tui/src/tui/provider_picker.rs:5622-5625 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config_persistence.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"913e17d71e6c40d7b469c3d2808801269aff4de883ecba29c0de9048397f72ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/engine/src/tools/apply_patch.rs:833-837 | crates/engine/src/tools/git.rs:530-534 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/apply_patch.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bede7ab01417d504004337d7c434ec1e914716242df434068dbf5e064096d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/palette/src/osc11.rs:205-210 | crates/tui/src/tui/startup_defaults.rs:773-778 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/osc11.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2182549c4fe2d71fb56b9d8c2daf91a5f50a8e41cfe03c023266072fff392ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/tui/src/tui/views/workflows_manager.rs:37-42 | crates/tui/src/tui/widgets/workflow_panel.rs:2424-2429 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/workflows_manager.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"216822d9d59129869f85dae16472b70a9beb0f51afef8f798619df9e04c9aad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/engine/src/core/authority/auto_review.rs:1097-1104 | crates/workflow/src/fleet_exact.rs:122-130 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/authority/auto_review.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"764e819ec6c8c49ff4d0782961bd3dc2f06dca00feaaf86a593c2478d569db1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/tui-kit/src/ui_text.rs:201-207 | crates/tui/src/tui/widgets/composer_legacy.rs:1119-1125 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/ui_text.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cff65ecf7a7ca3af67fdd68b4a8738da6ba233cbb6008cca3f22d9fd20c8d18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (349\u2013353 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:287-639 | crates/tui/src/tui/widgets/transcript_legacy.rs:223-571 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/mod.rs:287\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a12e4002f90f433dd52818f7454c0c9aebba70a098e4178e612b6475318505e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (153\u2013154 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:81-234 | crates/tui/src/tui/widgets/mod.rs:1606-1758 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"334767713c7d1e686f81773665e5613c9af3e0c7255c970115af65f48cbb97e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (69 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:182-250 | crates/tui/src/tui/widgets/transcript_legacy.rs:131-199 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/mod.rs:182\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/tui/src/tui/widgets/mod.rs:251\u0060 calls \u0060with_paint_caps\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs:200\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc68c7976147d404d79c11959dbcb1417ee4497412cc1d36efed161bd92e06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51\u201361 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:872-932 | crates/tui/src/tui/widgets/transcript_legacy.rs:750-800 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7c614f6ae90360eee421d8b8b6a734243a3ef69334a6b45f69f891352106b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): crates/protocol/src/event_msg.rs:967-1025 | crates/protocol/src/event_msg.rs:1029-1087 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/protocol/src/event_msg.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f0b89a13c07f3f11f9a45b611eee3b8c4ec98b013c88ca6aa9e12ba45b1636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:1033-1082 | crates/tui/src/tui/widgets/transcript_legacy.rs:953-1002 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/mod.rs:1033\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"341ac5594cc61b8740b8952c243d3a9ab6bd2620de592e2a464c3cdb1dbdeff4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): crates/app-server-protocol/src/v2.rs:4142-4188 | crates/app-server-protocol/src/v2.rs:4395-4441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/v2.rs"},"region":{"startLine":4142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2c5d7f6d593cb6413d00825d523c86f0152494777b67ea0a8d2fec8456b660"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): crates/engine/src/client.rs:4981-5027 | crates/engine/src/client.rs:5140-5186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client.rs:4981\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":4981}}}],"partialFingerprints":{"codehealthFindingId/v1":"874dd4cc070f54958ee190d976d78532a7814e2191008bf8ed12beec69f61a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41\u201342 lines \u00D7 2): crates/tui/src/tui/session_picker.rs:1264-1304 | crates/tui/src/tui/session_picker.rs:1340-1381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tui/src/tui/session_picker.rs:1339\u0060 calls \u0060render\u0060 and \u0060crates/tui/src/tui/session_picker.rs:1263\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"662ab9e7d133a34579a9739ce1deb60c9a98c2abd3fe1eaa8cc8103b3fe0b21b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201340 lines \u00D7 2): crates/config/src/xai_credentials.rs:384-423 | crates/config/src/xai_credentials.rs:442-478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/xai_credentials.rs:384\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/xai_credentials.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8524065c3e68e1fa3fab34c1fd2d9a42f7aced1402bcb399745b5ebf8c54e189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:1101-1147 | crates/tui/src/tui/widgets/mod.rs:2229-2275 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b393c040d24c3978d92b8a37b116c4ea341490ee9e0652656c90217602e42713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:1002-1039 | crates/tui/src/tui/widgets/mod.rs:2130-2167 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75f79ae9e1741d3fd97f412a69e466cdb1fdce2e94a252f8291402920bebc2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36\u201337 lines \u00D7 2): crates/engine/src/tools/git.rs:457-493 | crates/engine/src/tools/git_history.rs:656-691 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/git.rs\u0060 and \u0060crates/engine/src/tools/git_history.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c8f19a7ee7fdab23164371c7e0caae91c4a2030decc235ebd934e978c00259"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201335 lines \u00D7 2): crates/app-server/src/runtime_api.rs:5761-5795 | crates/engine/src/fleet/control.rs:94-122 \u2014 before extracting anything, compare \u0060crates/app-server/src/runtime_api.rs\u0060 and \u0060crates/engine/src/fleet/control.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:5761\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5761}}}],"partialFingerprints":{"codehealthFindingId/v1":"e597539eaafb8d15ad6c19b3c10ee8e926e3249bd8bcd03b5dfa2e2eadf673f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): crates/tui/src/tui/ui/handlers.rs:2438-2472 | crates/tui/src/tui/ui/handlers.rs:3630-3664 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/ui/handlers.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb978a2cfe19cbb43cf91d151acd0320081f28056effcc8f5956d7716fcb650"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (70 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:236-305 | crates/tui/src/tui/widgets/mod.rs:1760-1829 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs:236\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"83082e921bae6fbf9ba431bb52b1a1504a83b0c4725aaf9b86a9cb2be5eac7de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): crates/engine/src/runtime_threads.rs:3523-3556 | crates/engine/src/runtime_threads.rs:3933-3966 \u2014 both copies are in the same file, so extract the block 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/engine/src/runtime_threads.rs"},"region":{"startLine":3523}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e54e903ccc19fcfafe64d8f46d39fa844b59fcedc439945d39499d6c246e29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): crates/engine/src/client/anthropic.rs:429-460 | crates/engine/src/client/responses.rs:399-431 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/anthropic.rs:429\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a20f2c5a34b60eb77807d84c0cf7624ae7f0a5cd22e0b38ce4b5e3c8bb29d5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201333 lines \u00D7 2): crates/tui/src/tui/history/latex_render.rs:299-331 | crates/tui/src/tui/history/latex_render.rs:357-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":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3e02f1f97765301fe515f990826afef2114e31d6fd3d40cce7375eceb6328b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201332 lines \u00D7 2): crates/engine/src/client.rs:6454-6485 | crates/engine/src/client.rs:6532-6557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client.rs:6454\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":6454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aae929f5697a353136c9241087b00409d8bb7cfd82ca034029b675066a61e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:1049-1080 | crates/tui/src/tui/widgets/mod.rs:2177-2208 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf3628ffa9b08308d274db81ba64b697e815f1fb7d80fc865251039219cd63c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201331 lines \u00D7 2): crates/engine/src/client/reasoning_effort.rs:189-219 | crates/engine/src/client/reasoning_effort.rs:317-343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/reasoning_effort.rs:189\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/reasoning_effort.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a710f89ca8e2b06d5997bc533fccde43fb3998a49baf9d36c8015798a6c455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201331 lines \u00D7 2): crates/engine/src/tools/file.rs:1387-1417 | crates/engine/src/tools/file.rs:1608-1630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/file.rs:1387\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd92c3b379cbc270ee2a6933283cdef66d8c3e20387ade2566a7bdf0731e0804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): crates/tui/src/tui/views/automations.rs:674-702 | crates/tui/src/tui/views/workflows_manager.rs:448-477 \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/tui/src/tui/views/automations.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"d281edf152e0d967e5e099e8673715da708f05eb8d1a1387c934f2a4898d4396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:2768-2797 | crates/tui/src/tui/widgets/transcript_legacy.rs:1061-1090 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/mod.rs:2768\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":2768}}}],"partialFingerprints":{"codehealthFindingId/v1":"251b307f8880059b569515d99b08f4e4375ff4a5c3205d0d2633d84af84459c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/config/src/config_document.rs:525-553 | crates/runtime/src/config_persistence.rs:259-287 \u2014 before extracting anything, compare \u0060crates/config/src/config_document.rs\u0060 and \u0060crates/runtime/src/config_persistence.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_document.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"728488ebd1e058d7f7c69bc075aa56cf5347fd442c17559febedc7672e1439d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/config/src/windows_identity.rs:37-65 | crates/engine/src/tools/github/report.rs:1370-1398 \u2014 before extracting anything, compare \u0060crates/config/src/windows_identity.rs\u0060 and \u0060crates/engine/src/tools/github/report.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/windows_identity.rs:37\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/windows_identity.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b16df93509ac34a809d48fbdc4b66d95ce61bfe7ff252c48efad2961a63bb1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/engine/src/fleet/ledger.rs:928-955 | crates/engine/src/fleet/ledger.rs:1219-1246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/ledger.rs:928\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"d543c1d9363ead7834ad2cba251da51d0025d9627462051a264a655a161c2a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:2647-2675 | crates/engine/src/runtime_threads/manager.rs:2686-2714 \u2014 both copies are in the same file, so extract the block 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"649f9d10a8c5b424de24a8db51f55357e2398397ea91d50c93f03fc8018b31bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/engine/src/tools/shell.rs:6863-6890 | crates/engine/src/tools/shell.rs:7515-7542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/shell.rs:6863\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":6863}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c286f9b4468d01b0a8bac5921240f2429157417673fe55cca8f35e306deb5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/engine/src/model_routing.rs:1577-1603 | crates/engine/src/model_routing.rs:1804-1830 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/model_routing.rs:1577\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_routing.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf9e27ffab9f16fb7285a4c70dc3fcdff8b7ef42c4b76b59d0b29dfe65449c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): crates/engine/src/tools/apply_patch.rs:294-318 | crates/engine/src/tools/apply_patch.rs:355-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/apply_patch.rs:355\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/apply_patch.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd78c49294536cf076499301e71b90aff1c7969ce08bad902a08557a6fc9e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:834-866 | crates/tui/src/tui/widgets/mod.rs:2038-2070 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"c545bb73ceae11d23c5e1b284be2932d7a9ae02602160bc80ebccd3669fb756a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:92-118 | crates/tui/src/tui/widgets/transcript_legacy.rs:53-79 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71fe21bef8d36c7b6432c046cc4136b207154e09042b40ebf78faec74e63592"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): crates/models/src/hand_pricing.rs:281-306 | crates/models/src/hand_pricing.rs:325-350 | crates/models/src/hand_pricing.rs:362-387 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/models/src/hand_pricing.rs:362\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/hand_pricing.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"27453e2d9864010c519b90f06ee84a48a0481d3cf27a8fa286a0d29ec8c82cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/cli/src/lib.rs:4757-4782 | crates/cli/src/lib.rs:4910-4935 \u2014 both copies are in the same file, so extract the block 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/cli/src/lib.rs"},"region":{"startLine":4757}}}],"partialFingerprints":{"codehealthFindingId/v1":"2615636f170be84b80ac76633a0131ca096f577f5bd94ceed03c3190b271c13f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/engine/src/tools/web_run.rs:556-581 | crates/engine/src/tools/web_run.rs:628-653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_run.rs:556\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6331860a952cb2e89f347bf16ca125b31591e44611d86a54190177647e7842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:699-722 | crates/tui/src/tui/widgets/mod.rs:1892-1917 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs:699\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5389247ad0f6f78fe965b86b2e4731077927434732f0e5fc380a7a167f92823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201326 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:3295-3317 | crates/tui/src/tui/widgets/mod.rs:3342-3367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/mod.rs:3295\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":3295}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fc31df7e2f87c224f73ceeeee23edc695f74c5a3bfa05d1f6135a7c44fc1d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201325 lines \u00D7 2): crates/engine/src/client/chat.rs:1614-1638 | crates/engine/src/client/chat.rs:1713-1731 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/chat.rs:1614\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"dabb5f89a8078f85aff65ea5722fcb900b4653ae33ac4dd9b26d907b8cfcb78c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201325 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:407-424 | crates/tui/src/tui/ui/event_loop.rs:3555-3579 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:407\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"666cab89be8041d232042c7c0db3470707e9478ea5c7c2f2c88a1380aeae83dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:753-777 | crates/tui/src/tui/widgets/transcript_legacy.rs:642-666 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"290af7060abb5b24e8c3260642b790b2ae93d5e26a55e3f7e0c8cadacc467e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): crates/config/src/model_normalization.rs:115-138 | crates/runtime/src/config.rs:7842-7863 \u2014 before extracting anything, compare \u0060crates/config/src/model_normalization.rs\u0060 and \u0060crates/runtime/src/config.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/model_normalization.rs:115\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/model_normalization.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"92895e28083e841349573c0553520470817831b09fc1eae4482bd7f883c88d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201324 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:5236-5259 | crates/engine/src/runtime_threads/manager.rs:5294-5313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:5236\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":5236}}}],"partialFingerprints":{"codehealthFindingId/v1":"637655ece93452fcb1415a52d6a3c1ef7475dc8a2429da2f76f2eaaa74e57782"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201324 lines \u00D7 2): crates/engine/src/tools/file.rs:1279-1302 | crates/engine/src/tools/file.rs:1576-1591 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/file.rs"},"region":{"startLine":1279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f407c98a89364d45d588c52fae9a8c71b6bd72ea1b0521653d1a95428e95f88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/plugins/src/registry.rs:2456-2479 | crates/plugins/src/registry.rs:2706-2729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/plugins/src/registry.rs:2452\u0060 calls \u0060open_bundle_file\u0060, \u0060map_err\u0060, \u0060ensure_windows_registry_path_still_opened\u0060 and \u0060crates/plugins/src/registry.rs:2705\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"772c523183bb9182fcef077f06a3a53024fb27af40b0c971d16a05e2a982e230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/runtime/src/config.rs:11908-11931 | crates/runtime/src/config.rs:11996-12018 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config.rs:11908\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":11908}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c52235196f9cbc8081d5b34abc9c18c2e565201bd4500d4bd26332ed52bd6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:6005-6028 | crates/tui/src/tui/ui/event_loop.rs:6802-6825 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:6005\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":6005}}}],"partialFingerprints":{"codehealthFindingId/v1":"e027f48c499f4b4ea3f07d99a26f3e8edb011bb32669fc6414f1954b449d83d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:2818-2841 | crates/tui/src/tui/widgets/transcript_legacy.rs:1105-1128 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":2818}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c98e35d76f98d821536e618a28d481abfc82229e95fd31288a2aac2e572c185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201323 lines \u00D7 4): crates/tui/src/commands/config_main_host.rs:972-991 | crates/tui/src/commands/config_main_host.rs:1030-1049 | crates/tui/src/commands/config_main_host.rs:1126-1148 | crates/tui/src/commands/config_main_host.rs:2292-2311 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/config_main_host.rs:972\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_main_host.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6764b4c2fc8f7c1de578cd97408f48947c262bc15ac260979a7a8d07b8c2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/app-server/src/runtime_api/mobile.rs:100-121 | crates/app-server/src/runtime_api/web.rs:84-106 \u2014 before extracting anything, compare \u0060crates/app-server/src/runtime_api/mobile.rs\u0060 and \u0060crates/app-server/src/runtime_api/web.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/mobile.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b17ccd0f1fc253dd4aba2e807230ff613b28ad0580f4a5f3843f6e2b6b9963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): crates/config/src/model_normalization.rs:40-60 | crates/runtime/src/config.rs:9177-9199 \u2014 before extracting anything, compare \u0060crates/config/src/model_normalization.rs\u0060 and \u0060crates/runtime/src/config.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/model_normalization.rs:40\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/model_normalization.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc7c0796a6c97296fe51ba82f598a1e4b5b1442e14c900e1c3d09d602f27406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:10797-10842 | crates/engine/src/runtime_threads/manager.rs:11450-11495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:10797\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":10797}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab207085a6fddbd1196339b70c199f4c9a81c700acfefb3ccb03f32ae74c8d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/plugins/src/install/tarball.rs:265-287 | crates/skill-install/src/install.rs:1552-1574 \u2014 before extracting anything, compare \u0060crates/plugins/src/install/tarball.rs\u0060 and \u0060crates/skill-install/src/install.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/install/tarball.rs:265\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/tarball.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e1e29957bc156f32e3710bd720b953906c618a1137e4f276ac00fedb020f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201323 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:1722-1738 | crates/tui/src/tui/ui/event_loop.rs:1915-1937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:1722\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dffb115e788558619ec17c9f8d99ce73dcc87c3c3eadce649e0b7746586bc6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:5962-5982 | crates/tui/src/tui/ui/event_loop.rs:6650-6672 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:5962\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":5962}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac222bafa2a4f7c5cc8478b70ad0635a78e798a310b0bfef1879ecf6152af0f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:143-165 | crates/tui/src/tui/widgets/transcript_legacy.rs:104-126 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca539fad22cc9564f0c43070d07c1a9649cd932a4f957bdf4c177e39db9728e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:252-273 | crates/tui/src/tui/widgets/transcript_legacy.rs:199-221 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/mod.rs:252\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tui/src/tui/widgets/mod.rs:251\u0060 calls \u0060with_paint_caps\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs:199\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a53f68f709f9734d6d1936c7f3049123c715f6d2659f6b678e0a43686c0d8d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/engine/src/client.rs:3490-3511 | crates/engine/src/client.rs:3544-3565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client.rs:3490\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"c012156bb930de91091dec6cd73d1280de3453d9b454f1403ae823a40daf4029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:17140-17161 | crates/engine/src/runtime_threads/manager.rs:17233-17251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:17140\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":17140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0e08792172cadfcfc381e93fe7f067042857a1159ee7e5b0a602134e24e27c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/app-server/src/exec_agent.rs:656-676 | crates/engine/src/runtime_threads/manager.rs:15499-15519 \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/app-server/src/exec_agent.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2c807aedb9e8ddae2e48c485165cbd31787377a0d8ffee542a372412341669"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/app-server/src/runtime_api.rs:5810-5830 | crates/engine/src/fleet/control.rs:133-153 \u2014 before extracting anything, compare \u0060crates/app-server/src/runtime_api.rs\u0060 and \u0060crates/engine/src/fleet/control.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:5810\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5810}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d73d27b4ce33235ddf538878854d4fa823b0feabc75c8c2c2d9532383fe4e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/app-server/src/runtime_api.rs:11426-11446 | crates/app-server/src/runtime_api.rs:11503-11523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:11426\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b65186a939a0e2d6d4007cb91f79ff89760a810bc2d8ada45942f7d0eeb3d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/core/src/fragments.rs:548-567 | crates/runtime/src/model_context/fragment.rs:219-239 \u2014 before extracting anything, compare \u0060crates/core/src/fragments.rs\u0060 and \u0060crates/runtime/src/model_context/fragment.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fragments.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5c1a673092776e9777ebc3e9443230009804bfcfb5dc31dc876f7ca76b4149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/engine/src/core/engine/rlm_host.rs:802-822 | crates/engine/src/tools/subagent/engine.rs:1548-1568 \u2014 before extracting anything, compare \u0060crates/engine/src/core/engine/rlm_host.rs\u0060 and \u0060crates/engine/src/tools/subagent/engine.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/rlm_host.rs:802\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) async fn settle(\u0026mut\u0060 in one and \u0060\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21505059e65b5e483b2c3f5926f7a8740bdd666b01ab50197a7fa6c8d2f61c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/engine/src/core/engine/turn_loop.rs:3179-3199 | crates/engine/src/core/engine/turn_loop.rs:3203-3223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/turn_loop.rs:3179\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6ae31657be51ea4128494dda249fff2e12ed0653eff8f8be9fb03074d84f51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:17115-17135 | crates/engine/src/runtime_threads/manager.rs:17208-17228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:17115\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":17115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa2ec5d7ff9e1d59641e500005de62e7f9202f10b72287952e5a5f440023698"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): crates/runtime/src/working_set.rs:640-658 | crates/runtime/src/working_set.rs:676-696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/working_set.rs:640\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/working_set.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"922b46c2354465b83d35dd4b5b320523e5985a5949b5701b04f0ba1f88bdba7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/skill-install/src/install.rs:1290-1310 | crates/skill-install/src/install.rs:1481-1501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/skill-install/src/install.rs:1290\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skill-install/src/install.rs"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18a4c3ca66b67db3aa90c6abcb4965895768c31cf760a30e558331a65d89333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): crates/tui/src/tui/ui/activity_detail.rs:387-407 | crates/tui/src/tui/ui/activity_detail.rs:430-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/activity_detail.rs:387\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/tui/src/tui/ui/activity_detail.rs:408\u0060 calls \u0060Some\u0060, \u0060spillover_pager_reference\u0060, \u0060with_owned_evidence\u0060 and \u0060crates/tui/src/tui/ui/activity_detail.rs:448\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/activity_detail.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1362fa3c8dc2b14e280d15a4878c1f090bd63ca2acc7bba9d8758685cefce6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:2949-2969 | crates/tui/src/tui/ui/event_loop.rs:3072-3091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:2949\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2949}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ce305d38a4e6a505881e537e598c41efdaa7846d2a016cccc3f97fd10ec282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:5927-5947 | crates/tui/src/tui/ui/event_loop.rs:6627-6647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:5927\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":5927}}}],"partialFingerprints":{"codehealthFindingId/v1":"c007fb8c858d72148c14bf46758bfcdd6cff6d46774d4e75dc9f9806f8a5ca07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): crates/engine/src/runtime_threads/manager.rs:3240-3259 | crates/engine/src/runtime_threads/manager.rs:3276-3294 | crates/engine/src/runtime_threads/manager.rs:3321-3340 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:3240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/runtime_threads/manager.rs:3319\u0060 calls \u0060unwrap_or\u0060 and \u0060crates/engine/src/runtime_threads/manager.rs:3238\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":3240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1839a041b797b8a0d2e8d6d70109d6f21c168590b46980eb81dbbafd3f2a16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/app-server/src/runtime_api.rs:10272-10291 | crates/app-server/src/runtime_api/review.rs:12-31 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:10272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":10272}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce4f54666772655a28c4d58a6c48512d475cc690f58c8d3274f2ca94c4573a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/engine/src/core/engine/compaction.rs:587-605 | crates/engine/src/core/engine/compaction.rs:621-640 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/compaction.rs:587\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/compaction.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"06acaeccdd896f95b792a2e22fe5f16c63056ee8668538265bca2a2058f6973d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/engine/src/task_manager.rs:4190-4209 | crates/engine/src/task_manager.rs:4222-4241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/task_manager.rs:4190\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":4190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee54c15d10b7dbf64a59f6a60e98758c52b0f505149591221737edc2141db139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/tui/src/tui/app.rs:4554-4573 | crates/tui/src/tui/app.rs:6450-6469 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/app.rs"},"region":{"startLine":4554}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cc0b3ea31975c0ac9d3967550f958ea66a3150f083122197fbc5ca204eb971"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201336 lines \u00D7 2): crates/tui/src/tui/ui/apply.rs:1704-1734 | crates/tui/src/tui/ui/handlers.rs:2305-2340 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/apply.rs:1704\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa1363360ba76f8cbe5fa4259a1dcc7edcabed278784f0453b1e12799a614fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:754-773 | crates/tui/src/tui/widgets/mod.rs:1958-1977 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07861f8a0f90ad8e61a942adabb255ae5f160ba247f8b4292fa522ada83e3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/engine/src/client/reasoning_effort.rs:87-113 | crates/engine/src/client/reasoning_effort.rs:193-211 | crates/engine/src/client/reasoning_effort.rs:321-339 \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/engine/src/client/reasoning_effort.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8b28f6ac68b0ca36c92a954ddba190077d12548fc7fbee81a910d1e82c7a8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/app-server/src/remote_control.rs:1623-1641 | crates/app-server/src/remote_control.rs:1659-1677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/remote_control.rs:1623\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db3483ff26f7a575f83109331a2e83da9ce9bd32a5b36849105d0b1bceb9fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:10144-10162 | crates/engine/src/runtime_threads/manager.rs:10184-10200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:10144\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":10144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0639eebe464b4f0429595fe96da8462e668cf52b0ab26078c0e0201d432b8e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:6959-6976 | crates/engine/src/tools/subagent/mod.rs:10144-10162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":6959}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca9fa89fcff7d88cda5452281234a3626fe2c33431a16675fea7ba31e447a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/runtime/src/config.rs:11311-11328 | crates/runtime/src/config.rs:11943-11961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config.rs:11943\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":11311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60044b829d4570e73439690c79e62bbfaf046cc98909f522c47e2afd10b0850"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/tui/src/commands/contract.rs:1281-1299 | crates/tui/src/commands/contract.rs:1471-1489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:1281\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f663e16ea0db70b1597c3e9ddd5af824e37f25aa387aa01758a35bd0a3d5a27c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/config/src/private_directory.rs:1757-1774 | crates/config/src/private_directory.rs:1886-1903 | crates/engine/src/tools/github/report.rs:1286-1303 \u2014 before extracting anything, compare \u0060crates/config/src/private_directory.rs\u0060 and \u0060crates/engine/src/tools/github/report.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/private_directory.rs:1757\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34c410ea77796f4deef5016b5aecfd176754e973a04150cccb8b88a533bcb2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 3): crates/tui/src/tui/feedback_picker.rs:145-159 | crates/tui/src/tui/live_transcript.rs:666-683 | crates/tui/src/tui/views/mode_picker.rs:150-164 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/feedback_picker.rs\u0060 and \u0060crates/tui/src/tui/live_transcript.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/feedback_picker.rs:145\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/feedback_picker.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"133a53e005cb0aa37bef0123528ee0ab5928a3ee96a142d1097fb7945030841c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/app-server/src/remote_control.rs:365-382 | crates/app-server/src/runtime_chat_relay.rs:1888-1905 \u2014 before extracting anything, compare \u0060crates/app-server/src/remote_control.rs\u0060 and \u0060crates/app-server/src/runtime_chat_relay.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f9f2939b0646e5921ae55fb1e913e8f65288effbd187999f1d1038d73cd4eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/config/src/xai_credentials.rs:494-511 | crates/config/src/xai_credentials.rs:525-542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/xai_credentials.rs:494\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/xai_credentials.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95dec046b1f0f8954c6673daae59d99d0ff7171f1d79e08a9bb06da06139fb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/engine/src/client/reasoning_effort.rs:288-305 | crates/engine/src/client/reasoning_effort.rs:391-408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/reasoning_effort.rs:288\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/reasoning_effort.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe24ab28f77bd715ab68b0ba249c7b1d28c5a37b33d2051f2ac5c729e172e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/engine/src/core/engine/compaction.rs:1284-1301 | crates/engine/src/core/engine/compaction.rs:1306-1323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/compaction.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dcef1c1275df3861dbd475957ef93a29138e96b88cf2f8dbd296fdbfdfac64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/engine/src/core/engine/rlm_host.rs:730-747 | crates/engine/src/tools/subagent/engine.rs:1509-1526 \u2014 before extracting anything, compare \u0060crates/engine/src/core/engine/rlm_host.rs\u0060 and \u0060crates/engine/src/tools/subagent/engine.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/rlm_host.rs:730\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) async fn settle_open_error(\u0026mut\u0060 in one and \u0060\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd5d17e7e2127eb4fcbfcca68dcd4431c2bbd9d96f3d8f68d39c008de8e7d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/engine/src/model_routing.rs:1519-1536 | crates/engine/src/model_routing.rs:1723-1740 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_routing.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74952d2c397a76f11bb5e8174bdb392ddd920b91b39535d7e8022af74892627"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): crates/engine/src/runtime_handoff.rs:1233-1248 | crates/models/src/turn_classify.rs:62-79 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_handoff.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"437837db3150ff13c9259b5566cdad4661a29742736c7fbf6daf84f99b18502b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:8807-8824 | crates/engine/src/runtime_threads/manager.rs:8834-8851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:8807\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":8807}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e66d7874a9aed96ab739fc81606f4dbe21819935cfbc27b5a64ed378c185f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:17168-17185 | crates/engine/src/runtime_threads/manager.rs:17258-17275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":17168}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3103c3a2ef5588ae6e71c8afc254e05e43445700f6addb167df60c0684c78d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/engine/src/tools/file.rs:2060-2077 | crates/engine/src/tools/file.rs:2262-2279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/file.rs:2060\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":2060}}}],"partialFingerprints":{"codehealthFindingId/v1":"818b9bee7b69bb6a7b253d773df174a20f719623a09b56e497269d64b8204c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/engine/src/tools/verifier.rs:473-490 | crates/engine/src/tools/verifier.rs:538-554 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/verifier.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce91c30ca5895b3c6c43de66b644474cefb42d864c96242f1d96fdc2982019a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/localization/src/lib.rs:75-92 | crates/localization/src/lib.rs:96-113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/localization/src/lib.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99a381782a9b6a04ce08cacc559baca3eb03f8c7fd9e369fe956078ff96024e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/tui/src/lib.rs:4874-4891 | crates/tui/src/lib.rs:4898-4915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/lib.rs:4874\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":4874}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdf4cd4e36ec0cc51e25b42665887f0c11c4f3d24afb22f4c33b35f217f4b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/tui/src/tui/tool_routing.rs:99-116 | crates/tui/src/tui/tool_routing.rs:138-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/tool_routing.rs:99\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/tool_routing.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"193e98c9bda13c5c9d70165a99bc608b70efa8dffae910609667467cda77df68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:4787-4804 | crates/tui/src/tui/ui/event_loop.rs:4866-4883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:4787\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":4787}}}],"partialFingerprints":{"codehealthFindingId/v1":"526d00604c9c765a831aacb09f04f5c6a91fc87c991185f0c4c25c4b75bdad07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:1154-1171 | crates/tui/src/tui/widgets/mod.rs:2282-2299 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3454574aee5c07014beb7cfff7a7b8c8f9b8b981f8b08d53d65ee6e01fb4cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/config/src/path_io.rs:83-99 | crates/engine/src/runtime_threads.rs:5714-5730 | crates/engine/src/tools/subagent/mod.rs:13044-13060 \u2014 before extracting anything, compare \u0060crates/config/src/path_io.rs\u0060 and \u0060crates/engine/src/runtime_threads.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/path_io.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf69e12d1424fd6b646dca5dc1bc4ed59d9531ecea19b1348363c07623bfaf3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/plugins/src/install/dsh.rs:702-718 | crates/plugins/src/install/dsh.rs:750-766 | crates/plugins/src/install/dsh.rs:863-879 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/install/dsh.rs:702\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d4f77e1c4828d916badeb7514aa4e7a519d07a2f6ce867ecf345384894a657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/engine/src/core/engine/tool_catalog.rs:1793-1823 | crates/engine/src/tools/js_execution.rs:168-198 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/tool_catalog.rs:1793\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_catalog.rs"},"region":{"startLine":1793}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d695269c091dd36704dbd2535442f7e5c0dda325299a22753ecf79f6b9a87f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/engine/src/core/engine/turn_loop.rs:3285-3301 | crates/engine/src/core/engine/turn_loop.rs:3357-3373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/turn_loop.rs:3285\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":3285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1922098a5fe4be853f177a60dede4294fb781101ea3e6d00a8ddaeff0c63620"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/engine/src/extension_host/execution.rs:1145-1160 | crates/engine/src/extension_host/execution.rs:1303-1319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/execution.rs:1145\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/execution.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4958904b4869e4f3ec7eed47b81bb4e20355248c2f50668f01129e5cbf1d59ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/engine/src/fleet/ledger.rs:880-896 | crates/engine/src/fleet/ledger.rs:986-1002 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/ledger.rs:880\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"7981aae5ecb43f17c9464a55bcefa6333c534b5402d6be7479cb8c642f8604a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/engine/src/fleet/manager.rs:1965-1981 | crates/engine/src/fleet/manager.rs:2028-2044 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/manager.rs:1965\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/fleet/manager.rs:2026\u0060 calls \u0060Ok\u0060 and \u0060crates/engine/src/fleet/manager.rs:1964\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"1642e5bb269c8431c87b1a3c8fd6fdb00927557bb0b32ed3a066666afec599b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:18317-18333 | crates/engine/src/runtime_threads/manager.rs:18359-18375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:18317\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":18317}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9c1459a20bd779d338d848b3564212d95a96863f0c53665ff54658dfb6ba6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/engine/src/session_manager.rs:4965-4981 | crates/engine/src/session_manager.rs:5516-5532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_manager.rs:4965\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":4965}}}],"partialFingerprints":{"codehealthFindingId/v1":"645f24627e92b1bc353b8cfccd63c14533f94ee87503fa4bb555810ce2686d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:15144-15159 | crates/engine/src/tools/subagent/mod.rs:15228-15244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":15144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d45a1e6736bf4f7e32b35a12a2278d6b460ba005f61f040479fd28df1521dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:584-600 | crates/plugins/src/marketplace/parsers/codex.rs:367-383 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codex.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a45fe2c2077500d7ff1ca08a1a042436813d29f87ddd06e8d61ecf0ac9d855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/secrets/src/lib.rs:246-262 | crates/secrets/src/lib.rs:311-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/secrets/src/lib.rs:246\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"adac20ddc4ae93aa8a305135f30e7ef35db9ffed26b278b042f664b396aef750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/tui/src/commands/contract.rs:3702-3718 | crates/tui/src/commands/contract.rs:4772-4787 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:3702\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":3702}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77e8c04624b140035a4db6739e9e41ee27670cecbd6150ecb94f744a1db63bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/tui/src/tui/command_palette.rs:838-854 | crates/tui/src/tui/views/mod.rs:4269-4285 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/command_palette.rs:838\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa9de3169e914b732a561febae5b94ff55ca83d81587224f039208f6e7f6731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/tui/src/tui/history/latex_render.rs:890-906 | crates/tui/src/tui/history/latex_render.rs:908-924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"e51913b6ba51ad2688b1de7b6f44214eac1b543960ccbdce80d20533ff940e02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/tui/src/tui/provider_picker.rs:4338-4353 | crates/tui/src/tui/provider_picker.rs:4377-4393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/provider_picker.rs:4338\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":4338}}}],"partialFingerprints":{"codehealthFindingId/v1":"8463e0451c6d1e2269ad24b5e2ebca988fbaec9cf14883e4b9834537a45e21aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/tui/src/tui/ui/dispatch.rs:512-528 | crates/tui/src/tui/ui/dispatch.rs:1399-1413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/dispatch.rs:512\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/dispatch.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af3f5d3a3b7530b52bf0c442730013b3b447532e6f82b060182d8dce67dfaf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:121-137 | crates/tui/src/tui/widgets/transcript_legacy.rs:82-98 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa71ab0c10aabb8a65deefe58e8d1362333b461e915ae0f22511f6e4822c987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/app-server/src/runtime_api.rs:11430-11445 | crates/app-server/src/runtime_api.rs:11451-11466 | crates/app-server/src/runtime_api.rs:11507-11522 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:11430\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0380ac7908d6241aa9f08c6a8d19786245518de6b373914f0747d8e1c879f621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): crates/engine/src/runtime_threads/manager.rs:16486-16499 | crates/engine/src/runtime_threads/manager.rs:16509-16522 | crates/engine/src/runtime_threads/manager.rs:16539-16554 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f030b43b1314de09f289353571585de78c9c018969316edc6f0939b3a270e4e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/tui/src/tui/ui/event_loop.rs:9145-9160 | crates/tui/src/tui/ui/event_loop.rs:9184-9199 | crates/tui/src/tui/ui/event_loop.rs:9213-9228 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:9145\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":9145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ddb8cf7d8c5a7bcc624961ce2c427a1ebad43d7cfa85bd91cb77ea5d9fb0378"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/app-server/src/runtime_api/secrets.rs:336-351 | crates/app-server/src/runtime_api/secrets.rs:1038-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/secrets.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bedad102cfbb5d0c600d8c5cf2e72013803cf95c533fcadff7a15f6df74c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/cli/src/lib.rs:6085-6100 | crates/cli/src/lib.rs:6157-6172 \u2014 both copies are in the same file, so extract the block 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/cli/src/lib.rs"},"region":{"startLine":6085}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d43fec5487ebec83fd05af6cedcf335d25eb73c858d9842b2d01ec3ab19170"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): crates/config/src/private_directory.rs:1338-1353 | crates/engine/src/tools/github/report.rs:1181-1193 \u2014 before extracting anything, compare \u0060crates/config/src/private_directory.rs\u0060 and \u0060crates/engine/src/tools/github/report.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/private_directory.rs:1338\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e2383c77da2daead641700d262f54d7bf3740babd8f5d5d4d8549915233bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/engine/src/extension_host/execution.rs:1123-1138 | crates/engine/src/extension_host/execution.rs:1268-1283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/execution.rs:1123\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/execution.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32357056f24f13e8f3c40bd330858836b4969058f57acfaad2cebedaf24c16e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/engine/src/mcp.rs:4216-4231 | crates/engine/src/mcp.rs:4356-4371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/mcp.rs:4373\u0060 calls \u0060drop_connection\u0060 and \u0060crates/engine/src/mcp.rs:4235\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":4216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74fdfb1b5372f017c7ffba975575719df585d0d5fac0d84775ca342987cea49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:8179-8194 | crates/engine/src/runtime_threads/manager.rs:8224-8238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:8179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":8179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f713a3e1bc3c9b6fc70491ee7cac6e27a8607b83bb59425b3e49b6af8f25dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:13981-13996 | crates/engine/src/runtime_threads/manager/external_agent.rs:964-979 \u2014 before extracting anything, compare \u0060crates/engine/src/runtime_threads/manager.rs\u0060 and \u0060crates/engine/src/runtime_threads/manager/external_agent.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13981}}}],"partialFingerprints":{"codehealthFindingId/v1":"d939dfb75e98028e11c737731b6597841eaffdd8a9fcd1f40f077cb0729a5356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:14283-14298 | crates/engine/src/runtime_threads/manager.rs:14319-14333 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:14283\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":14283}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d1742718319261afb0e333d740b4459b6037aa0773b14af38763356fc858e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201316 lines \u00D7 2): crates/engine/src/tools/file.rs:3799-3814 | crates/engine/src/tools/file.rs:3873-3883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/file.rs:3799\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":3799}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aed74a9366e3517c3f6200801ed298938280ec3333f1a4029eaa175aab8dd93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/engine/src/tools/shell.rs:2781-2795 | crates/engine/src/tools/shell.rs:2813-2828 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/shell.rs:2781\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4f55127f2c64806c3be90b91047813d7ad0823024aa9478a77dff4b98b28db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/engine/src/tools/spec.rs:483-498 | crates/workflow-js/src/vm.rs:1547-1562 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/spec.rs:483\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/spec.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad88eb0e57cca0931e2135d5b73714cc465b1c2315eea5abc3e24591e6beb58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/engine/src/work_graph/runtime.rs:547-562 | crates/engine/src/work_graph/runtime.rs:583-598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/work_graph/runtime.rs:547\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/runtime.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"792b520f3e54c44eac3a86839bc425e9f4cba069f40a707fe6292e171e8b78f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/sanitize/src/redact.rs:1318-1332 | crates/workflow/src/redaction.rs:624-639 \u2014 before extracting anything, compare \u0060crates/sanitize/src/redact.rs\u0060 and \u0060crates/workflow/src/redaction.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sanitize/src/redact.rs:1318\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e1e62e66029dd5e40688b0d45254f00ddf2ea337a24f2115e724a6c0a0cb81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/tui-kit/src/diff_render.rs:1194-1207 | crates/tui-kit/src/diff_render.rs:1246-1261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui-kit/src/diff_render.rs:1194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ce13b5ad72f161c44ca494fa877fd492af5745f1387178e60de4df0a5d2773"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/tui/src/commands/contract.rs:3499-3514 | crates/tui/src/commands/contract.rs:3528-3543 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:3499\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":3499}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa58a9adb611b1a6e96115091d905adb8f0f12fc02ba863999d11ab691e1b709"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/tui/src/commands/contract.rs:4556-4570 | crates/tui/src/commands/contract.rs:4818-4833 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:4556\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":4556}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03562d4f06b40f27fc94249019d057c7b6cee5e2652afc5b798c8e28666b494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/tui/src/commands/debug_group.rs:24-39 | crates/tui/src/commands/session_group.rs:24-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/debug_group.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2b1e03038e7787b3eb4783c36cd314f5e9e4bfb985ddcf980c754521abaabd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/tui/src/lib.rs:7900-7915 | crates/tui/src/lib.rs:8363-8378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/lib.rs:7900\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":7900}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d049eb856defea87053e70442b0f0ad88dec8beaef5579e1c484dbf2c3e15e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/tui/src/tui/setup/mod.rs:2317-2332 | crates/tui/src/tui/setup/mod.rs:2345-2360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/setup/mod.rs:2317\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11b55f5b3fb01b597819e5a65f64baaa9d6ec38b9b72e5c26cb869aee624969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/tui/src/tui/ui/apply.rs:1953-1968 | crates/tui/src/tui/ui/apply.rs:3180-3195 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/ui/apply.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"387dc4c849be143ac34d6201da3a379f93f8ba58b8299574468b1112bbc8a19a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:2894-2909 | crates/tui/src/tui/ui/event_loop.rs:4954-4965 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d1142a58ec97eb408a8b6970e3f6491d46029fdb05070b51facd528969d0c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): crates/tui/src/tui/views/mod.rs:3838-3853 | crates/tui/src/tui/views/mod.rs:5101-5114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/views/mod.rs:3838\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/mod.rs"},"region":{"startLine":3838}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec17c11ffcc3eb422a84093a615d57c46a2e7657589e8092cc2ba4e3792e0b54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:1083-1098 | crates/tui/src/tui/widgets/mod.rs:2211-2226 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0a2e0c778388db4816a474fc02a2902d029bda4e4a1bad70f3725a1dc6d01b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/tui/src/tui/widgets/composer_legacy.rs:912-927 | crates/tui/src/tui/widgets/composer_legacy.rs:954-969 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46ee11f2c2b09956dc109c197527ad309d37bd2da8d4674aa0b187fa6e00a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): crates/engine/src/core/engine/turn_loop.rs:3179-3192 | crates/engine/src/core/engine/turn_loop.rs:3203-3216 | crates/engine/src/core/engine/turn_loop.rs:3280-3294 | crates/engine/src/core/engine/turn_loop.rs:3352-3366 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/turn_loop.rs:3179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":3179}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ce528825785a0d31f9091c61d2e704a77d7596eecdcb73b68becd915e839d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): crates/engine/src/fleet/ledger.rs:890-904 | crates/engine/src/fleet/ledger.rs:949-963 | crates/engine/src/fleet/ledger.rs:996-1010 | crates/engine/src/fleet/ledger.rs:1240-1254 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/ledger.rs:890\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"643f5a0f03c7500187cf299a0a7e5c4745dbe2d193ec4b51345c6e9b7e7c9b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/app-server/src/runtime_api.rs:6283-6297 | crates/app-server/src/runtime_api.rs:6324-6338 | crates/app-server/src/runtime_api.rs:6377-6391 \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/app-server/src/runtime_api.rs"},"region":{"startLine":6283}}}],"partialFingerprints":{"codehealthFindingId/v1":"123844f24a26f0ffe23337f2eb498cd66372c08508c814b80dfdc47a7e781209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): crates/engine/src/extension_host/registry.rs:1006-1018 | crates/engine/src/extension_host/registry.rs:1817-1829 | crates/engine/src/extension_host/registry.rs:1877-1891 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/registry.rs:1006\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f292f586ae67371668c5d00d5ecd9d4c6a6a753444061d7355a14b5be77438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): crates/engine/src/fleet/host.rs:1589-1601 | crates/engine/src/tools/shell.rs:748-762 | crates/runtime/src/process_tree.rs:576-589 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/host.rs:1589\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/host.rs"},"region":{"startLine":1589}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebe677f28f5ca614152753de268f050bb89c569557fea13d18309db9132de42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201315 lines \u00D7 3): crates/tui/src/tui/ui/event_loop.rs:4787-4795 | crates/tui/src/tui/ui/event_loop.rs:4864-4874 | crates/tui/src/tui/ui/event_loop.rs:9282-9296 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:4787\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":4787}}}],"partialFingerprints":{"codehealthFindingId/v1":"6522a2900b04c7745eff61eab912909456f4861e93fd3bc5a125e9b09b5e2f8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/app-server/src/runtime_api.rs:10795-10809 | crates/app-server/src/runtime_api.rs:10844-10858 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:10795\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":10795}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88006f80a8a04a83ff87ee104352172401e275d36192530a03933d67a363a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/cli/src/metrics.rs:720-732 | crates/cli/src/metrics.rs:1211-1225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/src/metrics.rs:720\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"4997abbfc89d0d08cc0f9ba4d6927b21d0972fbcea9d0e108cabba338a04780a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/config/src/base_url_resolution.rs:33-47 | crates/runtime/src/config.rs:9270-9284 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6592f2a023d28e7b21f5e7fa1516d1b30208ac3faebf6518b88dac6ad3ae71f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/engine/src/client.rs:3893-3907 | crates/engine/src/cost_status.rs:1625-1639 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client.rs:3893\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":3893}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed789d1eafa53856c09c858a373a73731fad859fd2361eab4522583e8049f246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/engine/src/core/engine.rs:6558-6572 | crates/engine/src/core/engine/host_profile.rs:64-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine.rs:6558\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/core/engine/host_profile.rs:63\u0060 calls \u0060wait_for_mcp_boot\u0060 and \u0060crates/engine/src/core/engine.rs:6557\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":6558}}}],"partialFingerprints":{"codehealthFindingId/v1":"8701474257c2d680595d2c95ae2ce321f034bffc3921637d4bda7bc5103cacb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/engine/src/extension_host/core_call.rs:1017-1030 | crates/engine/src/extension_host/core_call.rs:1110-1124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/core_call.rs:1017\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf6d37655a40ef22a2104a0dbfb179d82e055bd9ac1808826a9043c794bcf8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/engine/src/extension_host/registry.rs:1600-1614 | crates/engine/src/extension_host/registry.rs:1649-1663 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/registry.rs:1600\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc75619a38757d6808c40cd2a91bf0a5b87e4143e395fc3897fa4cb1398b8840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): crates/engine/src/fleet/worker_runtime.rs:694-708 | crates/engine/src/fleet/worker_runtime.rs:807-817 \u2014 both copies are in the same file, so extract the block 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/engine/src/fleet/worker_runtime.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d904fde03a4155ad9e59f3d6febc240863346f6f569e25f130dfae8fa74c8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201315 lines \u00D7 2): crates/engine/src/hooks/executor.rs:2104-2118 | crates/engine/src/hooks/executor.rs:2167-2177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/hooks/executor.rs:2104\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5f7b3fbb89334c93841592fc347b46203227936efbc778c7ad063b0b8fb6f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/engine/src/mcp.rs:3724-3738 | crates/engine/src/mcp.rs:3752-3766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:3724\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":3724}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e843473d895a71bb42bb87215df76601d0b0f20ad747ec367ab15cefd56f9bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/engine/src/purge.rs:552-566 | crates/engine/src/purge.rs:570-584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/purge.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5c607e53bed3d81a0dce5c13efa5837a412b059ff2fd11e58b249d377c479c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/engine/src/tools/file.rs:2044-2057 | crates/engine/src/tools/file.rs:2247-2261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/tools/file.rs:2058\u0060 calls \u0060check_contract_file_size\u0060, \u0060check_file_operation_cancelled\u0060 and \u0060crates/engine/src/tools/file.rs:2262\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":2044}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf07888a6cfb264e8cbf7aed6220fdbc0e70cdb0675c7d50f39fbc7e03df146b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/engine/src/tools/review_core.rs:286-300 | crates/engine/src/tools/review_core.rs:331-345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/review_core.rs:286\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"faad8e0ee61cea1a4d98a63e6af97354f41ee81d4e90713438fb9286f4bd2ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/engine/src/tools/terminal_session.rs:1280-1294 | crates/engine/src/tools/terminal_session.rs:1369-1383 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/terminal_session.rs:1280\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/terminal_session.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0401f6d660500f3208353625e298e945605c1a2bc3fd411cf7703e28bb40d6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/sanitize/src/sanitize.rs:175-189 | crates/tui-kit/src/osc8.rs:279-293 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/sanitize.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8805a1f36adc30b6c429356f0d0f664845ad0eee0b572f01d4db5f92f43b10f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/tui/src/commands/groups/skills/skills.rs:764-778 | crates/tui/src/commands/groups/skills/skills.rs:797-811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/skills/skills.rs:764\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/skills/skills.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff49f3703dd1e09cc28889e2b00d037be41ac1351d0257575a4f1b5a7585da3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/tui/src/tui/agent_details.rs:434-448 | crates/tui/src/tui/work_surface/model.rs:2231-2245 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/agent_details.rs:434\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_details.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f75c836af16a2bfd0a2f40a05704d018a198c24fac8c767325c9a599070b2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/tui/src/tui/history/checklist.rs:141-155 | crates/tui/src/tui/history/checklist.rs:245-259 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/history/checklist.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c114ccfe85463311753a63eec60316f37447ac0d7050551dbf56659f68f9cd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/tui/src/tui/history/latex_render.rs:1356-1370 | crates/tui/src/tui/history/latex_render.rs:1404-1418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/history/latex_render.rs:1356\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"205aced37f5b7df7c3dd201c8a5580edba2e9f128513c92409b073d7c066fd14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/tui/src/tui/session_picker.rs:1159-1173 | crates/tui/src/tui/views/fleet_roster.rs:386-399 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/session_picker.rs:1159\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa4290feea4e16932b1fb1f8cc1e835ca8184fb589a1f316686c9cdeeabff95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:1268-1282 | crates/tui/src/tui/widgets/mod.rs:2418-2432 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc97aba62507b9336454e7054f6773b9a60d03f2fc0f5217c5bc430886e1e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/tui/src/tui/widgets/composer_legacy.rs:547-561 | crates/tui/src/tui/widgets/composer_legacy.rs:595-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/composer_legacy.rs:547\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e49881724dd707d337682bdf56537ae611709a564df2a55b1bfae61c534795"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:804-818 | crates/tui/src/tui/widgets/transcript_legacy.rs:693-707 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c94cad9d4ad0abd367395178afcaaf79d33ed220dec37290d5043c6e698639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crates/app-server/src/runtime_chat_relay.rs:1805-1817 | crates/config/src/config_document.rs:340-352 | crates/runtime/src/settings.rs:2415-2428 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1805}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ebc9c678832ceeca5c7ec57d359c5a48ff19bcc58e8437790874bd296ac51c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crates/config/src/windows_identity.rs:42-54 | crates/engine/src/tools/github/report.rs:1375-1387 | crates/runtime/src/external_credentials.rs:567-580 \u2014 before extracting anything, compare \u0060crates/config/src/windows_identity.rs\u0060 and \u0060crates/engine/src/tools/github/report.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/windows_identity.rs:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/windows_identity.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0080e17bb23fb20ad1a4fbc5db27b9a09ef0901713257219e0ab740a76dbe54b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/engine/src/core/engine/turn_loop.rs:2855-2868 | crates/engine/src/core/engine/turn_loop.rs:2894-2907 | crates/engine/src/core/engine/turn_loop.rs:2943-2956 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/turn_loop.rs:2855\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"581562aacb7f78da53fddd1f51ec70bb1e5a1493375af9bb8576c88f54824bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/engine/src/extension_host/mod.rs:983-996 | crates/engine/src/extension_host/mod.rs:1003-1016 | crates/engine/src/extension_host/mod.rs:1021-1034 \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/engine/src/extension_host/mod.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9321169c814d8e7d57359c5b4296651026a20e0a0f7dddd804a521f618ef64f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/engine/src/task_manager.rs:4264-4277 | crates/engine/src/tools/github/shape.rs:178-191 | crates/engine/src/tools/tasks.rs:1389-1402 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/github/shape.rs\u0060 and \u0060crates/engine/src/tools/tasks.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":4264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4287748349442ba23cfafd5b2db41d6972b2d93b2160bda13f1fe378f14431b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/engine/src/tools/verifier.rs:1188-1201 | crates/engine/src/tools/verifier.rs:1207-1220 | crates/engine/src/tools/verifier.rs:1235-1248 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/verifier.rs:1188\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/verifier.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80247ada5e6f875add38a853f4c50e2447df391589abca688888a70aedc9d25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/app-server/src/runtime_api.rs:13998-14011 | crates/tui/src/tui/views/mod.rs:3966-3979 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":13998}}}],"partialFingerprints":{"codehealthFindingId/v1":"511e56c6a70d3d373ca8605c19431de164979513b7949a628089e8be0273195c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/cli/src/lib.rs:3526-3540 | crates/runtime/src/oauth.rs:4343-4357 \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/cli/src/lib.rs"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab44d190ef8c83d4782d9cbe4bb7f62210ecaa2ff82a156ca77a3baa7769d573"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/cli/src/lib.rs:6111-6124 | crates/cli/src/lib.rs:6182-6195 \u2014 both copies are in the same file, so extract the block 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/cli/src/lib.rs"},"region":{"startLine":6111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d614c4089be6401af2f5082a7babd336db0d39e40038fdbe6ce57b54ae2bca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/cli/src/update.rs:2163-2176 | crates/cli/src/update.rs:2323-2336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/src/update.rs:2163\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a67b35cbb1766fbc45407ff98180c05ef73e6175372b6f62a9087f2e1b7bf57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/engine/src/client.rs:3513-3526 | crates/engine/src/client/responses.rs:273-285 \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/engine/src/client.rs"},"region":{"startLine":3513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a32d215db504ca670ba0bf7fe94625319d26c3316e7949f182e9bb10b96dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/engine/src/client/reasoning_effort.rs:256-269 | crates/engine/src/client/reasoning_effort.rs:364-377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/reasoning_effort.rs:256\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/reasoning_effort.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7e53d064043e085f8d596bc69b8ae680817ab1c842eb7217c819fe517e1d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/engine/src/cost_status.rs:1766-1779 | crates/engine/src/cost_status.rs:1806-1819 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/cost_status.rs:1766\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd05e520b9786db3abf5ecffdf6463f17c122a42b59773da14feeeb3e2947ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/engine/src/provider_lake.rs:2453-2466 | crates/engine/src/provider_lake.rs:2469-2482 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/provider_lake.rs:2453\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":2453}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3fdaa0abf84d425d8ac5e30bb0b71ac7316d7224a5451dfb10f9555378b9af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/engine/src/tools/cargo_failure_summary.rs:343-356 | crates/engine/src/tools/workflow/mod.rs:2679-2692 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/cargo_failure_summary.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf798b8577c54e4ba2185d00b65ef72c301b9d64fa2cb68fed72a4e7ae9c347e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/engine/src/tools/github/report.rs:1274-1287 | crates/runtime/src/external_credentials.rs:457-470 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/github/report.rs\u0060 and \u0060crates/runtime/src/external_credentials.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/report.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"69058a570fd86da0a95a6e5bca5620a52cbf801a87ff2f4be40e1cc27320035a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:17736-17749 | crates/engine/src/tools/subagent/mod.rs:17761-17774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/mod.rs:17736\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":17736}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcd020b047ad454b923134a17da907103c209e0ed099b90214e7c30746e88ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/engine/src/tools/truncate.rs:612-625 | crates/engine/src/tools/truncate.rs:1117-1130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/truncate.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba11a2eb01cadcae6edd6f92599081f1a255b9115f094d7dc8cfc46386676b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/engine/src/tools/web/contract.rs:43-56 | crates/runtime/src/config/search.rs:97-110 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web/contract.rs:43\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/runtime/src/config/search.rs:113\u0060 calls \u0060names_hint\u0060 and \u0060crates/engine/src/tools/web/contract.rs:57\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/contract.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4e3f265127950e3337189c9f66eef396e722ac850a04bdb5167b149a9c4a4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/engine/src/tools/web_search.rs:593-605 | crates/engine/src/tools/web_tool.rs:97-110 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:593\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"941a9fadc4aaca0611053097e4170ed89234eac1d6f824447f9871d225ea4b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/plugins/src/install/tarball.rs:252-263 | crates/skill-install/src/install.rs:1537-1550 \u2014 before extracting anything, compare \u0060crates/plugins/src/install/tarball.rs\u0060 and \u0060crates/skill-install/src/install.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/install/tarball.rs:252\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/tarball.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd703f5227229aa57d8df517a0131a8aecb0f70faac1987431188c7008afee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:88-101 | crates/plugins/src/marketplace/parsers/codex.rs:63-76 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codex.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:88\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e28278d6f131b23ce9e3b5287dfd471974a1df0d758d0f885f6cdf0dfc9c77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:98-111 | crates/plugins/src/marketplace/parsers/codewhale.rs:79-91 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codewhale.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae4c00b70e3116a2a840c44a73ab85c4272c0e485c94f4ed8233aa46970cd3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:240-251 | crates/plugins/src/marketplace/parsers/kimi.rs:139-152 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/kimi.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:240\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b706559593e309296f4ea0357b15de45106fdaaed124ffb826ef75d53eb5ee92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/sanitize/src/redact.rs:604-617 | crates/sanitize/src/redact.rs:671-684 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/sanitize/src/redact.rs:670\u0060 calls \u0060Some\u0060, \u0060last\u0060, \u0060copied\u0060 and \u0060crates/sanitize/src/redact.rs:603\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"b464679aefe9246ca1e2d9837281aba73781c3759197358e1e54b55baf3146a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/state/src/lib.rs:1001-1022 | crates/state/src/lib.rs:1223-1244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/state/src/lib.rs:1001\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/state/src/lib.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8b8e6b47af2cdd8b95a8a10ee5d9e385e88c8f0f34c02d3537ec62d27f0558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/tui-kit/src/markdown_render.rs:289-302 | crates/tui-kit/src/markdown_render.rs:520-533 \u2014 both copies are in the same file, so extract the block 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/tui-kit/src/markdown_render.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5da34f5bfe03b908f46a217aaf1cf59aacc841d4ee4be8227b5fee7c94be5d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/tui/src/commands/contract.rs:645-658 | crates/tui/src/commands/contract.rs:1274-1287 \u2014 both copies are in the same file, so extract the block 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/tui/src/commands/contract.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bef3300e46a86aac1065118caf7824d4e3393425ea055cf34a7154d7678e1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/tui/src/tui/model_picker.rs:4600-4611 | crates/tui/src/tui/provider_picker.rs:3140-3153 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/model_picker.rs:4600\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":4600}}}],"partialFingerprints":{"codehealthFindingId/v1":"3131b4434feccffc1d65ff109017580f7841ff143c6aac1b375e283fe1e16a4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/tui/src/tui/session_picker.rs:698-711 | crates/tui/src/tui/session_picker.rs:794-807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/session_picker.rs:698\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c8d8a14f0f8b8a9bd17ea70c649e32cecc00b8bc1ecf43e57e5fb838208fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/tui/src/tui/tool_routing.rs:551-563 | crates/tui/src/tui/ui/event_loop.rs:3723-3736 \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/tui/src/tui/tool_routing.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6f0771122b0bf222207424c524a2e184647b08c00cc77df1f5e7d5d8b75a30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/tui/src/tui/ui/apply.rs:1187-1200 | crates/tui/src/tui/ui/provider_routes.rs:933-946 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/ui/apply.rs\u0060 and \u0060crates/tui/src/tui/ui/provider_routes.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/apply.rs:1187\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36d3b989914618a5bbcff56edc3b9c74bbcb4c93f4b378c42c10851fdf75a24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:818-831 | crates/tui/src/tui/widgets/mod.rs:2022-2035 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"99362b6f83c57e721cb0e70d4dfefe3e3f2dd5b3753c6c949e7992b77403ac17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/tui/src/tui/widgets/composer_legacy.rs:488-501 | crates/tui/src/tui/widgets/composer_legacy.rs:812-825 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e844db5ee624ea21d24ed1964457da6883848bacd3b2da9226541f2fd9e9a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): crates/engine/src/extension_host/mcp_http.rs:743-754 | crates/engine/src/mcp/sse.rs:157-169 | crates/engine/src/mcp/wire.rs:85-97 \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/engine/src/extension_host/mcp_http.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3cac5d4be56819fe73ba1dfd87f5ca988771232759eb1ef47b635b4de03275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/engine/src/model_routing.rs:1576-1588 | crates/engine/src/model_routing.rs:1803-1815 | crates/engine/src/model_routing.rs:1923-1935 \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/engine/src/model_routing.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c1379f4e8cc251e99e3bc3074ca8b0d5a9b4365a65c791fb7ca40c40b29d25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/engine/src/runtime_threads.rs:3518-3530 | crates/engine/src/runtime_threads.rs:3677-3689 | crates/engine/src/runtime_threads.rs:3928-3940 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads.rs:3518\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"51194cd3397d49fc6f862d5e2417391fcc8c905adac30eed8624564d27a11f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/engine/src/tools/web_search.rs:2999-3011 | crates/engine/src/tools/web_search.rs:3050-3062 | crates/engine/src/tools/web_search.rs:3358-3370 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:2999\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/tools/web_search.rs:2997\u0060 calls \u0060or_else\u0060, \u0060get\u0060 and \u0060crates/engine/src/tools/web_search.rs:3357\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2999}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d394976a19ff2199d18c2f32eebb88839432040b6e0d8bb3047005d510cf5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/plugins/src/marketplace/parsers/claude.rs:92-104 | crates/plugins/src/marketplace/parsers/codewhale.rs:73-85 | crates/plugins/src/marketplace/parsers/codex.rs:67-79 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codewhale.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:92\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12976a476f14dcfc60d7e039fb4afcb6dfe38924a5a08d40d839c0637035cd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/secrets/src/lib.rs:210-222 | crates/secrets/src/lib.rs:246-258 | crates/secrets/src/lib.rs:311-323 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/secrets/src/lib.rs:210\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd106ffae5cc200a9bada845ec0fb8fe1f5ca082b1aece63d070bbb3c4202cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/tui/src/tui/ui/apply.rs:1717-1729 | crates/tui/src/tui/ui/apply.rs:1955-1967 | crates/tui/src/tui/ui/apply.rs:3182-3194 \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/tui/src/tui/ui/apply.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"863edc58ef7c21c1b4aab07adb8470cdf6c4173994d599b6d298fcb7ef2964ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/tui/src/tui/widgets/composer_legacy.rs:527-539 | crates/tui/src/tui/widgets/composer_legacy.rs:574-586 | crates/tui/src/tui/widgets/composer_legacy.rs:621-633 \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/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78f1ab5a27f6b5c00c087f5360573d8b77a556d6ab1a2c2883c0a59ebb1b3a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/app-server/src/runtime_api.rs:6667-6679 | crates/app-server/src/runtime_api.rs:6708-6720 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:6667\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":6667}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae3da4484005d6b0e96d44bc7dc81e7efda3ae85ea09178ed017eb4b02f3f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/app-server/src/runtime_api/plans.rs:370-382 | crates/app-server/src/runtime_api/plans.rs:399-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/plans.rs:370\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plans.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"801a551fb5af22a32ae968c76b2841610d645b7a2234e88f220fc18d6a1f3c83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/app-server/src/runtime_api/thread_history.rs:1650-1662 | crates/app-server/src/runtime_api/thread_history.rs:1666-1677 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca92d42d2ea435891b5e98b630b814ea93ebf34b406d0aedbf70a144f761884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/config/src/model_normalization.rs:23-33 | crates/runtime/src/config.rs:275-287 \u2014 before extracting anything, compare \u0060crates/config/src/model_normalization.rs\u0060 and \u0060crates/runtime/src/config.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/model_normalization.rs:23\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/runtime/src/config.rs:274\u0060 calls \u0060to_ascii_lowercase\u0060 and \u0060crates/config/src/model_normalization.rs:22\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/model_normalization.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1ce045471a18639122fedfedfda6e0adb720896889c4848e4a9e79e312155b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/core/src/prefix_cache.rs:841-853 | crates/runtime/src/prompt_zones.rs:34-46 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/prefix_cache.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4962187af712e17f9c9c17662623e4ee0abfb48a7b7c5fc2efe5a3f10b214d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/core/src/tool_parser.rs:431-443 | crates/core/src/tool_parser.rs:453-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/tool_parser.rs:431\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/core/src/tool_parser.rs:452\u0060 calls \u0060contains_key\u0060 and \u0060crates/core/src/tool_parser.rs:429\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/tool_parser.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"013fc6580bd1847f74248d1e4ed9426d7585af53fb693cc77a3d41a18f030d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/core/protocol_parity.rs:88-100 | crates/engine/src/tools/subagent/mod.rs:21270-21282 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/protocol_parity.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d1a83afef9d99fe88b8838e22d01f1c5f00da743f1416a5e0953976b862374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/extension_host/core_call.rs:940-952 | crates/engine/src/extension_host/core_call.rs:1396-1408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/core_call.rs:940\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"999afd0381a1a12dcb12d0b9eddc6dced384c7ba8f2c7392d5d85618fba91f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/extension_host/mod.rs:1039-1051 | crates/engine/src/extension_host/mod.rs:1056-1068 \u2014 both copies are in the same file, so extract the block 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/engine/src/extension_host/mod.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9420101ae6292beaa232ed7223a3b51276498ce4c920d2054de216bb56ed44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/fleet/ledger.rs:872-884 | crates/engine/src/fleet/ledger.rs:920-932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/ledger.rs:872\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fae736898bf567312397f9e2922399c0570ce17ac91c6b1573d3e225b34b2d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/fleet/ledger.rs:978-990 | crates/engine/src/fleet/ledger.rs:1211-1223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/ledger.rs:978\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2eeaba7d7a98742ea391c4208572a80c9bdb4667a41b33e2decde019b534d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/mcp.rs:4274-4286 | crates/engine/src/mcp.rs:4315-4327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:4274\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":4274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4625019c4a98f2cc5410fccf48e5e34700588278a8a66ab2b42b6bc3173f9e60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/engine/src/provider_catalog_live.rs:1210-1222 | crates/engine/src/provider_catalog_live.rs:1278-1289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/provider_catalog_live.rs:1210\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f24ade3ed1551720ec33440ccc5e77559ecc55eb16c1fe3e9dcba9da9d405e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/route_runtime.rs:362-374 | crates/engine/src/route_runtime.rs:393-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/route_runtime.rs:362\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_runtime.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b108a8c368ccccfcf0afdeef472361d54038a6288e35733b9a5fcda6fdebcc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/route_runtime.rs:1133-1145 | crates/tui/src/tui/provider_picker.rs:892-904 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/route_runtime.rs:1133\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/route_runtime.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a31720536ab4c1c115f981400a6462dae4182bf8a42e27013fcfc046ad6de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:1201-1213 | crates/engine/src/runtime_threads/manager.rs:8627-8639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:1201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"b218a63136e776817140f49ac67873ab474c5976940180618aadb5eeed5522bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:2820-2832 | crates/engine/src/runtime_threads/manager.rs:2845-2856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:2820\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/runtime_threads/manager.rs:2833\u0060 calls \u0060audit_frozen\u0060, \u0060default\u0060 and \u0060crates/engine/src/runtime_threads/manager.rs:2857\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"94433184ee7d687c147e7e266c876721cccf32344c47487ea9ad0331701a5f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:11930-11942 | crates/engine/src/runtime_threads/manager.rs:11955-11967 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:11930\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11930}}}],"partialFingerprints":{"codehealthFindingId/v1":"0324fbe710182425fb9ee49c70e9da51978542bb8ec2f89a643b114e8c9d5c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:12818-12830 | crates/engine/src/runtime_threads/manager.rs:18804-18816 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:12818\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12818}}}],"partialFingerprints":{"codehealthFindingId/v1":"694fa3c1cadeaeac93de44cb54b9029104762c2989941af89c9f3f4f4343af8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:18392-18404 | crates/engine/src/runtime_threads/manager.rs:18720-18732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:18392\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":18392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9468b5857efd00ba1f273b9b5a9b34d6d4a4109b2aa8332f3d19f37e19a9baa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/tools/plan.rs:280-292 | crates/engine/src/work_graph/compat.rs:36-48 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/plan.rs:280\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plan.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"593c57830fc29fb6368a0ac2e1d57f95da60bc7ebad02f7cc99429dc449b558a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/tools/review_core.rs:833-845 | crates/engine/src/tools/review_core.rs:1114-1126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/review_core.rs:833\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"d759635038712bce478364ef5c7828b984b44da4291c80e789909dfd8adbb4b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/engine/src/tools/shell.rs:2578-2590 | crates/engine/src/tools/shell.rs:2734-2745 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/shell.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c956dbb7696810738f61b6df7b8fa5204156b29ccfc9a41ea1b9bdea3a08a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/engine/src/tools/subagent/coord.rs:797-808 | crates/engine/src/tools/subagent/mod.rs:15406-15418 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/subagent/coord.rs\u0060 and \u0060crates/engine/src/tools/subagent/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/coord.rs:797\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71d687b007afe5efec209af06aeda2142728131ce089c178d7c165e387a0bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/engine/src/tools/subagent/coord.rs:820-832 | crates/engine/src/tools/subagent/mod.rs:15423-15434 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/subagent/coord.rs\u0060 and \u0060crates/engine/src/tools/subagent/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/coord.rs:820\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b381941bb43c3edb27258b466ad88e316658c99d0707a547a3de9480dac7c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/engine/src/tools/subagent/coord.rs:836-848 | crates/engine/src/tools/subagent/mod.rs:15447-15459 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/subagent/coord.rs\u0060 and \u0060crates/engine/src/tools/subagent/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/coord.rs:836\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"c695ecd1aa018ff2273359eb7840fdcc52cb92fdcb0f49ca26e3b50b3072ce0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/engine/src/tools/subagent/engine.rs:1834-1847 | crates/engine/src/tools/subagent/engine.rs:1890-1901 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/engine.rs:1834\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72d25797b253aa1e036890c6adfc7dd6e124515b1d998fdd6e8904ec192cfc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:5761-5773 | crates/engine/src/tools/subagent/mod.rs:7257-7267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/mod.rs:5761\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/tools/subagent/mod.rs:7256\u0060 calls \u0060origin_workspace_for_owner\u0060 and \u0060crates/engine/src/tools/subagent/mod.rs:5760\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":5761}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef58e98657763fd2c099fc4bf29107dc764d19ae894fc1ce6f10686c2179943"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/lane/src/control.rs:1904-1916 | crates/lane/src/control.rs:1967-1978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lane/src/control.rs:1904\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/control.rs"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc8b6e701e53074904e18c7cc0a8326e267a5d0e4ce4592ad4fd59a34619dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/plugins/src/install/tarball.rs:96-108 | crates/plugins/src/install/tarball.rs:198-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/install/tarball.rs:96\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/plugins/src/install/tarball.rs:209\u0060 calls \u0060header\u0060, \u0060clone\u0060, \u0060entry_type\u0060 and \u0060crates/plugins/src/install/tarball.rs:108\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/tarball.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cf1afd7e3397aa4f0eea054710862c594a436a99a48ab092fd4926a0a4fc7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:221-233 | crates/plugins/src/marketplace/parsers/dsh.rs:284-295 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/dsh.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:221\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e791d218af91d6e28a2696edeac64720a5b0c411e6db2137eb8a74d483d3d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/plugins/src/marketplace/parsers/codewhale.rs:152-164 | crates/plugins/src/marketplace/parsers/codex.rs:162-174 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/codewhale.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codex.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/codewhale.rs:152\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/codewhale.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b465d9d6c4b18169a130f709fe55c68d8390d862e5902dec48860ca43146766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/tui/src/lib.rs:2987-2999 | crates/tui/src/lib.rs:14994-15006 \u2014 both copies are in the same file, so extract the block 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/tui/src/lib.rs"},"region":{"startLine":2987}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff02b8d213f8a2a7b77a05d07d60a247568a9d8935888df6fcf341fc7ecd040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/tui/src/tui/history/latex_render.rs:794-806 | crates/tui/src/tui/history/latex_render.rs:875-886 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/history/latex_render.rs:794\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e25093b605351947d0649fd50c0ef28bb0615427127a250abe7fe809ed7e6bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/tui/src/tui/mouse_ui.rs:662-674 | crates/tui/src/tui/mouse_ui.rs:869-881 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/mouse_ui.rs:662\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/mouse_ui.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfbe73c0f56cd83a5541be4fe1b83750fc1804cbdbbad75b29d31d84565ac15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/engine/src/runtime_threads/manager.rs:17119-17130 | crates/engine/src/runtime_threads/manager.rs:17212-17223 | crates/engine/src/runtime_threads/manager.rs:17334-17345 | crates/engine/src/runtime_threads/manager.rs:17702-17713 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:17119\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":17119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9615de2d9d2318d94fa24e84d2b9e5db5d2cf2bb14691a7834d3bf741d27b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/app-server/src/remote_control.rs:367-378 | crates/app-server/src/runtime_chat_relay.rs:1890-1901 | crates/engine/src/session_manager.rs:2513-2524 \u2014 before extracting anything, compare \u0060crates/app-server/src/remote_control.rs\u0060 and \u0060crates/app-server/src/runtime_chat_relay.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/remote_control.rs:367\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9ec661d0aa181688c7d2c86cbedcbd67e079054e182bb5b80046be50c52d68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/config/src/config_document.rs:458-469 | crates/config/src/private_directory.rs:1679-1690 | crates/runtime/src/external_credentials.rs:373-384 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/config_document.rs:458\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_document.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"520d01bdfe221c7566cc0f803638275b673b7b8fc675ecf44575c0979385c7cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): crates/engine/src/client.rs:3895-3904 | crates/engine/src/core/engine/rlm_host.rs:726-737 | crates/engine/src/cost_status.rs:1627-1636 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client.rs:3895\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":3895}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0479f40af870961b750cbcdc0acf3a7e3406524bbab34ad3127f353b38ab08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/engine/src/tools/automation.rs:166-177 | crates/engine/src/tools/send_later.rs:112-123 | crates/engine/src/tools/tasks.rs:224-235 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/automation.rs\u0060 and \u0060crates/engine/src/tools/tasks.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/automation.rs:166\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/tools/automation.rs:163\u0060 calls \u0060Some\u0060, \u0060legacy_action_schema\u0060 and \u0060crates/engine/src/tools/send_later.rs:111\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b5b1d0da474c97a252a5e04a146d29241a73b329f8585ab95a67c30b227b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/plugins/src/install/tarball.rs:205-216 | crates/skill-install/src/install.rs:1297-1308 | crates/skill-install/src/install.rs:1488-1499 \u2014 before extracting anything, compare \u0060crates/plugins/src/install/tarball.rs\u0060 and \u0060crates/skill-install/src/install.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/install/tarball.rs:205\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/tarball.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35778366320062f529c6e7cc576d84d8f1be730370fbe1521fc6c46d09ba4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/secrets/src/lib.rs:231-242 | crates/secrets/src/lib.rs:265-276 | crates/secrets/src/lib.rs:297-308 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/secrets/src/lib.rs:231\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"d420d31d9a99e67036921d407fea5b3efe89d4d1436af3858f6bb85444b9f0b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/tui/src/tui/hotbar/setup.rs:947-966 | crates/tui/src/tui/provider_picker.rs:4485-4496 | crates/tui/src/tui/provider_picker.rs:4556-4568 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/hotbar/setup.rs\u0060 and \u0060crates/tui/src/tui/provider_picker.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/hotbar/setup.rs:947\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/setup.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cdde4a394d09f14776d84eb9fec146ef099ef469933773b1d8c13429d3a9d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): crates/tui/src/tui/views/fleet_detail.rs:972-982 | crates/tui/src/tui/views/fleet_list.rs:384-395 | crates/tui/src/tui/views/workflows_manager.rs:552-563 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tui/src/tui/views/fleet_detail.rs:971\u0060 calls \u0060borrow_mut\u0060, \u0060clear\u0060 and \u0060crates/tui/src/tui/views/fleet_list.rs:383\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a364484cb4ba4fc37836f0fae144bb7f4847744b75add09b4ce9ffcd6e8b983"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/tui/src/tui/widgets/composer_legacy.rs:542-553 | crates/tui/src/tui/widgets/composer_legacy.rs:590-601 | crates/tui/src/tui/widgets/composer_legacy.rs:655-666 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/composer_legacy.rs:542\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a65e03fcbd91ed912a016f3d03edf181d7132e3514c208f6dd5fcbd08aa7a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/app-server/src/daemon_socket.rs:1020-1031 | crates/app-server/src/daemon_windows.rs:276-286 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/daemon_socket.rs:1020\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/daemon_socket.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"cba8b8a0a741cf1090c7760425f80fb03bde6e66f0790212706f8f864dd7abd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app-server/src/http.rs:234-245 | crates/app-server/src/runtime_api.rs:14787-14798 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/http.rs:234\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/http.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84817e28ed73b0095c662dc0c86c23f589486619bc563d914ed193846a401a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app-server/src/runtime_api.rs:6466-6477 | crates/tui/src/tui/ui/handlers.rs:1450-1461 \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/app-server/src/runtime_api.rs"},"region":{"startLine":6466}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bebe5b95cf9c90c95746a56787483c70646bd30d5d98d030f577c5aa5a43bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app-server/src/runtime_api.rs:11132-11143 | crates/app-server/src/runtime_api.rs:11222-11233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:11132\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8406a2f027d6d285e8b55a24c563e8c579b1ef2ee842d9a1b1300ddc3fef898d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app-server/src/runtime_api/mobile.rs:162-173 | crates/app-server/src/runtime_api/mobile.rs:187-198 \u2014 both copies are in the same file, so extract the block 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/app-server/src/runtime_api/mobile.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9d9dda3c82bcafc0a4b2a7d89947dcc156132fe29beba0f604259ba5a0bd15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app-server/src/runtime_api/plans.rs:312-323 | crates/app-server/src/runtime_api/plans.rs:345-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/plans.rs:312\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plans.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f763ec7b9a3990c66c6085ea8d012637a249ca6f47341118b8e536c3f401eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/config/src/responses_dialect.rs:351-362 | crates/config/src/responses_dialect.rs:383-394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/responses_dialect.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec8bfe87ad36e4c8163a6e9c92a2a001084159a036484099a5a023de315cef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/engine/src/client/chat.rs:4215-4225 | crates/engine/src/client/chat.rs:4229-4240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/chat.rs:4229\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":4215}}}],"partialFingerprints":{"codehealthFindingId/v1":"415db2451a1e149b15721925f8afbe2f1365f36f1daf3dfa0c1ff32906f9b78f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/core/engine.rs:2059-2070 | crates/engine/src/core/engine.rs:2135-2146 \u2014 both copies are in the same file, so extract the block 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/engine/src/core/engine.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd374e38fb84fce8723fa63ffa5b303d37846c98f0c549c935512bc7643c9f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/core/engine/compaction.rs:889-900 | crates/engine/src/core/engine/compaction.rs:1205-1216 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/compaction.rs:889\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/compaction.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d0805ed4d5e59233d1e20491ea14ed3a456bc30660971cef225a5fd7cf15f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/core/engine/tool_setup.rs:90-102 | crates/engine/src/core/engine/tool_setup.rs:171-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_setup.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c89e907c8379bc04309331285f967e91fbc360bd9231557f93a6c1564428f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/core/engine/turn_loop.rs:1730-1742 | crates/engine/src/core/engine/turn_loop.rs:1744-1755 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/turn_loop.rs:1730\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d6edf6c89b2a2c61b88aab221b7d0dc32a3a3078e4a4529faca24b30b26800"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/engine/src/extension_host/hooks.rs:46-56 | crates/engine/src/extension_host/hooks.rs:77-88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/hooks.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e1b9dd08e9c8561aeaf83d75121313ae67e6f7b1d5332a6b964a705e69c3bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/hooks/executor.rs:2666-2677 | crates/engine/src/hooks/executor.rs:2697-2708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/hooks/executor.rs:2666\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b493e112c1a86dc73b77993ebe4baabeae1c62cf63a0992d3136a96863fe7dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/mcp.rs:6400-6411 | crates/engine/src/mcp.rs:6418-6429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:6400\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":6400}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cd1bbb17901ec79ec17718bf20e909aa1c35db27ca3157d66dae0f8bb2b23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/mcp.rs:8339-8350 | crates/engine/src/mcp.rs:8407-8418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:8339\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":8339}}}],"partialFingerprints":{"codehealthFindingId/v1":"442b1b99423b1d38338ef94c91878f19dee30fff025dc8d2e9761bc5d04e209d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/provider_catalog_live.rs:599-610 | crates/runtime/src/catalog_cache.rs:18-29 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/provider_catalog_live.rs:599\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efb2980a5cf72fd509e307af50a35407610f6bc81a4a2e188b9d4d1d5b8bb04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/provider_catalog_live.rs:1865-1876 | crates/engine/src/provider_catalog_live.rs:1948-1959 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/provider_catalog_live.rs:1865\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d344b2ac8148a16cd419ff14509a310cd5b06560b80160f417f2efe15765b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:14339-14350 | crates/engine/src/runtime_threads/manager.rs:14933-14944 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:14339\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":14339}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a654e5620033ab9124b61a54e9927ce4a799f980c16c71eda83500e33db94c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:14361-14371 | crates/engine/src/runtime_threads/manager.rs:14945-14956 \u2014 both copies are in the same file, so extract the block 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":14361}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d114f6e586976fee9e5f170b482773ee94d1df2f20040456996a7b69ef21d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:17102-17113 | crates/engine/src/runtime_threads/manager.rs:17195-17206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:17102\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":17102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a961e542c2f6eeb1a31bcc7975246e56e80bb3d07f2767321e93183d6603f179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/runtime_threads/manager/external_agent.rs:1000-1011 | crates/engine/src/runtime_threads/manager/external_agent.rs:1090-1101 \u2014 both copies are in the same file, so extract the block 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/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd3d25873570bdf081d3dc6bb5dc89047a92224619a4c332919ed4fbd2d3ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/tools/file.rs:611-622 | crates/engine/src/tools/file.rs:826-837 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/file.rs:611\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5feaeea6a9af735665c13f17536b94ab24677ba6ea7ef730205b21ce0c3a1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/tools/plan.rs:135-146 | crates/engine/src/work_graph/model.rs:765-776 \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/engine/src/tools/plan.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b376bff36b19099386378b36bc34915e03c86d4a76e25dc22eafaef1bf7667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/engine/src/tools/web_run.rs:1732-1741 | crates/engine/src/tools/web_run.rs:1781-1792 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_run.rs:1732\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":1732}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3663ca2f07be405f87f75c622dd03e17c282657fa68fa218b797c1106622332"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/work_graph/compat.rs:19-30 | crates/tui/src/commands/contract.rs:1541-1552 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060snapshot\u0060 to \u0060\u0026PlanSnapshot\u0060 in one and \u0060\u0026codewhale_engine::tools::plan::PlanSnapshot\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/compat.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be28e94341dea0a2ca27dd9853627a7b6b763ba7980080a0ad5e61e1a191909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/execpolicy/src/bash_arity.rs:326-335 | crates/execpolicy/src/command_safety.rs:280-291 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/execpolicy/src/bash_arity.rs:326\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/bash_arity.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adda8d2dc6e762bdc374565f4608db3f32632cec2fc3d8fbd137eed84530a35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/lane/src/registry.rs:328-339 | crates/lane/src/registry.rs:430-441 \u2014 both copies are in the same file, so extract the block 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/lane/src/registry.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f921294618c9d84c6f81c168742eae1793cc343ad7b902fe5ceb8f6cf82ff68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:253-273 | crates/plugins/src/marketplace/parsers/kimi.rs:154-174 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/kimi.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:253\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c54d26ef04d442ba88dbbe7026572b7e279ada30508713fbc52924923267e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:287-298 | crates/plugins/src/marketplace/parsers/kimi.rs:194-205 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/kimi.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcd049dae21c916f3a0cb9c751e59cbe65bdebaf7037580a6261c2f9a322c27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:495-506 | crates/plugins/src/marketplace/parsers/codex.rs:311-322 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codex.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:495\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35d402a8c8bcf887e4bf74c424126efc8c59051eca216ede5ec7a25c6b4eed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/runtime/src/config.rs:12637-12648 | crates/runtime/src/config.rs:12794-12805 \u2014 both copies are in the same file, so extract the block 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/runtime/src/config.rs"},"region":{"startLine":12637}}}],"partialFingerprints":{"codehealthFindingId/v1":"0851508027f791408016c4dc634f44a0d77ffedec73a52548fd7681113d4f24c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui-kit/src/diff_render.rs:234-245 | crates/tui-kit/src/diff_render.rs:259-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui-kit/src/diff_render.rs:234\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4664cb4977db9733477c771c057d9931e568101a4e358a7f1c87dbe1a7b39451"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/commands/groups/plugins/mod.rs:499-510 | crates/tui/src/commands/groups/plugins/mod.rs:679-690 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/plugins/mod.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b91766e05435a3f005891801ed9dcdc55b93d543532835eac37d0ea82cb2ec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/tui/src/lib.rs:6051-6062 | crates/tui/src/lib.rs:8659-8669 \u2014 both copies are in the same file, so extract the block 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/tui/src/lib.rs"},"region":{"startLine":6051}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eaaf70977dfc6bf9c28357e4bc45da2cd45d9abc9398f3b0d23f33fa1ee3ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/lib.rs:7887-7898 | crates/tui/src/lib.rs:8350-8361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/lib.rs:7887\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":7887}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e82768926c7fe234fa7abbe1366626fdee9aa874a0b21460d84d1ffdb1865c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/app.rs:1019-1030 | crates/tui/src/tui/app/init.rs:767-778 \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/tui/src/tui/app.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"d769e82178af71d2aa448ba26f58887d960b102ea656bd3cf4edd6418a2f3a5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/approval/elevation.rs:232-243 | crates/tui/src/tui/approval/view.rs:460-471 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/approval/elevation.rs:232\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval/elevation.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e54d0b3da9e2401df0a4b6ceda68a5087941bf831886526ef211a19593f100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/history/latex_render.rs:1215-1226 | crates/tui/src/tui/history/latex_render.rs:1247-1258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/history/latex_render.rs:1215\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef55998c19716f0b1ff2a7b6e97a3d63ce6f3bf9ff8c2b88a7ec2c4278803fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/mouse_ui.rs:1795-1806 | crates/tui/src/tui/ui/event_loop.rs:6692-6703 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/mouse_ui.rs:1795\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/mouse_ui.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"76499f1767271b2ab62c42c7b5547be9322ff8d8eb84f769094664054ef853dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:7902-7913 | crates/tui/src/tui/ui/event_loop.rs:7914-7925 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":7902}}}],"partialFingerprints":{"codehealthFindingId/v1":"4deb20f413f71446407a78baf6aa123b0126ddac6f7293adc61e184982df7f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): crates/tui/src/tui/ui/handlers.rs:390-398 | crates/tui/src/tui/ui/handlers.rs:480-491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/handlers.rs:390\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ddc279b125560d8a00c905d9eef311044e7a2e5845ab6ba1017160fe5ce185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/ui/remote_control_bridge.rs:132-143 | crates/tui/src/tui/ui/remote_control_bridge.rs:343-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/remote_control_bridge.rs:132\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/remote_control_bridge.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5598aec7c021418c5fe926af484b5e0fd9f16d10a3087dce2b8e0019b7ea81a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/views/automations.rs:613-624 | crates/tui/src/tui/views/workflows_manager.rs:393-404 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/automations.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e2b2853c9f7ac5b443f5be666ffd1ed2f07f4908df971c514f1b5548a39c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:907-918 | crates/tui/src/tui/widgets/mod.rs:2110-2121 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs:907\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fea8c6811f3ea65d57481c4feff1ba54034cdaec55c4934ab8a1bdf6325d8d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/widgets/composer_legacy.rs:372-383 | crates/tui/src/tui/widgets/composer_legacy.rs:413-424 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9a3d42eeaf24c86fd1b56bcb44d838ff59dba98785396f76e9129be26bf3c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/tui/src/tui/widgets/composer_legacy.rs:669-680 | crates/tui/src/tui/widgets/mod.rs:1378-1387 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/composer_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tui/src/tui/widgets/composer_legacy.rs:666\u0060 calls \u0060selection_marker\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs:1377\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9e83c0b562fef35d43c839eca7f2eb0bf9cbb7b82294b54d60b179b6092d39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:1012-1023 | crates/tui/src/tui/widgets/transcript_legacy.rs:917-928 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/widgets/mod.rs:1012\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1540353ed0191e5aa99a717e668fcfb134c92165c4abf7692547d9de1915bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/work_surface/terminal.rs:703-714 | crates/tui/src/tui/work_surface/terminal.rs:746-757 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/work_surface/terminal.rs:703\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"038784a11e3d03acd503203463c374b2e18aa48cfc001edc06db295125ed4d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): crates/engine/src/runtime_threads/manager.rs:17816-17826 | crates/engine/src/runtime_threads/manager.rs:18318-18328 | crates/engine/src/runtime_threads/manager.rs:18360-18370 | crates/engine/src/runtime_threads/manager.rs:18389-18399 | crates/engine/src/runtime_threads/manager.rs:18717-18727 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:17816\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":17816}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a9e526783ad9b837f2bfb0b581b22dbaf010611d914537dd9c2ccfe6a9fb66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/engine/src/tools/web_search.rs:1013-1023 | crates/engine/src/tools/web_search.rs:1108-1118 | crates/engine/src/tools/web_search.rs:1252-1262 | crates/engine/src/tools/web_search.rs:1457-1467 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:1013\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48ed2291176e4d345802521c59853292feb33308cf8964a8e0fe1809d09ba0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): crates/plugins/src/marketplace/parsers/claude.rs:225-235 | crates/plugins/src/marketplace/parsers/codewhale.rs:156-166 | crates/plugins/src/marketplace/parsers/codex.rs:166-176 | crates/plugins/src/marketplace/parsers/dsh.rs:288-297 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codewhale.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:225\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"14428b4218fbe68f90f517ecf94d9d492287186ef0161bfa1f59d9a6f5f9f70f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/app-server/src/runtime_api.rs:10656-10666 | crates/app-server/src/runtime_api.rs:10770-10780 | crates/app-server/src/runtime_api.rs:10817-10827 \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/app-server/src/runtime_api.rs"},"region":{"startLine":10656}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af3d07b3dc52ad6e59aedca26d53bb0557f54e12e6d221caf18d8257ca157e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 3): crates/cloud-facts/src/lib.rs:314-323 | crates/engine/src/provider_catalog_live.rs:791-798 | crates/plugins/src/registry.rs:1747-1757 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cloud-facts/src/lib.rs:314\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cloud-facts/src/lib.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a162c012c16fdcd3bbdcce24481c5a5dedd3627771cad0759aa3e5d0ade376f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/engine/src/compaction.rs:2284-2294 | crates/engine/src/compaction/last_round.rs:414-424 | crates/engine/src/superfast.rs:260-270 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/compaction.rs:2284\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0f08e8895d78e3363f7f06c48f0b94efa405db4de87abc45c44d93fb58a7d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/engine/src/extension_host/core_call.rs:1017-1029 | crates/engine/src/extension_host/core_call.rs:1110-1122 | crates/engine/src/extension_host/core_call.rs:1528-1538 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/core_call.rs:1017\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc8a8f22ffdd35d36e51be6760f69ede8a6451e0e11d30fa8067a82b7d2a6f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): crates/engine/src/tools/subagent/mod.rs:5761-5770 | crates/engine/src/tools/subagent/mod.rs:5820-5830 | crates/engine/src/tools/subagent/mod.rs:7257-7267 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/tools/subagent/mod.rs:7256\u0060 calls \u0060origin_workspace_for_owner\u0060 and \u0060crates/engine/src/tools/subagent/mod.rs:5760\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":5761}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e5616af6f9a1f9ce6a8d98fbde11e1399b5fa92d2ac5169f82e4ac7901bea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/plugins/src/marketplace/parsers/claude.rs:288-298 | crates/plugins/src/marketplace/parsers/codewhale.rs:259-269 | crates/plugins/src/marketplace/parsers/kimi.rs:195-205 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codewhale.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e8869e73e5a013e0488f79aa1d49369d534996d98cdbb18e26c9ef863aa7725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/tui/src/tui/hotbar/actions.rs:1050-1060 | crates/tui/src/tui/mouse_ui.rs:1798-1808 | crates/tui/src/tui/ui/event_loop.rs:6695-6705 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/hotbar/actions.rs:1050\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/actions.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c00fad3a0bbafbdee8ebc42d22438e392faffe015d2c5ba55ce50b96cf6a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/app-server/src/eval.rs:530-540 | crates/app-server/src/eval.rs:626-636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/eval.rs:530\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/eval.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e006d5fc85d1141c7652c17acee78664f69ecf997a2bf3efe47fcd0ae4c860"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201311 lines \u00D7 2): crates/app-server/src/exec_agent.rs:700-710 | crates/tui/src/tui/ui/frame.rs:1176-1181 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/exec_agent.rs:700\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"645c0d862a26232f8120d5b75f2aa09437c77d760b560e8ccaddd2c24f8783b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/app-server/src/exec_agent.rs:798-808 | crates/tui/src/tui/app/init.rs:646-656 \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/app-server/src/exec_agent.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2095f4c4a1c1fcc15cbdaa6e0bb8c53702f983a2d5fe113f906171581d529ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201311 lines \u00D7 2): crates/app-server/src/exec_agent.rs:3489-3499 | crates/tui/src/tui/ui/event_loop.rs:4912-4918 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/exec_agent.rs:3489\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":3489}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e96259589e9fca75b00c8c94556bf64feebb3ca5ee1c3d677d46045a430764"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/app-server/src/runtime_api.rs:5414-5424 | crates/app-server/src/runtime_api.rs:5436-5446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:5414\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5414}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb9b0bc6ff649abba45dba69d8f6bd8d7072bf25320c198019effc3627649b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/app-server/src/runtime_api.rs:7401-7411 | crates/app-server/src/runtime_api.rs:7436-7445 \u2014 both copies are in the same file, so extract the block 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/app-server/src/runtime_api.rs"},"region":{"startLine":7401}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d354eb73d9a03cff4aecb412ebc50c320f60f48b3de1c5747b816fabb5be50b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/app-server/src/runtime_api.rs:7697-7707 | crates/app-server/src/runtime_api.rs:8028-8038 \u2014 both copies are in the same file, so extract the block 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/app-server/src/runtime_api.rs"},"region":{"startLine":7697}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc368a800f2b9c6e4cbc78019b7551cf5c95e2cb3789540acb68d083466f271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/config/src/path_io.rs:141-151 | crates/config/src/path_io.rs:156-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/path_io.rs:141\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/path_io.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"106951563b0d41269634d48d8abb4f91b707a53c8885ac35891bf25e48efa3c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/config/src/xai_credentials.rs:425-435 | crates/config/src/xai_credentials.rs:480-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/xai_credentials.rs:425\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/xai_credentials.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc745d7994ce80f8811843c9e9b5da1a68bc59db9b39bed11e8304d60d09c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/core/src/fragments.rs:62-72 | crates/runtime/src/model_context/fragment.rs:64-74 \u2014 before extracting anything, compare \u0060crates/core/src/fragments.rs\u0060 and \u0060crates/runtime/src/model_context/fragment.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fragments.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d6a518ab5c49c4c9320d21b76ad0f74421a26faa6bcf47fcb7910ec7209e12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/automation_manager.rs:1234-1244 | crates/runtime/src/skill_state.rs:254-264 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/automation_manager.rs:1234\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5294d98597ad8a3a55c7d53026719dd17d85832e0d234f6b1b4993a92f5139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/compaction.rs:2015-2025 | crates/engine/src/core/engine/review.rs:420-430 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction.rs"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"49080993d67c1921db22d8b671586ebf81e464507ac74e05864961863995d89e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/core/engine/preview.rs:551-561 | crates/engine/src/core/engine/preview.rs:580-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/preview.rs:551\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/preview.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e2f017d99961da54b92a9e6b82156f4e3fd0ff4b34bcefa9addf21f46e7c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/core/engine/rlm_host.rs:749-759 | crates/engine/src/core/engine/rlm_host.rs:784-794 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/rlm_host.rs:749\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) async fn settle_open_error(\u0026mut\u0060 in one and \u0060super) async fn cancel_unexecuted(\u0026mut\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"60873540c234e1cc5c4397a0a53c8fb48dfcd624ff6afa0f423d028109309b76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/core/engine/turn_loop.rs:1744-1754 | crates/engine/src/core/engine/turn_loop.rs:1757-1767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/turn_loop.rs:1744\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1744}}}],"partialFingerprints":{"codehealthFindingId/v1":"7136fac2959862355e5c24a1b949a81786b146c1744e149e600cde4816a6fe74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/fleet/exact.rs:781-791 | crates/engine/src/purge.rs:728-738 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/exact.rs:781\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/exact.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20e132600fd0f11720b3131e40503ddc0eb06eaa288cfa5fa72a081f6d9402a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/mcp.rs:4262-4272 | crates/engine/src/mcp.rs:4375-4385 \u2014 both copies are in the same file, so extract the block 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/engine/src/mcp.rs"},"region":{"startLine":4262}}}],"partialFingerprints":{"codehealthFindingId/v1":"defc0a823213a70ef36a431a0b4900a808b466f78fdf763b5a9354d7a88469bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/operate.rs:604-614 | crates/engine/src/operate.rs:621-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/operate.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c57aa389167f1cb9a395c37d961951d3d475499b24542aaed56b01495d197c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/runtime_threads/job_operations.rs:192-202 | crates/engine/src/runtime_threads/job_operations.rs:371-381 \u2014 both copies are in the same file, so extract the block 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/engine/src/runtime_threads/job_operations.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"370b23b35fdd00e6bd95e7ff2db791de2c7edc85a7538f43f43f25d0c5b8969a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:5223-5233 | crates/engine/src/runtime_threads/manager.rs:5281-5291 \u2014 both copies are in the same file, so extract the block 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":5223}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb398822091b28d82cc78d648842b93c4d7efb2985ab29b944b147453ba444f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:5845-5855 | crates/engine/src/runtime_threads/manager.rs:6096-6106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:5845\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/runtime_threads/manager.rs:5858\u0060 calls \u0060load_goal\u0060, \u0060sync_runtime_goal_control\u0060, \u0060as_ref\u0060 and \u0060crates/engine/src/runtime_threads/manager.rs:6107\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":5845}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11a1612d4795276a68d5f3a8a0b24505b466decc6f1d503f006f996391ccaa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:14400-14409 | crates/engine/src/runtime_threads/manager.rs:14994-15004 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:14994\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":14400}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dadc9b94ab6646a1278c422e23398e9cfe802cd01e477ff8ac3b8feb494d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:15197-15207 | crates/engine/src/runtime_threads/manager.rs:15215-15225 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":15197}}}],"partialFingerprints":{"codehealthFindingId/v1":"004b686b29109d2545a26e51737cb100b4c95260c21831dc9628ed8cff62bf51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/automation.rs:195-205 | crates/engine/src/tools/tasks.rs:242-252 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/automation.rs\u0060 and \u0060crates/engine/src/tools/tasks.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/automation.rs:195\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"224c79e7de373281dd963acaf7d95aee97eb56810b64c7833a26727a983cd43b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/automation.rs:249-259 | crates/engine/src/tools/tasks.rs:323-333 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/automation.rs\u0060 and \u0060crates/engine/src/tools/tasks.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/automation.rs:249\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ba2b1fb0b9789ac67e93e9967e6b649dde2447c67f1d4cbbf0ada9bf630533"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/git_history.rs:241-251 | crates/engine/src/tools/git_history.rs:376-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/git_history.rs:241\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_history.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"66853a4c7b80f6bd2fad83dc13750b046d1592623ccfa5a2b2568d4749b30ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/github/shape.rs:163-173 | crates/engine/src/tools/tasks.rs:1370-1380 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/github/shape.rs\u0060 and \u0060crates/engine/src/tools/tasks.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/tools/tasks.rs:1381\u0060 calls \u0060trim\u0060, \u0060is_empty\u0060, \u0060to_string\u0060 and \u0060crates/engine/src/tools/github/shape.rs:174\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/shape.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"981d8ab4ee7eca8b3e8488c9a97aaa9a1b57630905f91f23c3270c8c7afa0629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/shell.rs:2671-2681 | crates/engine/src/tools/shell.rs:2710-2720 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/shell.rs:2671\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":2671}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0223eb319c0f5101f9f292550568b403d5852b7aa5ec08e65eedd8e1c4fdc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/subagent/coord.rs:937-947 | crates/engine/src/tools/subagent/mod.rs:15562-15572 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/subagent/coord.rs\u0060 and \u0060crates/engine/src/tools/subagent/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/coord.rs:937\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/tools/subagent/coord.rs:949\u0060 calls \u0060is_empty\u0060 and \u0060crates/engine/src/tools/subagent/mod.rs:15573\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50c2436da81e310d48e31f9ccaf49513a2b4404e091f952fbe7e6b5a1c37f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/subagent/coord.rs:1021-1031 | crates/engine/src/tools/subagent/mod.rs:15444-15454 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/subagent/coord.rs\u0060 and \u0060crates/engine/src/tools/subagent/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/coord.rs:1021\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a0bbe5671b674179306091aef54d16552c6ac158a5bcece49ac6dc50ca5a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/engine/src/tools/subagent/engine.rs:2030-2040 | crates/engine/src/tools/subagent/engine.rs:2042-2051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/engine.rs:2030\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"31368d75d4dea27d6ef705c50cc3bc29df01ba95d3189c1d4bf5f985f4c879e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:12902-12912 | crates/plugins/src/export.rs:330-340 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/mod.rs:12902\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":12902}}}],"partialFingerprints":{"codehealthFindingId/v1":"2179dab9966c96481e1b5f319860c460b35117cad021f5993c708a36f6fb427e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): crates/engine/src/tools/verify.rs:477-484 | crates/engine/src/tools/verify.rs:498-508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/verify.rs:498\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/verify.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acd07d8c3982fdddcc1bd74972b74ef81d14665ddaadb9da4480778f735264f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/web_search.rs:2985-2995 | crates/engine/src/tools/web_search.rs:3036-3046 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:2985\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2985}}}],"partialFingerprints":{"codehealthFindingId/v1":"259f895ee751977b20a3120d5cfe2194e0c3927effa2b0f0ddd9a77e0d337e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/lsp/src/registry.rs:34-44 | crates/lsp/src/registry.rs:54-64 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lsp/src/registry.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/registry.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab077ac17c64ee86bb51151925f7950cce1d5f1ea4ebef533e9953694e2d13a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/runtime/src/child_env.rs:89-99 | crates/runtime/src/child_env.rs:245-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/child_env.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbb9f7af6505269fd4859d54c24322b20b6b4387a434be4569e9abded014208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/runtime/src/oauth.rs:3621-3631 | crates/runtime/src/oauth.rs:3668-3678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/oauth.rs:3621\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/oauth.rs"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"490835248d5b14ce1eecdb0bde6e8b42ad316c778d9ab2b3ee295ac9f6b60e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui-kit/src/markdown_render.rs:796-806 | crates/tui-kit/src/markdown_render.rs:808-818 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/markdown_render.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a54570b4ef7fc96eefaaa1f84da7d9806cd6cd27d51ccfbdcdcb7186a7e9344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/tui/src/tui/agent_focus.rs:116-125 | crates/tui/src/tui/mouse_ui.rs:984-994 \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/tui/src/tui/agent_focus.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"310af42889d2f2f6d741771afd8ad922d0f70a738794021d4b1529ab7d2817c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/feedback_picker.rs:176-186 | crates/tui/src/tui/views/mode_picker.rs:172-182 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/feedback_picker.rs\u0060 and \u0060crates/tui/src/tui/views/mode_picker.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/feedback_picker.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f2ec93baae6fa3a3bb48880a1e3df52515de687e5aff12ec6c7897ce693f7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/tui/src/tui/file_picker.rs:591-601 | crates/tui/src/tui/views/mode_picker.rs:112-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/file_picker.rs:591\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_picker.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75597adc6cb7a80f52e30e2f45c60dfd58b68ce347933a5c9665f5b0d6744a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/model_picker.rs:2225-2235 | crates/tui/src/tui/model_picker.rs:2911-2921 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/model_picker.rs"},"region":{"startLine":2225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e976295d461de22cde63b5f715f7b9a3458e5e8ec150865d09c52595078b79b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/ui.rs:1237-1247 | crates/tui/src/tui/ui.rs:1253-1263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui.rs:1237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb9f443c094c0d00a6c4e1267a90c8beba07b4bc460829b75426014e1cdd972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/ui/dispatch.rs:544-554 | crates/tui/src/tui/ui/dispatch.rs:577-587 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/ui/dispatch.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff67b6ffe057648cdabcded57e828df387c50ed13d532396c2b48e2d888ab2f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/tui/src/tui/ui/dispatch.rs:651-661 | crates/tui/src/tui/ui/dispatch.rs:1434-1442 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/ui/dispatch.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77c003a85e33a682cfb81a2e8f12070a40262cf144677c62da59129ca0a58aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:885-895 | crates/tui/src/tui/widgets/mod.rs:2089-2099 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"674fe253d59cba71d4f3ed83c85d5cfa555240fbeb6032351649739fd04b77ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:1193-1203 | crates/tui/src/tui/widgets/mod.rs:2343-2353 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f1440356e5093ff478ca295b6547e37065d7092fbc37dc0eeeef16030c285a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/widgets/mod.rs:786-796 | crates/tui/src/tui/widgets/transcript_legacy.rs:675-685 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"848961f4dea409961bedf6e2f7e3b2edffd9dca3ad50cfd8b16e7fe31a4f5b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/engine/src/mcp.rs:2504-2513 | crates/engine/src/mcp.rs:2567-2576 | crates/engine/src/mcp.rs:2622-2631 | crates/engine/src/mcp.rs:2677-2686 | crates/engine/src/mcp.rs:2728-2737 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:2504\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":2504}}}],"partialFingerprints":{"codehealthFindingId/v1":"997b9afb3b002b4355058b04fe97655ccdc12a6a495d51e935bc22bec05d4dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/tui/src/tui/context_menu.rs:675-684 | crates/tui/src/tui/context_menu.rs:689-698 | crates/tui/src/tui/widgets/mod.rs:920-929 | crates/tui/src/tui/widgets/transcript_legacy.rs:788-797 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/mod.rs\u0060 and \u0060crates/tui/src/tui/widgets/transcript_legacy.rs\u0060 as WHOLE FILES: this scan already matched 15 separate duplicated blocks between them, totalling at least 750 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/context_menu.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe3a3347540911a3d4d16dca514f6beafbdc0fcd06c16e1561de0181a0d6015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/engine/src/automation_manager.rs:1232-1241 | crates/engine/src/runtime_threads.rs:5753-5762 | crates/runtime/src/skill_state.rs:252-261 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/automation_manager.rs:1232\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb93edf20e801ca8d5e35df1f7b2b96710e4fa6ea44a976c0ee15aac2da34ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/engine/src/client/reasoning_effort.rs:166-175 | crates/engine/src/client/reasoning_effort.rs:297-306 | crates/engine/src/client/reasoning_effort.rs:400-409 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/reasoning_effort.rs:166\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/reasoning_effort.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d6d2bf7ebd3d69f46c8ab3ec147e5f1ba62dce91a8e632d35d79ab576d9d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/engine/src/runtime_threads/manager.rs:17170-17179 | crates/engine/src/runtime_threads/manager.rs:17260-17269 | crates/engine/src/runtime_threads/manager.rs:18467-18476 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:17170\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":17170}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c81f8f246da9d7169f59f367f762de9753bb800857dbb4db2728869d1237b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/engine/src/tools/subagent/coord.rs:836-845 | crates/engine/src/tools/subagent/coord.rs:1024-1033 | crates/engine/src/tools/subagent/mod.rs:15447-15456 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/subagent/coord.rs\u0060 and \u0060crates/engine/src/tools/subagent/mod.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/coord.rs:836\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6e593502f303f3ea9d603f0588dc52060f81620468553c42a143a40fb68f0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/runtime/src/config.rs:3259-3268 | crates/runtime/src/config.rs:8129-8138 | crates/runtime/src/config.rs:8243-8252 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config.rs:3259\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/runtime/src/config.rs:8242\u0060 calls \u0060ok_or\u0060 and \u0060crates/runtime/src/config.rs:8128\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3259}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ec3a09a9a49e317d8fbaf1ec98218a1af9b57ef5a5561bd1552845666b54e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): crates/tui/src/commands/contract.rs:641-650 | crates/tui/src/commands/contract.rs:1270-1279 | crates/tui/src/commands/contract.rs:1461-1469 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:641\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50404ef9ee349588960d7ecb04d4d8c2b0d002fbf027e85be327acb1feda17f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): crates/tui/src/tui/provider_picker.rs:2343-2352 | crates/tui/src/tui/provider_picker.rs:2712-2719 | crates/tui/src/tui/provider_picker.rs:2736-2743 \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/tui/src/tui/provider_picker.rs"},"region":{"startLine":2343}}}],"partialFingerprints":{"codehealthFindingId/v1":"afefef93a43e8d653973e129bce0daf15a811c89ab66267d16436f00c84ce907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/app-server/src/exec_agent.rs:3145-3154 | crates/engine/src/core/engine/tool_execution.rs:915-922 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":3145}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a4398685e0ee19480c8604d731660e7e238f79369ce3aa5c627effb942c2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/app-server/src/lib.rs:159-168 | crates/app-server/src/lib.rs:194-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/lib.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/lib.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa103d8c24ebdaf60fdba67dcca23422b60f700598f3d635d9355775bde6dd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app-server/src/runtime_api.rs:4947-4956 | crates/app-server/src/runtime_api.rs:5321-5330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:4947\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/app-server/src/runtime_api.rs:4946\u0060 calls \u0060clone\u0060 and \u0060crates/app-server/src/runtime_api.rs:5320\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":4947}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d11605002e11134e4be557b78ac548f698584c778fa914163c9783b066ae867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app-server/src/runtime_api.rs:5746-5755 | crates/engine/src/fleet/control.rs:81-90 \u2014 before extracting anything, compare \u0060crates/app-server/src/runtime_api.rs\u0060 and \u0060crates/engine/src/fleet/control.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5746}}}],"partialFingerprints":{"codehealthFindingId/v1":"094d97735fea4fb70bd01116ea13ca4fa6649509cd8f2599f115666e090e6506"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app-server/src/runtime_api.rs:7517-7526 | crates/app-server/src/runtime_api.rs:7708-7717 \u2014 both copies are in the same file, so extract the block 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/app-server/src/runtime_api.rs"},"region":{"startLine":7517}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15a0b762540813ee00508a8ede219456fc53f76fd1b6d62d14b701a3ed262cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app-server/src/runtime_api/git.rs:216-225 | crates/app-server/src/runtime_api/git.rs:232-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/git.rs:216\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda24665edf6266a59eea342fdc5c1dc34f81a8abcb6392b5949830c0311aaef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app-server/src/runtime_api/plugins.rs:1642-1651 | crates/app-server/src/runtime_api/plugins.rs:1675-1684 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/plugins.rs:1642\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/plugins.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"079ccd455121575bbd8a4e74e3e7829dd07745065f994cae9d6eda589ac16485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/config/src/config_document.rs:566-575 | crates/runtime/src/config_persistence.rs:300-309 \u2014 before extracting anything, compare \u0060crates/config/src/config_document.rs\u0060 and \u0060crates/runtime/src/config_persistence.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_document.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bf6aa98a0b3e896c3df9e7878bdef53c0e46a0c162eec32da33444913b7e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/config/src/runtime_options.rs:7-16 | crates/runtime/src/config.rs:9914-9923 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/runtime_options.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0876947c184977cdacd0019ee5bf88386b22c05e6e4d1fc3a1db5209afb831b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/core/engine.rs:5717-5733 | crates/engine/src/core/engine/turn_loop.rs:5633-5642 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine.rs:5717\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5717}}}],"partialFingerprints":{"codehealthFindingId/v1":"129efe6901a77cff80bfac4ab7445579093bed6898e62c428cb66aef2b44c471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/cost_status.rs:1708-1717 | crates/engine/src/cost_status.rs:2176-2185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/cost_status.rs:1708\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"002aee2e62a1bce75274533485f816d3621b805c4335671df062b2c9b20fb5ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/engine/src/extension_host/avatars.rs:136-143 | crates/engine/src/extension_host/skills.rs:111-120 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/avatars.rs:136\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/avatars.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6de517df348bba6461084afcb7c873d94605e06c1f46c687280365de50df568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/extension_host/mod.rs:2681-2692 | crates/engine/src/extension_host/mod.rs:2733-2742 \u2014 both copies are in the same file, so extract the block 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/engine/src/extension_host/mod.rs"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c27c5c4b9dfb1e5d412ae56441d16fe04a55ee89141d64578c4549ad280233"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/fleet/host.rs:430-439 | crates/engine/src/fleet/host.rs:475-484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/host.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddb5f5f6782f5bac58c1c72c3c55a9eb2dc4468c86be3130c825462989c7221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/hooks/executor.rs:2069-2083 | crates/engine/src/hooks/executor.rs:2145-2154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f9b5b8dd5c942e24f35f286787d9529da4cf3fea40f635fc9db60e18b4b076"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/hooks/executor.rs:2590-2599 | crates/engine/src/hooks/executor.rs:2616-2625 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/hooks/executor.rs:2590\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/hooks/executor.rs:2615\u0060 calls \u0060collect_reader\u0060 and \u0060crates/engine/src/hooks/executor.rs:2589\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f523061941cb526ca02e1d14029320652eb908532d19388752864d321b277e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/mcp.rs:6442-6451 | crates/engine/src/mcp.rs:6460-6469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:6442\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/mcp.rs:6473\u0060 calls \u0060all_prompts\u0060, \u0060is_empty\u0060 and \u0060crates/engine/src/mcp.rs:6452\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":6442}}}],"partialFingerprints":{"codehealthFindingId/v1":"8924ab418a690b410dfb57f777ca03764ba87fc2f187431312e58627f2518a48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): crates/engine/src/mcp.rs:6611-6620 | crates/engine/src/mcp.rs:6623-6632 | crates/engine/src/mcp.rs:6634-6640 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:6611\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":6611}}}],"partialFingerprints":{"codehealthFindingId/v1":"027085288fb0f7b1438dccf5553055e57993c6a2dd6e29aa260b62ec85bd10d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/engine/src/mcp.rs:7979-7987 | crates/engine/src/mcp.rs:8042-8051 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:7979\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":7979}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7b3e763081964426426d7a5e9f3f5cf5616eaa26ace94ce65418673927352d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/model_routing.rs:1990-1999 | crates/engine/src/model_routing.rs:2025-2034 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/model_routing.rs:1990\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_routing.rs"},"region":{"startLine":1990}}}],"partialFingerprints":{"codehealthFindingId/v1":"8750b1087b297e15d047b8d5128914a847ddf8e14dfa04d28e970dc0a74afca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/engine/src/provider_readiness.rs:305-314 | crates/engine/src/provider_readiness.rs:439-447 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/provider_readiness.rs:305\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_readiness.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aac6cccafab055e5c47a3bb9cca452d24a3e7325eb032f9b965ce29f4b0eae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/provider_readiness.rs:800-809 | crates/engine/src/provider_readiness.rs:816-825 \u2014 both copies are in the same file, so extract the block 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/engine/src/provider_readiness.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"216a7368a164222bdef0f0090e51bf770c39e00295dbe4f980e222b0e6f108eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:2740-2749 | crates/engine/src/runtime_threads/manager.rs:2760-2769 \u2014 both copies are in the same file, so extract the block 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"832de5aa84e0b7de16278fe45e4e2e220a6a070f0b0ae391c04f748caeffd689"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:8961-8970 | crates/engine/src/runtime_threads/manager.rs:9016-9025 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:8961\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/runtime_threads/manager.rs:9015\u0060 calls \u0060to_string\u0060 and \u0060crates/engine/src/runtime_threads/manager.rs:8960\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":8961}}}],"partialFingerprints":{"codehealthFindingId/v1":"66302a8c59bdb8ea732ecced5fc59fe07c421c071f1795946c759362989dab0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:11944-11953 | crates/engine/src/runtime_threads/manager.rs:11969-11978 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:11944\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11944}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c50a416373800bfdc536a485789daf5c04d6266529f85ada4de768c8d3e2cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/apply_patch.rs:686-695 | crates/engine/src/tools/apply_patch.rs:752-761 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/apply_patch.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"1548fc87de63830ed32b3a1b0067d4be1f12400a66cb364b09cc8f141384094b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/file.rs:2002-2011 | crates/engine/src/tools/file.rs:2172-2181 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/file.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8f6d2b379e13a03a1f02754840686e0450c9f1113ea9a1d6a4afad12ffda04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/review.rs:634-643 | crates/tui/src/tui/widgets/workflow_panel.rs:2313-2322 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/review.rs:634\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d3fa9727398667b8d2d652d56349d93e9218c42b2bbfc59b65a5fb090d24d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/review_core.rs:848-857 | crates/engine/src/tools/review_core.rs:1129-1138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/tools/review_core.rs:858\u0060 calls \u0060is_empty\u0060, \u0060clear\u0060 and \u0060crates/engine/src/tools/review_core.rs:1139\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98386da4c2df6a64e0f7a0aca401197e86e1b40f8c2a49f084ea13fa3f5a5d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/review_triage.rs:128-137 | crates/engine/src/tools/review_triage.rs:139-148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/review_triage.rs:128\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_triage.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"958bf74c5c5e304278b760d011715bb20e4ffb374556ab7d88e932e15b964af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/engine/src/tools/shell.rs:2684-2693 | crates/engine/src/tools/shell.rs:2795-2803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/shell.rs:2684\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":2684}}}],"partialFingerprints":{"codehealthFindingId/v1":"53621f7c7101628afa802cda6f167039a95dc8f1da6f9554a335a2785d7b8580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/shell.rs:3164-3173 | crates/engine/src/tools/shell.rs:3986-3995 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/shell.rs:3164\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/tools/shell.rs:3177\u0060 calls \u0060snapshot\u0060 and \u0060crates/engine/src/tools/shell.rs:3996\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"033e6db923ee7b0ec2cd46ad4c8a2543036d1465647825b95b75d5c3762fc4dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/web/citations.rs:80-89 | crates/engine/src/tools/web/citations.rs:127-136 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/web/citations.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dbcedad8259baef675ddb514f36731958543c9fbe46ee5c63cc2ed4980cdf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/web_search.rs:2642-2651 | crates/engine/src/tools/web_search.rs:2729-2738 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:2642\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6919f4a0dbbf5ecc62a98befe0b87e683708b5fb5979cd15146ffcb84a24c80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/workflow/mod.rs:4853-4862 | crates/engine/src/tools/workflow/mod.rs:5045-5054 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/workflow/mod.rs:4853\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":4853}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8ef3f899a8585989c7571aff419bdd67cbbe835b839b07bdce059940e7b185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/workflow/mod.rs:6045-6054 | crates/engine/src/tools/workflow/mod.rs:6167-6176 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":6045}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a54705bfeee3896c16c7f4e69916d58ec05a9e5654abe590ddd15bb53b4fab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/execpolicy/src/shell_expand.rs:1864-1873 | crates/execpolicy/src/shell_expand.rs:1880-1889 \u2014 both copies are in the same file, so extract the block 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/execpolicy/src/shell_expand.rs"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b2efdbed415e02c1ac96d2a5383658d229130252237fb99eb7dd11f6fe7af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/plugins/src/marketplace/parsers/codex.rs:100-109 | crates/plugins/src/marketplace/parsers/dsh.rs:147-156 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/codex.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/dsh.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/codex.rs:100\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/codex.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35f69fae273a08eb1cfcd5298f717ec71c130b3f033eb860f026794163d70ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/plugins/src/matcher.rs:151-159 | crates/skill-install/src/recommend.rs:211-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/matcher.rs:151\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/matcher.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58fb5c6e575c7bba2ef45826fcee9588cd20d58c3d153e06766311561a80ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/plugins/src/registry.rs:1038-1047 | crates/plugins/src/registry.rs:1177-1186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/registry.rs:1038\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"7439c92a0bddacbd35c66ad374bfdeb80a947b72e526755382711100d0c5b279"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/runtime/src/hashing.rs:43-51 | crates/tui/src/commands/groups/session/structcopy.rs:945-954 \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/runtime/src/hashing.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b98ce8f60e1041721ca85e5f08a3b0225e2e555e09a4d6731cab9c452a2b9d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/state/src/lib.rs:1320-1329 | crates/state/src/lib.rs:1349-1358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/state/src/lib.rs:1320\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/state/src/lib.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5bc9f91b401de1e5c1db7473643c13e61fd8673f8800c1d205b2bc9cb3ff0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/commands/config_main_host.rs:1855-1864 | crates/tui/src/commands/config_main_host.rs:1883-1892 \u2014 both copies are in the same file, so extract the block 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/tui/src/commands/config_main_host.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"906f1984d58359bc6da9a25ffcc18cf3094081d5c02632b270d34851a67c133d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 2): crates/tui/src/commands/config_main_import_host.rs:113-122 | crates/tui/src/commands/config_main_import_host.rs:134-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/config_main_import_host.rs:113\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_main_import_host.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"923970c168bf90394589a1a20760ef53bfa94c13f7c76b185112c933845e3980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/commands/contract.rs:1303-1313 | crates/tui/src/commands/contract.rs:1493-1503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:1303\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a968323145c08f894a2a37f040325350c9a8650504ca57eb6fe76dbc5272be50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/commands/contract.rs:3394-3403 | crates/tui/src/commands/contract.rs:3636-3645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":3394}}}],"partialFingerprints":{"codehealthFindingId/v1":"998e92f00ddc357529e0454f799e10c784c3cb504377dd9da08c90d6bc7060b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/commands/contract.rs:4573-4582 | crates/tui/src/commands/contract.rs:4609-4618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:4573\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":4573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2467d4f4216a9032d83a68f3d31942d2c45ed5ac37b3852d8aa8ece665ad59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/tui/app/composer.rs:1124-1133 | crates/tui/src/tui/app/composer.rs:1153-1162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/app/composer.rs:1124\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/composer.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"01418462ee2d9e9f8e89ee02c62cfeac6336660a704d7a638208c2823974f798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/tui/context_inspector.rs:919-928 | crates/tui/src/tui/context_menu.rs:430-439 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/context_inspector.rs:919\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/context_inspector.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc64da33bb57726f9db7a5a843ef24a85a430d225493b993be143d3bc1a6262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/tui/src/tui/external_editor.rs:88-97 | crates/tui/src/tui/external_editor.rs:171-179 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/external_editor.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0939861e05aab43c26460b1dad87cd8db2ea0cab99aa4e2917cc7d4871a55bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/tui/setup/fleet_draft.rs:273-282 | crates/tui/src/tui/setup/model_draft.rs:177-186 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/fleet_draft.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"6268002e7659783c1ee4bcd422656d9558deaca6745d94ae2667ca13700d3bc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/tui/ui/apply.rs:3967-3976 | crates/tui/src/tui/ui/apply.rs:4083-4092 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":3967}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a3d99014e7780eaa0003e9df0ebcef4c627893f1efca7013a1aa113de41b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/tui/src/tui/ui/apply.rs:4006-4013 | crates/tui/src/tui/ui/apply.rs:4109-4118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/apply.rs:4006\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":4006}}}],"partialFingerprints":{"codehealthFindingId/v1":"c630b56081de3e19f3af0368610abe6fac25429237e3e231a5d36f1037a938f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:2937-2946 | crates/tui/src/tui/ui/event_loop.rs:3056-3065 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:2937\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c35b326799fa9ce3e7d492c4f2d281ad9b2f2a69756caf1bd397cdf3528d64d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/tui/ui/remote_control_bridge.rs:181-190 | crates/tui/src/tui/ui/remote_control_bridge.rs:343-355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/remote_control_bridge.rs:343\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/remote_control_bridge.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf118b5e6b8bf4b440c69fc539cad2ca3336c018269abd3b91a214e997ffed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/tui/ui/session_state.rs:646-656 | crates/tui/src/tui/ui/session_state.rs:735-744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note what the matched lines are: every one of them assigns one field to another, so the block is a hand-written mapper between two data shapes rather than behaviour with a helper inside it. Extracting one shared function only works if both sites map the SAME pair of types in the same direction \u2014 check that first, because inverse or differently-typed mappers have no single function they can both call. Where they do not, the moves that exist are a generated or reflective mapper, a common embedded/base type the fields live on once, or accepting the run and covering it with a test that fails when a field is added to one side only. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tui/src/tui/ui/session_state.rs:641\u0060 calls \u0060persist_recovery_snapshot\u0060, \u0060cancel_in_flight_dispatch\u0060 and \u0060crates/tui/src/tui/ui/session_state.rs:734\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/session_state.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"8735b71f8a802274cca1d000fe9ea24f5448d56dbbe6dd710a7c94689dbebe2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/tui/user_input.rs:377-386 | crates/tui/src/tui/user_input.rs:423-432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/user_input.rs:377\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/user_input.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf26eafa60b0e30b4655a34048d791059e40d37238c6b9b3e3ab683952cb5aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 11): crates/tui/src/tui/hotbar/setup.rs:946-954 | crates/tui/src/tui/provider_picker.rs:3741-3748 | crates/tui/src/tui/provider_picker.rs:3771-3778 | crates/tui/src/tui/provider_picker.rs:3995-4002 | crates/tui/src/tui/provider_picker.rs:4095-4102 | crates/tui/src/tui/provider_picker.rs:4179-4186 | crates/tui/src/tui/provider_picker.rs:4219-4227 | crates/tui/src/tui/provider_picker.rs:4337-4344 | crates/tui/src/tui/provider_picker.rs:4376-4383 | crates/tui/src/tui/provider_picker.rs:4484-4492 | crates/tui/src/tui/provider_picker.rs:4555-4563 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/hotbar/setup.rs\u0060 and \u0060crates/tui/src/tui/provider_picker.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/hotbar/setup.rs:946\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/tui/src/tui/provider_picker.rs:3781\u0060 calls \u0060tr\u0060 and \u0060crates/tui/src/tui/provider_picker.rs:3751\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/setup.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"312f0adda247ee901277492a00d2252f4373e5290a6e2b5c2b7820ee6390f730"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/app-server/src/remote_control.rs:3378-3386 | crates/engine/src/compaction.rs:2283-2291 | crates/engine/src/compaction/last_round.rs:413-421 | crates/engine/src/superfast.rs:259-267 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":3378}}}],"partialFingerprints":{"codehealthFindingId/v1":"a844cb6f4f72216174d7e203106bb3f319c2c742a988eb3769ec4a7ecddebdcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/engine/src/core/engine/turn_loop.rs:2861-2869 | crates/engine/src/core/engine/turn_loop.rs:2900-2908 | crates/engine/src/core/engine/turn_loop.rs:2949-2957 | crates/engine/src/core/engine/turn_loop.rs:2971-2979 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/turn_loop.rs:2861\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a7b847e4752a3bb30cb2e043cffa946d8b462383b3c800805b90bf848260e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): crates/engine/src/tools/git.rs:115-123 | crates/engine/src/tools/git.rs:220-228 | crates/engine/src/tools/git_history.rs:113-120 | crates/engine/src/tools/git_history.rs:230-237 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/git.rs\u0060 and \u0060crates/engine/src/tools/git_history.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/git.rs:115\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/tools/git_history.rs:229\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060crates/engine/src/tools/git.rs:219\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03de4fd6f429787bcb0918be5f29cd8e1e5f28c59f14b8f7b6f216b14a84d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/engine/src/client.rs:4021-4029 | crates/engine/src/client.rs:4625-4633 | crates/engine/src/client.rs:7141-7149 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client.rs:4021\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":4021}}}],"partialFingerprints":{"codehealthFindingId/v1":"720ecf4096ff7a11b6e62f4cd3ba3f65da1de3dadf204207701b2d7812a8e736"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/engine/src/compaction.rs:454-462 | crates/engine/src/prompts.rs:1638-1646 | crates/engine/src/rlm/session.rs:301-309 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6159918d58a53883d9d6dbb9ac6cf89763889b8085d67907fb26243af030ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/engine/src/core/engine/turn_loop.rs:681-689 | crates/engine/src/model_routing.rs:1356-1364 | crates/engine/src/tools/subagent/mod.rs:1240-1248 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060usage\u0060 to \u0060\u0026Usage\u0060 in one and \u0060\u0026codewhale_models::Usage\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b4f7faec6b18a1b2fa28149cc712cdde3b84453c867843209e5e81dbb9cc0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/engine/src/tools/shell.rs:6588-6596 | crates/engine/src/tools/shell.rs:6872-6880 | crates/engine/src/tools/shell.rs:7524-7532 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/shell.rs:6588\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":6588}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14e53b0fb7ec537b9686e5603e2bcbcda4ee7f2660ec7d53bff308902078352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/tui/src/tui/ui/apply.rs:1181-1189 | crates/tui/src/tui/ui/provider_routes.rs:927-935 | crates/tui/src/tui/ui/session_state.rs:1156-1164 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/ui/apply.rs\u0060 and \u0060crates/tui/src/tui/ui/provider_routes.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/apply.rs:1181\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tui/src/tui/ui/provider_routes.rs:925\u0060 calls \u0060spawn_active_provider_catalog_refresh\u0060 and \u0060crates/tui/src/tui/ui/apply.rs:1179\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9c1223e30ea9ee5c702cf316e81aaba3e974fc235b43ce2332bf4d63aa5e83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/tui/src/tui/ui/apply.rs:1934-1942 | crates/tui/src/tui/ui/apply.rs:3322-3330 | crates/tui/src/tui/ui/provider_routes.rs:20-28 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/ui/apply.rs\u0060 and \u0060crates/tui/src/tui/ui/provider_routes.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ca8aa281617d764b9058acfd44bcf287220290c9ce7f6c240199f64a290d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/app-server/src/runtime_api.rs:4512-4520 | crates/app-server/src/runtime_api.rs:7301-7308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:4512\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":4512}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1f78fa17e978c2d834b3e68d5ee89df1d1f4ec730d6a9cd8c2bba979b45703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app-server/src/runtime_api.rs:5182-5190 | crates/app-server/src/runtime_api.rs:5202-5210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:5182\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f804697427e8cf38f62497e16a08d1ce232615020a5ed2f4099018a3e3c820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app-server/src/runtime_api.rs:12692-12700 | crates/app-server/src/runtime_api.rs:12726-12734 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/app-server/src/runtime_api.rs:12701\u0060 calls \u0060contains\u0060, \u0060runtime_chat_model_id_looks_like_host_port\u0060 and \u0060crates/app-server/src/runtime_api.rs:12735\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":12692}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad41835f7d1eb98b2b7857b8aa75974c09d6c9560b61de05495cb5598bcdea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app-server/src/runtime_api/diagnostics.rs:182-190 | crates/engine/src/session_manager.rs:893-901 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/diagnostics.rs:182\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/diagnostics.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d63cb4caf655691710213f341e59257a973a026cb2970591d0bf8b23cecd5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20139 lines \u00D7 5): crates/app-server/src/runtime_api.rs:12946-12949 | crates/app-server/src/runtime_api.rs:13025-13028 | crates/app-server/src/runtime_api.rs:13072-13075 | crates/app-server/src/runtime_api/mcp_import.rs:32-40 | crates/app-server/src/runtime_api/mcp_import.rs:79-87 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:12946\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/app-server/src/runtime_api/mcp_import.rs:32\u0060 calls \u0060spawn_blocking\u0060 and \u0060crates/app-server/src/runtime_api.rs:12946\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":12946}}}],"partialFingerprints":{"codehealthFindingId/v1":"0389715984cec7c8beb98481f8e18bf4908ddcdc2c3c25a04d02609fcedc624c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app-server/src/runtime_chat_relay.rs:460-468 | crates/app-server/src/runtime_chat_relay.rs:649-657 \u2014 both copies are in the same file, so extract the block 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/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75d05e6a97aa2a9027294cefd0ffe39a375ea00a8a01ead5ba05c48baebc218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app-server/src/stdio.rs:914-922 | crates/app-server/src/stdio.rs:925-933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/stdio.rs:914\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/stdio.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa12086e0eb895442a2880741fcba62bfe48f5d94bdc461c2c2bb0a77aa1c6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/cli/src/lib.rs:6697-6705 | crates/cli/src/lib.rs:6712-6720 \u2014 both copies are in the same file, so extract the block 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/cli/src/lib.rs"},"region":{"startLine":6697}}}],"partialFingerprints":{"codehealthFindingId/v1":"3621a8805f35c010586e29254775b0803f28bba85801ccff9311fb7715c60e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/config/src/path_io.rs:66-74 | crates/engine/src/runtime_threads.rs:5691-5699 \u2014 before extracting anything, compare \u0060crates/config/src/path_io.rs\u0060 and \u0060crates/engine/src/runtime_threads.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/path_io.rs:66\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/path_io.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8c1f1cae8c0ce0ee64eded515b09161cd385f9a386221523f22c3b2c0cf4f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/dependencies/src/lib.rs:1609-1617 | crates/dependencies/src/lib.rs:1619-1627 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dependencies/src/lib.rs"},"region":{"startLine":1609}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a53a6c0ecf5282ebcf01a0de7d9068452a6eaaa70c2984510816b08fe0b2e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/automation_manager.rs:1567-1575 | crates/engine/src/automation_manager.rs:2088-2096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/automation_manager.rs:1567\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"33734ce4f0c513784e517544eff83369010f9ace8b394725f4c4965c1fd0d804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/engine/src/client.rs:4840-4848 | crates/engine/src/client.rs:4876-4883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":4840}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5008a137d26a7c304dd9ba711abc440462adc90d7534fb176a89598995dbca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/client/chat.rs:1347-1355 | crates/engine/src/client/chat.rs:1428-1436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/chat.rs:1347\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/chat.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ce1700e3750a9e5359eb2cc36e89fc8207c6ea246ea6c50856c80775289d48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/client/provider_native_search.rs:563-571 | crates/engine/src/client/provider_native_search/kimi.rs:273-281 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/provider_native_search.rs:563\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"205c438a819feda307917e6b0fed4edfecbec77bc19f1b251b370bed4d43b92c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/client/provider_native_search/kimi.rs:67-75 | crates/engine/src/client/provider_native_search/kimi.rs:145-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/client/provider_native_search/kimi.rs:154\u0060 calls \u0060api_url\u0060 and \u0060crates/engine/src/client/provider_native_search/kimi.rs:77\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search/kimi.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e0de723dfca46d68b4559ed66eb01238fb4255a980deb0ccf237495a7ad6c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/extension_host/registry.rs:1275-1283 | crates/engine/src/extension_host/registry.rs:1418-1426 \u2014 both copies are in the same file, so extract the block 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/engine/src/extension_host/registry.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd78db387a34e97499f5cdb162f79a7affc13657f4e59289decd0f0c2b68e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/engine/src/fleet/acp.rs:409-417 | crates/runtime/src/oauth.rs:3293-3300 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/acp.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"be72425c4a69b3ed9caf5f2353522ee3f22f02ed66d9697645f1fe2323dfc760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/hooks/executor.rs:2739-2747 | crates/engine/src/hooks/executor.rs:2760-2768 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/hooks/executor.rs:2739\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"928d52dd19b9cbb78a69d3a931122e83851cb5e4d9140f8416747f9abd94acb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/model_routing.rs:1014-1022 | crates/engine/src/model_routing.rs:1041-1050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/model_routing.rs:1014\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_routing.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71cdd7f82d7f1c097198e2144fefb8ddcf2348385cd475a8fd1377ccf259f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/runtime_threads.rs:2160-2168 | crates/engine/src/runtime_threads.rs:2309-2317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads.rs:2160\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":2160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0d4d8f30814f381656313299258d77ec4dfb480d8adc88194e5ec389b7dc16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/runtime_threads.rs:2239-2247 | crates/engine/src/runtime_threads.rs:2368-2376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads.rs:2239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":2239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b264d7ef35a311be21c5584117847469c2c0d7e151eb6681971d095f72db89cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/runtime_threads/job_operations.rs:211-219 | crates/engine/src/runtime_threads/job_operations.rs:390-398 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/job_operations.rs:211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/job_operations.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae623e881e17e1b874d3f32bdcadd5eb8b09081529f0ec359f0840c5e323a7b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:479-487 | crates/tui/src/tui/tool_routing.rs:733-741 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:479\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5ec91880be87aca2ccce217afc3789b0a1aeb970ef5a196159e7ee0c0e6bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:14739-14747 | crates/engine/src/runtime_threads/manager.rs:14797-14805 \u2014 both copies are in the same file, so extract the block 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":14739}}}],"partialFingerprints":{"codehealthFindingId/v1":"4814d536e74d1f770843730c67862598b64deb3cd216dea6274a080c2adf92f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:14985-14993 | crates/engine/src/runtime_threads/manager/external_agent.rs:1053-1061 \u2014 before extracting anything, compare \u0060crates/engine/src/runtime_threads/manager.rs\u0060 and \u0060crates/engine/src/runtime_threads/manager/external_agent.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":14985}}}],"partialFingerprints":{"codehealthFindingId/v1":"d756c8b56989db057d0b1ccceac0de8b98bb8a3f3973cdd66bb9c52bc765f0e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:18304-18312 | crates/engine/src/runtime_threads/manager.rs:18343-18351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:18304\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":18304}}}],"partialFingerprints":{"codehealthFindingId/v1":"677fba07ea9c84cb9bada2c9453e45db8d1f71b665fc45fff13ba190aa473c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/tools/apply_patch.rs:607-615 | crates/tools/src/patch_preflight.rs:268-276 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/apply_patch.rs:607\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/apply_patch.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f31b5c1fa26f0acc4b04d0cbe94130ca556c00b699df7675518541188e2ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/tools/file.rs:1248-1256 | crates/engine/src/tools/file.rs:1353-1361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/file.rs:1248\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c483d4f9673d68c7f0539c2da40babae0c487f8c03b323610b4e0c64a787f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/tools/git.rs:126-134 | crates/engine/src/tools/git.rs:231-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/git.rs:126\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8c5b8e3a23fbd200359c92e450dc54792ba5037a08335c9a2e8a37cd7b0f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/tools/github/shape.rs:53-61 | crates/engine/src/tools/tasks.rs:1174-1182 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/github/shape.rs\u0060 and \u0060crates/engine/src/tools/tasks.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/github/shape.rs:53\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/shape.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02986df189e0e44008f7545d57e5047973ac98b4c8a03a8a6d56c0af15b7c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/tools/review.rs:2019-2027 | crates/engine/src/tools/verify.rs:761-769 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/review.rs:2019\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"d945522f43cdfea076ab41e5543dfa47e7eb0234a33587915a216191de3ba79b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/tools/shell.rs:7330-7338 | crates/engine/src/tools/shell.rs:7669-7677 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/shell.rs"},"region":{"startLine":7330}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37f3450725218c7aadd27ba4418f5ba348b0052211a28ebcdc8dad7387a9ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:5543-5553 | crates/engine/src/tools/subagent/mod.rs:5633-5643 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/mod.rs:5543\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":5543}}}],"partialFingerprints":{"codehealthFindingId/v1":"4923ce018e680665ab298a38f7efb29bf8d09231b79f4bdc7170a720a0d6b28e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/tools/web_search.rs:1188-1196 | crates/engine/src/tools/web_search.rs:1351-1361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:1188\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"110c8bd30b90840c17fde922211313a4fd4b94e53e7517714ab2b77fbc04f4b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/engine/src/tools/workflow/mod.rs:2910-2917 | crates/engine/src/tools/workflow/mod.rs:2940-2948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/workflow/mod.rs:2910\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2910}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd8d0ba8978b5dc18e4730a9fc0310e9ed3220e5dde2ebc05c7e294ec7869ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/work_graph/runtime.rs:469-477 | crates/engine/src/work_graph/runtime.rs:497-505 \u2014 both copies are in the same file, so extract the block 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/engine/src/work_graph/runtime.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9b596eaf4296b7204ed107d2daf7f2bb8c3b010e30c078bb9c0ea9b0e448f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/lane/src/runtime.rs:260-268 | crates/lane/src/runtime.rs:393-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lane/src/runtime.rs:260\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/runtime.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8247db4918f19d90fb80a731be7b1662d9d5770eafcab62ae9d1d345e3fc55c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/sanitize/src/redact.rs:1337-1345 | crates/workflow/src/redaction.rs:646-654 \u2014 before extracting anything, compare \u0060crates/sanitize/src/redact.rs\u0060 and \u0060crates/workflow/src/redaction.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sanitize/src/redact.rs:1337\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7ccb0bcd5c4dd8766a714b4c8435a666f1612191d66f0d8a95a647abff48e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/skills/src/audit.rs:229-237 | crates/skills/src/audit.rs:300-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/skills/src/audit.rs:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/audit.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"519cab46e4d790c8743237d5d5a1635df77e5fe830c605e3bfe3af29683abfc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/skills/src/lib.rs:1719-1727 | crates/tui/src/commands/groups/session/structcopy.rs:421-428 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/skills/src/lib.rs:1719\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/lib.rs"},"region":{"startLine":1719}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eb5c142ddb2e4ae187df148f405ad6a2916399f280372daaa73439a7570ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/skills/src/mutation.rs:1622-1630 | crates/skills/src/mutation.rs:1767-1774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/skills/src/mutation.rs:1621\u0060 calls \u0060ensure_remote_updatable\u0060 and \u0060crates/skills/src/mutation.rs:1766\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/mutation.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05cffb7a30d67ef7e4056045f3b5d0362e122f10bac14daceae43abe9b35c93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/telemetry/src/actor.rs:224-232 | crates/telemetry/src/actor.rs:250-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/telemetry/src/actor.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d24ef13c5fc9e734b3a8edafb23c957745161bcabdc24132d950ed81682cca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui-kit/src/markdown_render.rs:974-982 | crates/tui-kit/src/markdown_render.rs:1333-1341 \u2014 both copies are in the same file, so extract the block 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/tui-kit/src/markdown_render.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96b244ca46554b146c5895245bf0960d50115095c3ebc48ce540b57efc05c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/commands/contract.rs:3020-3028 | crates/tui/src/tui/ui/handlers.rs:1449-1457 \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/tui/src/commands/contract.rs"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eec3642e40f51b74709c8e800905435df16e7af9a97823d47c3abcc154846df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/commands/groups/core/core.rs:188-196 | crates/tui/src/commands/groups/core/core.rs:301-309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/core.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3618297f9b80db97314352fc41959dbad42d1bb0a414f451fbf087cf80f2179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/tui/src/tui/history/message.rs:163-170 | crates/tui/src/tui/history/message.rs:242-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/history/message.rs:242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/message.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"75358993388e5c6b53a331e7a5b8b20fdd816d794bf5c40052b8972b2bddbb34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/tui/live_transcript.rs:543-551 | crates/tui/src/tui/pager.rs:1296-1304 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/live_transcript.rs:543\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/live_transcript.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"307937e1809d5c59972f5a701302a5796bbdbe7eb08cdfe544a01ed650a0d76f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/tui/live_transcript.rs:591-599 | crates/tui/src/tui/pager.rs:1349-1359 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/live_transcript.rs:591\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/live_transcript.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"b357f98374489deee723f0efa83769e562127e8087162b169dad5ef722060023"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/tui/setup/tools_mcp.rs:275-283 | crates/tui/src/tui/setup/tools_mcp.rs:363-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/setup/tools_mcp.rs:275\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/tools_mcp.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"1345a59dfa8519ae171764835837b913b32874bfe4bfea58a7b5bf07507466a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/tui/views/fleet_detail.rs:1139-1147 | crates/tui/src/tui/views/fleet_roster.rs:631-639 \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/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff753e5ce3ba52cbf051fa929c2d6645682bf79699c209beb336767363d5f89e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/tui/work_surface/model.rs:1881-1889 | crates/tui/src/tui/work_surface/model.rs:2044-2052 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/work_surface/model.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fc4b57e99eb897adb28a14716e21f331e0ea8da61894ac865787ab5cffce7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/tui/src/tui/work_surface/model.rs:1925-1933 | crates/tui/src/tui/work_surface/model.rs:1995-2002 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/work_surface/model.rs:1925\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/model.rs"},"region":{"startLine":1925}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e8b253c962fbdaac5ab4a99f66e27abbb79f9a2f9c3169b7efeaaa1c6ddde5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 16): crates/tui/src/tui/hotbar/setup.rs:942-949 | crates/tui/src/tui/provider_picker.rs:3127-3134 | crates/tui/src/tui/provider_picker.rs:3699-3706 | crates/tui/src/tui/provider_picker.rs:3737-3744 | crates/tui/src/tui/provider_picker.rs:3767-3774 | crates/tui/src/tui/provider_picker.rs:3821-3828 | crates/tui/src/tui/provider_picker.rs:3991-3998 | crates/tui/src/tui/provider_picker.rs:4091-4098 | crates/tui/src/tui/provider_picker.rs:4175-4182 | crates/tui/src/tui/provider_picker.rs:4215-4222 | crates/tui/src/tui/provider_picker.rs:4333-4340 | crates/tui/src/tui/provider_picker.rs:4372-4379 | crates/tui/src/tui/provider_picker.rs:4480-4487 | crates/tui/src/tui/provider_picker.rs:4551-4558 | crates/tui/src/tui/views/skills_manager.rs:367-374 | crates/tui/src/tui/views/skills_manager.rs:418-425 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/hotbar/setup.rs\u0060 and \u0060crates/tui/src/tui/provider_picker.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 37 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/hotbar/setup.rs:942\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/setup.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b18bf2b1258ca3a1da8b38f26925affd59bdd9b6b5c701deca355f9cf89179a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/engine/src/automation_manager.rs:1922-1929 | crates/engine/src/runtime_threads.rs:3432-3439 | crates/engine/src/runtime_threads.rs:3478-3485 | crates/engine/src/runtime_threads.rs:3519-3526 | crates/engine/src/runtime_threads.rs:3678-3685 | crates/engine/src/runtime_threads.rs:3929-3936 \u2014 there are 6 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/automation_manager.rs:1922\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bdc293191dd03f25af5c3d79d7349a09d70852ab42581c8f2fef0ee88ad476"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/app-server/src/runtime_api/diagnostics.rs:180-187 | crates/cloud-facts/src/lib.rs:312-319 | crates/engine/src/provider_catalog_live.rs:789-796 | crates/engine/src/session_manager.rs:891-898 | crates/plugins/src/registry.rs:1745-1753 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/diagnostics.rs:180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/diagnostics.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3379bfedfa90be379bcc3faa589e9bd0dabbc71610729591f2f13998c1d03f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/plugins/src/marketplace/parsers/claude.rs:106-113 | crates/plugins/src/marketplace/parsers/claude.rs:287-294 | crates/plugins/src/marketplace/parsers/codewhale.rs:86-93 | crates/plugins/src/marketplace/parsers/codewhale.rs:258-265 | crates/plugins/src/marketplace/parsers/kimi.rs:194-201 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codewhale.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f7b1599690cfca5686cda97b33b0c66ba69e9cc46b6102c340d09a9345ee9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): crates/config/src/private_directory.rs:1756-1762 | crates/config/src/private_directory.rs:1885-1891 | crates/engine/src/tools/github/report.rs:1285-1291 | crates/runtime/src/external_credentials.rs:468-475 \u2014 before extracting anything, compare \u0060crates/config/src/private_directory.rs\u0060 and \u0060crates/engine/src/tools/github/report.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/private_directory.rs:1756\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b7d9a17a509b54f29de81f545de2ca13209fbc49426c7fdaf355add038f13f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/engine/src/core/engine/context.rs:91-98 | crates/engine/src/purge.rs:267-274 | crates/engine/src/rlm/session.rs:404-411 | crates/notify/src/payload.rs:272-279 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/context.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7471a1feedee5af77127d6f267dffee7ac198aaef3a7cb9552abed30c33e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/engine/src/tools/git.rs:127-134 | crates/engine/src/tools/git.rs:232-239 | crates/engine/src/tools/git_history.rs:243-251 | crates/engine/src/tools/git_history.rs:378-386 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/git.rs\u0060 and \u0060crates/engine/src/tools/git_history.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/git.rs:127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"f196a02bf71a00bc60430b49df1cf0a7ff0cdb1f70e7cc67057c8a2b8c9b6f92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/tui/src/tui/account_login.rs:694-701 | crates/tui/src/tui/feedback_picker.rs:145-154 | crates/tui/src/tui/live_transcript.rs:666-676 | crates/tui/src/tui/views/mode_picker.rs:150-159 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/feedback_picker.rs\u0060 and \u0060crates/tui/src/tui/live_transcript.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/account_login.rs:694\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/account_login.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b799b997e9c4405e492c8c391a52248a2b4c5c0752f59c338e577e23add1abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/engine/src/provider_readiness.rs:305-312 | crates/engine/src/provider_readiness.rs:438-445 | crates/tui/src/tui/provider_picker.rs:1679-1686 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/provider_readiness.rs:305\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_readiness.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b253086254605750769e5c9599121db3ae542ce78670f83a194ac399692d1c85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/engine/src/runtime_threads/manager.rs:17731-17738 | crates/engine/src/runtime_threads/manager.rs:17754-17761 | crates/engine/src/runtime_threads/manager.rs:17772-17779 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:17731\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":17731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d448e11bec73a970572e6fcc65dc78c49eaf077d0adf0d79675fd5365622bb4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/runtime/src/session_diagnostics.rs:381-388 | crates/runtime/src/session_diagnostics.rs:413-420 | crates/runtime/src/session_diagnostics.rs:445-452 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/session_diagnostics.rs:381\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/session_diagnostics.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca8f98b40fe52aff81bbebf9ddea0840810a958f73c154bcd9f724f08031e46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/tui/src/tui/provider_picker.rs:3123-3130 | crates/tui/src/tui/provider_picker.rs:4547-4554 | crates/tui/src/tui/views/router_setup.rs:714-721 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":3123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57c7eee19761e164e8545c112424f6e6d571be287c8d808f8aa1c9878ba5b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/tui/src/tui/views/fleet_detail.rs:975-982 | crates/tui/src/tui/views/fleet_list.rs:387-395 | crates/tui/src/tui/views/fleet_roster.rs:469-480 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/views/fleet_detail.rs:975\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"72013200b10a812b932cf6be6859a54edf173b980e76c28d01dbe39ebc5a0433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/app-server-protocol/src/v2.rs:4223-4230 | crates/app-server-protocol/src/v2.rs:4505-4512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/v2.rs"},"region":{"startLine":4223}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c7680cb8448826c61da9e5f6dc6cab9cb04c86dd342b48bcd931735f479cc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/app-server/src/acp_server.rs:341-348 | crates/app-server/src/acp_server.rs:451-458 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/acp_server.rs:341\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/acp_server.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edfca588a77e356a4c8a348b0a326d22b6c133daae43bfb905129e8a4ae7e17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/app-server/src/runtime_api/diagnostics.rs:108-115 | crates/app-server/src/runtime_api/diagnostics.rs:280-287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/diagnostics.rs:108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/diagnostics.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27534c01e6ebe11cc43d0c4627dbe078cca836900029e0cb9a4307de5c3096a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/app-server/src/runtime_api/jobs.rs:953-960 | crates/app-server/src/runtime_api/jobs.rs:1258-1265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/jobs.rs:953\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/jobs.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"b839194577142a04b209427ef4aec6e7281eb41d637dee5e8651feb052a107ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/commands/src/debug/change.rs:190-197 | crates/commands/src/debug/change.rs:259-266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/commands/src/debug/change.rs:190\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/change.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1e36aca2fe0d85a7456fda2198ac2a835abd2b07b9db429b61f1b6c015c414"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/config/src/private_directory.rs:1915-1922 | crates/engine/src/tools/github/report.rs:1314-1321 \u2014 before extracting anything, compare \u0060crates/config/src/private_directory.rs\u0060 and \u0060crates/engine/src/tools/github/report.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/private_directory.rs:1915\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"55790f935e4352d4366998d8c4290acb8ec761ed9b911686184ab29d4f76e20f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/automation_manager.rs:3795-3803 | crates/engine/src/task_manager.rs:4253-4261 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3795}}}],"partialFingerprints":{"codehealthFindingId/v1":"308a49fc0c40a51e11d246399fa815eb75e02e63045c0892fc22dc39e2963e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/core/engine/compaction.rs:641-648 | crates/engine/src/core/engine/compaction.rs:954-961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/compaction.rs:641\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/compaction.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae84dd7d7d00c2e1fa8c27c8e42d0df342a92163bc3d510e6656bc94420926f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/core/engine/tool_catalog.rs:983-990 | crates/engine/src/core/engine/tool_catalog.rs:1050-1057 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_catalog.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"081b58481acb4dbde89be629b4800430475bf6eafa6bd012a0d8e069d99e6aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/extension_host/dsh_terminal.rs:367-374 | crates/engine/src/extension_host/dsh_workspace.rs:403-410 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/dsh_terminal.rs:367\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_terminal.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2260a08ea8daba4a363e247e28ebcc8310a38fa3192ec56cd2c14dbc788a2e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/engine/src/extension_host/windows.rs:1372-1378 | crates/engine/src/extension_host/windows.rs:1487-1494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/windows.rs:1372\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe5b6266bad5c2c459ab4d6f9e49c9cf95f2ed24728af743e50129b096d4c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/fleet/profile.rs:856-863 | crates/engine/src/fleet/profile.rs:885-892 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/profile.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6666be9eca337a886ba5f62591017f80005aa73a316bd4489f67a6f1ee43ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/engine/src/hooks/executor.rs:1495-1502 | crates/engine/src/hooks/executor.rs:2603-2609 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/hooks/executor.rs:1495\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"0211097dbb122d78aa98be8f26e738ce3ef52b877f196758b30ba611d7692e69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/provider_catalog_live.rs:1190-1197 | crates/engine/src/provider_catalog_live.rs:1248-1255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/provider_catalog_live.rs:1190\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"f007957b7ca675370b59f5536cb0a78ff67a017752cacf8a526fcca6c68f6e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:6237-6245 | crates/engine/src/runtime_threads/manager.rs:6315-6323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:6237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd20974f2c1ee421751e73973ba9b882f5681b91db46752c4a06dc5b517facb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:9567-9574 | crates/engine/src/runtime_threads/manager.rs:16597-16604 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:9567\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":9567}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5c0a5175bbe30cc8e7242e08ad0ff9c2cbc956501f66022a0d3111da1c2329d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:9737-9744 | crates/engine/src/runtime_threads/manager.rs:9775-9782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:9737\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":9737}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7dd94ef4b6a76b61e8ce6120eeb51f29d637aaf18c19d51efebf16ded2a2bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:9810-9817 | crates/engine/src/runtime_threads/manager.rs:9939-9946 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:9810\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":9810}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab608056561c08ba718b7492aa5ba140c1667883b8cd3d553cefa514bf3b05f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:10985-10992 | crates/engine/src/runtime_threads/manager.rs:11014-11021 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:10985\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":10985}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc16288288796d29c395dd54e052cb5cd22ffbd167b65dc84f5154a6b502baf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/automation.rs:306-313 | crates/engine/src/tools/tasks.rs:386-393 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/automation.rs\u0060 and \u0060crates/engine/src/tools/tasks.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/automation.rs:306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3480bb56f34c356eaa68ee06246e48b1ad449c1865e1d46deabd417b822d00b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/engine/src/tools/github/report.rs:513-520 | crates/util/src/files.rs:220-226 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/github/report.rs:513\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/report.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93075f01da0d095be06836f65d2305e8f60ea8813e7f9815bc3bf240a02e74c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/github/report.rs:1353-1360 | crates/runtime/src/external_credentials.rs:546-553 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/github/report.rs\u0060 and \u0060crates/runtime/src/external_credentials.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/github/report.rs:1353\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/report.rs"},"region":{"startLine":1353}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2a7b3637756780439cf2170adac06d690e603ff15b6db5f6c42be6cc462a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/read_media.rs:934-941 | crates/engine/src/tools/read_media.rs:963-970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/read_media.rs:934\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/read_media.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"7320cd515d8e1032556e9c30da831308def4b85e66eefe1f362e20bb1d8cf19b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/review.rs:1648-1655 | crates/tui/src/lib.rs:11575-11582 \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/engine/src/tools/review.rs"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"20d0056b0c2bf2fb75773b84457b7229c8d4111ccab345d89bed63a12cbc0839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/subagent/coord.rs:791-798 | crates/engine/src/tools/subagent/coord.rs:962-969 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/subagent/coord.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"040b3b27a263ee3a62a57e43b50cad2c52150930f42245cfee954584d49c72ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:10122-10129 | crates/engine/src/tools/subagent/mod.rs:10260-10267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/tools/subagent/mod.rs:10121\u0060 calls \u0060Err\u0060, \u0060persist_state_synchronously\u0060 and \u0060crates/engine/src/tools/subagent/mod.rs:10259\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":10122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4686dfe465f8da0765efc018b821332a50e57ee32ccb0cc9929126eb808fd23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/workflow/mod.rs:4639-4646 | crates/engine/src/tools/workflow/mod.rs:5203-5210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/workflow/mod.rs:4639\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":4639}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd82fb1831c779d0f04d88bd9c1162ab75a937a3ec447b83179063a4aaccfb55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/models/src/schema_sanitize.rs:1814-1821 | crates/models/src/schema_sanitize.rs:1894-1901 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/models/src/schema_sanitize.rs:1814\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/schema_sanitize.rs"},"region":{"startLine":1814}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a67312d2c1dddff3cb9d6f3f6f8e38528b99d114c69a7483c8c696316fcf47b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/plugins/src/install/dsh.rs:2949-2955 | crates/plugins/src/manifest.rs:1284-1291 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/install/dsh.rs:2949\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/plugins/src/install/dsh.rs:2948\u0060 calls \u0060refusal_text\u0060, \u0060host_str\u0060, \u0060unwrap_or_default\u0060 and \u0060crates/plugins/src/manifest.rs:1283\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":2949}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c35391921e68a4aba6d5d6133c759991fa7184d7f5fe59354e4bf0fa4b0bea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/plugins/src/manifest.rs:1662-1669 | crates/plugins/src/manifest.rs:1676-1683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/manifest.rs:1662\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":1662}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a39f701ff427bf581c9f98c2c4557ddde856905fec813408184ebc59068619"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:517-524 | crates/plugins/src/marketplace/parsers/codex.rs:334-343 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codex.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:517\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb062854a9f819c229605b34020190ef6490d782af14446c0f3cae20ff8ce585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/plugins/src/registry.rs:1317-1324 | crates/plugins/src/registry/gc.rs:847-854 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"831e0c9ca3c0b675bfb596197b6e073c1973a1858d0828e9d2dd498045e5eecb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/runtime/src/config.rs:12220-12227 | crates/runtime/src/config.rs:12294-12301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config.rs:12220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":12220}}}],"partialFingerprints":{"codehealthFindingId/v1":"036da162de561d443605ea457d1cd0090917fde514c29c099a00394e5e555408"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/runtime/src/delivery_files.rs:132-139 | crates/runtime/src/delivery_files.rs:167-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/delivery_files.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"38163ad812ea4651238e4fc61169e0c7ce3b35c1e964484227ba87ea974efc79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/runtime/src/settings.rs:2505-2512 | crates/runtime/src/settings.rs:2885-2892 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/settings.rs:2505\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbad83be1851fc974b05d2d8e410ce9905889494869d6608eb1afca8d49251e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/sanitize/src/redact.rs:1308-1315 | crates/workflow/src/redaction.rs:610-617 \u2014 before extracting anything, compare \u0060crates/sanitize/src/redact.rs\u0060 and \u0060crates/workflow/src/redaction.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sanitize/src/redact.rs:1308\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/redact.rs"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ab33cdfd736babdc06ffa473db9cf50fed68b83dc1ad2ea0d6623862898bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/commands/contract.rs:694-701 | crates/tui/src/commands/contract.rs:808-815 \u2014 both copies are in the same file, so extract the block 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/tui/src/commands/contract.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d924b94b341bd3623bac9bea4a285641bb2195b2a2790a9974127b161f3ebce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/commands/groups/core/agent.rs:48-55 | crates/tui/src/commands/groups/core/rlm.rs:33-40 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/core/agent.rs:48\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/agent.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fcacdce623844c2e2c98f9bcd7f4ffc12781500909eb654ee2d742197836bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/tui/src/commands/groups/project/init.rs:317-322 | crates/tui/src/commands/groups/project/init.rs:331-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/project/init.rs:317\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/project/init.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4864ef5739990e5bf0e52d1ec28844264d4cb52e950cffc8e8ebab17f0628c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/commands/groups/project/init.rs:422-429 | crates/tui/src/commands/groups/project/init.rs:446-453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/project/init.rs:422\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/project/init.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feb2e8726d20bbbd23499a9c62e4f18d80ee1fdcf972a28a7b5517be8833f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/tui/src/integrations/dsh/mod.rs:522-529 | crates/tui/src/integrations/dsh/mod.rs:566-572 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/integrations/dsh/mod.rs:522\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/mod.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad24f3d9b61ea099827e17db8da6c40f111683f65128f1adcd6413a63fef852"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/tui/file_mention.rs:96-103 | crates/tui/src/tui/slash_menu.rs:219-226 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/file_mention.rs:96\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74529b424bc56f5757946c3b482d46e34a9ae248ae097fe3dba5fbe4bf1b720"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/tui/history/message.rs:178-185 | crates/tui/src/tui/history/message.rs:256-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/history/message.rs:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tui/src/tui/history/message.rs:177\u0060 calls \u0060repeat\u0060 and \u0060crates/tui/src/tui/history/message.rs:255\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/message.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e7e78a13642a48a4cd07730bc8c6a39fb223cd7a31b8fba7ffc5ffd79fb1e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): crates/tui/src/tui/hotbar/actions.rs:1026-1033 | crates/tui/src/tui/ui/apply.rs:148-153 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/hotbar/actions.rs:1026\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/actions.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3fdf62f29bb34900b8063057d016c9bad34239a0883b4ffac6f9119ebc11c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/tui/onboarding/mod.rs:53-60 | crates/tui/src/tui/redaction_gate.rs:49-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/onboarding/mod.rs:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/onboarding/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e704f6468e1fb5206c0fce373efa85cfa753d08f963f0d4223264d9503d1ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/tui/ui/handlers.rs:1142-1149 | crates/tui/src/tui/ui/handlers.rs:1164-1171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/handlers.rs:1142\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b94ccb6746c371a9de195973db423962b7baf71c9d4fb68d49c598aecab48a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/tui/views/extensions.rs:538-545 | crates/tui/src/tui/views/extensions.rs:569-576 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/views/extensions.rs:538\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/extensions.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"437adcc55930a5b03a27e9a6a1afb9864ad3029148e9a5bce3a4b08073babe9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/tui/src/commands/contract.rs:4539-4545 | crates/tui/src/commands/contract.rs:4578-4584 | crates/tui/src/commands/contract.rs:4614-4620 | crates/tui/src/commands/contract.rs:4804-4810 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:4539\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tui/src/commands/contract.rs:4803\u0060 calls \u0060to_path_buf\u0060 and \u0060crates/tui/src/commands/contract.rs:4577\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":4539}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2de5fe6933053ca6223b16d65fd09306fdcc7ceee13cec6694381f10721c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/config/src/path_io.rs:66-72 | crates/engine/src/mcp.rs:8014-8020 | crates/engine/src/runtime_threads.rs:5691-5697 \u2014 before extracting anything, compare \u0060crates/config/src/path_io.rs\u0060 and \u0060crates/engine/src/runtime_threads.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/path_io.rs:66\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/path_io.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ec594d234ce87a8d8f697d994745e5e943423ec2cc2732c502f75bfa0e1e4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/engine/src/automation_manager.rs:1873-1879 | crates/engine/src/runtime_threads.rs:2239-2245 | crates/engine/src/runtime_threads.rs:2368-2374 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/automation_manager.rs:1873\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e909adfefa818c545ec3ecfc00a592593e4e0e279920755e7443a8877872b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/engine/src/extension_host/core_call.rs:1024-1030 | crates/engine/src/extension_host/core_call.rs:1117-1123 | crates/engine/src/extension_host/core_call.rs:1607-1613 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/core_call.rs:1024\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"0edf25e003c3d94f1ffd041d997c88657248876e541dac1087fc9d2b7c65f888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/engine/src/fleet/store.rs:786-792 | crates/engine/src/fleet/store.rs:817-823 | crates/engine/src/fleet/store.rs:832-838 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/store.rs:786\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/store.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"26341ce81c8a1b35bf3b7752e2a85babe5e1a09d318634c546b9c78e5b5719b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/engine/src/project_context.rs:938-944 | crates/engine/src/project_context.rs:989-995 | crates/engine/src/project_context.rs:1665-1671 \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/engine/src/project_context.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b50c74c3accb7ed0c6efe014b0b80e5a72d8e251240a0ff291d0b3e494f3f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/plugins/src/marketplace/parsers/claude.rs:292-298 | crates/plugins/src/marketplace/parsers/dsh.rs:311-317 | crates/plugins/src/marketplace/parsers/kimi.rs:199-205 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/dsh.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0a332647d8668b7ae285b55373dde13e5a91ffdd6333cf5b3fc1deb87751fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/plugins/src/marketplace/store.rs:230-236 | crates/plugins/src/registry.rs:1318-1324 | crates/plugins/src/registry/gc.rs:848-854 \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/plugins/src/marketplace/store.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3e221b6f8bae15aae5bcf31265ce94a0e8307484d5faa11d92ee1a519d5893"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/tui/src/lib.rs:7962-7968 | crates/tui/src/lib.rs:8169-8175 | crates/tui/src/lib.rs:8873-8879 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/lib.rs:7962\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":7962}}}],"partialFingerprints":{"codehealthFindingId/v1":"82963a8606e576436f15aa011b96d836100c1d1ec39de38ee2b5ecf45a342b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/tui/src/tui/ui.rs:578-584 | crates/tui/src/tui/ui/apply.rs:1187-1193 | crates/tui/src/tui/ui/provider_routes.rs:933-939 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/ui/apply.rs\u0060 and \u0060crates/tui/src/tui/ui/provider_routes.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui.rs:578\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa2c392f1808b91ac9b8e2d01d6feb8512767046624e0f16be3ba3fb357945a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/tui/src/tui/ui/apply.rs:1954-1960 | crates/tui/src/tui/ui/apply.rs:3181-3187 | crates/tui/src/tui/ui/event_loop.rs:5145-5151 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/apply.rs:1954\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":1954}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adb5fea1ea8f31598896611a342bdd365352c891634b9c2655864902d1363de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/tui/src/tui/ui/session_state.rs:1485-1491 | crates/tui/src/tui/ui/session_state.rs:1511-1517 | crates/tui/src/tui/ui/session_state.rs:1534-1540 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026mut Config\u0060 in one and \u0060\u0026Config\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/session_state.rs"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5ccb7bac161dad0469a6a6567004c548907c5425a767e06e8c7732ff6e7f7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/app-server/src/runtime_api.rs:5799-5806 | crates/engine/src/fleet/control.rs:124-131 \u2014 before extracting anything, compare \u0060crates/app-server/src/runtime_api.rs\u0060 and \u0060crates/engine/src/fleet/control.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:5799\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5799}}}],"partialFingerprints":{"codehealthFindingId/v1":"78460a195dd80abfd89199d49721c91972e1d1271a772700beb669f2baff8c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app-server/src/runtime_api.rs:7967-7973 | crates/app-server/src/runtime_api.rs:7997-8003 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:7967\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":7967}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c64c8a60a304ff2721ac7e0463103d73ccbc3294aa66f34e8a8b87d2a76e09c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app-server/src/runtime_api/mobile.rs:264-270 | crates/app-server/src/runtime_api/web.rs:291-297 \u2014 before extracting anything, compare \u0060crates/app-server/src/runtime_api/mobile.rs\u0060 and \u0060crates/app-server/src/runtime_api/web.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/mobile.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"452572acdf3a63d4c32a5f06ac0db3a0a229736ecee2e24f49b5a5bf68978d63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app-server/src/runtime_api/thread_history.rs:324-331 | crates/app-server/src/runtime_api/thread_history.rs:1035-1041 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/thread_history.rs:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3830e3755549b626b920ed6f4d3324536ac7d131699d72039e7a8fb6194546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/commands/src/debug/tokens.rs:159-165 | crates/commands/src/debug/tokens.rs:211-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/tokens.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9b7b47ac8749877a67c83043b730d80a78f57469274bc5daa6a0c535af64e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/config/src/base_url_resolution.rs:70-76 | crates/runtime/src/config.rs:9300-9306 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/base_url_resolution.rs:70\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2124cca693924357211eac2f2db8b88c58455bc469ce1ef9461825c3788ba6dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/config/src/windows_identity.rs:29-35 | crates/engine/src/tools/github/report.rs:1361-1368 \u2014 before extracting anything, compare \u0060crates/config/src/windows_identity.rs\u0060 and \u0060crates/engine/src/tools/github/report.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/windows_identity.rs:29\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/windows_identity.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0f17e1ee351a64747a86df5b817091ad50c03647fba098784e6d56cbfa8632"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/core/src/fragments.rs:335-341 | crates/core/src/fragments.rs:349-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/fragments.rs:335\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fragments.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ef46962f165e613c635851ebd59314d719cc779faba5da9b633a6aff6f6db6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/client/anthropic.rs:923-929 | crates/engine/src/client/responses.rs:932-938 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/anthropic.rs:923\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4677e3aebc747bf4354bc1691d2d2b6d88e483345942ad988814c3e6e84f49c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/extension_host/mcp.rs:355-361 | crates/engine/src/extension_host/mcp.rs:474-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/mcp.rs:355\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7adee60f41753bd70994f3e69b0d3f945491873993be98ec2fa08e8f6560b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/fleet/manager.rs:1466-1472 | crates/engine/src/fleet/manager.rs:1633-1639 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/manager.rs:1466\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/fleet/manager.rs:1632\u0060 calls \u0060clone\u0060 and \u0060crates/engine/src/fleet/manager.rs:1465\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d7282910d4e8c210a8e1204ad4e00080e4b00496d2d774803465212cdbbba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/fleet/profile.rs:105-111 | crates/engine/src/fleet/profile.rs:177-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/profile.rs:105\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/profile.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8415af262a1050a86a5d6adb6c6ab309d76da859d794c3b0cecfd6acf4f380"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/mcp.rs:6680-6686 | crates/engine/src/mcp.rs:6718-6724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:6680\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":6680}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d708eccea8f449be72d01fb9869c112a5af6386a62ac29693494def3ecc7815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/mcp/process_broker.rs:360-366 | crates/repl/src/runtime.rs:357-363 \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/engine/src/mcp/process_broker.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe62930907018e8e796b65b144d79f7ac05e9367e175edf93f91377dbfda3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:7170-7176 | crates/engine/src/runtime_threads/manager.rs:7227-7233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:7170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e34b5bf614715d48a1dbae251d2282c502cae793ae0f94ca1e4f2fe036dd10d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/engine/src/session_manager.rs:3153-3158 | crates/engine/src/session_manager.rs:3222-3228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_manager.rs:3153\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/session_manager.rs:3159\u0060 calls \u0060retire_session_usage_records\u0060 and \u0060crates/engine/src/session_manager.rs:3229\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":3153}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b0cc45826f3407dbef1017735121b7603b059358de9a17ced2ef82eae30be9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/session_manager.rs:4127-4133 | crates/engine/src/session_manager.rs:4234-4240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_manager.rs:4127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":4127}}}],"partialFingerprints":{"codehealthFindingId/v1":"44307f421e28614797cd0f05b5dc601517e3f1c129e6b6fe9f1ba092e7c1f842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/automation.rs:352-359 | crates/engine/src/tools/automation.rs:479-486 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/automation.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b53959e50f618383e89ea66074729570bb16731b46364b69eedaebb27d228e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/engine/src/tools/plan.rs:318-324 | crates/engine/src/tools/plan.rs:552-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/plan.rs:318\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plan.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa60334713f57cfdf23fcf48c453ea61384b66db36ea29ba673429ecc0aee7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/shell.rs:7019-7025 | crates/engine/src/tools/shell.rs:7098-7104 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/shell.rs"},"region":{"startLine":7019}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2450d79ff82c23d941c82b63022b183fa39fad37d03b73ef0073dedd25f24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/shell.rs:7314-7320 | crates/engine/src/tools/shell.rs:7644-7650 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/shell.rs"},"region":{"startLine":7314}}}],"partialFingerprints":{"codehealthFindingId/v1":"48aa34148d15067c28babd2100921e99740ecb2ddce51c82ac5bb1fbf6960de3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/engine/src/tools/subagent/coord.rs:232-238 | crates/engine/src/tools/subagent/coord.rs:440-445 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/tools/subagent/coord.rs:231\u0060 calls \u0060parse_agent_ref\u0060, \u0060ok_or_else\u0060, \u0060missing_field\u0060 and \u0060crates/engine/src/tools/subagent/coord.rs:439\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6338be721577ec13fb1b24220b85d2602c7da868e7a939586306e04d12648423"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:6318-6324 | crates/engine/src/tools/subagent/mod.rs:7472-7478 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":6318}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aebd7363572ab7334ac9356be99e20efbbc8e4962405eeef60649d470e59584"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:21775-21781 | crates/engine/src/tools/subagent/mod.rs:21796-21801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/mod.rs:21775\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":21775}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdbd744db40bd9b00965423bc026fd0d760318bcf8166d76261b0dfa7ad13ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/tasks.rs:906-912 | crates/engine/src/tools/tasks.rs:926-932 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/tasks.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f0fd15fbbab62aeb753ece3eeff05ed18815bec9f496cf8a7f8d2612f1204b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/web_search.rs:3142-3148 | crates/engine/src/tools/web_search.rs:3208-3214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:3142\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":3142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0349e8c7976f9879fab849cb994030bb475f1955d0508a4d36d0565a58f3331"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/work_graph/runtime.rs:479-487 | crates/engine/src/work_graph/runtime.rs:507-515 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/work_graph/runtime.rs:479\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/runtime.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c91f67982c060c3be627a1918f7d298df7cc7ce16a47f6583256c34ecd4527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/execpolicy/src/command_safety.rs:1081-1088 | crates/execpolicy/src/command_safety.rs:1362-1369 \u2014 both copies are in the same file, so extract the block 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/execpolicy/src/command_safety.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"e86153a0f39ac1dc900b996de72a73058f0022b9cbb7ce08b579fb9895aef48a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/memory/src/store.rs:744-750 | crates/memory/src/store.rs:759-765 \u2014 both copies are in the same file, so extract the block 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/memory/src/store.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"6919a7fed05a650738fa0ced24b4b53321bc503cc1551ee6d4a4e8910e5e58fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/plugins/src/recommend.rs:170-176 | crates/plugins/src/recommend.rs:317-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/recommend.rs:170\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/recommend.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6ce9f32da3513c5fd28448abc309947583e01a7d851b8649e4159550966713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/src/config.rs:3422-3428 | crates/runtime/src/config.rs:3531-3537 \u2014 both copies are in the same file, so extract the block 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/runtime/src/config.rs"},"region":{"startLine":3422}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fcfd56257a5d5b603da70b00bb17653ae53713e1f8fa9da3723167c53ec343"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/runtime/src/oauth.rs:3952-3957 | crates/runtime/src/oauth.rs:4157-4163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/oauth.rs:3952\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/oauth.rs"},"region":{"startLine":3952}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1225e538bb31129ab84d51f8c2f715e7b57768e664196a0757886ac16aebbae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/commands/contract.rs:4221-4227 | crates/tui/src/commands/contract.rs:4269-4275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:4221\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":4221}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b2a34adef9665411ea804895467b580987956112d37f80c7e1142bb6851191"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/commands/groups/session/color.rs:40-46 | crates/tui/src/commands/groups/session/remote_env.rs:47-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/color.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b74152888100c3f3056d81987098ca0833523302255fa57e09a8da273cd418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/tui/src/integrations/dsh/bundle.rs:450-456 | crates/tui/src/integrations/dsh/bundle.rs:462-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/integrations/dsh/bundle.rs:450\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/bundle.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07abf75c34eff75eac848652a2fc20761533317ca0d94d0fecffc70c1cafa04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/tui/model_picker.rs:4439-4445 | crates/tui/src/tui/provider_picker.rs:5444-5450 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/model_picker.rs:4439\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":4439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49ed94a1707e640ca1b36bc4ee637c82502575e6f946c4edc9b3c3a8037abcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/tui/mouse_ui.rs:2252-2258 | crates/tui/src/tui/mouse_ui.rs:2303-2309 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/mouse_ui.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"df745e2c377ad73500492e8160f7e2a677f38a0c834cec59364bd4e3166cb700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/tui/pager.rs:746-752 | crates/tui/src/tui/pager.rs:943-949 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/pager.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e37699b5cd47a70c96500716d64c1199ca165fe9a48a1116938436d78cdffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/tui/pet_watch/full.rs:280-286 | crates/tui/src/tui/pet_watch/full.rs:421-427 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/pet_watch/full.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd3046d840329165d9428f9b33e027946aee9159ce85f5e8c0ed97fd79cb8f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/tui/provider_picker.rs:5132-5140 | crates/tui/src/tui/provider_picker.rs:5225-5231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/provider_picker.rs:5132\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/tui/src/tui/provider_picker.rs:5141\u0060 calls \u0060is_some\u0060 and \u0060crates/tui/src/tui/provider_picker.rs:5232\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":5132}}}],"partialFingerprints":{"codehealthFindingId/v1":"61721bf0611f362e8ad24aa15dbf2f75aea426f9c6211032545637dedfc96dc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/tui/ui.rs:723-729 | crates/tui/src/tui/ui/handlers.rs:2549-2555 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui.rs:723\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"468b867aba3045ce742bc134d8554c627820ef34c59001fe26bc1fe12cfa539d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/tui/ui/activity_detail.rs:378-385 | crates/tui/src/tui/ui/activity_detail.rs:421-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/activity_detail.rs:378\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/activity_detail.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec15ae6cbe7d85069cab24fa8cde5169a9db8603d121f584b68e8574c71775c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/tui/src/tui/ui/provider_routes.rs:896-902 | crates/tui/src/tui/ui/session_state.rs:1463-1468 \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/tui/src/tui/ui/provider_routes.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f65a09d6dab23e77057a6362bc5a6823a6b7eb9bb8a88391cb4d6f0265c9149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/tui/underwater.rs:879-885 | crates/tui/src/tui/underwater.rs:892-898 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/underwater.rs:879\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/underwater.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3215125c534bcfd0794baafc3eed46780c0bcb703f01452885379ff5ae629d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/tui/work_surface/render/mod.rs:562-568 | crates/tui/src/tui/work_surface/render/mod.rs:571-577 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/work_surface/render/mod.rs:562\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/mod.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"2560fef0770ddf92a90b593bbd5fa3db89973991ca5ca0d1744dd657349ce27d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 9): crates/engine/src/tools/web_search.rs:758-763 | crates/engine/src/tools/web_search.rs:861-868 | crates/engine/src/tools/web_search.rs:957-963 | crates/engine/src/tools/web_search.rs:1050-1056 | crates/engine/src/tools/web_search.rs:1138-1144 | crates/engine/src/tools/web_search.rs:1210-1215 | crates/engine/src/tools/web_search.rs:1290-1296 | crates/engine/src/tools/web_search.rs:1390-1396 | crates/engine/src/tools/web_search.rs:1497-1503 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:758\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fae17c64aca9514cd724239734763ce2bcde0fb44a779774f58674436a7acc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/commands/src/debug/change.rs:192-197 | crates/commands/src/debug/change.rs:235-240 | crates/commands/src/debug/change.rs:261-266 | crates/commands/src/debug/change.rs:368-373 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/change.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"526daa7ec12caa83edd3b7ea923690b416243f836905e925563ebaadd9dfc995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/config/src/base_url_resolution.rs:39-44 | crates/config/src/provider.rs:458-463 | crates/config/src/provider.rs:477-482 | crates/runtime/src/config.rs:9276-9281 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/base_url_resolution.rs:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a763d6088c6661fd5e895fdf061ccc634c55e447fb723db0798dc931450e8df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/engine/src/fleet/ledger.rs:880-885 | crates/engine/src/fleet/ledger.rs:928-933 | crates/engine/src/fleet/ledger.rs:986-991 | crates/engine/src/fleet/ledger.rs:1219-1224 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/ledger.rs:880\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ab8586a0bb051fdc1dd010651c8233ac2ef71557747e9a756725477cdb7135"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/tui/src/lib.rs:7964-7969 | crates/tui/src/lib.rs:8171-8176 | crates/tui/src/lib.rs:8875-8880 | crates/tui/src/lib.rs:8967-8972 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":7964}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70477b8df48a5bf50045ea479fbc269569ac4436fa2d4406cecab84be17f1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/config/src/config_document.rs:426-432 | crates/config/src/private_directory.rs:1614-1619 | crates/runtime/src/external_credentials.rs:325-331 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/config_document.rs:426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_document.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"51817e689b9a5a1802cb915d310f227472c9477ab93c9583ef43ffcfe0008108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/engine/src/core/engine.rs:4746-4751 | crates/engine/src/core/engine.rs:4754-4759 | crates/engine/src/core/engine.rs:4762-4767 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine.rs:4746\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":4746}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43bf28e4804712360c7e47753c2a18c97bd0535d9600dd05c787c3970fb2898"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/engine/src/fleet/ledger.rs:880-885 | crates/engine/src/fleet/ledger.rs:986-991 | crates/engine/src/fleet/ledger.rs:1096-1101 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/ledger.rs:880\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"5622bb1584931a1b86b4314aeec0217d51be4381790de0813e21b427cb135a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/engine/src/runtime_threads.rs:2056-2061 | crates/engine/src/runtime_threads.rs:5360-5365 | crates/engine/src/runtime_threads.rs:5777-5783 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads.rs:2056\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8b9c888d3a4bb96987fef3a5c67a19e136816852f74f7236e0cc2b74788816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/tui/src/tui/approval/elevation.rs:239-245 | crates/tui/src/tui/approval/view.rs:467-473 | crates/tui/src/tui/views/mode_picker.rs:119-125 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/approval/elevation.rs:239\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval/elevation.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"5577d4b4ee0c99537a75fbef32a440f693f05ab9e3bdcacae7ccecd7937ec9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/tui/src/tui/views/fleet_roster.rs:730-735 | crates/tui/src/tui/views/fleet_setup.rs:2763-2768 | crates/tui/src/tui/views/fleet_setup.rs:2843-2848 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_roster.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dfd3811ddf2671c5652537b5584c22c70a75184e84cd8014d3bcfc26c181df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app-server/src/acp_server/connection.rs:302-307 | crates/engine/src/fleet/acp.rs:797-802 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/acp_server/connection.rs:302\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/app-server/src/acp_server/connection.rs:308\u0060 calls \u0060Ok\u0060, \u0060Some\u0060, \u0060closes_input\u0060 and \u0060crates/engine/src/fleet/acp.rs:803\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/acp_server/connection.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce44dc065195a5d656dd3352da04a9b26e8dd97ef8c06fd1ec6c6852040f3f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app-server/src/runtime_api.rs:8286-8291 | crates/app-server/src/runtime_api.rs:8327-8332 \u2014 both copies are in the same file, so extract the block 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/app-server/src/runtime_api.rs"},"region":{"startLine":8286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b500b6c5cc38e612bdd74fb8e7a717659f08c67b3a262b0448b667aef4cda10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/cli/src/metrics.rs:918-939 | crates/cli/src/metrics.rs:1153-1174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/src/metrics.rs:918\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"f660fb228bd1d648ad9222523d07460d778f93ef1a15d1bcd851eac13a1a6eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/command-contract/src/types.rs:28-33 | crates/config/src/app_mode.rs:20-29 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/command-contract/src/types.rs:28\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/command-contract/src/types.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa5a8212b89f4a315e012a4cd6b4d3d3979b4006ffa837f5936b9410926571e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/commands/src/debug/change.rs:235-240 | crates/commands/src/debug/change.rs:350-355 \u2014 both copies are in the same file, so extract the block 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/commands/src/debug/change.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad956e6e28202405137494e20d0433b347f6f7f00e3883dcda535b79889ac0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/core/src/tool_parser.rs:167-172 | crates/core/src/tool_parser.rs:183-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/core/src/tool_parser.rs:167\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/tool_parser.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8692983287620990d64866a2be3def36a6baccb48a219b299ce89644029a6e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/client/chat.rs:3176-3185 | crates/engine/src/client/chat.rs:3196-3205 \u2014 both copies are in the same file, so extract the block 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/engine/src/client/chat.rs"},"region":{"startLine":3176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab8c170f2249882c5be2a08399acae410788881eafaef8236b9f82518d1414e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/core/engine.rs:2051-2056 | crates/engine/src/core/engine.rs:2126-2131 \u2014 both copies are in the same file, so extract the block 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/engine/src/core/engine.rs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f129549410de4f056e4b36ff5ca3c1d13548653706b67571f6a301f8a957bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/extension_host/windows.rs:1360-1367 | crates/engine/src/extension_host/windows.rs:1478-1485 \u2014 both copies are in the same file, so extract the block 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/engine/src/extension_host/windows.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"39471097bad7b630724cf55469f30f4f5e3c11d0d5e6205d26e93b6b0befc93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/fleet/manager.rs:496-501 | crates/engine/src/fleet/manager.rs:587-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/manager.rs:496\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb2778cf474f401e4518259d4f889b8124fe3a2d8860d10372322674750aced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/receipts/usage.rs:136-142 | crates/engine/src/receipts/usage.rs:193-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/receipts/usage.rs:136\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/receipts/usage.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a760990bfd3a33c38e7ae32d6fe034df45102dfe2d5ff7cbb1ec1b01de5ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:4795-4800 | crates/engine/src/runtime_threads/manager/external_agent.rs:2020-2025 \u2014 before extracting anything, compare \u0060crates/engine/src/runtime_threads/manager.rs\u0060 and \u0060crates/engine/src/runtime_threads/manager/external_agent.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:4795\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/runtime_threads/manager/external_agent.rs:2026\u0060 calls \u0060channel\u0060 and \u0060crates/engine/src/runtime_threads/manager.rs:4801\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":4795}}}],"partialFingerprints":{"codehealthFindingId/v1":"537ca84cbdf5260cf10637eb0a265a972e6107652f3eb9c456ebd6349398b677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:4898-4903 | crates/engine/src/runtime_threads/manager.rs:4911-4916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:4898\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":4898}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9a940142527d324af605d8afbb5ad3f33b7ba903063c0861a0884a49e9f02c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/session_manager.rs:3047-3052 | crates/engine/src/session_manager.rs:3059-3064 \u2014 both copies are in the same file, so extract the block 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/engine/src/session_manager.rs"},"region":{"startLine":3047}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec46bdb66bf48180280b8cc0b2062f9d462b1251d3984e7266e0cd212fed690"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/session_manager.rs:3656-3661 | crates/engine/src/session_manager.rs:3795-3800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_manager.rs:3656\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":3656}}}],"partialFingerprints":{"codehealthFindingId/v1":"5807014bc4770d19fe4e6534b8fe2ce2a8e2ca97ef56d5a1b000cba98c5aacf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/session_reconcile.rs:308-313 | crates/engine/src/session_reconcile.rs:464-469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_reconcile.rs:308\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_reconcile.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d9020db292c2a3720e81a1d6606bbc3d152d60b159b9594a62d3828293a72c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/plan.rs:309-314 | crates/engine/src/tools/plan.rs:543-548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/plan.rs:309\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plan.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a4d7a05b6095d16c2263a930f4ae48d254ba368fa444bb305bdd5109817c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/subagent/coord.rs:986-991 | crates/engine/src/tools/subagent/coord.rs:1017-1022 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/coord.rs:986\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/tools/subagent/coord.rs:985\u0060 calls \u0060subagent_status_name\u0060 and \u0060crates/engine/src/tools/subagent/coord.rs:1016\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord.rs"},"region":{"startLine":986}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41d2ce443e07bdb04900cf573aed0685bb9109cfa91ac05683984862b45fced"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/terminal_session.rs:1361-1366 | crates/engine/src/tools/terminal_session.rs:1401-1406 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/terminal_session.rs:1361\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/terminal_session.rs"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0773591892aa461ca7f29c4b944047e7cb501eb6b71b1842854d32fb4a3f21ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/web_search.rs:2907-2912 | crates/engine/src/tools/web_search.rs:2930-2935 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:2907\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d18cfe6dca108c1ad4d1b7f9946300c0d5404812ad5445e947688742eef899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/plugins/src/install/mod.rs:464-469 | crates/plugins/src/install/mod.rs:559-563 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/mod.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dac6875622e0821a2e19dc3c6396ba3bff079d14c06d1cfe456efefc5e4e68d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/runtime/src/config.rs:8324-8330 | crates/runtime/src/config.rs:8332-8337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8324}}}],"partialFingerprints":{"codehealthFindingId/v1":"27aa04bcf32a14653ff086b946b8510b0f5e68b959c36c58b9a97eaf988bade4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/runtime/src/config.rs:8410-8415 | crates/runtime/src/config.rs:8527-8532 \u2014 both copies are in the same file, so extract the block 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/runtime/src/config.rs"},"region":{"startLine":8410}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f652912ec62ff402c372afdc50e132db0d3ad42a52f82548ecaf54c2bc3d6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/runtime/src/config.rs:12074-12079 | crates/runtime/src/config.rs:12106-12111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config.rs:12074\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":12074}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e93d5dd013a2de085f5faf61b51979f958cb8d0ce9b76eb494d7e4e593210d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/commands/contract.rs:671-676 | crates/tui/src/commands/contract.rs:768-773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8960052e067c202da2c1ffe74401f019720adbbfc1c4aba669b311e764228d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/commands/contract.rs:3549-3554 | crates/tui/src/commands/contract.rs:3570-3575 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:3549\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":3549}}}],"partialFingerprints":{"codehealthFindingId/v1":"26002c697b74962f71af14ec19d419c7a25f30085b63af830625155bfe882b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/commands/groups/config/config.rs:1371-1376 | crates/tui/src/commands/groups/config/config.rs:1403-1408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/config/config.rs:1371\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rest\u0060 to \u0060\u0026str) -\u003E (SubagentOp\u003C\u0027_\u003E\u0060 in one and \u0060\u0026str) -\u003E (SearchOp\u003C\u0027_\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/config.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"8169e0cf6eab65d3c84874278aa1ec991cbe93144f67613fc4363e2bf2a924f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/tui/file_mention.rs:432-438 | crates/tui/src/tui/slash_menu.rs:299-304 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/file_mention.rs:432\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc399631d9bb7d459e31fe25f455260310e76a0563afce1f1d4dd2cce33a23ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/tui/model_picker.rs:4357-4362 | crates/tui/src/tui/model_picker.rs:4372-4377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/model_picker.rs:4357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":4357}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c506a40025ab441fd9073ea406074f1d3c9c9bc85b3d766bb4c4916e99dd00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/tui/session_picker.rs:1257-1263 | crates/tui/src/tui/session_picker.rs:1332-1338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/tui/src/tui/session_picker.rs:1339\u0060 calls \u0060render\u0060 and \u0060crates/tui/src/tui/session_picker.rs:1264\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/session_picker.rs"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"9596376bf7278fa1a097208d757899ea86a8f51f817d3e2c7bb77bec8eb9f812"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/tui/setup/tools_mcp.rs:322-327 | crates/tui/src/tui/setup/tools_mcp.rs:410-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/tui/src/tui/setup/tools_mcp.rs:329\u0060 calls \u0060push_str\u0060 and \u0060crates/tui/src/tui/setup/tools_mcp.rs:416\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/tools_mcp.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fbc4f51cc9073535fbbe3264ecb63d69b84640c74d78785a10d6d57bb4ed39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/tui/sidebar.rs:161-167 | crates/tui/src/tui/work_surface/model.rs:1721-1726 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/sidebar.rs:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/sidebar.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3d0cd40c4410a8c6e904bb3ca0b27ac44e5526c74ac617b81de74166568d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/tui/ui/compaction_flow.rs:120-125 | crates/tui/src/tui/ui/compaction_flow.rs:192-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/compaction_flow.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/compaction_flow.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"223b694ada5166c17770c4b2fb4207a4750f33cfab8f3efec1ee34cf9b6c4abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/tui/ui/handlers.rs:2549-2554 | crates/tui/src/tui/ui/handlers.rs:2595-2600 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/handlers.rs:2549\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":2549}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ba648a2e79b16e24f06eb66a6fa747087899bf2d60acba542da3b7084e7201"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/workflow/src/fleet_reasoning.rs:631-637 | crates/workflow/src/fleet_reasoning.rs:1443-1449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/workflow/src/fleet_reasoning.rs:1450\u0060 calls \u0060Some\u0060, \u0060push_str\u0060, \u0060receipt\u0060 and \u0060crates/workflow/src/fleet_reasoning.rs:638\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/fleet_reasoning.rs"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b01a611f3243cc883dd7a988da420c2ba28c2e3111490a3f3676ec4789a200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): crates/tui/src/tui/account_login.rs:354-358 | crates/tui/src/tui/account_login.rs:692-696 | crates/tui/src/tui/feedback_picker.rs:143-148 | crates/tui/src/tui/launch_resume_confirm.rs:147-151 | crates/tui/src/tui/live_transcript.rs:664-668 | crates/tui/src/tui/views/mode_picker.rs:148-153 | crates/tui/src/tui/views/router_setup.rs:721-725 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/feedback_picker.rs\u0060 and \u0060crates/tui/src/tui/live_transcript.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/account_login.rs:354\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/account_login.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d25be241b97f0234040800dc220be15ebc3de492273d2fd9ccd9bdf1b9d2b38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/engine/src/runtime_threads.rs:3432-3436 | crates/engine/src/runtime_threads.rs:3478-3482 | crates/engine/src/runtime_threads.rs:3519-3523 | crates/engine/src/runtime_threads.rs:3678-3682 | crates/engine/src/runtime_threads.rs:3929-3933 | crates/engine/src/runtime_threads.rs:5961-5967 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads.rs:3432\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":3432}}}],"partialFingerprints":{"codehealthFindingId/v1":"607deda6f0eb0c4cb895dfc8e296238bdf1d8916b584212a2b6e73da6fbebe90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/engine/src/extension_host/registry.rs:1855-1862 | crates/engine/src/extension_host/registry.rs:1867-1871 | crates/engine/src/extension_host/registry.rs:1920-1924 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/registry.rs:1855\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/registry.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca47ea4eac3b5ec3740e567169364edbf08d865ede14d697ac127248175add5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app-server/src/remote_control.rs:1339-1343 | crates/app-server/src/remote_control.rs:3117-3122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/remote_control.rs:1339\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e988e1622e15f315bcf1148ff082088cc92684a4def6bfe0d3853af398d0f3bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app-server/src/remote_control.rs:4149-4154 | crates/app-server/src/remote_control.rs:4227-4232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/remote_control.rs:4149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":4149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c552ecf0c35cae16c1b9c922d01d474b8e72a91f0655db9adce330b2899b4e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app-server/src/runtime_api/jobs.rs:947-953 | crates/app-server/src/runtime_api/jobs.rs:1240-1246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/jobs.rs:947\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/jobs.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"442bc87394fa9c6b5fbd24ce8b81488d2178784ca1a24fae83a2a986de25fe5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 6): crates/app-server/src/runtime_api.rs:6372-6375 | crates/app-server/src/runtime_api.rs:7336-7339 | crates/app-server/src/runtime_api.rs:12945-12948 | crates/app-server/src/runtime_api.rs:13024-13027 | crates/app-server/src/runtime_api/secrets.rs:320-324 | crates/app-server/src/runtime_api/secrets.rs:924-928 \u2014 there are 6 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:6372\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/app-server/src/runtime_api.rs:13022\u0060 calls \u0060Query\u0060 and \u0060crates/app-server/src/runtime_api.rs:6368\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":6372}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22db587df05008938fd3ec0cfbee95132206b1f2eb3d1873c8530852dcfeeab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app-server/src/runtime_api/secrets.rs:369-373 | crates/app-server/src/runtime_api/secrets.rs:964-968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/secrets.rs:369\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/secrets.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e179b35feb4ddf9c83ba036969bb3a8665da7c1ace8fad30bb7b18cc68d4f5b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app-server/src/thread_control.rs:896-903 | crates/app-server/src/thread_control.rs:1345-1349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/thread_control.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e0d7951117b4a7662b91678f15daf80e67cc7e2ab5fb8a02ce165a64381c23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/config/src/resolve.rs:95-99 | crates/config/src/resolve.rs:114-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/resolve.rs:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/resolve.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8b09b3d958e593f902c5b74fdd86b5721122279c126362aa8afb9379363add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/config/src/user_constitution.rs:1335-1339 | crates/protocol/src/display.rs:126-130 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/user_constitution.rs:1335\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/user_constitution.rs"},"region":{"startLine":1335}}}],"partialFingerprints":{"codehealthFindingId/v1":"c208e03810142e1cc44dba8b71ac05ab08b83f019eea2435cc12f1ccc6018f91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/core/engine/rlm_host.rs:847-851 | crates/engine/src/tools/subagent/engine.rs:52-56 \u2014 before extracting anything, compare \u0060crates/engine/src/core/engine/rlm_host.rs\u0060 and \u0060crates/engine/src/tools/subagent/engine.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/rlm_host.rs:847\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cabae425ffe040e211fc0423214a6d4c261cb13651b42cdaf43966a508543f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/core/engine/tool_catalog.rs:1116-1120 | crates/tui/src/commands/mod.rs:573-578 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/core/engine/tool_catalog.rs:1121\u0060 calls \u0060dedup_by\u0060 and \u0060crates/tui/src/commands/mod.rs:578\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_catalog.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e5c1d352f2fda6aa1320e0faa8bd4f5ef97ff765ea06bc02b334050af0dd82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/extension_host/avatars.rs:136-140 | crates/engine/src/extension_host/native_mcp.rs:148-154 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/avatars.rs:136\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/avatars.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bccc54a5b2c979dda8ee17f487eb5a629f18e027e6a5cdb43f8424c7be2997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 9): crates/engine/src/codex_model_cache.rs:102-105 | crates/engine/src/core/authority/auto_review.rs:464-467 | crates/engine/src/extension_host/mod.rs:873-877 | crates/engine/src/extension_host/mod.rs:3677-3681 | crates/engine/src/extension_host/supervisor.rs:1746-1749 | crates/engine/src/runtime_threads/manager.rs:16068-16071 | crates/engine/src/runtime_threads/manager.rs:19815-19818 | crates/engine/src/superfast.rs:362-365 | crates/engine/src/tools/subagent/engine.rs:2211-2214 \u2014 there are 9 copies across 7 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 9 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/codex_model_cache.rs:102\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/codex_model_cache.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fa3c000897e8a2178aded25438abb7d5ea532203fb446c17b8e7826371d611"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/extension_host/mod.rs:1195-1199 | crates/engine/src/extension_host/mod.rs:1286-1290 \u2014 both copies are in the same file, so extract the block 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/engine/src/extension_host/mod.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cdf084148039ea9031fde981b25e962d6d7625fb645c4ef763f4f03151fc7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/model_inventory.rs:724-729 | crates/engine/src/model_inventory.rs:742-747 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/model_inventory.rs:724\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_inventory.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"474d751751e1423686d1ba91b0e45286f118323db5ee6e275464efb510ac4e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:5057-5062 | crates/engine/src/runtime_threads/manager.rs:5070-5075 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:5057\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060claim\u0060 to \u0060ClaimedDynamicToolSettlement\u0060 in one and \u0060\u0026ClaimedDynamicToolSettlement\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/runtime_threads/manager.rs:5063\u0060 calls \u0060Some\u0060 and \u0060crates/engine/src/runtime_threads/manager.rs:5076\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":5057}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a4eec058b0f2fea54c012307514623cb53030702acf9abc092db3b23ee53e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:13921-13927 | crates/engine/src/runtime_threads/manager.rs:14559-14565 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13921}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e37cab170962b12cab251d3ce964c5e86032ac78289206255c4c014eff73eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:16638-16642 | crates/engine/src/runtime_threads/manager.rs:16817-16821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:16638\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16638}}}],"partialFingerprints":{"codehealthFindingId/v1":"84087b36f4c486aa4a0f1d198f9719b4a6e51e417574353d5deb7efb3ec09a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:18100-18105 | crates/engine/src/runtime_threads/manager.rs:18108-18113 \u2014 both copies are in the same file, so extract the block 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":18100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab845c1ab0b746c3a5185cc13bf35bca04e725c1310e6cefee60e92081cae2fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/session_manager.rs:4900-4905 | crates/engine/src/session_manager.rs:5445-5450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_manager.rs:4900\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":4900}}}],"partialFingerprints":{"codehealthFindingId/v1":"9058978c1d99a964149bfd600ce95ba765f47a5acb7a036315945a45bf8547fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/apply_patch.rs:287-291 | crates/engine/src/tools/apply_patch.rs:346-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/tools/apply_patch.rs:345\u0060 calls \u0060clone\u0060 and \u0060crates/engine/src/tools/apply_patch.rs:286\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/apply_patch.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"81bd109e1125acba8b1d6c306bdc61b2b03276a94ce9751a9f48bf4752acf31c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/runtime_mcp.rs:170-174 | crates/engine/src/tools/runtime_mcp.rs:178-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/runtime_mcp.rs:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/runtime_mcp.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b56b3778f134f0009da942ecf8adc7caf617010ed063f770f22f6834bba5508"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 10): crates/engine/src/core/engine.rs:3043-3046 | crates/engine/src/extension_host/dsh_catalog.rs:250-253 | crates/engine/src/extension_host/mod.rs:2126-2129 | crates/engine/src/extension_host/mod.rs:2830-2833 | crates/engine/src/model_routing.rs:1747-1750 | crates/engine/src/runtime_threads/manager.rs:19109-19112 | crates/engine/src/tools/image_ocr.rs:400-403 | crates/engine/src/tools/session.rs:120-124 | crates/engine/src/tools/session.rs:205-209 | crates/engine/src/tools/tui_help.rs:113-116 \u2014 there are 10 copies across 8 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 10 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine.rs:3043\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":3043}}}],"partialFingerprints":{"codehealthFindingId/v1":"12064c05fea6d454727f74298e2db0edd88dcf2587eda9973fdca276e16c74f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/web/scrape.rs:87-92 | crates/engine/src/tools/web/scrape.rs:125-130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/scrape.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c52efb4df4fe854bce3b0dbc192388ad5fe77d280284693cdbad48af8b65823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/web_search.rs:2788-2792 | crates/engine/src/tools/web_search.rs:3784-3788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:2788\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"365b9c81b984badc4b10d8e5831f6a245ec93d69f5efa9427ac874c9c5aed16e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/workflow/mod.rs:5589-5599 | crates/workflow/src/lib.rs:1885-1895 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":5589}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d2d89537b1b43b5857634490ef7c292c1c7a5b9f0a4addcc6ec7cac0864fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/plugins/src/install/mod.rs:670-674 | crates/skill-install/src/install.rs:494-498 \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/plugins/src/install/mod.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf5c1ee3792f4265de0097fe7063cd5ea712e68533616d4e0dd0e3e30d7c252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/plugins/src/install/tarball.rs:244-248 | crates/skill-install/src/install.rs:1527-1533 \u2014 before extracting anything, compare \u0060crates/plugins/src/install/tarball.rs\u0060 and \u0060crates/skill-install/src/install.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/install/tarball.rs:244\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/tarball.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6651aa5e0813542f5488246cd41fa58f0cc2326621a5f2e03e195953d0dc950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/plugins/src/manifest.rs:1614-1618 | crates/plugins/src/registry.rs:2536-2540 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/manifest.rs:1614\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd84d1d71c6fc948b058340b7f11520dc4f3b1cb7569b0be5e424de851a9916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/runtime/src/delivery_files.rs:220-224 | crates/runtime/src/delivery_files.rs:342-346 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/delivery_files.rs:220\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/delivery_files.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4afaf9aca9ce2daba697c106058299792380eeee9094d96c042aca3c788585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/commands/config_host.rs:469-473 | crates/tui/src/commands/groups/config/config.rs:164-168 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/config_host.rs:469\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_host.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"57aec73d99fa0e366698b7fc09917ebd56b5a3a6c5df676905618cd2fc51e283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/tui/account_login.rs:329-334 | crates/tui/src/tui/account_login.rs:674-679 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/account_login.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee353a44105f7f03714344aa88aa2e835c49f18d0663d031d052eba737e558db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/tui/command_palette.rs:795-799 | crates/tui/src/tui/theme_picker.rs:281-290 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/command_palette.rs:795\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48f511ea47139808848021c4546f61cbbc52a10a7a8d5ecb74daee1a7785b6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/tui/history/message.rs:114-118 | crates/tui/src/tui/history/message.rs:233-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/tui/src/tui/history/message.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2d68b5aa0d78bb0529129dca5df6408beee42c23072eb529ee4969bdbad308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/tui/provider_picker.rs:3588-3592 | crates/tui/src/tui/views/mod.rs:2910-2914 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/provider_picker.rs:3588\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/provider_picker.rs"},"region":{"startLine":3588}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f9db3a78061ede648d128d02808d9ac0603f3aac4cf7044eb25c3fe162280a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/tui/setup/mod.rs:3358-3362 | crates/tui/src/tui/views/fleet_setup.rs:2763-2767 \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/tui/src/tui/setup/mod.rs"},"region":{"startLine":3358}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82d88612e25984d7de8960b1cf87c014737e109eb2d7981c86b60d9044f03e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/tui/views/fleet_list.rs:620-624 | crates/tui/src/tui/views/fleet_list.rs:627-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/views/fleet_list.rs:627\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_list.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"337d5d1e20e72848e6f445a7eaef7d0739ae36c201d7674720443ca7b7704e56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/util/src/bounded_lines.rs:54-58 | crates/util/src/bounded_lines.rs:96-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/util/src/bounded_lines.rs:54\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/bounded_lines.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ba476513e35f9260ab00ac52c9375a94340a822fd3de4b3623761dbbdfd2e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app-server-protocol/src/methods.rs:1013-1018 | crates/engine/src/extension_host/dsh_broker.rs:263-268 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/methods.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"909b1e25bb57107e17ab532bd3e463b7b9b589ca6440bbd757586ad420ea1c48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/app-server-protocol/src/runtime/watch_event.rs:63-68 | crates/engine/src/runtime_threads/turn_artifacts.rs:134-139 | crates/engine/src/session_manager.rs:814-819 \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/app-server-protocol/src/runtime/watch_event.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5920df408fa754f07cd9df89c8abae0643773afe574ee5c7537b522e4f2728b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app-server/src/eval.rs:759-766 | crates/engine/src/tools/approval_summary.rs:252-258 \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/app-server/src/eval.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b18d485664621a3784efbd5f16a043e6b0e2cfa5e2688a9f7fa38c6bbc2dd7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/app-server/src/runtime_api.rs:5723-5733 | crates/engine/src/fleet/control.rs:54-64 \u2014 before extracting anything, compare \u0060crates/app-server/src/runtime_api.rs\u0060 and \u0060crates/engine/src/fleet/control.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5723}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a5b4ab8858322a6c51268cea2db56e31be6bf04ff9e6d3cd1555905468695c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/app-server/src/runtime_api/auth.rs:54-58 | crates/engine/src/automation_manager.rs:3815-3819 | crates/engine/src/tools/plan.rs:357-361 | crates/engine/src/tools/review.rs:2177-2181 | crates/engine/src/tools/verify.rs:893-897 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 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 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/auth.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5d755c3a095b2e5fb6a35db10d644cf7a9c281732649dc4c111e6232be2432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app-server/src/runtime_api/git.rs:1211-1220 | crates/snapshot/src/repo.rs:2385-2394 \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/app-server/src/runtime_api/git.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1055fece840d60aeda1ee9e6d50da48e624d44cdd53c9b61629c3a69f22b526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app-server/src/runtime_api/mobile.rs:272-276 | crates/app-server/src/runtime_api/web.rs:299-303 \u2014 before extracting anything, compare \u0060crates/app-server/src/runtime_api/mobile.rs\u0060 and \u0060crates/app-server/src/runtime_api/web.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/mobile.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"242271c159701756d866710f90caad8dead57bfed736ffaa2c95774e39aa937a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/cli/src/hashing.rs:8-16 | crates/runtime/src/hashing.rs:7-15 | crates/skill-install/src/install.rs:1699-1707 | crates/skill-install/src/package_digest.rs:179-187 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/hashing.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"935d6ed63c605a06ab22160df15b069f01a06ffc078f0463691e6714ebd71867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/cli/src/lib.rs:1671-1677 | crates/engine/src/core/authority/auto_review.rs:1666-1672 | crates/lane/src/runtime.rs:235-241 \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/cli/src/lib.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb7c2427cece59ddba7b5c85f959403c93ca9d80db91d92d4ca77281182765c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/cli/src/metrics.rs:1115-1121 | crates/engine/src/runtime_threads.rs:4799-4805 \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/cli/src/metrics.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c309883e43e4d310d5e280952cb0d9d6cc866a502de87b2f8c52171f5345303e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/command-contract/src/config.rs:352-361 | crates/tui/src/tui/pet_watch/appearance.rs:34-43 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/command-contract/src/config.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3330e88272954652baea15d3e487bbd89d655ea47956ed868a5c323b0de3e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/command-contract/src/types.rs:103-111 | crates/tui/src/tui/work_surface/model.rs:194-202 \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/command-contract/src/types.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec655c9d113cf2f00ce9b36b3f26ab85aa4af5f3edc39d72d66ed1257c94224"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/commands/src/diagnostics_reports/receipts.rs:6-13 | crates/engine/src/tools/session.rs:25-32 | crates/lane/src/control.rs:2198-2205 | crates/tui/src/commands/groups/core/workflow.rs:54-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/diagnostics_reports/receipts.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e6603b902ee2040990c46f0167410871c12a08f51b995d370f03a97d335c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/config/src/config_document.rs:555-560 | crates/runtime/src/config_persistence.rs:289-294 \u2014 before extracting anything, compare \u0060crates/config/src/config_document.rs\u0060 and \u0060crates/runtime/src/config_persistence.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_document.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"b704ae3ccf37d476e08d3170e659044d575e9042983d43c8f55c9731b5747314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/config/src/env_overrides.rs:127-133 | crates/runtime/src/config.rs:9227-9233 \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/config/src/env_overrides.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e8983ff3079dceb4791890efa352f4e5e2b82b7ff7595f640c34184c8403ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/config/src/project_config.rs:244-249 | crates/engine/src/project_context.rs:1778-1783 \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/config/src/project_config.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6154e6d9519ac362816c72f1aab78f7af520150d85ecc51d5d2c74b2e88389bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/config/src/windows_identity.rs:94-98 | crates/engine/src/tools/github/report.rs:1402-1406 | crates/runtime/src/external_credentials.rs:599-604 \u2014 before extracting anything, compare \u0060crates/config/src/windows_identity.rs\u0060 and \u0060crates/engine/src/tools/github/report.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/config/src/windows_identity.rs:102\u0060 calls \u0060pub\u0060, \u0060WindowsLocalAllocation\u0060 and \u0060crates/engine/src/tools/github/report.rs:1410\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/windows_identity.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e273761a397cd8c710a751211e1b52ca7f5250c2c39668928dd3a2771a70cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/core/src/fragments.rs:35-46 | crates/core/src/fragments.rs:102-113 | crates/runtime/src/model_context/fragment.rs:34-45 | crates/runtime/src/model_context/fragment.rs:114-125 \u2014 before extracting anything, compare \u0060crates/core/src/fragments.rs\u0060 and \u0060crates/runtime/src/model_context/fragment.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fragments.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9b56859a5d740db49755883d660f6a8b9dcbfdc2de03896dec695a07b06df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/core/src/fragments.rs:48-59 | crates/runtime/src/model_context/fragment.rs:49-60 \u2014 before extracting anything, compare \u0060crates/core/src/fragments.rs\u0060 and \u0060crates/runtime/src/model_context/fragment.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fragments.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2976a57a0266a08c4180efd8901d1de7abbf3739ef1618206fb8ebc47bc0d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/core/src/fragments.rs:74-85 | crates/runtime/src/model_context/fragment.rs:77-88 \u2014 before extracting anything, compare \u0060crates/core/src/fragments.rs\u0060 and \u0060crates/runtime/src/model_context/fragment.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 68 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/fragments.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6acbb5c11c36d19ad6502fa7ed2303d3421eee52a3a46d34cced8f237399a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/core/engine.rs:10645-10650 | crates/engine/src/fleet/identity.rs:223-228 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":10645}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce35bf590b3935b0d0ba3a7f1b9db38693503ae4c906687784c3d76507b2a697"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/core/engine.rs:10995-11002 | crates/tui/src/tui/widgets/workflow_panel.rs:2349-2356 \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/engine/src/core/engine.rs"},"region":{"startLine":10995}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4d0dcd1d6eab7e17b5bdb08da492fc22f76330d8d9feb4c75ecf6ba9956c6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/core/runtime_contract/model.rs:36-46 | crates/engine/src/llm_client/mod.rs:129-139 \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/engine/src/core/runtime_contract/model.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c1f15199e6d080b23095943344705ddb861d9e1874c15943da28a981065998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/core/runtime_contract/model.rs:51-61 | crates/engine/src/llm_client/mod.rs:148-158 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/runtime_contract/model.rs:51\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/runtime_contract/model.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"43953b8190c9f6289b4c5259f5c0b1ca2c87159c13e545c183cae3fe674f3090"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/extension_host/dsh_terminal.rs:387-393 | crates/engine/src/extension_host/dsh_workspace.rs:423-429 \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/engine/src/extension_host/dsh_terminal.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"be104a48e627a16632fd6077e634b568e0ef8aec6110a6a0c255844ca1e0d29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/fleet/host.rs:1821-1832 | crates/engine/src/fleet/manager.rs:2976-2987 \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/engine/src/fleet/host.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa11599701c1236d56c37c0f931870c07d31eed5847e09210c4cf6d94cfdb569"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/fleet/manager.rs:2629-2637 | crates/engine/src/fleet/scheduler.rs:669-677 \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/engine/src/fleet/manager.rs"},"region":{"startLine":2629}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5641ba01a1b61811138644e9c0e5b6c70ab21d9406faa77fdc48ea27d9d549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/image_attach.rs:265-273 | crates/engine/src/tools/read_media.rs:1031-1039 \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/engine/src/image_attach.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03470777df2b12f3ca710c2a8f164b5ca2746e58ae32e4b98be4a8814245ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/mcp.rs:7411-7418 | crates/util/src/bundle_file.rs:5-12 \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/engine/src/mcp.rs"},"region":{"startLine":7411}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b9a6669d22610d57e423f66ae6120b0e080f780f7dcb254135469922db2d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/model_routing.rs:2209-2217 | crates/tui/src/tui/auto_router.rs:77-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_routing.rs"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"048f8b80e4ffd863cd696efed2331290edd3d81c74f2875c57ce3e1eab506597"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/runtime_threads.rs:5667-5674 | crates/engine/src/task_manager.rs:4279-4286 \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/engine/src/runtime_threads.rs"},"region":{"startLine":5667}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d90122d521ca1e1508e87cd792c1f4bb68889095d6b70f5c45ef50dfcdea326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/automation.rs:282-289 | crates/engine/src/tools/github/mod.rs:177-184 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/tools/github/mod.rs:188\u0060 calls \u0060Ok\u0060 and \u0060crates/engine/src/tools/automation.rs:293\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"0abf3ccc85a5efedc959954950416f54ca5f5b1cc17a4c95da37111cb479e320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/engine/src/tools/automation.rs:298-303 | crates/engine/src/tools/github/mod.rs:194-199 | crates/engine/src/tools/tasks.rs:370-375 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/automation.rs\u0060 and \u0060crates/engine/src/tools/tasks.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"561b79413106c61238c134459a76514e13cb0451a8297f3af599b45408632e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/git.rs:501-507 | crates/engine/src/tools/git_history.rs:867-873 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/git.rs\u0060 and \u0060crates/engine/src/tools/git_history.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2da72b66f48dcadb0d46288e5a1dadb11417918565c28ff28db8875198b2f07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/engine/src/tools/git_tool.rs:46-51 | crates/engine/src/tools/run_tool.rs:44-49 | crates/engine/src/tools/web_tool.rs:45-50 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_tool.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1b089c49382cb44a83a3d66860a948a58eda0684d5cfb785ecf6aebb958352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/image_ocr.rs:427-432 | crates/engine/src/tools/pdf.rs:366-371 \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/engine/src/tools/image_ocr.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef86a695fb1663a66e21f0622811a00a063a337f115dc3b4e1ac144f95b8bed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/tools/subagent/delivery.rs:401-409 | crates/util/src/files.rs:36-44 \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/engine/src/tools/subagent/delivery.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec18b274817464a3c9f6d437e7e9da3ee201434e10a04f0efb956d4d7b370be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/work_graph/migration.rs:225-231 | crates/engine/src/work_graph/runtime.rs:1468-1474 \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/engine/src/work_graph/migration.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b058ccfbb9c2d898bfcd687f79ee097f8cd3e136cd9188d59231cc73fedca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/work_graph/migration.rs:233-240 | crates/engine/src/work_graph/runtime.rs:1476-1483 \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/engine/src/work_graph/migration.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f440304bfdfdffe15e5ea77de617785d7747ab25f2e0b5919c1a6d0c6f6311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/work_graph/runtime.rs:1510-1518 | crates/tui/src/tui/app.rs:7355-7363 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/work_graph/runtime.rs:1510\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/runtime.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1772041cfef9854046897ae2410ed027e89ae1292a48e6e716ca5cd7a1ca32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/plugins/src/host_services.rs:294-300 | crates/plugins/src/install/summary.rs:232-238 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060peers\u0060 to \u0060\u0026[ReviewPeer]\u0060 in one and \u0060\u0026[crate::host_services::ReviewPeer]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/host_services.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5568a96bd0e9203e791d66387dfc05bcd7dda829afe97b540281315d53d24115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:602-611 | crates/plugins/src/marketplace/parsers/mod.rs:382-391 \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/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"c850a28ef44fb222b13f8736a48fdac58ce667d99a4e2c0a3eb83f23d18c8fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/runtime/src/working_set.rs:900-909 | crates/tui/src/tui/git_mention.rs:260-269 \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/runtime/src/working_set.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"28755450fa4f265faf1dc81c1311597813ff9d6be9d648066538eaf5d7ea20f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/secrets/src/file_lock.rs:272-281 | crates/util/src/lock.rs:31-40 \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/secrets/src/file_lock.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8389072e2ed065aa676fbf0d216820e885ab144501e65d7eb61be4d39c8a04d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/integrations/dsh/scene.rs:46-51 | crates/tui/src/tui/ocean.rs:551-556 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/scene.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a82b9948039c8cab11501539c50cf8fc4a9193edf70364f2861c6ed6c77667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/tui/agent_focus.rs:269-273 | crates/tui/src/tui/automation_routing.rs:437-441 \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/tui/src/tui/agent_focus.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"738ede8f409ce3eb3bbef9b102136c508c7e158e569023a582d2ae7ee34941f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/tui/hover_hit.rs:59-67 | crates/tui/src/tui/mouse_ui.rs:1298-1307 \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/tui/src/tui/hover_hit.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"625c5da8782e48b5ddb447c603fac3ce70086cdcdda2015618ad42a069923ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/onboarding/mod.rs:65-75 | crates/tui/src/tui/redaction_gate.rs:58-68 \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/tui/src/tui/onboarding/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8aff33d4ee9cb7f828a8950168f25175e8cbf5f418467970366495fb74e6cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/tui/onboarding/mod.rs:198-206 | crates/tui/src/tui/redaction_gate.rs:141-149 \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/tui/src/tui/onboarding/mod.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d9b300c257433e8cb8c35f8921d4ac2c50a990cf91832dd1ee057d6b6dcc2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/tui/setup/fleet_draft.rs:247-258 | crates/tui/src/tui/setup/model_draft.rs:152-163 \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/tui/src/tui/setup/fleet_draft.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"050cf29c067587aabd0147769818624882ead3ed7acf9ccfb1afe9b46674e6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:798-808 | crates/tui/src/tui/widgets/mod.rs:2002-2012 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9a963cc686e55daf519263a05086442dfaa63f4b3878e5e5e8a2b225146a07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:1173-1178 | crates/tui/src/tui/widgets/mod.rs:2323-2328 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9b51b3a75a4ec87f2c8f7c38d61d41f252805ff5919d8d2c4cabe48eba447e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/tui/widgets/approval_band_legacy.rs:1181-1188 | crates/tui/src/tui/widgets/mod.rs:2331-2338 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 18 separate duplicated blocks between them, totalling at least 542 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b0b7b8ee0b2885f4f50833ec4cedfeeb8e636fc570d6a5791609065ca218d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/tui/widgets/composer_legacy.rs:184-192 | crates/tui/src/tui/widgets/mod.rs:1188-1196 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/composer_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"466ece0071f83f2f82c6719286e716bcb20abec31e8f23f3be405efb982202e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/tui/src/tui/widgets/composer_legacy.rs:205-217 | crates/tui/src/tui/widgets/mod.rs:1209-1221 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/widgets/composer_legacy.rs\u0060 and \u0060crates/tui/src/tui/widgets/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8a621363cccc427971787dd514ed0c6ee35523121435cae804187e8c58134d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/workflow/src/fleet_exact.rs:332-337 | crates/workflow/src/fleet_snapshot.rs:366-371 \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/workflow/src/fleet_exact.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8594dbd4b3834adb62c0300dcfabd3843c859d7a3da8ca806c4e317da8baf4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/workflow/src/fleet_exact.rs:345-350 | crates/workflow/src/fleet_snapshot.rs:381-386 \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/workflow/src/fleet_exact.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"9074a6e62388cb2c261a0adf361bf126d3da13373b8db986b3dbeaec30a0827d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/account-cli/src/work.rs:70-76 | crates/engine/src/extension_host/dsh_terminal.rs:227-233 \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/account-cli/src/work.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"64af53b757e2b2918ed8c57d548084b6ce2ec791c69997a9007839d559b2729f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/config/src/legacy_root.rs:1025-1030 | crates/engine/src/prompts.rs:671-676 \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/config/src/legacy_root.rs"},"region":{"startLine":1025}}}],"partialFingerprints":{"codehealthFindingId/v1":"08317c798642cb91e40b5f8aebce3b2c47b6fe18f891ead99a68863925d4650b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): crates/tui/src/commands/groups/session/branch.rs:42-50 | crates/tui/src/commands/groups/session/fork.rs:44-52 | crates/tui/src/commands/groups/session/load.rs:44-52 | crates/tui/src/commands/groups/session/new.rs:40-48 | crates/tui/src/commands/groups/session/save.rs:40-48 | crates/tui/src/commands/groups/session/sessions.rs:40-48 | crates/tui/src/commands/groups/session/tree.rs:40-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 7 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/session/branch.rs:42\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/branch.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d727681d5b1b32c74b740bf1b7212d1c7f5a6c2fb525ac5a41f68c6bf0afc8fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/tui/src/commands/groups/session/relay.rs:46-52 | crates/tui/src/commands/groups/session/remote_control.rs:47-53 | crates/tui/src/commands/groups/session/rename.rs:39-45 | crates/tui/src/commands/groups/session/resume.rs:39-45 | crates/tui/src/commands/groups/session/title.rs:40-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/session/relay.rs:46\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/relay.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ce30cb0d528dc44e2799a0170ecf0708a13f0a78c5869e04afa94581841a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/commands/groups/skills/restore.rs:51-57 | crates/tui/src/commands/groups/skills/review.rs:48-54 \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/tui/src/commands/groups/skills/restore.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"274d3629d8deac75f344ffd4e36ba90621996cce2941341c8a821aaa0cb2d2e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): crates/plugins/src/marketplace/parsers/claude.rs:73-91 | crates/plugins/src/marketplace/parsers/codex.rs:48-66 | crates/plugins/src/marketplace/parsers/dsh.rs:80-98 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/codex.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 96 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:73\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f7a81fc9bf1e9474f8593689b5c9ccff2cd597a1435b7c74886c9a66b41891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/tui/src/lib.rs:6080-6091 | crates/tui/src/lib.rs:6127-6142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/lib.rs:6080\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":6080}}}],"partialFingerprints":{"codehealthFindingId/v1":"97aeb92062cf6df7089a430ef1672b5117d54a70c05be52698847f457b0f3862"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:2418-2432 | crates/tui/src/tui/ui/event_loop.rs:2488-2502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:2418\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2418}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0aa4dfbae8c47cb915394c8607bb637932a28461357214b0dbdbb907d39cff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/engine/src/fleet/manager.rs:1546-1560 | crates/engine/src/fleet/manager.rs:1587-1601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/fleet/manager.rs:1546\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/fleet/manager.rs:1561\u0060 calls \u0060insert\u0060, \u0060clone\u0060 and \u0060crates/engine/src/fleet/manager.rs:1602\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"48535de171c8a153bb1eb3ed23c78a3f34ad6a2d81a65680113f083bf16660a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): crates/engine/src/mcp.rs:2515-2529 | crates/engine/src/mcp.rs:2578-2592 | crates/engine/src/mcp.rs:2633-2647 | crates/engine/src/mcp.rs:2688-2702 | crates/engine/src/mcp.rs:2739-2751 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:2515\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":2515}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d00c918ffe4db79558e08606ec98a5e31c52f61ce9a9f54bb4f739ee4aeb9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/cli/src/metrics.rs:703-716 | crates/cli/src/metrics.rs:1194-1206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/cli/src/metrics.rs:703\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/cli/src/metrics.rs:702\u0060 calls \u0060Err\u0060, \u0060kind\u0060 and \u0060crates/cli/src/metrics.rs:1193\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcca7aa50e79164d3ceb5c26ae1911d5719e70917cd4294d27ee1f6d4e16853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/fleet/ledger.rs:1686-1699 | crates/engine/src/fleet/ledger.rs:1740-1749 \u2014 both copies are in the same file, so extract the block 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/engine/src/fleet/ledger.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacaa142e5fc201d865a1175118b1f8c5a3571062a77bbb82e1f45efd8686638"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app-server/src/runtime_api.rs:10782-10793 | crates/app-server/src/runtime_api.rs:10829-10842 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:10782\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":10782}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb871bdf3e32204f0d6c7e3116ae62f788174379df1a2a863196f22d6c8aa8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/app-server/src/remote_control.rs:3609-3622 | crates/app-server/src/remote_control.rs:3728-3741 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/remote_control.rs:3609\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":3609}}}],"partialFingerprints":{"codehealthFindingId/v1":"1793509080717f6d9d29466482bf8b4748394d6aa2b4c191e32572968e723f83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/engine/src/tools/review_core.rs:920-933 | crates/engine/src/tools/review_core.rs:1164-1177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/review_core.rs:920\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"1766a398ef9e9f7a10cf23b4d70b250ec6f041ede6f94435d678264130339cd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/engine/src/mcp.rs:2600-2613 | crates/engine/src/mcp.rs:2658-2671 | crates/engine/src/mcp.rs:2710-2723 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/mcp.rs:2600\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":2600}}}],"partialFingerprints":{"codehealthFindingId/v1":"577fdd8071db7766847d092c9127c59feadf408b4c850153d5b567fe9a568993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/engine/src/extension_host/core_call.rs:1002-1015 | crates/engine/src/extension_host/core_call.rs:1095-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/core_call.rs:1002\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"e861d70440b3948ecfab8e95ede69fabafd6aed0e7848f496977bc4dacc78801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/tui/src/tui/ui/event_loop.rs:8162-8174 | crates/tui/src/tui/ui/event_loop.rs:8323-8335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/event_loop.rs:8162\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":8162}}}],"partialFingerprints":{"codehealthFindingId/v1":"808c7d7bbcba24a4af85589c43d034c57eb2bca0ee39e0ab9f9f114c77d7295d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/execpolicy/src/lib.rs:619-631 | crates/execpolicy/src/lib.rs:642-654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/lib.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e203152e8790853e5db6c3e838e5b2d54354c6b190e206dd8905aca0fd9fde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/extension_host/mod.rs:2577-2589 | crates/engine/src/extension_host/mod.rs:2683-2694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/mod.rs:2577\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":2577}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb843799d84bc57c8dd0857c2f00860092a3b202a3ccdda5fa64470f91e29c4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/runtime/src/oauth.rs:1125-1132 | crates/runtime/src/oauth.rs:1167-1178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/oauth.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fa1fdb7e48afd9e329cc9ca8eb583ac850b6d51c0350a670e60023d9f667c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app-server/src/thread_control.rs:1099-1110 | crates/app-server/src/thread_control.rs:1140-1151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/thread_control.rs:1099\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/thread_control.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df8b1a2a8a83f5844f93ceec178a41c930de8db1ae00aa994fad45c84278525"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/reasoning_preference.rs:156-167 | crates/engine/src/reasoning_preference.rs:172-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/reasoning_preference.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb689b656938104df5b4f9fcff1dbacb2cf3b646b078be487f48a50ea39cad2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/finance.rs:527-537 | crates/engine/src/tools/finance.rs:689-700 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/finance.rs:527\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/finance.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4e85361ee969f2af7418b4f1072838f6ee87e54d556c55b14439054c553094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/engine/src/hooks/executor.rs:2563-2571 | crates/engine/src/hooks/executor.rs:2592-2600 | crates/engine/src/hooks/executor.rs:2618-2626 | crates/engine/src/hooks/executor.rs:2701-2712 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/hooks/executor.rs:2590\u0060 calls \u0060collect_reader\u0060 and \u0060crates/engine/src/hooks/executor.rs:2561\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2563}}}],"partialFingerprints":{"codehealthFindingId/v1":"736aa39e41d4c0ed5b374436c97e56f2a9e26e3f7c2135a05ffd1d8033855eda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/plugins/src/marketplace/parsers/claude.rs:219-230 | crates/plugins/src/marketplace/parsers/kimi.rs:118-129 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/claude.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/kimi.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 85 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/claude.rs:219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaeec88490f7481a8823a1a761cef5ac30c1324fb72e53518c2d9f9b6abcba56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/tools/file.rs:2300-2311 | crates/engine/src/tools/file.rs:3364-3375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/file.rs:2300\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f324bd34d5b256d3cf3ceabfc771d856f0e6e6a94667cfa9158b268ea52752"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/config/src/private_directory.rs:1262-1273 | crates/config/src/private_directory.rs:1278-1289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/private_directory.rs:1262\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbec079233451cc9e665e048513548f62fbfbda5f0afe2943739115725561f31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/engine/src/tools/automation.rs:107-118 | crates/engine/src/tools/github/mod.rs:105-116 | crates/engine/src/tools/tasks.rs:146-157 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/automation.rs\u0060 and \u0060crates/engine/src/tools/tasks.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 60 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/automation.rs:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8ae089523f21a0b5df8517887c8b866fa04e4393dd62190bd6f85518d0c591"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app-server/src/runtime_api/thread_history.rs:514-525 | crates/app-server/src/runtime_api/thread_history.rs:1789-1800 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/thread_history.rs:514\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dd1081d2c1c84c26ed536f0335e5ee0c3998f30fb3b921edd8083eb9ba5dff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app-server/src/stdio.rs:1081-1092 | crates/app-server/src/stdio.rs:1097-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/stdio.rs:1081\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/stdio.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"20406e0e9351ec05196b8536bf964ac699ca9f26261293b94631cb7646f93274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/engine/src/client/test_cases_01.rs:1455-1466 | crates/engine/src/client/test_cases_05.rs:96-107 | crates/tui/src/lib.rs:9999-10010 \u2014 before extracting anything, compare \u0060crates/engine/src/client/test_cases_01.rs\u0060 and \u0060crates/engine/src/client/test_cases_05.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_01.rs:1455\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"045e153beec4ed1a6c4388437a5890899c3651273252930d206955e2ef5cdd8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/hooks/executor.rs:1331-1342 | crates/engine/src/hooks/executor.rs:1551-1562 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/hooks/executor.rs:1331\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060receiver\u0060 to \u0060Arc\u003CMutex\u003CReceiver\u003CObserverJob\u003E\u003E\u003E\u0060 in one and \u0060Arc\u003CMutex\u003CReceiver\u003CBackgroundHookJob\u003E\u003E\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b5295e94ee34cdcbc23fe8a70af8fb3367b37c3d22a59b5615103610f82acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/extension_host/native_mcp.rs:165-176 | crates/engine/src/extension_host/skills.rs:130-141 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/native_mcp.rs:165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/native_mcp.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2908cee789b10963c819e6dc8f4bae4c098d8ab3ae71355f5dee168bdf1b09da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/plugins/src/marketplace/parsers/codewhale.rs:196-205 | crates/plugins/src/marketplace/parsers/kimi.rs:177-188 \u2014 before extracting anything, compare \u0060crates/plugins/src/marketplace/parsers/codewhale.rs\u0060 and \u0060crates/plugins/src/marketplace/parsers/kimi.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/marketplace/parsers/codewhale.rs:196\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/codewhale.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1165ac493a57ce3b086241f5c84ce4253d4d5160687348b8a6c5d2014596d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/config/src/private_directory.rs:874-885 | crates/config/src/private_directory.rs:978-988 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"950fa6586dfa01198bd095cbbe2e9bf6e8eeb248cb0676bbe8b02845c0a165eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/session_manager.rs:4949-4960 | crates/engine/src/session_manager.rs:5502-5513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_manager.rs:4949\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":4949}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de4495de4726d4b4d9dfee681b711c156a6527dae722138b954cf7b71cffafb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/config/src/state_dirs.rs:209-219 | crates/config/src/state_dirs.rs:229-240 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/state_dirs.rs:209\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/state_dirs.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3838ddde7b5cd74cb4e76717ec73ccb754e4ff02c3955edb305ac4dc81c6d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/client/provider_native_search.rs:574-585 | crates/engine/src/client/provider_native_search/zai.rs:38-49 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/provider_native_search.rs:574\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"226f88340d01bea3cf3153dcdcad8d88666e5a22f15eb15bf348eeba62c81f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/dependencies/src/lib.rs:1419-1430 | crates/dependencies/src/lib.rs:1489-1500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/dependencies/src/lib.rs:1419\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/dependencies/src/lib.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"50aa89a66e6c11457b26de158dfe29b19b6a6582f34d1969739a7ab6b2d79a11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/core/engine.rs:5969-5980 | crates/engine/src/core/engine.rs:6000-6011 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine.rs:5969\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5969}}}],"partialFingerprints":{"codehealthFindingId/v1":"330c10f1d368a855687968de5c635efe7e69b2c9ccbd080198fe56aed7840b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): crates/engine/src/tools/web_search.rs:926-937 | crates/engine/src/tools/web_search.rs:1010-1021 | crates/engine/src/tools/web_search.rs:1249-1260 | crates/engine/src/tools/web_search.rs:1348-1359 | crates/engine/src/tools/web_search.rs:1454-1465 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:926\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/tools/web_search.rs:1009\u0060 calls \u0060as_deref\u0060 and \u0060crates/engine/src/tools/web_search.rs:1248\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66d6084054a4d8a3d2dbc14c64b4364471b637b765830369e334621554d6241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/tui/src/tui/agent_details.rs:434-444 | crates/tui/src/tui/sidebar.rs:243-253 | crates/tui/src/tui/work_surface/model.rs:2231-2241 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/agent_details.rs:434\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_details.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b92c28ff7c708e5fda5ced310a90da7c512ff8b4d0b2c24b9ac6ed04dbb162d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/tui/ui/apply.rs:3440-3447 | crates/tui/src/tui/ui/session_state.rs:1299-1309 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/apply.rs:3440\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c51e71c0b996789d8c82db0900ca77bc1327438dbe6cd427e71772f1f44118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/engine/src/tools/web_search.rs:965-975 | crates/engine/src/tools/web_search.rs:1058-1068 | crates/engine/src/tools/web_search.rs:1146-1156 | crates/engine/src/tools/web_search.rs:1298-1308 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:965\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f86a677d75ffd56d3efccaaa80dd4af9ac884469f357e1f92ecd82d83be9222"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/workflow/src/lib.rs:1142-1152 | crates/workflow/src/lib.rs:1160-1170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/workflow/src/lib.rs:1142\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/lib.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5583f12a3c088526ae1869d6fb05227913a57cfc367b53182109df91fbae1202"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/plugins/src/registry.rs:2566-2576 | crates/plugins/src/registry.rs:2660-2670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/registry.rs:2566\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/registry.rs"},"region":{"startLine":2566}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb960f6cd4ec318d7307112658c36545cd2d96ca3848125b72233d68968eda9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/workflow/src/lib.rs:1156-1166 | crates/workflow/src/lib.rs:1175-1183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/workflow/src/lib.rs:1156\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/lib.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d70a27e193c04a433d0e73867ebf29d8c8df6602e2be85ea4b17abb324b508e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/session_manager.rs:4829-4839 | crates/engine/src/session_manager.rs:6216-6226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_manager.rs:4829\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":4829}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6f7a2c4656f0b72d13244d302068bdcd368848d4ee1978650de42b5aea7193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/web_search.rs:3392-3402 | crates/engine/src/tools/web_search.rs:3407-3417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:3392\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":3392}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f72c4cc650300e37e0a010cc8a49c88b982c5ed5feb8beb98762b62f536262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 19): crates/runtime/src/config.rs:8309-8314 | crates/runtime/src/config.rs:8316-8321 | crates/runtime/src/config.rs:8323-8328 | crates/runtime/src/config.rs:8363-8368 | crates/runtime/src/config.rs:8370-8377 | crates/runtime/src/config.rs:8379-8384 | crates/runtime/src/config.rs:8386-8391 | crates/runtime/src/config.rs:8401-8406 | crates/runtime/src/config.rs:8416-8421 | crates/runtime/src/config.rs:8423-8428 | crates/runtime/src/config.rs:8438-8443 | crates/runtime/src/config.rs:8445-8450 | crates/runtime/src/config.rs:8452-8457 | crates/runtime/src/config.rs:8459-8464 | crates/runtime/src/config.rs:8466-8471 | crates/runtime/src/config.rs:8473-8483 | crates/runtime/src/config.rs:8485-8492 | crates/runtime/src/config.rs:8517-8522 | crates/runtime/src/config.rs:8526-8531 \u2014 all 19 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config.rs:8370\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/runtime/src/config.rs:8431\u0060 calls \u0060or_else\u0060 and \u0060crates/runtime/src/config.rs:8317\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8309}}}],"partialFingerprints":{"codehealthFindingId/v1":"33df03904ee4968125b1d7bfa1f95576d7baa54035ea1981e379ac32c6a03457"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/extension_host/skills.rs:221-231 | crates/engine/src/extension_host/skills.rs:241-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/skills.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"545dff491bb334e33578d251d26a21d49d87edd02a77ae6ac4a1d3694eac0293"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/ui/session_state.rs:428-438 | crates/tui/src/tui/ui/session_state.rs:454-464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/session_state.rs:428\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/session_state.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c2e23241d7272d7a79965088d3a8f75cf18b648f1a2bb9f9d80704282a1de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/tools/workflow_plan_approval.rs:219-229 | crates/engine/src/tools/workflow_plan_approval.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/workflow_plan_approval.rs:219\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow_plan_approval.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f402c3aa469a43ee19f578492161e9797cfb1d698d2bde8933486885bf66b521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/engine/src/tools/git_history.rs:240-250 | crates/engine/src/tools/git_history.rs:375-385 | crates/engine/src/tools/git_history.rs:508-518 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/git_history.rs:240\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_history.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8cfbac6f81f26f0fd254c61505926f079b8a4462898e7b4075ee4c229a314e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/tui/history/latex_render.rs:828-837 | crates/tui/src/tui/history/latex_render.rs:856-866 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/history/latex_render.rs:828\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"39287dfe925ce38eca28bbc697aae20ce1a13cfa722c13be05cab2af8d075eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/app-server/src/runtime_api.rs:11676-11686 | crates/app-server/src/runtime_api.rs:11695-11705 | crates/app-server/src/runtime_api.rs:11720-11730 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:11676\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11676}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e942b2ce8fd6f8409f71fdc5f4777c51188425dd5a51afba2e6de0f92599cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/tui/views/fleet_detail.rs:700-710 | crates/tui/src/tui/views/fleet_detail.rs:717-727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/views/fleet_detail.rs:700\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1a3b17f4b27c5592d5e7cd439813778c938a9b345304bc1a64c88a8c859426"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/tui/src/commands/config_group.rs:86-96 | crates/tui/src/commands/debug_group.rs:63-67 | crates/tui/src/commands/session_group.rs:67-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/config_group.rs:86\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tui/src/commands/session_group.rs:64\u0060 calls \u0060expect\u0060 and \u0060crates/tui/src/commands/debug_group.rs:60\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_group.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3303bbeac29797fa4ff8d8d983008410c7fac02cd557591921d0d0e6cfab670"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/tui/src/commands/contract/debug_operations.rs:391-401 | crates/tui/src/commands/contract/debug_operations.rs:457-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract/debug_operations.rs:391\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/debug_operations.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e1d5aa22e14bf849837533061fe68c323d114cf68f29465f76ef88f65946f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): crates/engine/src/tools/web_search.rs:761-767 | crates/engine/src/tools/web_search.rs:1394-1401 | crates/engine/src/tools/web_search.rs:1501-1508 | crates/engine/src/tools/web_search.rs:1624-1633 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:761\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e12a147334096b26cd56733aa6a9a188f01874e5d62a951ee9510ffea1419e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/core/engine/turn_loop.rs:3497-3506 | crates/engine/src/core/engine/turn_loop.rs:3524-3532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/core/engine/turn_loop.rs:3497\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":3497}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a07a6882bba7858b084bd279d672abd3c521e3e22af147fcce268128f73594e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/engine/src/tools/git_history.rs:239-248 | crates/engine/src/tools/git_history.rs:374-383 | crates/engine/src/tools/git_history.rs:507-516 | crates/engine/src/tools/git_history.rs:626-635 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/git_history.rs:239\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_history.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e550161928fc555748d98010e31b26de03a81bc01627c67f6beab0acb2a47f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/cli/src/lib.rs:5005-5014 | crates/cli/src/lib.rs:5018-5027 | crates/cli/src/lib.rs:5030-5039 | crates/cli/src/lib.rs:5042-5051 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":5005}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e62e97877b9e9248e57d82db153bb91ef73eaa96c1d601670e7a021844cc1c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/web_search.rs:618-627 | crates/engine/src/tools/web_tool.rs:125-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:618\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a013248184ab4bfdf51aca4386d6812fc5b7f2423d83bebad4a317c03b2ac10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/runtime/src/config.rs:8533-8540 | crates/runtime/src/config.rs:8542-8551 | crates/runtime/src/config.rs:8553-8560 | crates/runtime/src/config.rs:8562-8569 | crates/runtime/src/config.rs:8588-8595 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config.rs:8542\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8533}}}],"partialFingerprints":{"codehealthFindingId/v1":"3065a13f3c2e7b35ee777168d73eeba94f3eaf97868964c1acb581989cc26fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/web_run.rs:712-719 | crates/engine/src/tools/web_run.rs:754-763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_run.rs:712\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"f237e8bd8e91aa71bc34ed44434e8dec755b62651007943d1da50ff362c265fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/tui/ui/dispatch.rs:578-587 | crates/tui/src/tui/ui/dispatch.rs:1415-1424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/dispatch.rs:578\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/dispatch.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e6a9a7beaa8c0e9cba54108483bfe2e9aea62e355fed43b1aa60cc295d940c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app-server/src/stdio.rs:1070-1079 | crates/app-server/src/stdio.rs:1086-1095 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/stdio.rs:1070\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/stdio.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8d9ca76e71ea39b67ed1d11585c43fb6c019973af21c4a50fdc829c1bf1463"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/hooks/executor.rs:2551-2560 | crates/engine/src/hooks/executor.rs:2579-2588 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/hooks/executor.rs:2551\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/hooks/executor.rs:2590\u0060 calls \u0060collect_reader\u0060 and \u0060crates/engine/src/hooks/executor.rs:2562\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":2551}}}],"partialFingerprints":{"codehealthFindingId/v1":"98148b19820f78c218d80ef1a7651dee7deaeb4675ef3e0a8502ca6e605c97ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/session_manager.rs:4120-4129 | crates/engine/src/session_manager.rs:4163-4172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_manager.rs:4120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/session_manager.rs:4130\u0060 calls \u0060as_deref\u0060, \u0060Some\u0060 and \u0060crates/engine/src/session_manager.rs:4173\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":4120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6fc915ec3d22a6ca05dbbc90e6f9ded29752abca73a6fa8181f146efd3b5cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/engine/src/tools/git.rs:238-245 | crates/engine/src/tools/git_history.rs:130-139 | crates/engine/src/tools/git_history.rs:250-256 \u2014 before extracting anything, compare \u0060crates/engine/src/tools/git.rs\u0060 and \u0060crates/engine/src/tools/git_history.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/git.rs:238\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/tools/git_history.rs:259\u0060 calls \u0060Some\u0060 and \u0060crates/engine/src/tools/git.rs:247\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1860c98e291d2aa5fab21b4596c34f88947fabf09f5ba3a3362dea08cc6edce8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:13530-13539 | crates/engine/src/tools/subagent/mod.rs:13562-13571 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":13530}}}],"partialFingerprints":{"codehealthFindingId/v1":"781bd111fa44521d41c6e01ae7586842478c9c77d2fdc58df78f2a49e26094a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:1824-1833 | crates/engine/src/tools/subagent/mod.rs:1837-1846 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/mod.rs:1824\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"937b64ad05002b6f83d993890695b1a9c31d2be0d51da92e7614c0ca9e9fd085"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/engine/src/tools/web_search.rs:885-894 | crates/engine/src/tools/web_search.rs:1410-1417 | crates/engine/src/tools/web_search.rs:1517-1522 | crates/engine/src/tools/web_search.rs:1642-1649 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:885\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"93868102d85e406066543c068bb80a6d54075e87bed5cec108244c999052bcbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/web_run.rs:1157-1166 | crates/engine/src/tools/web_run.rs:1193-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_run.rs:1157\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc40308d91103b9855ac51ecaab8854669c2ad4418ad2a80fdad2fc438661f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/engine/src/tools/session.rs:64-73 | crates/tui/src/tui/agent_focus.rs:452-461 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060message\u0060 to \u0060\u0026codewhale_models::Message\u0060 in one and \u0060\u0026Message\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/session.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"65130e9241e9c94a36a3798a0f89a2819bcb42f16721b5be8052f13f34c1f3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app-server/src/runtime_api/thread_history.rs:579-587 | crates/app-server/src/runtime_api/thread_history.rs:948-956 \u2014 both copies are in the same file, so extract the block 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/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f26bcb436b794d725728da8ea98c35780579f0322c4c9dc4dcc8cd7c3277afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/tui/feedback_picker.rs:134-142 | crates/tui/src/tui/views/mode_picker.rs:139-147 \u2014 before extracting anything, compare \u0060crates/tui/src/tui/feedback_picker.rs\u0060 and \u0060crates/tui/src/tui/views/mode_picker.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/feedback_picker.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7722bf7bf4cea9d1d9abf4680d71a896e60b53e0c722018e083ee5deed19b1b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/plugins/src/manifest.rs:1604-1612 | crates/plugins/src/registry.rs:2527-2534 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a22c3a711fff0cf0e44e8fcd946e511d7cf153c877595d79ee3dbf9a52b885"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:13119-13127 | crates/engine/src/runtime_threads/manager.rs:13151-13159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads/manager.rs:13119\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13119}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe681f4dbe1f1de82a694ab8ce3b63ef9fcb5174c32aa81b879da1dc35a44b09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app-server/src/runtime_api/git.rs:1333-1341 | crates/app-server/src/runtime_api/git.rs:1364-1372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/git.rs:1333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/app-server/src/runtime_api/git.rs:1362\u0060 calls \u0060push\u0060 and \u0060crates/app-server/src/runtime_api/git.rs:1331\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/git.rs"},"region":{"startLine":1333}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6c78dc640f42b85ba0db919f78139724a6e1fc9033c63d09935c4c3310b675"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/engine/src/client/provider_native_search.rs:563-571 | crates/engine/src/client/provider_native_search/kimi.rs:273-281 | crates/engine/src/client/provider_native_search/zai.rs:27-35 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/provider_native_search.rs:563\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3711f9767e4ea9402755f5fc925ff51ee1fdd913f6dc0d26909e9df6392e40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app-server/src/stdio.rs:1045-1053 | crates/app-server/src/stdio.rs:1056-1064 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/stdio.rs:1045\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/stdio.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"e749054d364e78a1b94121a2ea45a35b1d46b9a2d071d3036a08349f49d2edb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app-server-protocol/src/codegen/mod.rs:495-503 | crates/app-server-protocol/src/codegen/mod.rs:670-678 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server-protocol/src/codegen/mod.rs:495\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/codegen/mod.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b2f866c7c10c561bf56977813f3a74f0e35c3ddb54692e8a6caa2e6652938e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/runtime/src/config.rs:8600-8606 | crates/runtime/src/config.rs:8619-8625 | crates/runtime/src/config.rs:8648-8656 | crates/runtime/src/config.rs:8677-8683 | crates/runtime/src/config.rs:8696-8702 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config.rs:8648\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8600}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac478c6c471e8c261ea3979bd1e334af5998336422c986748e021b7a75ddb496"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/tui/setup/mod.rs:4156-4164 | crates/tui/src/tui/setup/mod.rs:4191-4199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/setup/mod.rs:4156\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/setup/mod.rs"},"region":{"startLine":4156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0de08507e4cfa0761d80197e7d4f508ef860b6b9190861b1fcbac562e99319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/snapshot/src/repo.rs:1567-1575 | crates/snapshot/src/repo.rs:2095-2103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/snapshot/src/repo.rs:1567\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"38023fb20c996c8850044ba30de77eff983f7a17a3e1c6bca83071a35ef117ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/engine/src/tools/git_history.rs:834-840 | crates/engine/src/tools/review.rs:1996-2004 | crates/engine/src/tools/review.rs:2019-2025 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/review.rs:1996\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_history.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0916c02e55662a8372b569ecb4c79c48024a64f487968407f0af35c9d4b8ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/commands/contract.rs:365-372 | crates/tui/src/commands/contract.rs:1264-1272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:365\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/tui/src/commands/contract.rs:1273\u0060 calls \u0060control\u0060 and \u0060crates/tui/src/commands/contract.rs:373\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a5e131427747988e9eef7935c64f51fa7fbf51dd9b2e88b896ae1c14fc0b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/subagent/coord/ledger.rs:1319-1327 | crates/workflow-js/src/vm.rs:1376-1381 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/subagent/coord/ledger.rs:1319\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd5422e44a1ae1556b9041d31d5f52246cfe5985aa5ce5b4321b50382dcfcd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 17): crates/runtime/src/config.rs:8609-8615 | crates/runtime/src/config.rs:8628-8634 | crates/runtime/src/config.rs:8637-8643 | crates/runtime/src/config.rs:8659-8665 | crates/runtime/src/config.rs:8668-8674 | crates/runtime/src/config.rs:8686-8692 | crates/runtime/src/config.rs:8705-8711 | crates/runtime/src/config.rs:8714-8720 | crates/runtime/src/config.rs:8723-8729 | crates/runtime/src/config.rs:8732-8738 | crates/runtime/src/config.rs:8741-8747 | crates/runtime/src/config.rs:8750-8756 | crates/runtime/src/config.rs:8759-8765 | crates/runtime/src/config.rs:8768-8776 | crates/runtime/src/config.rs:8779-8787 | crates/runtime/src/config.rs:8790-8796 | crates/runtime/src/config.rs:8799-8805 \u2014 all 17 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config.rs:8768\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8609}}}],"partialFingerprints":{"codehealthFindingId/v1":"380ee737a68f97629c36fc0232118fbbec585f56b1213af2487b865f2f5c7352"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/cost_status.rs:127-135 | crates/engine/src/session_manager.rs:1969-1977 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/cost_status.rs:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c140a0d57c4f0cf537d6e7b77a02f308fa691360ecc28c47cb2d223970920c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/tui/src/lib.rs:11124-11132 | crates/tui/src/lib.rs:11146-11154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/lib.rs:11124\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":11124}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5774d6c1823e79b0fb3308ca5c4b81be9b260fb96996034a4fb230247ce8aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/extension_host/windows.rs:357-365 | crates/engine/src/extension_host/windows.rs:575-583 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/extension_host/windows.rs:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd5dbfbd6103d404c20f2b5fcf88c7516725ecd9b658bbcb347eb43caf3b1f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/engine/src/tools/git_history.rs:703-711 | crates/engine/src/tools/git_history.rs:735-743 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/git_history.rs:703\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_history.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b997cae535d86c8aebb2d3d15eddda68c4298add49ab9e73d7d19871c8e1c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/workflow/src/named_fleet.rs:231-239 | crates/workflow/src/reasoning_router.rs:212-220 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/workflow/src/named_fleet.rs:231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/named_fleet.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35c98c1517617f5370643381825d0283a1709a5c1f5c16b93d1c751a88d0821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/engine/src/tools/git_history.rs:122-127 | crates/engine/src/tools/git_history.rs:239-246 | crates/engine/src/tools/git_history.rs:374-381 | crates/engine/src/tools/git_history.rs:507-514 | crates/engine/src/tools/git_history.rs:626-633 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/git_history.rs:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/git_history.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1956371b316142142874fa4706c994bf873d28bd4c603b5187adb0717ea28b5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/workflow-js/src/vm.rs:788-795 | crates/workflow-js/src/vm.rs:803-810 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/workflow-js/src/vm.rs:788\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/vm.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b7f0d11ae47b6429350c0911f55eb067dba08900264990bf7c59a9db28187a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/tui/src/commands/groups/project/init.rs:247-251 | crates/tui/src/commands/groups/project/init.rs:256-260 | crates/tui/src/commands/groups/project/init.rs:269-276 | crates/tui/src/commands/groups/project/init.rs:309-313 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/project/init.rs:247\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/project/init.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc44564a19aaa4cdfb7bf60ee85f20cd8e45a7cb71f072dd696fbb9b609baf05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/app-server/src/remote_setup/mod.rs:259-266 | crates/tui/src/lib.rs:11298-11305 \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/app-server/src/remote_setup/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbcfef61a0f70adf80774e07a81c49ff4c5ed136900db28e96a1ae709aa02f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/client/provider_native_search/kimi.rs:85-92 | crates/engine/src/client/provider_native_search/kimi.rs:163-170 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/provider_native_search/kimi.rs:85\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search/kimi.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba9ca3e58869bd793c1f537999aedbdc904d05392569ca63d41cdb834d84e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/commands/src/debug/tokens.rs:459-466 | crates/commands/src/debug/undo.rs:95-100 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/commands/src/debug/tokens.rs:459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/tokens.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce8521cc2c1bf565451aae99a430ecb1a9ee03a414fae8486b51e644822da0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/config/src/private_directory.rs:1478-1485 | crates/engine/src/runtime_threads.rs:5846-5850 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/private_directory.rs:1478\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ad01ca34ee8f8b83d80d5ab7b1b90d90e584c1bba2658816ed767ef2bb7b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/image_ocr.rs:316-323 | crates/engine/src/tools/pdf.rs:237-243 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/image_ocr.rs:316\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060result\u0060 to \u0060ToolResult\u0060 in one and \u0060super::spec::ToolResult\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/image_ocr.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edc09c878e9212e42716efb48db39473ac0e593b698e9d6eece31d622f4d73b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/runtime_threads/manager.rs:19836-19843 | crates/util/src/utils.rs:814-821 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":19836}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d94a8dd7316536c5f897a72e4f1083b8f823d411277ea35a6436a7eab952c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/automation_manager.rs:3216-3223 | crates/engine/src/automation_manager.rs:3579-3584 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/automation_manager.rs:3216\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07fa9541aed2afc141d1e3b8ff3311e0dbb82d9a52815fbfa19d433b158ba29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/provider_catalog_live.rs:748-755 | crates/runtime/src/skill_state.rs:259-266 \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/engine/src/provider_catalog_live.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2725916d75a8f578e1cd0500c2eaaa6cbc21557c4a52858c7ecb7ec0c44ec8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/core/engine.rs:8720-8727 | crates/engine/src/core/engine.rs:8748-8755 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":8720}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb12d561551f69fe1abb04d7a65ec30234440c2dff58d4eb89ef733ec125c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/commands/src/diagnostics_reports/tool_snapshot.rs:136-143 | crates/commands/src/diagnostics_reports/tool_snapshot.rs:181-188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/commands/src/diagnostics_reports/tool_snapshot.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/diagnostics_reports/tool_snapshot.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c39cbd24642d2f7fdc15b541a096297d8a2b48c53b9f4e754082011ea5be168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/runtime_threads.rs:1908-1915 | crates/engine/src/runtime_threads.rs:1930-1937 \u2014 both copies are in the same file, so extract the block 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/engine/src/runtime_threads.rs"},"region":{"startLine":1908}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f7ebaeaff9c39c9e41e770393405f22d40fad73116bb4b4baf4980fb156843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/tui/history/latex_render.rs:38-45 | crates/tui/src/tui/history/latex_render.rs:76-83 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/history/latex_render.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"808efef4c30b7122e02e6338f0c7d3cfc1fccd6396fd52ed5d15bbf3abacff7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/review_core.rs:270-274 | crates/engine/src/tools/review_core.rs:318-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/review_core.rs:270\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a86a2b051be2c1ceed67bd80c412f23b2d9addc47a926dc54150793f887655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/lib.rs:8781-8788 | crates/tui/src/lib.rs:8792-8799 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/lib.rs:8781\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":8781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5fe44ffd7da28f1d30765f6c3d5c840b7acaf45b4e5623f8773e1a28a8cf71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/tools/subagent/mod.rs:18617-18624 | crates/engine/src/tools/subagent/mod.rs:18632-18639 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":18617}}}],"partialFingerprints":{"codehealthFindingId/v1":"70daab407454790f86a8be122fe36a660b51e666a60a31876892e36e145731cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/engine/src/automation_manager.rs:3215-3222 | crates/engine/src/automation_manager.rs:3364-3368 | crates/engine/src/automation_manager.rs:3578-3583 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8681b725d85a83b9c8cb05402d68ab2c6e052f97103ec490a79d27347738eb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/app-server/src/stdio.rs:905-912 | crates/app-server/src/stdio.rs:1008-1015 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/stdio.rs:905\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/stdio.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"851ab8480b1e135d5fce4a3870bb7e830df124456b73ec3f230389e7ddc5b9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/plugins/src/install/dsh.rs:820-827 | crates/plugins/src/install/dsh.rs:840-847 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/install/dsh.rs:820\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/dsh.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abc9e921ceb4c8132eb4a9ae094ef97881d8ea1f3329410c62594d70cd3fe76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/app-server/src/exec_agent.rs:3349-3356 | crates/engine/src/client.rs:3125-3132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/exec_agent.rs:3349\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":3349}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b72860e6e933964206aaec2aee7dbe365415b5ee77954e7ab22526811736080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/tui/src/commands/groups/session/export.rs:860-869 | crates/tui/src/commands/groups/session/export_html.rs:113-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/session/export.rs:860\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/export.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72492c5dddc831e700483b9d6c9017a5d63e6ad9bd136493a1dfcd9eb286e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/tui/src/commands/groups/project/init.rs:247-251 | crates/tui/src/commands/groups/project/init.rs:256-260 | crates/tui/src/commands/groups/project/init.rs:269-276 | crates/tui/src/commands/groups/project/init.rs:281-285 | crates/tui/src/commands/groups/project/init.rs:309-313 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/project/init.rs:247\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/project/init.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"be88c6c9b92830b818a98302896f164b5bf578abddcb585e10dca11194177baa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/tui/src/tui/ui/activity_detail.rs:1705-1711 | crates/tui/src/tui/ui/activity_detail.rs:1722-1729 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/ui/activity_detail.rs:1705\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/activity_detail.rs"},"region":{"startLine":1705}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43aa16687c02deb7cc46e59b11b821bbfac17b874b1b8a22733ad621c4dacd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/extension_host/dsh_network.rs:425-432 | crates/engine/src/extension_host/dsh_network.rs:443-450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da8b60050d6e9357580dd3e267b8f64ba0a673796ff0ef4013c1acc4e7142d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/commands/config_group.rs:28-35 | crates/tui/src/commands/core_navigation_host.rs:25-32 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_group.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26a20df74e1790e61714a6f3613c94d81b89054efc513322d8effd93cd02ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/tui/src/commands/groups/config/permissions.rs:36-43 | crates/tui/src/commands/groups/config/status.rs:41-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/config/permissions.rs:36\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/permissions.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"184659645c3194e76642061d47d2191049bba8a65af1d88e8feb615a51f97d35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/lane/src/registry.rs:332-338 | crates/lane/src/registry.rs:434-440 | crates/runtime/src/continual_harness.rs:374-378 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/lane/src/registry.rs:332\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/registry.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13b9490d70e2b0cd32d4b0de358eac85c96a675898aae83812126e1a8427c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/workflow/mod.rs:5480-5486 | crates/workflow/src/lib.rs:1009-1015 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/workflow/mod.rs:5480\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060execution\u0060 to \u0060\u0026mut IrWorkflowExecution\u0060 in one and \u0060\u0026mut WorkflowExecution\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":5480}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfada849f685401df71a5bcb3e04ed88b760b03032e515bec04afdca1433b52b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app-server/src/runtime_api.rs:5256-5262 | crates/app-server/src/runtime_api.rs:5279-5283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:5256\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":5256}}}],"partialFingerprints":{"codehealthFindingId/v1":"205c7ebe4021a14cd3295178ae4386f391c9a9068d7724edbefa9f98f32f27c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/runtime/src/config/paths.rs:161-167 | crates/runtime/src/config/paths.rs:178-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config/paths.rs:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config/paths.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"932b483454e6154815e4648924f23fa51bde33b0df7c4631a3ccb7b22ac8bd74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/github/cli.rs:70-76 | crates/engine/src/tools/tasks.rs:1330-1336 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/cli.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2bdf47a8f318334bdbf73c1a16688281c448b5f60cd5745f21760ecfa8acca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/client/provider_native_search.rs:448-453 | crates/engine/src/client/provider_native_search.rs:520-526 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/provider_native_search.rs:448\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edc6406898392e43d6957bcdf41cca0ffe9ba6652b6b8a57b8dd5a69065ab9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app-server/src/runtime_api.rs:11656-11662 | crates/app-server/src/runtime_api.rs:11664-11669 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:11656\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11656}}}],"partialFingerprints":{"codehealthFindingId/v1":"57de87efa19820e3a5d98eb7889da022008484a4922f4303c9f9c5e67975fee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/session_reconcile.rs:394-400 | crates/engine/src/session_reconcile.rs:466-472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_reconcile.rs:394\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_reconcile.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2a51c5bbfdaa06d9e10340cac12aa455069cc26a5b8d0af0a737db703a168d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/engine/src/tools/web_search.rs:2912-2918 | crates/engine/src/tools/web_search.rs:2955-2961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:2912\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2912}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aafe5e48a96880cf4b826ef2c425534f83974b405eb3c7c14d52c8979a2d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/workflow-js/src/vm.rs:715-721 | crates/workflow-js/src/vm.rs:937-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/workflow-js/src/vm.rs:715\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow-js/src/vm.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"979b2a3da21abcab62ff7206fd15d20a5b29d9c46cc2e39ebe10cba9fc26f276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/snapshot/src/repo.rs:630-636 | crates/snapshot/src/repo.rs:650-656 \u2014 both copies are in the same file, so extract the block 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/snapshot/src/repo.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb821af0fde0530678b80849326ef849e3638ba10225608d4c4490229ee8f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/core/engine/turn_loop.rs:3904-3909 | crates/engine/src/core/engine/turn_loop.rs:3950-3955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":3904}}}],"partialFingerprints":{"codehealthFindingId/v1":"e390866b2ecf93ddad7ff1818b70893f5b9e1f6e606a6464beb88ab505486517"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/review.rs:451-456 | crates/engine/src/tools/review.rs:469-474 \u2014 both copies are in the same file, so extract the block 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/engine/src/tools/review.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"271026c915c13acbdfb29bf30a7bb3e713c4ae9bcb022fd35d0678ab868ce41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app-server/src/runtime_api.rs:11311-11316 | crates/app-server/src/runtime_api.rs:11386-11391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api.rs:11311\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11311}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf4809766d6915c86ccd2f877daf4112ecc918bf4726e9502ad8b1048a0dc0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/runtime/src/native_memory.rs:138-143 | crates/runtime/src/native_memory.rs:217-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/native_memory.rs:138\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/native_memory.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb46321680090c389b120927035d768fad7db84f79c0b0062513d1c9384c0cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/integrations/dsh/mod.rs:620-625 | crates/tui/src/integrations/dsh/mod.rs:926-931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/integrations/dsh/mod.rs:620\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/tui/src/integrations/dsh/mod.rs:923\u0060 calls \u0060Some\u0060 and \u0060crates/tui/src/integrations/dsh/mod.rs:617\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/mod.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6780ce988e3da244d138a857450d6a11b3ba4ef6ed71ababe96fcd00b13923a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/runtime/src/oauth.rs:4158-4163 | crates/runtime/src/oauth.rs:4170-4175 \u2014 both copies are in the same file, so extract the block 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/runtime/src/oauth.rs"},"region":{"startLine":4158}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a402066533fab0aeafaef4b3e7660edbe0a8541972d9af1226efb94fe1a049"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/commands/groups/memory/note.rs:135-140 | crates/tui/src/commands/groups/memory/note.rs:179-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/groups/memory/note.rs:135\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/memory/note.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"06992e69649e710cfad46f9a41605ec170bec53a42b4122e48e7dc9fd2a0aeb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/app-server/src/remote_control.rs:3423-3428 | crates/app-server/src/runtime_chat_relay.rs:1666-1671 | crates/app-server/src/runtime_chat_relay.rs:1705-1710 \u2014 before extracting anything, compare \u0060crates/app-server/src/remote_control.rs\u0060 and \u0060crates/app-server/src/runtime_chat_relay.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":3423}}}],"partialFingerprints":{"codehealthFindingId/v1":"76861f474d9a224ec75730548246c5d55dba115c0034703023ea50aaae1487a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/engine/src/tools/file.rs:796-801 | crates/engine/src/tools/file.rs:803-808 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/file.rs:796\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"eceb886ab4a6f00fc4c29c34cc168d7c3799143dc78f88fd833954f2265d606d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/tui/src/commands/config_main_host.rs:2123-2128 | crates/tui/src/commands/config_main_host.rs:2196-2201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/config_main_host.rs:2123\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/config_main_host.rs"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7a9ef541005b39f5450353de4ce5ff9e97b17c6a74cc31f243b738a993bb7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/runtime/src/config.rs:8332-8336 | crates/runtime/src/config.rs:8347-8352 | crates/runtime/src/config.rs:8356-8361 | crates/runtime/src/config.rs:8395-8399 | crates/runtime/src/config.rs:8410-8414 | crates/runtime/src/config.rs:8431-8436 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/runtime/src/config.rs:8347\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/runtime/src/config.rs:8346\u0060 calls \u0060or_else\u0060 and \u0060crates/runtime/src/config.rs:8430\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a43b40045c93ea2ecf4eb9a04881bf9b7e30483820238e09001e48d4d157662"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/engine/src/tools/speech.rs:192-197 | crates/engine/src/tools/speech.rs:200-205 | crates/engine/src/tools/verify.rs:399-404 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/speech.rs:192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/speech.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f1a0a98df2a51ebce2d5a835b93d663e968e3a393c89243094b222a601d701"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/config/src/persistence.rs:118-123 | crates/runtime/src/settings.rs:2571-2576 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/persistence.rs:118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/persistence.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b63bfbc804cb0dd99f27e494796f8be84d55ea4c9fbb14ef44d6e7a3341c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/skills/src/mutation.rs:936-941 | crates/skills/src/mutation.rs:1669-1674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/skills/src/mutation.rs:936\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/mutation.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"9200bca7920c9730c8c6b030f030829a816c02b9d3abe4033ccc5cb2e0f23954"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/plugins/src/manifest.rs:469-474 | crates/plugins/src/manifest.rs:1045-1050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/plugins/src/manifest.rs:469\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5b87d19406270cfbfe7f621d06eea49ab13ac12efdb82da177bbac826540b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/config/src/private_directory.rs:1904-1909 | crates/engine/src/tools/github/report.rs:1304-1308 \u2014 before extracting anything, compare \u0060crates/config/src/private_directory.rs\u0060 and \u0060crates/engine/src/tools/github/report.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/config/src/private_directory.rs:1904\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":1904}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c508511fa59395f6ae5d788773fc56d15d70cfeb04c38eca546959afe94aef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/core/engine/tool_catalog.rs:1400-1404 | crates/engine/src/core/engine/tool_catalog.rs:1405-1409 \u2014 both copies are in the same file, so extract the block 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/engine/src/core/engine/tool_catalog.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fa1c7d4d9954e3c5db5024349bbe7c080851cb6324387d36d3854b86796930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app-server-protocol/src/bin/contract.rs:8-12 | crates/app-server-protocol/src/bin/export.rs:21-25 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server-protocol/src/bin/contract.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5a60be66f1d30c668950afbbc5f062888cc2496b539823c19725a9a67e3c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/commands/contract.rs:1320-1324 | crates/tui/src/commands/contract.rs:1509-1513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/commands/contract.rs:1320\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce0bcfcc6508d31628eb03a074dc882d23f02816593cd7147fc0c305b2050b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/tui/ui/apply.rs:1500-1504 | crates/tui/src/tui/ui/apply.rs:1512-1516 \u2014 both copies are in the same file, so extract the block 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/tui/src/tui/ui/apply.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"16000a71a4ea346ba59c545c05d79550c7be9ada196ff3ef1382e90964731974"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/runtime_threads.rs:4290-4294 | crates/tui/src/lib.rs:2279-2283 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/runtime_threads.rs:4290\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":4290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da5caf79389d5c6816f609adbfbabe065b28fc6c25694f43bc6c51897e2a4cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/engine/src/tools/web_search.rs:2907-2911 | crates/engine/src/tools/web_search.rs:2930-2934 | crates/engine/src/tools/web_search.rs:2950-2954 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/web_search.rs:2907\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1baca53ab599ce742ca275023a20328adafb7ff3dadfdbc74dc1c6829d5f666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app-server/src/runtime_api/auth.rs:159-163 | crates/app-server/src/runtime_api/auth.rs:164-168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/auth.rs:159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/auth.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed957af516cae1cde1811634e55916dd0fa82ce8e064b1cbba8fa2c1a145eee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/tui/src/tui/history/latex_render.rs:890-894 | crates/tui/src/tui/history/latex_render.rs:908-912 | crates/tui/src/tui/history/latex_render.rs:927-931 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/history/latex_render.rs:890\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e91e8f3f07c7469408271c26a05db51ef2f71566ffc89b5dad487ee618f02b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/models/src/schema_sanitize.rs:1509-1513 | crates/models/src/schema_sanitize.rs:1524-1528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/models/src/schema_sanitize.rs:1509\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/models/src/schema_sanitize.rs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bca751cb7888207a6642e2dce717ee2618c8d26bcf0e9bd902a9db26df6280a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/app-server/src/mcp_server.rs:264-268 | crates/app-server/src/runtime_api.rs:6004-6008 | crates/app-server/src/runtime_api.rs:10026-10030 | crates/app-server/src/runtime_api/constitution.rs:27-31 | crates/app-server/src/runtime_api/external_agents.rs:332-336 | crates/app-server/src/runtime_api/turn_artifacts.rs:418-422 \u2014 there are 6 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/mcp_server.rs:264\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/mcp_server.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"004ec5d3cb7aa2b2f6e858da8b27b93d7ceeacc79c4f013a0ec975709ab82f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app-server/src/remote_control.rs:346-351 | crates/app-server/src/runtime_chat_relay.rs:1866-1871 \u2014 before extracting anything, compare \u0060crates/app-server/src/remote_control.rs\u0060 and \u0060crates/app-server/src/runtime_chat_relay.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/remote_control.rs:346\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a08bf9cb8ca81c13845a2be45a68b842b4a0f4e08479a24691845b7ced6d362"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app-server/src/runtime_api/sessions.rs:159-163 | crates/app-server/src/runtime_api/sessions.rs:187-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app-server/src/runtime_api/sessions.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/sessions.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1fd7dfed551e67978bd7419ab787fe7bfdec00d4805581d9267f9c17426b2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app-server/src/runtime_api/sessions.rs:325-329 | crates/app-server/src/runtime_api/sessions.rs:1320-1324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/app-server/src/runtime_api/sessions.rs:323\u0060 calls \u0060Query\u0060 and \u0060crates/app-server/src/runtime_api/sessions.rs:1318\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/sessions.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b64d37fc25e31e9810265aeac625d37aa80f5e741f5efbad3f9544a709424e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/cli/src/lib.rs:3377-3381 | crates/cli/src/lib.rs:4358-4362 \u2014 both copies are in the same file, so extract the block 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/cli/src/lib.rs"},"region":{"startLine":3377}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7fc72e469d2e8ad354c097d1e0e050d3ae1e8ccec2d642294eca8af9b0e63c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/core/events.rs:1233-1237 | crates/models/src/tool_projection.rs:22-26 \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/engine/src/core/events.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30c16ef1bf3a68d8ab720a7fcb8d941774db9b55b91a57c36583437bfeccbd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/engine/src/tools/automation.rs:622-626 | crates/engine/src/tools/automation.rs:655-659 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/tools/automation.rs:622\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/automation.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"031d9c1c1de223ac676c7d7368d1523e8321b8604bd8d598b1998ccfc3b599c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/plugins/src/registry/gc.rs:786-790 | crates/plugins/src/registry/gc.rs:836-840 \u2014 both copies are in the same file, so extract the block 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/plugins/src/registry/gc.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c79a46700828b8a83c010f1c209c6302603867ddae78f01bb862ef54c5c37c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/integrations/dsh/bundle.rs:334-338 | crates/tui/src/integrations/dsh/bundle.rs:355-359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/integrations/dsh/bundle.rs:334\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/bundle.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1aa47ebebe560c091bc6b317ecf95198dfc30b957a44ff61acba2e3b8d4d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/tui/src/tui/command_palette.rs:802-806 | crates/tui/src/tui/views/help.rs:1038-1042 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/tui/src/tui/command_palette.rs:802\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ad4b342f62a01a8636dceca89256cac75ba126b22ade30de5a9abf379ea6a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): pet/ios/CodewhalePetApp.swift:67-74 | pet/macos/CodewhalePetApp.swift:62-68 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060pet/ios/CodewhalePetApp.swift:67\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/CodewhalePetApp.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc11f4a1ddb77f4e410775a32b6457f4e17ec7cc280425ae06896a80dfde7e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/client/test_cases_01.rs:418-439 | crates/engine/src/client/test_cases_01.rs:445-467 | crates/engine/src/client/test_cases_01.rs:473-495 | crates/engine/src/client/test_cases_01.rs:1628-1650 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4676c3dba47078a6e4af1d25e257c71e047eb08007d4f1428701cae9891fb35"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/client/test_cases_01.rs:911-986 | crates/engine/src/client/test_cases_01.rs:1488-1539 | crates/engine/src/client/test_cases_01.rs:1545-1598 | crates/engine/src/client/test_cases_05.rs:50-145 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a7a0b7ef58e201fb250b20f422f9c3277fb92b91ab9fc08ee842f5af7989e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/engine/src/client/test_cases_05.rs:1224-1242 | crates/engine/src/client/test_cases_05.rs:1271-1289 | crates/engine/src/client/test_cases_05.rs:1291-1309 | crates/engine/src/client/test_cases_08.rs:7-25 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_05.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c510f20bf23ed6643f768468073ed5988ae7de8fa42ded048a4fdb5b0bfa7658"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): scripts/check-command-config-proof.py:58-83 | scripts/check-command-core-navigation-proof.py:65-89 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-command-config-proof.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"201e78970fecd8d725ca001ab44e490e0501577d352bbcd8fa8564b1d682ac3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/engine/src/session_manager/test_cases_02.rs:8-52 | crates/engine/src/session_manager/test_cases_02.rs:59-103 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager/test_cases_02.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2c7b25e70481fb80196f9a64e7c85ba506fafd426f0c9b36e39248968d2355"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/engine/src/client/test_cases_02.rs:336-364 | crates/engine/src/client/test_cases_02.rs:366-395 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_02.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"044df25eb5f3d74f3364852c2808d109ef848056c40ca393e22229d8e2605e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): scripts/check-persistence-backlog-budget.py:444-464 | scripts/check-runtime-contract-budget.py:406-429 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-persistence-backlog-budget.py"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cca25dba4c01877374508f6a297a40d987ffde98f698df7dcd02d8527332da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/engine/src/client/test_cases_02.rs:1222-1241 | crates/engine/src/client/test_cases_02.rs:1508-1526 | crates/engine/src/client/test_cases_03.rs:78-96 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_02.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab2d0bd6d91b381d3665e438e395ab4db8e0d904a60bc2b91184c333e192f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/engine/src/client/test_cases_03.rs:1147-1166 | crates/engine/src/client/test_cases_03.rs:1168-1187 | crates/engine/src/client/test_cases_03.rs:1189-1208 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_03.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"46098e7d61957f266c40aa0a7fb4445d1de05ff61070204971fc2dca3ace677a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): scripts/check-persistence-backlog-budget.py:374-391 | scripts/check-persistence-backlog-budget.py:401-432 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-persistence-backlog-budget.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3c81bf58787ea44c9ba4b1cac78221c8e5def92c947e7ce04da232e6014c7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): scripts/check-command-migration-manifest.py:492-511 | scripts/split/crate_map.py:409-420 | scripts/split/module_graph.py:642-655 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-command-migration-manifest.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f16b1237eb5df9ab06a34d5d6073bde6fd570255b52350c605bae57c1ae479c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): scripts/check-contributor-credit.py:40-53 | scripts/contributor-wall.py:51-59 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-contributor-credit.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"266169afb1fa4841782f9e1b6c779a876bee2f55f1a9285c08028b3a39e2f67c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/sandbox/src/policy.rs:451-466 | crates/sandbox/src/policy.rs:475-490 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sandbox/src/policy.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"100e8d515f0e462edbc4e9e5423e72c81bf94ed3a62361deb6e293e8f1ade142"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/engine/src/client/test_cases_01.rs:500-518 | crates/engine/src/client/test_cases_06.rs:848-862 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7aadaec6d13518e306746e2dc7f3db722886d63c2b139c892564ee10a629a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/sandbox/src/seatbelt.rs:356-364 | crates/sandbox/src/seatbelt.rs:368-376 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sandbox/src/seatbelt.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec1ac4ea513ef3d7629cda0ba0289c82ce729554317765d7631a7ebf47c617c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): scripts/check-command-config-proof.py:124-132 | scripts/check-command-core-navigation-proof.py:136-144 | scripts/check-command-session-proof.py:48-58 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-command-config-proof.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"257f3245644dd6507056862694c3693aa936f210cddf18fd2112e5e6cf58cc75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/engine/src/client/test_cases_03.rs:102-121 | crates/engine/src/client/test_cases_03.rs:123-141 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_03.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc31d4a548a266d3976a9f232575683eb2c42e75cf9537ab3e12b7624ecbab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): scripts/check-command-config-proof.py:51-54 | scripts/check-command-session-proof.py:26-29 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-command-config-proof.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bd1e32fae7648cbd340cd6299e0531b5fd4fcb5ccf1852319ee094126451df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): scripts/check-runtime-contract-budget.py:435-443 | scripts/check-persistence-backlog-budget.py:468-474 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-runtime-contract-budget.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5377165416b4b67dbcf74f12b65335b84dc2cec6ac952c398baa3d32c5ee2ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/tui/src/config_stay_tests/scope.rs:83-99 | crates/tui/src/config_stay_tests/scope.rs:187-199 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/config_stay_tests/scope.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ae51ee85b88b153fb9e857bf59b0505b77350b5bf29c44ab50fa2b6ddbe499"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/sandbox/src/process_hardening.rs:148-158 | crates/sandbox/src/lib.rs:691-698 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sandbox/src/process_hardening.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49a743e184348977127b0f405c9b49559f098b083f35504aefa37c31ec39c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/sandbox/src/seatbelt.rs:569-583 | crates/sandbox/src/windows.rs:38-53 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sandbox/src/seatbelt.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"315bbc507702cddc15f5fb4c84d9aed35b7f961ba8c90752ae272b96b6a4fb1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/engine/src/session_manager/test_cases_02.rs:30-50 | crates/engine/src/session_manager/test_cases_02.rs:81-101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/session_manager/test_cases_02.rs:30\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager/test_cases_02.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e67d88393d1f021eaf3f7246803e4946ded109cf622a7efc2c9d4f25a43cd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/engine/src/client/test_cases_01.rs:1500-1517 | crates/engine/src/client/test_cases_01.rs:1557-1574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_01.rs:1500\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe381aa105cd2e46920c7c4de6194fbaace34723ace4ecee4c4ef6fc03b9b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3): crates/engine/src/client/test_cases_01.rs:966-982 | crates/engine/src/client/test_cases_01.rs:1521-1537 | crates/engine/src/client/test_cases_01.rs:1577-1593 \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/engine/src/client/test_cases_01.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e9b8ce6178e9f93824e5d608da8841f9aa84cc85df7ef91cddfb22b833df03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): crates/engine/src/client/test_cases_01.rs:922-938 | crates/engine/src/client/test_cases_05.rs:79-91 \u2014 before extracting anything, compare \u0060crates/engine/src/client/test_cases_01.rs\u0060 and \u0060crates/engine/src/client/test_cases_05.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_01.rs:922\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"3212350865dd289e82255cb22af7dbcd1abf8e0ae7ebc14d785ffe6872d7d0ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/engine/src/client/test_cases_02.rs:346-360 | crates/engine/src/client/test_cases_02.rs:379-392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_02.rs:346\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/engine/src/client/test_cases_02.rs:344\u0060 calls \u0060Some\u0060 and \u0060crates/engine/src/client/test_cases_02.rs:377\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_02.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"11890f36ba70c9bdecd781e9e4d0864da796c4e569b590d08fb9a32e270db69e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/sandbox/src/policy.rs:453-466 | crates/sandbox/src/policy.rs:477-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sandbox/src/policy.rs:453\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sandbox/src/policy.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d342a01c8032aca49df4616e637aa5fbe6f16401e053883c8d961636c5ffd0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/sandbox/src/lib.rs:520-532 | crates/sandbox/src/read_guard.rs:777-789 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sandbox/src/lib.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"1110318d391e383cc4b1df23c0e3820d0aca8ec1ee1c8ae0f9422e0c1ace0af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/engine/src/client/test_cases_01.rs:424-434 | crates/engine/src/client/test_cases_01.rs:452-462 | crates/engine/src/client/test_cases_01.rs:480-490 | crates/engine/src/client/test_cases_01.rs:1635-1645 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_01.rs:424\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2c206a44002ca60cda6fc379c75db3e6f438ae5f6bb1f4f32613b029abcbd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): crates/engine/src/client/test_cases_05.rs:1230-1240 | crates/engine/src/client/test_cases_05.rs:1277-1287 | crates/engine/src/client/test_cases_05.rs:1297-1307 | crates/engine/src/client/test_cases_08.rs:13-23 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_05.rs:1230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_05.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c82a9eb122bbc61dc1e43e81a4a5b9c8040b6ab2b5e6f32d8384580ef84672e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/engine/src/client/test_cases_02.rs:1514-1524 | crates/engine/src/client/test_cases_03.rs:84-94 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_02.rs:1514\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_02.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ab1ed2f6f154e2315f62032a0722dd80be859c53b56057ce87defc87e46783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/engine/src/client/test_cases_01.rs:1499-1512 | crates/engine/src/client/test_cases_01.rs:1556-1569 | crates/engine/src/client/test_cases_05.rs:78-87 \u2014 before extracting anything, compare \u0060crates/engine/src/client/test_cases_01.rs\u0060 and \u0060crates/engine/src/client/test_cases_05.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_01.rs:1499\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/engine/src/client/test_cases_01.rs:1513\u0060 calls \u0060path\u0060 and \u0060crates/engine/src/client/test_cases_05.rs:88\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65f5c43fc9d7cdf934782643ecb52cf6ca6a133831ed244da8858ebc0cf5303"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/engine/src/client/test_cases_02.rs:1230-1239 | crates/engine/src/client/test_cases_02.rs:1515-1524 | crates/engine/src/client/test_cases_03.rs:85-94 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_02.rs:1230\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_02.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8238c498aff35bd3ebebc51a4756916c7ce75312db91522442731ed0232fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/engine/src/client/test_cases_01.rs:1489-1496 | crates/engine/src/client/test_cases_01.rs:1546-1553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_01.rs:1489\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d26df41e8b135bda0f89afcff17ba2dd7ed8244539099216ae17ba0893df50c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/engine/src/client/test_cases_01.rs:1455-1466 | crates/engine/src/client/test_cases_05.rs:96-107 \u2014 before extracting anything, compare \u0060crates/engine/src/client/test_cases_01.rs\u0060 and \u0060crates/engine/src/client/test_cases_05.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_01.rs:1455\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":1455}}}],"partialFingerprints":{"codehealthFindingId/v1":"30400c96c4d8effbb85b1c6000da19e0e2102cdfc2c74b73e55f1373656185ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/sandbox/src/bwrap.rs:441-449 | crates/sandbox/src/bwrap.rs:450-459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/sandbox/src/bwrap.rs:441\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sandbox/src/bwrap.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a76b68965d39326188d84d747e562455290bd330e148f09d936e3d5b3901805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/engine/src/client/test_cases_03.rs:1156-1164 | crates/engine/src/client/test_cases_03.rs:1177-1185 | crates/engine/src/client/test_cases_03.rs:1198-1206 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_03.rs:1156\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_03.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"531bf1baa8f945194753886cc5457be8b4c6309bf9d56bc1b3f761dd22417c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/engine/src/client/test_cases_01.rs:912-920 | crates/engine/src/client/test_cases_01.rs:1490-1498 | crates/engine/src/client/test_cases_01.rs:1547-1555 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/engine/src/client/test_cases_01.rs:912\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/test_cases_01.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed496857ded867e4e46e4e7b6f69ff4dfc90d537aa584001b46cf622898e68b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/sandbox/src/seatbelt.rs:357-362 | crates/sandbox/src/seatbelt.rs:369-374 \u2014 both copies are in the same file, so extract the block 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/sandbox/src/seatbelt.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3e7fd9b975900fa20f8618d1cf5f5942db97e996e3510d5843295dbf25c05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): scripts/check-command-migration-manifest.py:844-867 | scripts/check-command-migration-manifest.py:915-937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/check-command-migration-manifest.py:844\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-command-migration-manifest.py"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"420beea48c577f93474af58ea84e995262d477a389323af0aeb156cb3ae4e687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): scripts/check-command-migration-manifest.py:492-502 | scripts/split/module_graph.py:642-649 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/check-command-migration-manifest.py:492\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-command-migration-manifest.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ac0f6b74a0564703f77bd75de5b94768cf098cfcd73a1cbc7636b5727076d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/check-command-config-proof.py:74-83 | scripts/check-command-core-navigation-proof.py:80-89 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-command-config-proof.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75776dfc654e285b3532dc21d6690392d94db9d1c0e29c3520c4b6460a102ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): scripts/split/reexports.py:29-41 | scripts/split/reexports.py:214-226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060scripts/split/reexports.py:212\u0060 calls \u0060get\u0060, \u0060group\u0060, \u0060replace\u0060 and \u0060scripts/split/reexports.py:28\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/split/reexports.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26a7d423d08599cf2838c9a7515cb008bafc25445f49b0fbec45d2d0f56b1fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/split/module_graph.py:190-198 | scripts/split/preflight.py:48-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/split/module_graph.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8fe40b2f8f15048a96ac0761d850e30500fd8cfb941e0ca949c2a035aee65e"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project codewhale-app-server: codewhale-app-server has instability 0.94 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8684c0708ca33927a58c2d6dcac3bd7cd9f01819903164b200e35f9604398b56"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project codewhale-engine: codewhale-engine has instability 0.92 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"88727afc8e058ac11640449399d0b54b41a38c27af8d7728a941462a0ae656d9"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project codewhale-tui: codewhale-tui has instability 0.98 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"15d87fbb84306d4804e4a45db98d404185101b0ee0d3c020a1b5653cc89f39e2"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-app-server-protocol: codewhale-app-server-protocol: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c806008a6412840d70a9e2b70702c2a7b7e830a72bea55771cd176bbedfedf4e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-mcp: codewhale-mcp: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bb67bb68cbbd4567f8486278f59780bde8ab16a113af13ed982fedc5525769a5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-paths: codewhale-paths: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9cf9399910dd31f6a293d0f125f7637fef272d28a7fed089e5b5454a11cfc21d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-sanitize: codewhale-sanitize: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"30f97fc38b0f417898d89f2d8dcd3e49f01c60792869fff0cf6ddf5916fad841"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-memory: codewhale-memory: abstractness 0.04, instability 0.00, distance 0.96 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"06aec9e82bdca0797039f28d8569abeceddcc060a4712652f0e07ea24947e476"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-protocol: codewhale-protocol: abstractness 0.01, instability 0.07, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 13 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f7146093d42e392b37882117cb9d0afce22c961c50129b2cb270ad47b5f4bbb"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-release: codewhale-release: abstractness 0.00, instability 0.09, distance 0.91 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"87b09c66c6bbb9110c69cec5f353b5895bca31e02b5d5dc75901e798399da747"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-workflow-js: codewhale-workflow-js: abstractness 0.11, instability 0.00, distance 0.89 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0878faccd9434099f55405f1400e6b62e5e5bbd1d1a36a36bc0e34b18756679b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-execpolicy: codewhale-execpolicy: abstractness 0.00, instability 0.13, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 7 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"864fca12fcddd7a1f93f979520723ee16660f93a6442bd19c34bdbdf5b66dc3a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-error-taxonomy: codewhale-error-taxonomy: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b0cfa48987487ce21524136e9aacab4bd61afac1110e2afe398c78e4c57b93cb"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-palette: codewhale-palette: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f0d1f389dc1a33280d2882ad492315a4983c51a9be684114f81ef75c2798eda"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-config: codewhale-config: abstractness 0.01, instability 0.20, distance 0.79 \u2014 zone of pain \u2014 concrete and depended on by 20 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7b9f7a70f0265cdfbaf767e742fed4ece251b3d6ab9add86cc05402da116a656"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-lane: codewhale-lane: abstractness 0.05, instability 0.17, distance 0.79 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"70a8bfec2fd759d163dfcc594f2ce696e7ca98632476a46b5a6edf5717695a49"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-tools: codewhale-tools: abstractness 0.06, instability 0.17, distance 0.77 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bf6eecf902364d8a1ef6d62a83278cbdd89a0e028b3109374819641e6354cf0d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: codewhale-secrets: codewhale-secrets: abstractness 0.05, instability 0.20, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 8 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f357c498075a4f667f828c111f6899d38033507b297cc2bb87c5a4aa5c79fe10"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ToolContext (LCOM4 27): ToolContext\u0027s methods fall into 27 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 27 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/engine/src/tools/spec.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74874a0d6af79d15cf028df3bb193211860b0e8acd1cf632c4bf0ecdaabdf8e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Config (LCOM4 12): Config\u0027s methods fall into 12 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 12 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/runtime/src/config.rs"},"region":{"startLine":1975}}}],"partialFingerprints":{"codehealthFindingId/v1":"437a5376accf108c1e87112a21188c4764edef39d7d7050a0123e2a62a76797d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: App (LCOM4 8): App\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"8589672e7699bc0af3c3a89a790812656b23ff0da4b2651ca76fc578f1349248"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: EngineHandle (LCOM4 7): EngineHandle\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb8c663c156aff5ef58b65de27aa899fbd87d8268cb2105c50b763cdef6df70"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: RuntimeThreadStore (LCOM4 7): RuntimeThreadStore\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"64eec2122ddf8229f5bf7ddf860c82d03135c6a62942f8c7d3586961dc5d195a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: McpServer (LCOM4 6): McpServer\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/mcp_server.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da14829c7f703219c68238cc744ef487fb31a6afb79c41ef95050a0e286e009"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SessionCounters (LCOM4 5): SessionCounters\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/telemetry/src/counters.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fd39552d3d62e64eed78a3fff861cba09f17be64e7edaa3ae03c3296e72df4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UnavailablePublication (LCOM4 4): UnavailablePublication\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/app-server/src/daemon_client.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b1c495869d1dcc0b5d96862e5ddd47d7df0bfdbd38bd46c5fab7e065841498"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Vault (LCOM4 4): Vault\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/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bfaa72a614925b0160d093beeb33666b0e1883a21e66e123c263a19cbbe231"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PluginRegistry (LCOM4 4): PluginRegistry\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/plugins/src/registry.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d32c0c9355de9231f6344c75c301403524aa8fa4f687a9163e0d3adeadae46"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SnapshotRepo (LCOM4 4): SnapshotRepo\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/snapshot/src/repo.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"580d1173ce08722a93f62e91cdf114bb77d35d5467c723a265d14482381a0afa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SessionExportAdapter (LCOM4 4): SessionExportAdapter\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/tui/src/commands/contract.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"657e9f28d514e28ffd7de508e1ddcf0ff00c40250bbd12ef516f4c4880d714b7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PluginAdapter (LCOM4 4): PluginAdapter\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/tui/src/commands/contract.rs"},"region":{"startLine":3747}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f46950b4afb63f0a0b184f18f2319e116e58c84a46c4742f08b7dedb93dc19"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PagerPage (LCOM4 4): PagerPage\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/tui/src/tui/pager.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"847c2e12bfae74d9dbc03bdb655da68e2ea46285db93516678bcff2b6371b5e5"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: the CLI follows real Runtime SSE envelopes through disconnect and cursor recovery, recording no prompt content: This test starts work it did not wait for (\u0060exited\u0060, still running when the sleep starts) and then orders itself against it with \u0060delay(25)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/tests/pet-runtime.test.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc96dad1c8b0fd92d28fc9e20853c7419d186bae56f574473abf051e4ab2900"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: live Runtime recording retains human waits and a brief late failure exactly once between timer ticks: This test starts work it did not wait for (\u0060exited\u0060, still running when the sleep starts) and then orders itself against it with \u0060delay(20)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/tests/pet-runtime.test.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"699fbe8e6f082652b27c01636ba05599d1b7e466f46175f693bf041a44e9033d"}},{"ruleId":"D10","level":"warning","message":{"text":"Fixed-sleep synchronisation: replayed requests remain unknown until catch-up, including reentry to replay after a live connection: This test starts work it did not wait for (\u0060wait\u0060, still running when the sleep starts) and then orders itself against it with \u0060delay(450)\u0060 \u2014 a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer\u0027s box and random in CI. Wait for the event itself instead: the process\u0027s own exit or output, a completion handle, or a condition polled to a timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/tests/pet-runtime.test.mjs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab802c98e869a505d498b429b7bf50aed961f0d6444400c712514fc9280f67a9"}},{"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":"5c391f10c075797bd2df6f505ee9a34a4764589eebfdf03c31b1578f494b0fa6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"efdcac90dc1fe1343ea0f8667c0f19576b65fd54c87571ffa6bc488ce835eb22"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"3a0c74f54ee8eb351153823b1f4a1f311fc3d14d06d514d1f9cdf783eb3c047e"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"74266f7c12c7b42e1c24e45ad8cc6fa6255635165f3dae5842a0b3b0706e0af6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/ui/event_loop.rs: crates/tui/src/tui/ui/event_loop.rs changed 336 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 847 in codewhale_tui::tui::ui::event_loop::run_event_loop at line 2030. 113 of those changes were fix/bug commits, and the other 223 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/ui/event_loop.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2030}}}],"partialFingerprints":{"codehealthFindingId/v1":"563a1dda145c6631c19e729bce72a3395f0d9e248b7b29160ab3ea9445a82163"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/lib.rs: crates/tui/src/lib.rs changed 386 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 146 in codewhale_tui::run_doctor at line 5300. 136 of those changes were fix/bug commits, and the other 250 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":5300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4835a44d713574335dcb6ba9dca417857a7cdb538da5c19103393fbb8595d1ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/ui/apply.rs: crates/tui/src/tui/ui/apply.rs changed 191 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 212 in codewhale_tui::tui::ui::apply::apply_command_result_inner at line 1575. 64 of those changes were fix/bug commits, and the other 127 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/ui/apply.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/ui/apply.rs"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fbc75d69671e45e1c1b9df58458bf6c09d04054bcc73e4ca66a51101b2e3f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/src/config.rs: crates/runtime/src/config.rs changed 211 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 188 in codewhale_runtime::config::apply_env_overrides_unlocked at line 8267. 8 of those changes were fix/bug commits, and the other 203 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/runtime/src/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":8267}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c52d0ec842310822469bc6c2e9db152862599928721a58ca75210de3b12dd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine.rs: crates/engine/src/core/engine.rs changed 347 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 111 in Engine::run_owned at line 3888. 23 of those changes were fix/bug commits, and the other 324 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/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/engine/src/core/engine.rs"},"region":{"startLine":3888}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b06e7e0d774067e35316bb881c9eac4cf4ae019666438ea76440f472bf88cc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/ui/handlers.rs: crates/tui/src/tui/ui/handlers.rs changed 132 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 245 in codewhale_tui::tui::ui::handlers::handle_view_events at line 1881. 44 of those changes were fix/bug commits, and the other 88 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/ui/handlers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/ui/handlers.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b492f09c0e0e9097d93658d04c90cdc0d1b30506de0b298ab00b8a1602ead12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/turn_loop.rs: crates/engine/src/core/engine/turn_loop.rs changed 212 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Engine::plan_tool_calls at line 1847. 10 of those changes were fix/bug commits, and the other 202 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/turn_loop.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a468099681db29f4d5875666ea7204b8ea9d28c5b9021047f629d8c4765c99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/subagent/mod.rs: crates/engine/src/tools/subagent/mod.rs changed 271 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in SubAgentManager::prepare_background_with_assignment_options at line 9652. 21 of those changes were fix/bug commits, and the other 250 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/subagent/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/engine/src/tools/subagent/mod.rs"},"region":{"startLine":9652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ace5c9fe044a3aefec852c6e65ceb783534808b8b0ac56e1c3602709a40370"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/exec_agent.rs: crates/app-server/src/exec_agent.rs changed 102 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 152 in codewhale_app_server::exec_agent::run_exec_agent at line 217. 2 of those changes were fix/bug commits, and the other 100 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/exec_agent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2a7042553ff33d75f9b60258881776fd61b3a48673a5f7869db7585a5b5a7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/shell.rs: crates/engine/src/tools/shell.rs changed 113 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 125 in BashTool::execute at line 6110. 1 of those changes was a fix/bug commit, and the other 112 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/shell.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":6110}}}],"partialFingerprints":{"codehealthFindingId/v1":"983eff0c6b3f94c644a5c2e13fd6ac58c42b31bfb6c1c1e99752544075192c1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/lib.rs: crates/cli/src/lib.rs changed 150 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in codewhale_cli::run at line 2394. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/cli/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/lib.rs"},"region":{"startLine":2394}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb92026022020abe9126474e0f245e99de124523e00323905ac167a07ea90f7c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/ui/frame.rs: crates/tui/src/tui/ui/frame.rs changed 185 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in codewhale_tui::tui::ui::frame::render at line 1635. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/ui/frame.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/ui/frame.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"698de9861b6494072dc44f304384197ec780d3b2fb52996946e65a1403ee22f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/provider_picker.rs: crates/tui/src/tui/provider_picker.rs changed 82 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 136 in ProviderPickerView::handle_key at line 4856. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/provider_picker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/provider_picker.rs"},"region":{"startLine":4856}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a7cbe7fa872e6e6e3b5969b495af5aea9e78ef81211353d83cfaa8d2273ad2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_api.rs: crates/app-server/src/runtime_api.rs changed 257 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in codewhale_app_server::runtime_api::set_config at line 13569. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_api.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":13569}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e231cc701bf09e9a689da97fb6740bb189fe4562b4d82c90a9d7fe2a502ea9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/app/init.rs: crates/tui/src/tui/app/init.rs changed 141 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 72 in App::new_with_plugin_registry at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/app/init.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/app/init.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d88cb013835e8c1cd3ff34df7bfec9fe56b8a87e85a0bbc289291e83c19f723"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/runtime_threads/manager.rs: crates/engine/src/runtime_threads/manager.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 217 in RuntimeThreadManager::monitor_turn at line 16827. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/runtime_threads/manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/runtime_threads/manager.rs"},"region":{"startLine":16827}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77cf0a80c050035815c3e3dd1d9d144aeae37377557c974376d817c5afc7668"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/underwater.rs: crates/tui/src/tui/underwater.rs changed 114 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in codewhale_tui::tui::underwater::launch_empty_state at line 1641. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/underwater.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/underwater.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b653b50f1172a7352551da8848557407188b08247d48893cb67056298184d71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/views/mod.rs: crates/tui/src/tui/views/mod.rs changed 150 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in ConfigView::render_settings_shell at line 5491. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/views/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/tui/src/tui/views/mod.rs"},"region":{"startLine":5491}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4de40c7458e035512c12c982977d0fea8c2efb0c4867ff950e54ab6e039464"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/app.rs: crates/tui/src/tui/app.rs changed 258 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in App::announce_settled_workflows at line 6686. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/app.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/app.rs"},"region":{"startLine":6686}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd65d00dd2de9d1de8207ea6bd96cdc200ca7c238d4c1f4cba60ac10c8223ba8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/widgets/mod.rs: crates/tui/src/tui/widgets/mod.rs changed 125 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in codewhale_tui::tui::widgets::slash_completion_hints_for_plugins at line 3208. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/widgets/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/tui/src/tui/widgets/mod.rs"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e78afef6be8ddf6355da3d38a8aaf5fdc553dd0c9375ec5f4dca2953a5b217"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/client.rs: crates/engine/src/client.rs changed 176 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in CodewhaleClient::prepare_outbound_request_body at line 3261. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/client.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":3261}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f91b9e229db28b343243ecc69dd49e4e7538fb582b85f6d9157c1d060c2e24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/mouse_ui.rs: crates/tui/src/tui/mouse_ui.rs changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in codewhale_tui::tui::mouse_ui::handle_mouse_event at line 439. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/mouse_ui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/mouse_ui.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"380136bd0ff836b127a1f039e152b8fcdd10fcb5146d1b15b9098c01c2c88c5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/runtime_threads.rs: crates/engine/src/runtime_threads.rs changed 257 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in RuntimeThreadStore::checkpoint_tail at line 2746. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/runtime_threads.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/runtime_threads.rs"},"region":{"startLine":2746}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e41f9c961d2c73816e2a1f09f3d5bb87c86051e0c3a1c54ca7d538379a3f1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/contract.rs: crates/tui/src/commands/contract.rs changed 158 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in CommandContextBundle::contexts at line 5089. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/contract.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/contract.rs"},"region":{"startLine":5089}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b7f33957947d79c1201b422043d30cb1596b5bc2d611d1396ad83201e1928b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/client/chat.rs: crates/engine/src/client/chat.rs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in codewhale_engine::client::chat::build_chat_messages_with_reasoning at line 2730. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/client/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/engine/src/client/chat.rs"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"a516c51910e4920e92ea4fbbfd16f57db87549158d190fc7555e3df0e0d0f7be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_web/app.mjs: crates/app-server/src/runtime_web/app.mjs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 318 in app.startBrowserClient 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_web/app.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/runtime_web/app.mjs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"266c0d40b38b6f3e43cdf9dd09ab88df72d9978228f49ef6b5b91e04a2f83eec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/src/settings.rs: crates/runtime/src/settings.rs changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in Settings::set at line 1594. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/runtime/src/settings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/runtime/src/settings.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"243ca9a28ec1d73726c56387c6bd90054af3d56f03fe21591a99393f30f11ac4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/config_main_host.rs: crates/tui/src/commands/config_main_host.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 178 in codewhale_tui::commands::config_main_host::set_config_value at line 1670. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/config_main_host.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/config_main_host.rs"},"region":{"startLine":1670}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd50e1782ab89c0aff1f7ce3aecf06b9df54d501d03f2f4f98adf184b80c6ab2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/model_picker.rs: crates/tui/src/tui/model_picker.rs changed 92 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in ModelPickerView::handle_key at line 4273. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/model_picker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/model_picker.rs"},"region":{"startLine":4273}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d4cadc8f1d52fc3192358fab0d0f08c5d4458c3beb9b242f6da52a67c6c89b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/history.rs: crates/tui/src/tui/history.rs changed 86 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in GenericToolCell::lines_with_mode_and_locale at line 2233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/history.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e502b9f35fb4678ee76f30eadbbdf34b4d3e0f4e7ae45132ea81cba6cdbe5cb5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/turn_loop/model_step.rs: crates/engine/src/core/engine/turn_loop/model_step.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 123 in Engine::run_model_step at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/turn_loop/model_step.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/core/engine/turn_loop/model_step.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b81a32d1bf070ef73ea94fcb6dae14a2ebe49938626c468dc425e40f9d6dc7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/setup/mod.rs: crates/tui/src/tui/setup/mod.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in SetupWizardView::handle_key at line 3063. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/setup/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/tui/src/tui/setup/mod.rs"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fb26570c8418e6a349c26d96fb750511de80654821d5d8b36c48a01e4fa0a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/config/config.rs: crates/tui/src/commands/groups/config/config.rs changed 83 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in codewhale_tui::commands::groups::config::config::config at line 286. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/config/config.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/config/config.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada0ce2ed79036829f85bd9d3190a57e9945418db15ad54fd3f87af5c816e6d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/client/responses.rs: crates/engine/src/client/responses.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in CodewhaleClient::handle_responses_stream at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/client/responses.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/client/responses.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf09cd6fdc69d6fac9132370326560f6c9e633f622916a1cc99e155ae1b143f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/views/extensions.rs: crates/tui/src/tui/views/extensions.rs changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ExtensionsView::render at line 2241. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/views/extensions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/views/extensions.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b8b624cc9c0f7ae0cbf3f8965b9b7fb2586544efcb94aaca0dd729800fb8e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/account-cli/src/lib.rs: crates/account-cli/src/lib.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in codewhale_account_cli::run_agents at line 2399. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/account-cli/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":2399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9258357db1d297dcd9db98d2b298ba6afaa1cf2d95c70514804679cb51a40110"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/mcp.rs: crates/engine/src/mcp.rs changed 104 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in McpPool::call_tool_with_decision at line 6582. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/mcp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":6582}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54637f8777e5d52d3e2a8416befa60778f168057805994d847277e6ee5727a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/remote_control.rs: crates/app-server/src/remote_control.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in codewhale_app_server::remote_control::relay_worker at line 3451. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/remote_control.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/remote_control.rs"},"region":{"startLine":3451}}}],"partialFingerprints":{"codehealthFindingId/v1":"250aa853cedf09974312ca54045efc4c021e04a41172a63afcb3ee8d86be6540"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/provider_lake.rs: crates/engine/src/provider_lake.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in codewhale_engine::provider_lake::runtime_catalog_resolver_for_identity at line 934. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/provider_lake.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/provider_lake.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"90af8d34014709ee67543e1d79eb75790e728bdbc53d4c1d9795966ce351efc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/shell_key_routing.rs: crates/tui/src/tui/shell_key_routing.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in ShellBinding::matches 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/shell_key_routing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/shell_key_routing.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fdccb3d7bdab98e667978ce6c8c5113af1bd994bda81ecfe0b95974e47e020"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/mod.rs: crates/tui/src/commands/mod.rs changed 111 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in codewhale_tui::commands::execute_in_context at line 362. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/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/tui/src/commands/mod.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"8026aebff3a83a0efaba0de805a8ef4935841aa94399fe3cfec20b0b2833678f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/tool_routing.rs: crates/tui/src/tui/tool_routing.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in codewhale_tui::tui::tool_routing::handle_tool_call_complete at line 754. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/tool_routing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/tool_routing.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7445ca5270bd9bab5366666ae30bfcb44fb2ede36139c766f92eee5b2a34bb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/workflow/mod.rs: crates/engine/src/tools/workflow/mod.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in codewhale_engine::tools::workflow::run_workflow_vm at line 2087. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/workflow/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/engine/src/tools/workflow/mod.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"3124a166af0d8af684babe8c7f3835b9d47bf77af894b06a47787d55d5011402"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/compaction.rs: crates/engine/src/compaction.rs changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in codewhale_engine::compaction::create_summary at line 1892. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/compaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction.rs"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c921dcaab3ac6f9d8797253affd065421f86ed3af163694a00744684329ba2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/registry.rs: crates/engine/src/tools/registry.rs changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in codewhale_engine::tools::registry::enforce_tool_authority at line 658. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/registry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/registry.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4298a390be43ff04f164dff27bddcc32cd06f00e77a82814e2e2f958237270"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/task_manager.rs: crates/engine/src/task_manager.rs changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in TaskManager::run_task at line 3035. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/task_manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/task_manager.rs"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"d038f0de81298b4bee7387efe53b20824ee42278e6d73d45ec2461a102697f8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/tool_execution.rs: crates/engine/src/core/engine/tool_execution.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in Engine::execute_tool_admitted at line 518. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/tool_execution.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/core/engine/tool_execution.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c5e3a0be8aa0e46e91d86adc1b3e504679f31a94904412e5a36c89c953fe2cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/client/anthropic.rs: crates/engine/src/client/anthropic.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in CodewhaleClient::build_anthropic_wire_body at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/client/anthropic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/client/anthropic.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"694c76b8c60bde9ce3b4d000b4a71237a6bc4da20a4685e76b8e4556ff62bdfe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/views/fleet_setup.rs: crates/tui/src/tui/views/fleet_setup.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in FleetSetupView::handle_key at line 2069. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/views/fleet_setup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/views/fleet_setup.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed40ff7435a8d22e1e481a7f8f81e5522d6078cc7453cec12f7e27e9c1f8fc76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/config/src/catalog.rs: crates/config/src/catalog.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in CatalogOffering::complete_facts at line 365. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/config/src/catalog.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/catalog.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb675d55461c3950013be7a33a3c7e10a291e293957b2bd383964a4f88ac44d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/pricing.rs: crates/engine/src/pricing.rs changed 56 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in codewhale_engine::pricing::audit_turn_cost_for_provider_on_endpoint_for_identity_at at line 1172. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/pricing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/pricing.rs"},"region":{"startLine":1172}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f73ee296f3db6a4d855244a5b61de43d4b98d144401b12a1a24bca1ee85af8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/subagent/engine.rs: crates/engine/src/tools/subagent/engine.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in codewhale_engine::tools::subagent::engine::drive_child_actor at line 1905. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/subagent/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/engine/src/tools/subagent/engine.rs"},"region":{"startLine":1905}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d765d439f739e86dab72288f8930c4b1d21263eaddf1d41647eaa64d55ed7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/provider_readiness.rs: crates/engine/src/provider_readiness.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in codewhale_engine::provider_readiness::credential_state_for_provider at line 184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/provider_readiness.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/provider_readiness.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a29beb3e754d6525539b93a2052a9f99d02f3e644b154c6a90585942137d14b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/core/core.rs: crates/tui/src/commands/groups/core/core.rs changed 70 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in codewhale_tui::commands::groups::core::core::model at line 155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/core/core.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/groups/core/core.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb451a8ae530b026a256e100e1d0fcc6ce8d4fa1672197a81384bbcb0a6935cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/acp_server.rs: crates/app-server/src/acp_server.rs changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in AcpServer::history_updates at line 462. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/acp_server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/acp_server.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e01470578147d08f56b8e00e299d2b297be3296af8a1f4fbe50ab208c8b5a6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/review.rs: crates/engine/src/tools/review.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ReviewTool::execute at line 1508. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/review.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/review.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"873ba00314edd1af7109b45f5ca01f0393901be7d8e32c559adeda447ddd86ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/pet_watch/owner.rs: crates/tui/src/tui/pet_watch/owner.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in codewhale_tui::tui::pet_watch::owner::run_world at line 499. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/pet_watch/owner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/pet_watch/owner.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cbae50ac294597c14876bdcd765f18868a7c83afca594620c7b84a244a615ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/pet_watch/pet-native.js: crates/tui/src/tui/pet_watch/pet-native.js changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in PetEngineTelemetry.observe at line 1909. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/pet_watch/pet-native.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"e646321b5b5d2dc045b5d97830b6e634be76d0ade0cd289932bcc73bcec2b6fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/ios/Resources/pet-native.js: pet/ios/Resources/pet-native.js changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in PetEngineTelemetry.observe at line 1909. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/ios/Resources/pet-native.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccc6ef9692e62d13ab9b49193488c3e12f3628928b2f034dba3d91eaf8995e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/turn_loop/preparation.rs: crates/engine/src/core/engine/turn_loop/preparation.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in Engine::prepare_model_step at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/turn_loop/preparation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/core/engine/turn_loop/preparation.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab73e72c3304b47011f6dec3540cacb4c03c47b393cbd532a8c427bf93a19c40"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/execpolicy/src/command_safety.rs: crates/execpolicy/src/command_safety.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in codewhale_execpolicy::command_safety::lex_readonly_command at line 728. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/execpolicy/src/command_safety.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/execpolicy/src/command_safety.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2d15fdfeeaed33fa1ce85645ecd30e267ebd3b6916e04fa828c300d9e5917a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/app/api/admin/post/route.ts: web/app/api/admin/post/route.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in route.POST at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/app/api/admin/post/route.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/post/route.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d432a59ed3e9544be6088c41e60f3b12977697962586e14c9e0847c5f0481914"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/file.rs: crates/engine/src/tools/file.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in EditFileTool::execute at line 3146. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/file.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file.rs"},"region":{"startLine":3146}}}],"partialFingerprints":{"codehealthFindingId/v1":"465cf6dde83320f640390604b8ba784438ad93d70a82d1d04a7feee9ab456147"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/fleet/manager.rs: crates/engine/src/fleet/manager.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in FleetManager::drive_executor_tick at line 1075. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/fleet/manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/fleet/manager.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab595fa030e81b6a8b9bfeaa93172d3211c8c02df87d221d152173fc589c670"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/approval.rs: crates/engine/src/core/engine/approval.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Engine::await_tool_approval at line 435. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/approval.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/core/engine/approval.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ac7d07020dcd60a4513470e7c67803195b871868376afba73eabb7446ad3e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/app/[locale]/page.tsx: web/app/[locale]/page.tsx changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in page.HomePage at line 72. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/app/[locale]/page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/page.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c93dd6a6d45ee10cc2b69f9261cdb2cd6d05fcf438c06a4cb555be1dc441991"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/mod.rs: crates/engine/src/extension_host/mod.rs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in ExtensionHostManager::activate_owner at line 2462. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/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/engine/src/extension_host/mod.rs"},"region":{"startLine":2462}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0925abea0c90dc6bbf61e0e1ec7c9b02c611c84dd8d06f6b1caae0a816ce60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/ui/provider_routes.rs: crates/tui/src/tui/ui/provider_routes.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in codewhale_tui::tui::ui::provider_routes::switch_provider_inner at line 715. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/ui/provider_routes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/ui/provider_routes.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b7af5a84c0dad18373e425eaef58149c3e8988f894ff76c71307fbf9e991a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/supervisor.rs: crates/engine/src/extension_host/supervisor.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in HostProcess::spawn at line 1780. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/supervisor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/extension_host/supervisor.rs"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b1a4a82505d92bddb3b6a0d635e5985f528ca9a516a71648b2e4c5563edf886"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/llm_client/mod.rs: crates/engine/src/llm_client/mod.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in LlmError::from_http_response_with_retry_hints at line 617. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/llm_client/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/engine/src/llm_client/mod.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"a856011539f02c3743414e8b08d9c57a354dbc4058ff60cc74919a0d78259c2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/pet_watch/live.rs: crates/tui/src/tui/pet_watch/live.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in codewhale_tui::tui::pet_watch::live::run at line 438. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/pet_watch/live.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/pet_watch/live.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b29aea81a5c1e1d7e7d93901b0f7ed59d6ac67c9e04f7a022b3e472f61fb2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui-kit/src/markdown_render.rs: crates/tui-kit/src/markdown_render.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in codewhale_tui_kit::markdown_render::parse_inline_spans at line 1778. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui-kit/src/markdown_render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/markdown_render.rs"},"region":{"startLine":1778}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b79549ae82a19e222d064318c01cbf56fd17ba598523dfb34ace73051c91d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/route_runtime.rs: crates/engine/src/route_runtime.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in codewhale_engine::route_runtime::classify_provider_route_preflight_next_step at line 437. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/route_runtime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/route_runtime.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f5a49f332ab9f1c209c035c3b0f6fb28bc866718c13e585aa6bd45385e29e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/skills/src/lib.rs: crates/skills/src/lib.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SkillRegistry::discover_recursive at line 654. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/skills/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/lib.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3c21320116fbc54b2dec0a21879c2dc0f22683fe66d85106436f8b279726c3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/compaction.rs: crates/engine/src/core/engine/compaction.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Engine::recover_context_overflow at line 1065. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/compaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/compaction.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"508829663ccf22254bbf5b73406f4331affe4f90b55d002046e30625cbff6bfe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/session_picker.rs: crates/tui/src/tui/session_picker.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in SessionPickerView::handle_key at line 1067. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/session_picker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/session_picker.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07e3507b2d4689214d5828d2b31ba4b50640865a536b3da3714580154de82e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/project_context.rs: crates/engine/src/project_context.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in codewhale_engine::project_context::project_instruction_sources_with_settings at line 2163. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/project_context.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/project_context.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"752fdc0ef49929142a7adac793394f1ab4f9322693658d436b4cdb21650712bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/pager.rs: crates/tui/src/tui/pager.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in PagerView::handle_key at line 1175. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/pager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/pager.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2888ae700eb29e42e8a33eb8a80dfd1ad323a6c3593102736035cb52407554"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/receipts.rs: crates/engine/src/receipts.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in codewhale_engine::receipts::assemble at line 1746. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/receipts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/receipts.rs"},"region":{"startLine":1746}}}],"partialFingerprints":{"codehealthFindingId/v1":"661457653b56c9af429e6f7c08c06aa7864df1da2d7f9b35e22c3bc3a3090eec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/execpolicy/src/shell_expand.rs: crates/execpolicy/src/shell_expand.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 96 in Expander::expand at line 993. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/execpolicy/src/shell_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/execpolicy/src/shell_expand.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d82fe6f4b8d9a00b60f6adab01bf7b7ba6668011d530c0c8c0d36c300b9124"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/ui/dispatch.rs: crates/tui/src/tui/ui/dispatch.rs changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_tui::tui::ui::dispatch::dispatch_user_message_with_recovery at line 471. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/ui/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/tui/src/tui/ui/dispatch.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"5281c0aac66f8db2ca69906bc331cd91fe4682d06cf213389a0a349066eaacd8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/provider_catalog_live.rs: crates/engine/src/provider_catalog_live.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ProviderLivePricingQuote::pricing_for_route at line 401. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/provider_catalog_live.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/provider_catalog_live.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f0e46d5d2f7a37ea9616b17c7ceae12a40ba2379402930934ba3b38bcf07e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_api/thread_history.rs: crates/app-server/src/runtime_api/thread_history.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in codewhale_app_server::runtime_api::thread_history::mutate_in_owner at line 1134. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_api/thread_history.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/thread_history.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fc6be5fc12883077f9caaaa18658c40f12c573a44c239bdb9d5eb95684db28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/authority/auto_review.rs: crates/engine/src/core/authority/auto_review.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in codewhale_engine::core::authority::auto_review::deterministic_fallback at line 755. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/authority/auto_review.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/core/authority/auto_review.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf42209a587e3521c3bf373cbc8e5c04e0b5d8589fee26afb95d398f36bb9b6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/model_inventory.rs: crates/engine/src/model_inventory.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in ModelInventory::from_config_scoped at line 224. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/model_inventory.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/model_inventory.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"05303a1b03efb5580a4c15bda423a896f79d4c4f5d4859751f6359fa80f9d72e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugins/src/registry.rs: crates/plugins/src/registry.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PluginRegistry::apply_state at line 441. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/plugins/src/registry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/plugins/src/registry.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0bfc7654f926cd3d27a5c2fbd5f24ecf322b3badcdc46280b35dea77975e08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/pet_watch/mod.rs: crates/tui/src/tui/pet_watch/mod.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in codewhale_tui::tui::pet_watch::tick at line 508. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/pet_watch/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/tui/src/tui/pet_watch/mod.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde08eb8254ff437360f8556fe590f1e20dd1888c944fab3780f236b95c0bfc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/views/fleet_detail.rs: crates/tui/src/tui/views/fleet_detail.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in FleetDetailView::handle_key at line 781. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/views/fleet_detail.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/views/fleet_detail.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad50bf4d042cd525011e2955285d2de77e57c324a8bbe3e13fdd0418b6dc4794"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/prompts.rs: crates/engine/src/prompts.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in codewhale_engine::prompts::guard_instruction_prefix at line 1531. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/prompts.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/prompts.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7dd1e1a43ce45480aa2964853c8d85ecaf02ed920e66013b0d7279cbfbddf72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/history/latex_render.rs: crates/tui/src/tui/history/latex_render.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 123 in codewhale_tui::tui::history::latex_render::render_latex_to_string at line 693. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/history/latex_render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/latex_render.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0b510fe66c656fb459fb973c974ab1e9d17431807043a2bf33518901e47cf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/automation_manager.rs: crates/engine/src/automation_manager.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in AutomationManager::update_automation_unlocked at line 1591. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/automation_manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/automation_manager.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b292d45485c2f450bf646736c6adab8aa35a83eb8975b2f8de15da8a0dc379"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/hooks/executor.rs: crates/engine/src/hooks/executor.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in HookExecutor::execute_sync_legacy at line 2435. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/hooks/executor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/hooks/executor.rs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"576286c097c3e417b000a63c7048447e1953bdfdb9fd1f5145fba05fc35a15b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/preview.rs: crates/engine/src/core/engine/preview.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Engine::build_request_manifest at line 182. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/preview.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/core/engine/preview.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"72311086758c7b4b0b78cf10ca01ff6fccb1f84bb9a8355c64e75a5d3f3f63d6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/fleet/store.rs: crates/engine/src/fleet/store.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in FleetFile::validate at line 301. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/fleet/store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/store.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d5335be30c6f25f744efdbed00d138e63d68710bc8560ae121fab9c75b6012"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/snapshot/src/repo.rs: crates/snapshot/src/repo.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SnapshotRepo::restore_path_plan_locked at line 1258. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/snapshot/src/repo.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/snapshot/src/repo.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"0297e923785193904f744cf93e4f1aa17836193f5e3f41ab91f8db72c71fc29a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_api/git.rs: crates/app-server/src/runtime_api/git.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in codewhale_app_server::runtime_api::git::worktree_remove at line 2702. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_api/git.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/runtime_api/git.rs"},"region":{"startLine":2702}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26337b1e9a9054b519ad793e257187a1f62b873b3d6f737e89be86a7a684938"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/goal.rs: crates/engine/src/tools/goal.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in UpdateGoalTool::execute at line 1394. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/goal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/goal.rs"},"region":{"startLine":1394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9882f87d1fa47b368cbc6b26461d7f062a873834ec47e7ba6541864561b55cff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/update.rs: crates/cli/src/update.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in codewhale_cli::update::run_update at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/cli/src/update.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/update.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b353a1aabadd19715243265f56aebae069f21a8a25ec7123dd7f21e3af5b642d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_chat_relay.rs: crates/app-server/src/runtime_chat_relay.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in RuntimeChatPrompt::validate_shape at line 1347. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_chat_relay.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/runtime_chat_relay.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5eaef0d024f20c21654bda89d781ee992583221142d9f67dbe84beffc797b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/widgets/workflow_panel.rs: crates/tui/src/tui/widgets/workflow_panel.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in WorkflowPanel::apply_event at line 1421. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/widgets/workflow_panel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbd364662f7eb98bc62e90e52152f1b70fbbbfd15f56fb660181c68bb40621f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/work_surface/render/mod.rs: crates/tui/src/tui/work_surface/render/mod.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in codewhale_tui::tui::work_surface::render::render at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/work_surface/render/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/tui/src/tui/work_surface/render/mod.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e215fe2710699cb880c51021e1c2da7df1524c347f8e5663320684dee40628bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/src/config/credential_resolve.rs: crates/runtime/src/config/credential_resolve.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in codewhale_runtime::config::credential_resolve::resolve_credential_source_with at line 88. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/runtime/src/config/credential_resolve.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/runtime/src/config/credential_resolve.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"44def10849a69c6be883104a4cd2753adf623f2718e14a53c3038ff9a83bddcb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/subagent_routing.rs: crates/tui/src/tui/subagent_routing.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in codewhale_tui::tui::subagent_routing::handle_subagent_mailbox_for_turn at line 463. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/subagent_routing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/subagent_routing.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d64bc67014cdb57f2388aab3e5506ab99ce0bfe64f5ed65749de83153b6489"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/cost_status.rs: crates/engine/src/cost_status.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in NativeUsageSource::prepare_observed_kind at line 1692. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/cost_status.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"193b45dd6b3200907a6aed32334a89c48fc147e3cc3a71418266b0d89e15c851"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/transcript.rs: crates/tui/src/tui/transcript.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in TranscriptViewCache::ensure_iter at line 319. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/transcript.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/transcript.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"db0ee5360180cf8542ad8024374d0e4a0ad832848cfcc2cec0a477a57f25596f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugins/src/install/dsh.rs: crates/plugins/src/install/dsh.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in codewhale_plugins::install::dsh::native_composition_files at line 2647. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/plugins/src/install/dsh.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/plugins/src/install/dsh.rs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c041fc98d61f126d9f9a252a1b92752b7d436660fc4d8125eb6c8526ae8622a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/fleet/identity.rs: crates/engine/src/fleet/identity.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in codewhale_engine::fleet::identity::resolve_member_in_profiles at line 298. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/fleet/identity.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/fleet/identity.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f456b0a13e888eb690715d65dbe30e08e582a84b1716da78263fc592a401efd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/web_search.rs: crates/engine/src/tools/web_search.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in codewhale_engine::tools::web_search::run_scrape_search_with_endpoints at line 2501. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/web_search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"341e248741c68b6d1d9ff667fb1ec79d3b9dd1a0f3d170dc981952d04ed60d75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/views/fleet_roster.rs: crates/tui/src/tui/views/fleet_roster.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in codewhale_tui::tui::views::fleet_roster::member_detail_lines_with_session at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/views/fleet_roster.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/views/fleet_roster.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1602ead1863884d878a26d05541b84fdd2d5d4bbf34455a3399c82c315dc88a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/work_surface/input.rs: crates/tui/src/tui/work_surface/input.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in codewhale_tui::tui::work_surface::input::handle_mouse at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/work_surface/input.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/input.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe57da301a00b9cd8f046a1f3d4548c3d52c3e01f1355cc01ed5d9cccd8401f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/web_run.rs: crates/engine/src/tools/web_run.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in WebRunTool::execute at line 523. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/web_run.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fd0dad82e7d8ddbd62c20c33309000fcb931a7729dbb90b6e78e2b8df391b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/sanitize/src/redact.rs: crates/sanitize/src/redact.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in codewhale_sanitize::redact::redact_line at line 539. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/sanitize/src/redact.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/sanitize/src/redact.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e46b8b56252ebbde8780a6af12370ac5f19c85a92b2652acea41a730155f6b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/config/src/route/resolver.rs: crates/config/src/route/resolver.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in RouteResolver::scope_selector at line 607. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/config/src/route/resolver.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/config/src/route/resolver.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acabce72cc82b9f075505c07653007a9133d4b815d00355d5324bb9f33d96ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/fleet/worker_runtime.rs: crates/engine/src/fleet/worker_runtime.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_engine::fleet::worker_runtime::freeze_fleet_task_members at line 149. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/fleet/worker_runtime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/fleet/worker_runtime.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"492c13b3e358e588f47fb200cff15348d5ef0d96f465fbdb3ea5c611968f139d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/views/fleet_list.rs: crates/tui/src/tui/views/fleet_list.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in FleetListView::render_rows at line 438. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/views/fleet_list.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/views/fleet_list.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a65f8f75acf9f62c5faabf77a7da4e8056c05d980eef68922bcc1e891b9931"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/ui/activity_detail.rs: crates/tui/src/tui/ui/activity_detail.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in codewhale_tui::tui::ui::activity_detail::open_details_pager_for_cell at line 310. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/ui/activity_detail.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/ui/activity_detail.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebde19057973d04faf2862b2890beba2307188e22c7ea2db52444e06f62a6485"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/codewhale/scripts/install.js: npm/codewhale/scripts/install.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 79 in install.httpRequest at line 535. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- npm/codewhale/scripts/install.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ce23b5e796448172c43337921164fd0efc17199ef5e3699f4dee76a311c1a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/core_call.rs: crates/engine/src/extension_host/core_call.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in CoreCalls::serve_subagent at line 1148. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/core_call.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/core_call.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0c8185dead83befb31977a0aadb900f340f50d8151e2e4db24cd1e75dcbf87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_api/jobs.rs: crates/app-server/src/runtime_api/jobs.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in codewhale_app_server::runtime_api::jobs::create_thread_job at line 520. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_api/jobs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/runtime_api/jobs.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbf90d6fa167e5725fbab7da835fd4c5e39c68cfc3bad71e90aa6aad4758753"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/src/core/pet-engine.ts: pet/src/core/pet-engine.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in PetEngineTelemetry.observe at line 239. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/src/core/pet-engine.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-engine.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b1b504ce726fa28e8f368b621c6a80afe99bcd0236f7140a88a5a83c055f7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/ambient_life.rs: crates/tui/src/tui/ambient_life.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in codewhale_tui::tui::ambient_life::build_frame_marks at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/ambient_life.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/ambient_life.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d15ca6603745b50b02a335c079126baccbe40f391925cd2bcd14cb6d18c3ac4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/rlm.rs: crates/engine/src/tools/rlm.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in RlmTool::execute_eval at line 464. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/rlm.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/rlm.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9719961c96df785486a1c85c36901dc13ee3837ed3bd2cfa441e80200a49c7be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/contract/debug_operations.rs: crates/tui/src/commands/contract/debug_operations.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in codewhale_tui::commands::contract::debug_operations::plan_undo_range at line 358. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/contract/debug_operations.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/contract/debug_operations.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"74bcf369fd9144e2eb004f05a13cf406d2f92e1f0392ee6a7138a41bcb98d232"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/persistence_actor.rs: crates/tui/src/tui/persistence_actor.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in PendingState::absorb_publication at line 665. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/persistence_actor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/persistence_actor.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e203c80c26b1d92cbb7631e5c08026d07779b41d096ad75e64ae43586930c9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/daemon_socket.rs: crates/app-server/src/daemon_socket.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in codewhale_app_server::daemon_socket::attach at line 342. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/daemon_socket.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/daemon_socket.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c500c30c60513c1dfb0119e7269a9b306be645dae26372c5da269109357960"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/skill-install/src/install.rs: crates/skill-install/src/install.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in codewhale_skill_install::install::sync_one_skill at line 688. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/skill-install/src/install.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/skill-install/src/install.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e8f1f152ccf95076875685333a46e737ebdd33522b66aadb6a454dd1d4f4de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/verifier.rs: crates/engine/src/tools/verifier.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in codewhale_engine::tools::verifier::run_gate at line 1184. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/verifier.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/verifier.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10c15214d9f9c77499a342cc2ce4d9de8de18d7bb70bb7faee142ca9f518f89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/metrics.rs: crates/cli/src/metrics.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in codewhale_cli::metrics::read_audit_log at line 690. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/cli/src/metrics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cli/src/metrics.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd54160940aa867f23fa5bee09f87fab3d20aa598e2cdf8317a6ac939508d354"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/src/config_persistence.rs: crates/runtime/src/config_persistence.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in codewhale_runtime::config_persistence::migrate_legacy_route_preferences at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/runtime/src/config_persistence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/runtime/src/config_persistence.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fc331304ead1049ef4e0a2190bfb4a3492d28f4ccd367c0db73c45151611ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/registry.rs: crates/engine/src/extension_host/registry.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in OwnerRegistry::register_command at line 1274. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/registry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/extension_host/registry.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28610e9e5148973bcfd703e3ae4e63a16d56428765a699b3aaf21f3c238d623"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/config_bundles.rs: crates/cli/src/config_bundles.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in codewhale_cli::config_bundles::prepare_import at line 1247. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/cli/src/config_bundles.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cli/src/config_bundles.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a23df5cac7b5870cd6c4ccfa46c2029bc853cba1e85d760d37103bc6546519"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: integrations/weixin-bridge/src/index.mjs: integrations/weixin-bridge/src/index.mjs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in index.flushOutputs at line 616. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- integrations/weixin-bridge/src/index.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd5643e5d77381ea7559aed699bdc789d1e3f58a8c5164c2dfa7c883f39d945"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/fleet/ledger.rs: crates/engine/src/fleet/ledger.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in codewhale_engine::fleet::ledger::apply_record at line 2438. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/fleet/ledger.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"267db02958873271cdda420323eee454f197d6ba04feeee0db767f94c07a1e54"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/session_manager.rs: crates/engine/src/session_manager.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SessionCostSnapshot::project_usage_record_inner at line 1421. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/session_manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/session_manager.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"be225299397782211741933f16d88f7ded423190a90e35f32c38187838273d7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/client/provider_native_search.rs: crates/engine/src/client/provider_native_search.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in codewhale_engine::client::provider_native_search::parse_responses_search at line 423. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/client/provider_native_search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02fcaee3bc272a41734c6e87c41ea7fb2442c39c9d8007b10e377eae3c7292b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/approval_cache.rs: crates/engine/src/tools/approval_cache.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in codewhale_engine::tools::approval_cache::computer_use_user_gate at line 299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/approval_cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/approval_cache.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c255fb231e4f2d9c1f6a341c417b303f7a416cd2609ca439c7dca3a21a5db2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/components/docs-search.tsx: web/components/docs-search.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in docs-search.DocsSearch at line 138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/components/docs-search.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba0b7de34e76c67a054a186efdcf4467c7de6cc5d13b54a1aa31748fbba49d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/agent_details.rs: crates/tui/src/tui/agent_details.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in codewhale_tui::tui::agent_details::project_agent_details at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/agent_details.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/agent_details.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2661c8990fc256d9f046c691c3ca4df1855272d10a110ad87f9889feadb08933"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/scripts/facts-lib.mjs: web/scripts/facts-lib.mjs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in facts-lib.deriveFeatures.features at line 166. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/scripts/facts-lib.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-lib.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0d6ab69c13ab72eb1e670f55d79b1b160a82e9c61129c19240385ac4945e99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: integrations/telegram-bridge/src/index.mjs: integrations/telegram-bridge/src/index.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in index.streamTurnEvents at line 651. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- integrations/telegram-bridge/src/index.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5670ae27938f3cf60e22b120f9e347c0c7383effb5398c1076e271cdf9369d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/account-cli/src/computer.rs: crates/account-cli/src/computer.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in codewhale_account_cli::computer::run at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/account-cli/src/computer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/account-cli/src/computer.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfa5ecc7a1af80de06d0826a689729b6a22b16dd7ced80b55a0084233231a59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/review_core.rs: crates/engine/src/tools/review_core.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in codewhale_engine::tools::review_core::render_review_summary at line 240. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/review_core.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/review_core.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f794ed4629fac6708fa9c7ad86ff24074045c59465a370e34b50fdec9e988d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/execpolicy/src/lib.rs: crates/execpolicy/src/lib.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in ExecPolicyEngine::check at line 490. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/execpolicy/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/lib.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f16824441e3d5fc5c0726582119b8ad3a7bf32729262be2ff068632bf3964c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/subagent/coord.rs: crates/engine/src/tools/subagent/coord.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AgentsCoordinateTool::mutate_coordination at line 1155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/subagent/coord.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/subagent/coord.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"192da742a7ab8b1996f3ab0eb259a55fbdd5f0bf3046c13196beefddd4bdcbca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/ui/remote_control_bridge.rs: crates/tui/src/tui/ui/remote_control_bridge.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in codewhale_tui::tui::ui::remote_control_bridge::drain_remote_control_events at line 8. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/ui/remote_control_bridge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/remote_control_bridge.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba1c73f25223e4e0964804ccf16b35a37554fb5c175ccc3c6a8c4b7b3d6f667e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/fleet/roster.rs: crates/engine/src/fleet/roster.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in FleetRoster::load_with_personal_dir_and_plugins at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/fleet/roster.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/fleet/roster.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5aa85baa9994fc4adb2438dcfec5416c483f7a7e5a4d0c3a876b339a8c4afda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/ui/task_projection.rs: crates/tui/src/tui/ui/task_projection.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in codewhale_tui::tui::ui::task_projection::refresh_active_task_panel at line 10. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/ui/task_projection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/ui/task_projection.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0086a2c98dddc1002655bf21149f758175e7cd3dc4498f2112cef6a2ce7e63dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/catalog_models_dev.py: scripts/catalog_models_dev.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in catalog_models_dev.normalize_seed_spec at line 536. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/catalog_models_dev.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/catalog_models_dev.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b63502e7f618a086a8077a0133da2e7b4508dfbe50acc90c1d1e0ee98389fc7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/approval_summary.rs: crates/engine/src/tools/approval_summary.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in codewhale_engine::tools::approval_summary::approval_summary_in at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/approval_summary.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/approval_summary.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d22c1853ea32730847b26b7713a79ddf4af890eef3ca4492fd069b9a1f4eef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/command_palette.rs: crates/tui/src/tui/command_palette.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in CommandPaletteView::render at line 879. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/command_palette.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/command_palette.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9c5e407fa4d54d2f5c1a2503c5c4a3822130e401233d08b9cbbe19ffb72265"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/pet_watch/full.rs: crates/tui/src/tui/pet_watch/full.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in codewhale_tui::tui::pet_watch::full::render at line 401. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/pet_watch/full.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/pet_watch/full.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"501a4fcc9cfc0e58a21a0e3e5785ceb9c113037144fdeeb71f38cd053aaf0382"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/reasoning_preference.rs: crates/engine/src/reasoning_preference.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ReasoningEffort::normalize_for_route_identity at line 248. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/reasoning_preference.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/reasoning_preference.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cb1ad823a452a2276684b7bddbd2be960b5e38579fbf31ae2e97637b1931ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/client/system_one.rs: crates/engine/src/client/system_one.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in codewhale_engine::client::system_one::valid_decision_response at line 451. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/client/system_one.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/client/system_one.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b2c61685a2c0e7291b88eb2dac15bd468031b4ea5c3ee5ff57d02ed0114949"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_api/plugins.rs: crates/app-server/src/runtime_api/plugins.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_app_server::runtime_api::plugins::prepare_plugin_ui at line 1092. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_api/plugins.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/runtime_api/plugins.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f32c89e8c6be03f556fb4f4374c21806b4c2523169a546a5090abc9116a12b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/views/automations/editor.rs: crates/tui/src/tui/views/automations/editor.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in AutomationEditor::key at line 763. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/views/automations/editor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/automations/editor.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"74134072dd86ed5c80a94631ba8e5e44fabf6736c47ca92b24e85c49ebb941a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/windows.rs: crates/engine/src/extension_host/windows.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in codewhale_engine::extension_host::windows::edit_acl at line 1299. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/windows.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/extension_host/windows.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"461562690637936439544925a191dd30f1537c39b480de2d5511acec61602742"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/session_secret_scrub.rs: crates/engine/src/session_secret_scrub.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in codewhale_engine::session_secret_scrub::session_files at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/session_secret_scrub.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/session_secret_scrub.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf09df7eb23fb1b5e6b0a77d70598765abf3cdb997f964d30b0dda050c0901f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/approval.rs: crates/tui/src/tui/approval.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in codewhale_tui::tui::approval::build_prominent_details at line 496. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/approval.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/approval.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a438b4b9a9d6eefbac138922b281d6ad128e3a560ca0feead05d289c6097099"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/agent_focus.rs: crates/tui/src/tui/agent_focus.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_tui::tui::agent_focus::render_focus at line 707. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/agent_focus.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/agent_focus.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"587ed2c0b36da81e48022f3de793e81c03722b005a36f84fb977849e0aa945fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/dispatch.rs: crates/engine/src/core/engine/dispatch.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_engine::core::engine::dispatch::format_tool_error_with_schema at line 432. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/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/engine/src/core/engine/dispatch.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb614ebfbfbf97e26b079966d437ad037c2865b783a8299a2e8e904db4c6f9a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: telemetry-ingest/src/schema.ts: telemetry-ingest/src/schema.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in schema.validateBatch at line 732. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- telemetry-ingest/src/schema.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"26da6ed5fe6373ff530638bdbc1abce4523cb4a94b71789ac4988d24f56299cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui-kit/src/diff_render.rs: crates/tui-kit/src/diff_render.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in codewhale_tui_kit::diff_render::render_diff_into at line 158. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui-kit/src/diff_render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/diff_render.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ece319ea2a026859578907f12103fed7cac5c031bfddc156a7002aaee77fa6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/stdio.rs: crates/app-server/src/stdio.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in codewhale_app_server::stdio::dispatch_stdio_request_with_writer at line 726. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/stdio.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/stdio.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"744308e0d642b31ff825c933610afce1bf90e551994bcc246b95bdde52c718f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/widgets/agent_card.rs: crates/tui/src/tui/widgets/agent_card.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in codewhale_tui::tui::widgets::agent_card::apply_to_delegate at line 574. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/widgets/agent_card.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/widgets/agent_card.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"040facb3c58ab714d1db2f3604c0837a8aae0146e08fd8911a9805ba4990b9a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/turn_loop/continuation.rs: crates/engine/src/core/engine/turn_loop/continuation.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Engine::continue_model_step at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/turn_loop/continuation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/core/engine/turn_loop/continuation.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93449f4b3ae447e09dc8135d515531a1338dc3790fe1fca23d198307e5b77a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/skills/skills.rs: crates/tui/src/commands/groups/skills/skills.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in codewhale_tui::commands::groups::skills::skills::list_skills at line 275. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/skills/skills.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/groups/skills/skills.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ae89b038733e56fbe8a1cd8a664bc2dd21631bfbca3c0fe03b44d6ed14057f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/git_status.rs: crates/engine/src/git_status.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_engine::git_status::parse_porcelain_v2 at line 186. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/git_status.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/git_status.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02870e1210aec15c6e8cb93476bec8f79b476fbae61499f03c9e731ab99e8d2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/read_media.rs: crates/engine/src/tools/read_media.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in codewhale_engine::tools::read_media::process_media_file at line 569. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/read_media.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/read_media.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cf282f82b8c96ae6d3b0cf40b8c6addf3aa3c9b950a28b941a9d48e14c5443"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/utility/mcp.rs: crates/tui/src/commands/groups/utility/mcp.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in codewhale_tui::commands::groups::utility::mcp::mcp at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/utility/mcp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/utility/mcp.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdcdcc5b74580b9cdc54ba67a9d8039075fe95d21f13ab4bfdcc9a63fe50c91"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/route_billing.rs: crates/engine/src/route_billing.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in codewhale_engine::route_billing::capture_product at line 269. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/route_billing.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/route_billing.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c7bc77bc229a16738cdb2b26dc15360cdb629f8119961f6bcf5ab04220978c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/config/src/private_directory.rs: crates/config/src/private_directory.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_config::private_directory::open_owned_directory at line 594. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/config/src/private_directory.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/config/src/private_directory.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ed2197a0579fa1806e38ba3e41d60bfd1337a25dc57716e0f4393068331c58"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugins/src/install/mod.rs: crates/plugins/src/install/mod.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PluginInstallSource::parse at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/plugins/src/install/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/plugins/src/install/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c64597ea8ff553b4d9d8e2ac4857f6a69e9f8c0eece8fca56a4655e2f560974"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/history/tool_output.rs: crates/tui/src/tui/history/tool_output.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_tui::tui::history::tool_output::for_each_output_row at line 610. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/history/tool_output.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/tool_output.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f4984b3baa77b89fd79d9d009563ecb492f345261dd07891b684b65da7b2ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/acp_server/runtime.rs: crates/app-server/src/acp_server/runtime.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in PromptRun::project_event at line 317. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/acp_server/runtime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/acp_server/runtime.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a809cb156405f0a6f144a0dfc76072a56310eea287df5e561e181e612fa5710"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_api/secrets.rs: crates/app-server/src/runtime_api/secrets.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_app_server::runtime_api::secrets::run_provider_connect at line 604. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_api/secrets.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/runtime_api/secrets.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3512e7260b77ae0a554d28cf86550c4aa6d3019a43df405e7408d3494250bd7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_mobile.html: crates/app-server/src/runtime_mobile.html changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in runtime_mobile.html.eventText at line 570. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_mobile.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/runtime_mobile.html"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"52948896d67c60dd209a9c6da23971054747f3f045b84131f385c9779aa1d1a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check-provider-registry.py: scripts/check-provider-registry.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in check-provider-registry.report_antigravity_public_contract at line 278. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/check-provider-registry.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-provider-registry.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07295405cc53ad39c8fd4df43262f99ecc0555eb1c14d82a79424416927c0e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/search.rs: crates/engine/src/tools/search.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in codewhale_engine::tools::search::visit_files_recursive at line 519. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/search.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea1855ca63a5b5da82a7ba33bf42638f1f51703a149f50f57076865e3eee3b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/subagent/delivery.rs: crates/engine/src/tools/subagent/delivery.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in codewhale_engine::tools::subagent::delivery::explicit_change_paths at line 527. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/subagent/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/engine/src/tools/subagent/delivery.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64cdfd5a742ceada7cd927a13ad1aad850d69524343e38af9c64e086eaaf889"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/views/automations.rs: crates/tui/src/tui/views/automations.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AutomationsView::handle_key at line 660. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/views/automations.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/views/automations.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db2ae84650a7b2d6e5312c586acfb0534d880baec51494b9180fec0f8a9ac4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: integrations/wecom-bridge/src/index.mjs: integrations/wecom-bridge/src/index.mjs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in index.streamTurnEvents at line 398. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- integrations/wecom-bridge/src/index.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89ff86ececfa4f09a17a78a599ba9accc9aa561c5e0ec83dd8a6d01dd576d33"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/components/mobile-menu.tsx: web/components/mobile-menu.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in mobile-menu.MobileMenu at line 11. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/components/mobile-menu.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/mobile-menu.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c1bb043d4894d4ec1d0558c692fb79579d5e18b30f6d2d0daa0f96128e31e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check-command-migration-manifest.py: scripts/check-command-migration-manifest.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in check-command-migration-manifest.parse_rust_file at line 792. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/check-command-migration-manifest.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-command-migration-manifest.py"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"6163a1c606c739b39b8e250096c29d952d5ecfad6700dafe22b9a3f2c080e483"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/update/uninstall.rs: crates/cli/src/update/uninstall.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in codewhale_cli::update::uninstall::remove at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/cli/src/update/uninstall.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/cli/src/update/uninstall.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ddea312d1e1ba1b75ac3219870e16344fb9f04f1770f76870c6708e19ac340"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugins/src/manifest.rs: crates/plugins/src/manifest.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in PluginManifest::validate_metadata at line 583. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/plugins/src/manifest.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/plugins/src/manifest.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef74ebbe5c7c2c4e9b2ae800f5a9561e9784e9ed2cc34448732cb739c88aa75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/truncate.rs: crates/engine/src/tools/truncate.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_engine::tools::truncate::apply_spillover_inner at line 536. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/truncate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/truncate.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3238d0a3ecc03c24c14128a41644e813ac1c0e758175185caaa7ac10b7896e51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/error-taxonomy/src/lib.rs: crates/error-taxonomy/src/lib.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in codewhale_error_taxonomy::classify_error_message at line 245. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/error-taxonomy/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/error-taxonomy/src/lib.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c7e847bd2e2875b10a6c5a18a6a3afe733a83680a14304ddbfda47efa1ec83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/src/core/codewhale.ts: pet/src/core/codewhale.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in CodewhaleRuntimeTrace.append at line 365. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/src/core/codewhale.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa2c044c879cd89d5f60f0d6239fdd4918afdcd6f43009cc3603251082cb847"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/approval/view.rs: crates/tui/src/tui/approval/view.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ApprovalView::handle_key at line 375. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/approval/view.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/approval/view.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"58dc890331b75602c50ad29fbb801a68d54a304ebe8da91154c6dadeeb3ed98a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/lsp/src/lib.rs: crates/lsp/src/lib.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in LspManager::semantic_locations at line 678. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/lsp/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lsp/src/lib.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4680c547b3725f62d940dffaafb87deada658292ca1837355cf45d10a366908"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/mcp/http_client.rs: crates/engine/src/mcp/http_client.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in McpHttpClient::execute_inner at line 483. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/mcp/http_client.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/http_client.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da12786eea5a04c695fd62cce7b639accfd1e75681f6ef79c1ea7e04b667627"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/work_surface/views.rs: crates/tui/src/tui/work_surface/views.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_tui::tui::work_surface::views::git_state_rows at line 385. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/work_surface/views.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/work_surface/views.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8385c195168d42f5840bea725da07f48fedc9dc46b4c60c57920999f89b900e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugins/src/marketplace/parsers/codewhale.rs: crates/plugins/src/marketplace/parsers/codewhale.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in codewhale_plugins::marketplace::parsers::codewhale::parse_codewhale_entry at line 142. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/plugins/src/marketplace/parsers/codewhale.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/plugins/src/marketplace/parsers/codewhale.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e049c3dd8775526440fede4953dcff7f174ee09c6bba2ba2e4959560c266b92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/core/setup.rs: crates/tui/src/commands/groups/core/setup.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SetupCmd::execute at line 26. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/core/setup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/groups/core/setup.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d66edac390e45f5bf60fff6b0d2b3ec525a534e41a62610bfb6993f3e930791"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/work_surface/terminal.rs: crates/tui/src/tui/work_surface/terminal.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in codewhale_tui::tui::work_surface::terminal::render at line 613. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/work_surface/terminal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/work_surface/terminal.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"17390c6b2b95c1f1b41f6100d44bc3b21263ac38d34b5df2a548ef09b390bdf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/subagent/coord/ledger.rs: crates/engine/src/tools/subagent/coord/ledger.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in CoordinationLedger::register_claim_in_scope at line 649. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/subagent/coord/ledger.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/coord/ledger.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87b72e78b3d2c3e55535388b882d2efe5fa4e17b9952fb1bad0b8e4efa398c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugins/src/agent_plugin.rs: crates/plugins/src/agent_plugin.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in codewhale_plugins::agent_plugin::parse_claude_plugin_json at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/plugins/src/agent_plugin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/plugins/src/agent_plugin.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f362a0787fc7b505cd0c72c9ed2c52a0586fcf355d02e43f5dc02301528946e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/apply_patch.rs: crates/engine/src/tools/apply_patch.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in codewhale_engine::tools::apply_patch::build_pending_writes_from_patches at line 652. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/apply_patch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/apply_patch.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f484928957c866aa2f12a9c7fdc549d2dae7e82747befc32015b790b7dd52c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/git.rs: crates/engine/src/tools/git.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in codewhale_engine::tools::git::plan_commits at line 762. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/git.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/git.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c948a8e222cc74b7ccf48c61fc0d3d9f16626c867b6f8b8a57ce6699b8e70cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/account-cli/src/work.rs: crates/account-cli/src/work.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in codewhale_account_cli::work::quote at line 987. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/account-cli/src/work.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/account-cli/src/work.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"68196328fbaa3b417e081d2ac3ea6576f657ba74c86f9ef0474dc9af06bede6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/contract/debug_diagnostics.rs: crates/tui/src/commands/contract/debug_diagnostics.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DebugDiagnosticsAdapter::cache_telemetry at line 87. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/contract/debug_diagnostics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract/debug_diagnostics.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e98b32f6a0eaa1070fc2a730f5a94088225ac58ff5b2c0ac783fee3d19e5fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/skills/src/system.rs: crates/skills/src/system.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_skills::system::bundled_skills_status at line 957. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/skills/src/system.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/skills/src/system.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84f3bfd2989a9c656bcd0aef882813cfb6d07342f4fb56b619e57d35141bb20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/tool_preparation.rs: crates/engine/src/core/engine/tool_preparation.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_engine::core::engine::tool_preparation::prepare_tool_call at line 47. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/tool_preparation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/core/engine/tool_preparation.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1f57af057931665e20b01b089271ad09adc5223307eb7f25d7d5982667ba00"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/src/core/pet-world.ts: pet/src/core/pet-world.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in PetWorld.makeFrame at line 338. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/src/core/pet-world.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-world.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f74dd2fc6a2b14a88656dd9de2b4c270ece8693269db5d06088d00373bd4aeb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/commands/src/debug/cache.rs: crates/commands/src/debug/cache.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_commands::debug::cache::cache_portable at line 58. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/commands/src/debug/cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"5957670728b98bd07e413520da6ace4cd52181f863788b93c3a6b769e7288715"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/purge.rs: crates/engine/src/purge.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_engine::purge::cascade_tool_pair_removals at line 507. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/purge.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/purge.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4023f6cf42fe698be0f87b0040d35d9f14b13d55fb7708eb3b757da5ce0e40d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/execution_envelope.rs: crates/engine/src/tools/execution_envelope.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in codewhale_engine::tools::execution_envelope::enforce_execution_envelope at line 373. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/execution_envelope.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/execution_envelope.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7145f66f13cf53de6e56d8e94cb242fffa9f0fd531d9cd1472ed3eff394c464"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/widgets/transcript_legacy.rs: crates/tui/src/tui/widgets/transcript_legacy.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in ChatWidget::new_with_ocean_elapsed at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/widgets/transcript_legacy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/widgets/transcript_legacy.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb805323d6fff1ddb001ead903c983a75343e0c93ed9285bb4bc15545356ae3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/workflow/src/redaction.rs: crates/workflow/src/redaction.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in codewhale_workflow::redaction::redact_for_disclosure at line 298. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/workflow/src/redaction.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/workflow/src/redaction.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7effb108a6b3f18b1b4b9f6bbcbdc37746207a5a4aa6770708378120fcef8dd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/session.rs: crates/engine/src/core/session.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ToolActivationCache::activate_inner at line 216. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/session.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c449ccee0b4145db9e9a849bd4b6f91638da204884eae08cee247e377087eb5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: integrations/bridge-core/src/lib.mjs: integrations/bridge-core/src/lib.mjs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in ThreadStore.ensureShape at line 94. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- integrations/bridge-core/src/lib.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f086717f2041ed28dd0e9be08f50e40e9de8060827a0133c71667475b51d48e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/work_graph/model.rs: crates/engine/src/work_graph/model.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in codewhale_engine::work_graph::model::constrained_effective_reasoning_for_route at line 177. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/work_graph/model.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/model.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a028bb5852189436e1e0dc2e059eb90dbd4bcbb81da3dea5e158d270e6b813"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check-contributor-credit.py: scripts/check-contributor-credit.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in check-contributor-credit.main at line 116. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/check-contributor-credit.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-contributor-credit.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa8f2b27ae0ccb1acb31160034d29dd19e34165bfa560f67d1c3661f25d4338"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/tool_result_retrieval.rs: crates/engine/src/tools/tool_result_retrieval.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in TextInspection::push_line at line 710. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/tool_result_retrieval.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/tool_result_retrieval.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"de41afdd83f9783cfcd94440cecba1038d65e87641bbfdf64030346be85b4b84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/swift/PetHost.swift: pet/swift/PetHost.swift changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in PetHost.restart at line 76. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/swift/PetHost.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/swift/PetHost.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46692307eb680a05ff359f2d98de106e13ac29a4a4b8af2c115a95d8c0bc7d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/history/thinking.rs: crates/tui/src/tui/history/thinking.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_tui::tui::history::thinking::render_thinking_with_preview_limit at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/history/thinking.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/history/thinking.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"728a98c5810a9f2e6cb436b11e5e434a1b08b9f48cbbfc3b6c7bdcaf4d730e84"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/github-action/review.mjs: scripts/github-action/review.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in review.run at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/github-action/review.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/review.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"897b67d0f0b05766214586945927d242e4a1e917ef23b861f01bdb2432e338e6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/integrations/dsh/scene.js: crates/tui/src/integrations/dsh/scene.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in scene.createOcean at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/integrations/dsh/scene.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/integrations/dsh/scene.js"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f59728a62387cb56af25e66ae948b559744f53c4bfe2f32e8ece2431ac35f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/lib/facts.ts: web/lib/facts.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in facts.isRepoFacts 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/lib/facts.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f603eea199fd264659d09277c97f0fdd316670b79565b7fa6cedcb988ea512"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/plugins/render.rs: crates/tui/src/commands/groups/plugins/render.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_tui::commands::groups::plugins::render::render_gc_report at line 401. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/plugins/render.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/plugins/render.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c048f246c022261044124911ea88a4d694644d46cc95d4e4e0d5f1c944d2ee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/fleet/members.rs: crates/engine/src/fleet/members.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_engine::fleet::members::add_fleet_model at line 222. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/fleet/members.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/fleet/members.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce04efa8f32768369bbc0a60ed28fb79f4b30e432024ad6e38de073fd49bf5f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/widgets/composer_legacy.rs: crates/tui/src/tui/widgets/composer_legacy.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in ComposerWidget::render at line 253. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/widgets/composer_legacy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/widgets/composer_legacy.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ca4e4172882f27a8658ed7c070563ad9c2c780504f04a39c0049f42afb3cbb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/turn_loop/tool_batch.rs: crates/engine/src/core/engine/turn_loop/tool_batch.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Engine::run_tool_batch_phase at line 6. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/turn_loop/tool_batch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/core/engine/turn_loop/tool_batch.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ed69dcbbfad9d07ba1917229227af372b088f073dc4a6f3de748d7a920e540"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/scripts/lib/pet-runtime.mjs: pet/scripts/lib/pet-runtime.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in pet-runtime.followRuntime at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/scripts/lib/pet-runtime.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-runtime.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"59af2899cf4eddcfe9ff056ec8c7b352277991c5f4687eba4bee46acef0f1198"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/check-blocking-calls-budget.py: scripts/check-blocking-calls-budget.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in check-blocking-calls-budget._test_module_edges at line 267. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/check-blocking-calls-budget.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-blocking-calls-budget.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f9f2eb973403e17763c3e7016734ccecbe24d79caeb40cfd0a2458164bcd1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/mcp/sse.rs: crates/engine/src/mcp/sse.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SseTransport::run_sse_loop at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/mcp/sse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/mcp/sse.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b35c1f18eed545776d4bc67cb2c0b0b3ec88082aeff692188e8b714f6b0889"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/account-cli/src/dispatch.rs: crates/account-cli/src/dispatch.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in codewhale_account_cli::dispatch::run at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/account-cli/src/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/account-cli/src/dispatch.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e1102b4bf1ba93a12526bf1e8f7b1381a4058147c6618762f35816b8c88525"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/work_surface/render/layout.rs: crates/tui/src/tui/work_surface/render/layout.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in codewhale_tui::tui::work_surface::render::layout::height at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/work_surface/render/layout.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/work_surface/render/layout.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00d7febcdd0c448d71e9461ea7a2776718b5f49e2f2a4db74846328b400cf93"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/convert-plugin.py: scripts/convert-plugin.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in convert-plugin.convert at line 391. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/convert-plugin.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/convert-plugin.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"615aa195439440f070ac9d343544bea39fe0190c1259112f1fdeca31dd17b05f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugins/src/marketplace/parsers/claude.rs: crates/plugins/src/marketplace/parsers/claude.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in codewhale_plugins::marketplace::parsers::claude::parse_claude_entry at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/plugins/src/marketplace/parsers/claude.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/plugins/src/marketplace/parsers/claude.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50a72f5489b08477f0acdafeb0bfd4801387ce115a95538c9cc03231d6f3e3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/src/ui/pet.ts: pet/src/ui/pet.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in pet.get(\u0027follow\u0027).onclick at line 231. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/src/ui/pet.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/ui/pet.ts"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bc43553c51fb82a11fad76551fd78433ddbc747c86b969559f5fb40589d506"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/app/[locale]/admin/admin-client.tsx: web/app/[locale]/admin/admin-client.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in admin-client.AdminClient at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/app/[locale]/admin/admin-client.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/admin/admin-client.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf0934e72e86b9b817ebb5c420447d31ac6981f5601ba5dfc272d8b7834e35d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/subagent/lifecycle.rs: crates/engine/src/tools/subagent/lifecycle.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in codewhale_engine::tools::subagent::lifecycle::compact_row at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/subagent/lifecycle.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/lifecycle.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdde3e69a06837fe0ca0caf1e8b2a0adfe450f2b5cc0592c0def3ebc7967b09c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: integrations/feishu-bridge/src/index.mjs: integrations/feishu-bridge/src/index.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in index.reattachActiveTurns at line 304. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- integrations/feishu-bridge/src/index.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd8569416863a49e55eeed3a9a1780a31cf2b8c91a1445ccdd274b8c828a801"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/user_input.rs: crates/engine/src/tools/user_input.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in UserInputRequest::validate_transport at line 210. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/user_input.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/user_input.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4404609e29832a4cc4845fb7364610b0351b38bd522d72dfe0d21c6782067dbe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/session/export.rs: crates/tui/src/commands/groups/session/export.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_tui::commands::groups::session::export::render_content_block at line 758. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/session/export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/groups/session/export.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd465b8cf2329cee39eed7141f39e1713848988418d8cd2c01c676ba40ae7b39"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/subagent/budget_handback.rs: crates/engine/src/tools/subagent/budget_handback.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_engine::tools::subagent::budget_handback::fallback_partial_text at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/subagent/budget_handback.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/subagent/budget_handback.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"729e00afdc37d797bcace63706488c3907372adacd9a2a3bbf4b3b0e464c722f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/file_search.rs: crates/engine/src/tools/file_search.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in codewhale_engine::tools::file_search::search_files at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/file_search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/file_search.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"165fdc1d5095b52bae6e5d450b357842bd9babbb9a97f3943ebe6ed9b91b62c5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/mcp_http.rs: crates/engine/src/extension_host/mcp_http.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in codewhale_engine::extension_host::mcp_http::fetch at line 223. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/mcp_http.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/extension_host/mcp_http.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab22ce78a2f0ec2c0899b957f111c81e326759a0bd004ce4cc403686df711b63"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/runtime_options.rs: crates/engine/src/runtime_options.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in RuntimeOptions::merge at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/runtime_options.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_options.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b646d4e04068a003831fecf9aea0a558650831d2f11237257668f66ce219732"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/git_tool.rs: crates/engine/src/tools/git_tool.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_engine::tools::git_tool::review_scope at line 235. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/git_tool.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/git_tool.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa731b62825a89fbddb11b23b15d44664ad133036fee7335c07a6cf4b2c8af3e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/context_menu.rs: crates/tui/src/tui/context_menu.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ContextMenuView::render at line 506. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/context_menu.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/context_menu.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4cf7ea8625cfafbf5ccfd897d9d285e9baeffd6b3bae205cf24d491f7b3255e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/core/engine/turn_loop/inline_repl.rs: crates/engine/src/core/engine/turn_loop/inline_repl.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in Engine::run_inline_repl_phase at line 7. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/core/engine/turn_loop/inline_repl.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/core/engine/turn_loop/inline_repl.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"b908cfb521f9d0159fc7c19243470544c994cc67b23b83342bedf42f64aba45c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/turns.rs: crates/app-server/src/turns.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in codewhale_app_server::turns::message_native_thread at line 392. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/turns.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/turns.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96039643f123b735e914dd7c627fdd1ff54057219ee78316d87919f92dcbefd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/work_graph/validate.rs: crates/engine/src/work_graph/validate.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in codewhale_engine::work_graph::validate::check_structural at line 125. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/work_graph/validate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/work_graph/validate.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"be71a151ac7648a7056e93e86c54f12684146fb7b5e2e6c567d4aca80cf76a17"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/speech.rs: crates/engine/src/tools/speech.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_engine::tools::speech::prepare_speech_options at line 374. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/speech.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/speech.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd7a652fd88f4b3a10e17d093a98f888ebe106620996a37281eb38348c02cef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/notify/src/sound_policy.rs: crates/notify/src/sound_policy.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in EventSoundPolicy::decide_configured at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/notify/src/sound_policy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/notify/src/sound_policy.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b18214b3e3b81defb446fe0ccbf5a03abad3cfab3c54de52613250a137e387"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/workflow/journal.rs: crates/engine/src/tools/workflow/journal.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in WorkflowRunJournal::hydrate_runs at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/workflow/journal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/workflow/journal.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde220008fcd4af174bc1f89a1f7517750b88c8ce6838fe157de78963a8336bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/runtime_threads/manager/external_agent.rs: crates/engine/src/runtime_threads/manager/external_agent.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in RuntimeThreadManager::apply_external_update at line 1384. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/runtime_threads/manager/external_agent.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager/external_agent.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e8f2500f5cc647df4f4ae433e04c2ef5fac2214b9676df2d187e1292955d62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/split/module_graph.py: scripts/split/module_graph.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in module_graph.build_report at line 530. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/split/module_graph.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/split/module_graph.py"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"1014a4359ef677474c40485f30e4b2e64e6ff1ee7825aa21f906d0ca982f42c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/dsh_network.rs: crates/engine/src/extension_host/dsh_network.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in codewhale_engine::extension_host::dsh_network::fetch at line 1069. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/dsh_network.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/extension_host/dsh_network.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf821c3b1c9f73044b82a3efa6d66519337dfb49c663858bd49287259567591"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/skill-install/src/frontmatter.rs: crates/skill-install/src/frontmatter.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in codewhale_skill_install::frontmatter::parse_frontmatter at line 127. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/skill-install/src/frontmatter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/skill-install/src/frontmatter.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09a8136adc47176eefcc05e09f603249c5c64f7d3dc45f84c9750b0356222be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/src/core/dot-field.ts: pet/src/core/dot-field.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in dot-field.projectDotField at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/src/core/dot-field.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/dot-field.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2552981151d2d1d2adb720ae4b88b284f91301fc957643b1ca927faa2a9ad514"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/src/core/pet-sim.ts: pet/src/core/pet-sim.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in PetSim.restore at line 311. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/src/core/pet-sim.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-sim.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"39370c72ee2442556d206b3023196761272721a33f38ae2b053dfaee7609fbff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/split/reexports.py: scripts/split/reexports.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in reexports.run at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/split/reexports.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/split/reexports.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1d84275e8a4e8e30b71a1d54059e7c12d3ed295366a062f24f08c49de89ee1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/sanitize/src/sanitize.rs: crates/sanitize/src/sanitize.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in codewhale_sanitize::sanitize::strip_ansi_impl at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/sanitize/src/sanitize.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/sanitize/src/sanitize.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a33705a2c7f9dd7d5338263570919f3eeeb28d0c17bd7a5df91474d9d5c3b70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugins/src/install/tarball.rs: crates/plugins/src/install/tarball.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_plugins::install::tarball::scan_bundle_entries at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/plugins/src/install/tarball.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/plugins/src/install/tarball.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eee7fc8b75f5e63fa51ccc67aa019f20ec76952a8d93f94fbca297e7b23384a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/split/crate_map.py: scripts/split/crate_map.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in crate_map.build at line 159. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/split/crate_map.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/split/crate_map.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"223e0b9b66d34407ceb474a76f7897f6652311b70ebf2e706e2be536f92bed9b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/plugins/marketplace.rs: crates/tui/src/commands/groups/plugins/marketplace.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_tui::commands::groups::plugins::marketplace::render_candidates at line 280. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/plugins/marketplace.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/groups/plugins/marketplace.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2befa87d20e39656f0f4e5f0ca9afcede99981fbd8b0bef6ab62f9d6e4dbc7f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/telemetry_notice.rs: crates/engine/src/telemetry_notice.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_engine::telemetry_notice::apply_persistent_preference_at at line 227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/telemetry_notice.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/telemetry_notice.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"78edcc3b065df9230502c5a107f853d00d26a3b8794eaf81319af7b5f42c1a7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/scripts/lib/pet-recorder.mjs: pet/scripts/lib/pet-recorder.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in pet-recorder.createPetRecorder at line 50. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/scripts/lib/pet-recorder.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-recorder.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d960abdd66c483fd6ef6aa5f99e98cd2c989f7588ccf11b6d8205fa1a1c3884"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/src/tool_history_repair.rs: crates/runtime/src/tool_history_repair.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_runtime::tool_history_repair::repair_tool_call_pairs_inner at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/runtime/src/tool_history_repair.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/runtime/src/tool_history_repair.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a22553b255a9a5f625414ea6025962009af6f2f87048c30476631582e64fdb7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/widgets/approval_band_legacy.rs: crates/tui/src/tui/widgets/approval_band_legacy.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ApprovalWidget::build_inline_parts at line 74. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/widgets/approval_band_legacy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c1f64e670d7b0d6045f169f1941c094114f7dcb294203f3cbb608b6ab471ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/pet_watch/graphics.rs: crates/tui/src/tui/pet_watch/graphics.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Renderer::render at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/pet_watch/graphics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/pet_watch/graphics.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"be25942917b39f5b1767ffd32435fed2c8a8250458af5ed5bdc559a89b6269a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/src/session_diagnostics.rs: crates/runtime/src/session_diagnostics.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in codewhale_runtime::session_diagnostics::classify_session_failure at line 233. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/runtime/src/session_diagnostics.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/session_diagnostics.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdfc60a58893adc76131977d365d4b5670b072e8a2b17dcd1142806b85a8b664"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/android/src/main/kotlin/codewhale/pet/PetViewModel.kt: pet/android/src/main/kotlin/codewhale/pet/PetViewModel.kt changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in PetViewModel.handle at line 261. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/android/src/main/kotlin/codewhale/pet/PetViewModel.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/android/src/main/kotlin/codewhale/pet/PetViewModel.kt"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"64caf946316e4ab59d7a0d27136e656b9ab0080acef151934e6f3c588dcf2bd0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/tools/github/host.rs: crates/engine/src/tools/github/host.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in codewhale_engine::tools::github::host::run at line 354. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/tools/github/host.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/tools/github/host.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8487c3cdd8bd22d4db18903a3ca1d6588b05da4b1aee29e627e3ce4419d59f75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/github-action/publish.mjs: scripts/github-action/publish.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in publish.publish at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/github-action/publish.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/publish.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"090280b4017417affd6dda79a0e95f2a3c9806996d42c74c106360e5be77e6ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/lib/content-watch.ts: web/lib/content-watch.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in content-watch.runSemanticDrift at line 279. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/lib/content-watch.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content-watch.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"556621b504d7bf08b77593419a6e03ed1c23f23e187ec0c778e1668dd0e92cba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/execution.rs: crates/engine/src/extension_host/execution.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_engine::extension_host::execution::run_job at line 547. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/execution.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/extension_host/execution.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff76795bcd1e411ee0214bc600c084bf562e9bcafd5e54e1b2b689a991265c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: npm/codewhale/scripts/verify-release-assets.js: npm/codewhale/scripts/verify-release-assets.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in verify-release-assets.downloadJson at line 188. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- npm/codewhale/scripts/verify-release-assets.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/verify-release-assets.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb99fc67b817b626e213724a7c8d9b75cb3b90e10eb66368754fd3547b4f2cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/mcp.rs: crates/engine/src/extension_host/mcp.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Session::observe at line 131. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/mcp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mcp.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08337ea9e35e893075aa0f4ba8910024ebdc943bd4e09c382b1bf9a748119e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/release/verify-release-inventory.js: scripts/release/verify-release-inventory.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in verify-release-inventory.run at line 137. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/release/verify-release-inventory.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/verify-release-inventory.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"227893fc2e73f2c72b1cafc67d026b49bca558a03c5ac41da1b78602a47e4bf7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/lib/computer-use-release.ts: web/lib/computer-use-release.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in computer-use-release.receiptQualifiedRelease at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/lib/computer-use-release.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/computer-use-release.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c805d32e90fe578e903e7a13964fc529e87b5a5f14f79bdb2e6a9fbe566dd9f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/config/import_claude.rs: crates/tui/src/commands/groups/config/import_claude.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_tui::commands::groups::config::import_claude::render_plan at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/config/import_claude.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/groups/config/import_claude.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6eda2c740b690782f9221ef9dff2a8a5d697e7987dbac3c367feca80922963f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/runtime/src/external_credentials.rs: crates/runtime/src/external_credentials.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_runtime::external_credentials::open_secure_regular_file at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/runtime/src/external_credentials.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/runtime/src/external_credentials.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3009e5fb481a228c88e5174c9dc6b38832ebda9134f49262b93614bc470a1c49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: extensions/vscode/src/extension.ts: extensions/vscode/src/extension.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in extension.activate at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- extensions/vscode/src/extension.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/extension.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8836644f374d2b38ddcab69470465fcbd2e2e56222b42606c118dcdbf39e3db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/slash_menu.rs: crates/tui/src/tui/slash_menu.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in codewhale_tui::tui::slash_menu::visible_slash_menu_entries at line 20. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/slash_menu.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/slash_menu.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a84e73bd7023ddaceb38eeae6badc671bedb125219f7cde6158272401f2f17e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_api/plugin_index.rs: crates/app-server/src/runtime_api/plugin_index.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in codewhale_app_server::runtime_api::plugin_index::get_plugin_index at line 228. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_api/plugin_index.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/runtime_api/plugin_index.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf8eb3855563160035b958d02b080d196c8245ceaeda994f8553b6c3a05dea2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/scripts/install-guide-lib.mjs: web/scripts/install-guide-lib.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in install-guide-lib.buildInstallGuide at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/scripts/install-guide-lib.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/install-guide-lib.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f6a830921069b7f52dfc86d14e6b89d1507e20a76fb991a9439895814b6a18"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugins/src/install/dsh/presets.rs: crates/plugins/src/install/dsh/presets.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in codewhale_plugins::install::dsh::presets::contained_module at line 9. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/plugins/src/install/dsh/presets.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/plugins/src/install/dsh/presets.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"298ce705ccb6928fc5ac6c888ccc7ee6796ffebdc30cf73605af9beb75b75908"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/lib/draft-claim-lock.ts: web/lib/draft-claim-lock.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in draft-claim-lock.applyDraftLock at line 52. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/lib/draft-claim-lock.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/draft-claim-lock.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"070572ed190f4732b9f96d4a433fb87ba8d15e98de3b3bac2065b4bfe3ede277"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/android/PetSim.kt: pet/android/PetSim.kt changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in PetSimKt.gaitTarget at line 126. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/android/PetSim.kt\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/android/PetSim.kt"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0e9da2f406ab35a7cc9c05cd54224a2c96d7576a0864118f89de47a32fb347"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/memory/memory.rs: crates/tui/src/commands/groups/memory/memory.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in codewhale_tui::commands::groups::memory::memory::memory at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/memory/memory.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/groups/memory/memory.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a8781211e2d2955601c901723070719359b66823cca14d0d9641171c7588b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/ios/CodewhalePetApp.swift: pet/ios/CodewhalePetApp.swift changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in CodewhalePetMobileApp.body at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/ios/CodewhalePetApp.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/CodewhalePetApp.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ef7d890a26286e785f34744d9a625242c16f9c4062dd963c354f4d68c731d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/integrations/cli.rs: crates/tui/src/integrations/cli.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_tui::integrations::cli::print_status at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/integrations/cli.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/integrations/cli.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c206ff6a821281b418da504c75aab70a2471f8edb8b9eeef738433f20972a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: integrations/bridge-core/test/support/stub-server.mjs: integrations/bridge-core/test/support/stub-server.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in runtime at line 40. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- integrations/bridge-core/test/support/stub-server.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/test/support/stub-server.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8419dffbbfd441f93de89fc467a325ddd4f8b9a7d1b5c4901c65d76a74dff86a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/github-action/setup.mjs: scripts/github-action/setup.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in setup.workflow at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/github-action/setup.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/setup.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b629e836924a9ba368995d57ad18893c2fcdaaf8177b6ddce6d94f09ba6949"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/net/src/import_claude.rs: crates/net/src/import_claude.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in codewhale_net::import_claude::build_plan 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/net/src/import_claude.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/net/src/import_claude.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4cfdcef8c8a8792370e1218b81aba110c93d589381c3c615316fd0d42b4ee3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/config/src/catalog/corrections.rs: crates/config/src/catalog/corrections.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in CatalogCorrections::validate at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/config/src/catalog/corrections.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/config/src/catalog/corrections.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5466924783d26e428aa649b7f3fa16a85c3f077c12089cde1b5513c78f4cfeb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/tui/widgets/attachment_preview.rs: crates/tui/src/tui/widgets/attachment_preview.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in AttachmentPreviewWidget::render at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/widgets/attachment_preview.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/widgets/attachment_preview.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e52416e5849fdccaece09d2c6334fdcd9828e5ecfa4e687a321c774cf78aaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/dsh_terminal.rs: crates/engine/src/extension_host/dsh_terminal.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_engine::extension_host::dsh_terminal::serve at line 117. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/dsh_terminal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/extension_host/dsh_terminal.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"3211ec931c47e6d087df94d21b3c3196c064365c7a937be1ef4c86f00328dc57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/plugins/src/marketplace/parsers/kimi.rs: crates/plugins/src/marketplace/parsers/kimi.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in codewhale_plugins::marketplace::parsers::kimi::parse_kimi_entry at line 110. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/plugins/src/marketplace/parsers/kimi.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/plugins/src/marketplace/parsers/kimi.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db8dd7652faa63ca6736c01bff9f73edfaccce853d1d65f9bcbf30b9e8360ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/build-lock.py: scripts/build-lock.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in build-lock.main at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/build-lock.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/build-lock.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2850e35fcd4054484e393cafbe82045c11eea1ecef14583479441ab5299ce6e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: pet/macos/CodewhalePetApp.swift: pet/macos/CodewhalePetApp.swift changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in CodewhalePetApp.body at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- pet/macos/CodewhalePetApp.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/macos/CodewhalePetApp.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cce033d3be3534a0ef7d176b0866975e0e44581eefd8e553e837a2f40533eb8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/engine/src/extension_host/dsh_workspace.rs: crates/engine/src/extension_host/dsh_workspace.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_engine::extension_host::dsh_workspace::serve at line 82. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/extension_host/dsh_workspace.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/dsh_workspace.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acaee113cb93e35ef1d748d216fcd8f3e0f4336ed636870b119e2b967dc3bdb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/config/src/catalog/configured.rs: crates/config/src/catalog/configured.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in codewhale_config::catalog::configured::validate_configured_models at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/config/src/catalog/configured.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/config/src/catalog/configured.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"36793cfa374384fbe3352daa30ac93f5059f3c864fabdfd6d1d10bdccb684bda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/components/contributor-merch.tsx: web/components/contributor-merch.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in contributor-merch.ContributorMerch at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/components/contributor-merch.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/contributor-merch.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0a5b47114a880e52512e6a09c0b7cd0ed8fff903e4ee8856029fd01dee0b147"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/split/widen.py: scripts/split/widen.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in widen.main at line 335. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- scripts/split/widen.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/split/widen.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"3354b87c675769ad3b24ab041547298b6758c458421c4eb96c3ace5d0d3f99f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app-server/src/runtime_api/members.rs: crates/app-server/src/runtime_api/members.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_app_server::runtime_api::members::start_thread_member at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server/src/runtime_api/members.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server/src/runtime_api/members.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3744e56cc786f510059b84c231649e75d420ba97953dee3e799b2fb4da60835"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/tui/src/commands/groups/skills/restore.rs: crates/tui/src/commands/groups/skills/restore.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in codewhale_tui::commands::groups::skills::restore::restore at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/skills/restore.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/skills/restore.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d718e8aff1b7c1beb525528ffddadd3c277b84e0e894b6859da9e8d8aaa6589c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/tui/src/tui/clipboard.rs: crates/tui/src/tui/clipboard.rs changed 23 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is ClipboardHandler::read_content at line 605), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(clipboard): reuse the confined writer for relocated state roots\u201D; \u201Cfix(tui): drop the unneeded mut on the PowerShell stdout handle\u201D; \u201Cfix(tui): bound the PowerShell clipboard fallback\u201D; \u201Cfix(tui): read Windows clipboard images through .NET as a fallback\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/clipboard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/clipboard.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"5830287f2d13e5f5a8494de0131fdc3937206ada70e7118e3ac79d080a4dbdc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/lib/community-agent.ts: web/lib/community-agent.ts changed 17 times in last 90 days and 13 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is community-agent.getPostOutcomeUnknown at line 491), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): bound weekly digest archive reads and rendering [skip ci]\u201D; \u201Cfix(web): serialize draft generation with maintainer review [skip ci]\u201D; \u201Cfix(web): bound DeepSeek response bodies for both community clients [skip ci]\u201D; \u201Cfix(web): serialize generation and reconcile uncertain posts before retry\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/lib/community-agent.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf6d326f58e3c7b56198a368bcbf3e50db75dfea55f4174f0893258bd13b5ea"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/runtime/src/session_tree.rs: crates/runtime/src/session_tree.rs changed 18 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is SessionJournal::prune_plan at line 433), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(session): stop the comparison doc from overclaiming\u201D; \u201Cfix(session): match a projection strictly unless the entry stores a message\u201D; \u201Cfix(session): refresh a metadata-only prefix instead of forking\u201D; \u201Cfix(session): converge the journal when turn metadata differs\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/runtime/src/session_tree.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/runtime/src/session_tree.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b30b97305df8ebd285d8a07564876b82b7846887f8bacca425061388a23a36"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/config/src/credentials.rs: crates/config/src/credentials.rs changed 12 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is codewhale_config::credentials::set_provider_api_key_unlocked at line 102), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(auth): keep credential prompts and assertions free of secret sources\u201D; \u201Cfix(cli,config): key prompt stream, model set routes, clear outcome, app-server config\u201D; \u201Cfix(config): refuse storing an API key for openai-codex in the shared writer\u201D; \u201Cfix(config): mark root auth_mode only when saving the active provider\u0027s key\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/config/src/credentials.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/config/src/credentials.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4ea9f13d4d75dc6a6007183114b9cb1b92fc87ae7f19d3ff2d155358c07223"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/workflow/src/js_authoring.rs: crates/workflow/src/js_authoring.rs changed 11 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is codewhale_workflow::js_authoring::blank_quoted_strings at line 131), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(workflow): match the construct deny list on code, unquote fleet TOML strings, hide slot_dropped (#7312)\u201D; \u201Cfix: bound workflow ingress and frecency persistence\u201D; \u201Cfix(runtime): let delegated work finish without invented budgets (CW-7500) [skip ci]\u201D; \u201Cfix(workflow): scope the stopship scout to files that exist\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/workflow/src/js_authoring.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/workflow/src/js_authoring.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"65183f2971af3301e5967b803f31379a5e5bd7ba9ddb5df9b73d891d2fe21de9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/lib/community-agent-tasks.ts: web/lib/community-agent-tasks.ts changed 9 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is community-agent-tasks.generateDigest at line 41), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): serialize draft generation with maintainer review [skip ci]\u201D; \u201Cfix(web): serialize scheduled and manual facts refreshes [skip ci]\u201D; \u201Cfix(web): serialize generation and reconcile uncertain posts before retry\u201D; \u201Cfix(web): put every cron and page read of another host under a deadline\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/lib/community-agent-tasks.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent-tasks.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9967d119298c191bdf2d23f83b8b66b78afe4ce8ca4b08bbf000862bd8fe07"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/tui/src/tui/streaming_thinking.rs: crates/tui/src/tui/streaming_thinking.rs changed 10 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is codewhale_tui::tui::streaming_thinking::animate_pending_translation at line 161), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tui): a paused stream shows the thinking it already received (CW-7876)\u201D; \u201Cfix(tui): preserve translated reasoning placeholder at block boundaries\u201D; \u201Cfix(tui): deliver a reasoning tail before the active cell is flushed\u201D; \u201Cfix(tui): keep a prose tail that a reasoning block interrupts\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/streaming_thinking.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/streaming_thinking.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"73256f18ecd48c2004966eab2b9aae5c4c483ff781c53d24d8236d8cdd1983c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/tui/src/tui/history/file_mutation.rs: crates/tui/src/tui/history/file_mutation.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is FileMutationReceipt::from_success at line 55), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tui): drop idle Work bar label, keep ocean art off text, one Thinking label (CW-7876)\u201D; \u201Cfix(tui): bound retained output views and preserve exact decisions [skip ci]\u201D; \u201Cfix(tui): localize activity and file receipts [skip ci]\u201D; \u201Cfix(tui): drop field labels from calm shell cards and quiet system notes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/history/file_mutation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/history/file_mutation.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd84d12fcb37b1fb15c922922a6b616b5d097465b0dfc1a464bab766bcbe9da"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/tui/src/tui/worktree_manager.rs: crates/tui/src/tui/worktree_manager.rs changed 9 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is WorktreeManagerView::handle_list_key at line 208), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tui): create worktrees off the render loop\u201D; \u201Cfix(engine): bind stall supervision to admitted turn and offload blocking work\u201D; \u201Cfix: retry Chat opens on both HTTP versions, give body text an explicit ink, name the export command at every resume, and tell a read-only shell it is offline\u201D; \u201Cfix(tui): move task-store, Fleet and session reads off the async runtime; validate worktree names\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/worktree_manager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/worktree_manager.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9a9f951469bff900a66f75af478c36ead808b4a272de638f6f5485d5a1cfd0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/tui/src/commands/groups/memory/note.rs: crates/tui/src/commands/groups/memory/note.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is codewhale_tui::commands::groups::memory::note::note at line 15), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tui): confine workspace context, note and anchor file access\u201D; \u201Cfix: harden project config, repository reads, fetch refspecs and downloads\u201D; \u201Cfix(tui): the dock\u0027s GIT, FILES and NOTES views are real, on one git probe\u201D; \u201Crevert: drop the session-grant key and /note path changes from a8755ae00\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/groups/memory/note.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/groups/memory/note.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c17bae488a56b0c19c2c90f27212f0e5c695b33a7c568ee3b7311c666aff26c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: integrations/weixin-bridge/src/lib.mjs: integrations/weixin-bridge/src/lib.mjs changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is lib.sendMessage at line 351), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bridges): reconcile interrupted Feishu and Weixin deliveries [skip ci]\u201D; \u201Cfix(weixin): stay inside WeChat\u0027s reply limits and answer approvals by code (CW-6770)\u201D; \u201Cfix(weixin): retain retired account receipts and enforce chat thread ownership\u201D; \u201Cfix(weixin): validate send acceptance and cancellation\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- integrations/weixin-bridge/src/lib.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/lib.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97cafe51b57d99cc1029aec12c233c7d24c6df6f460dab713e136e107de95ce"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/tui/src/tui/history/checklist.rs: crates/tui/src/tui/history/checklist.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is codewhale_tui::tui::history::checklist::render_checklist_card at line 236), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tui): bound retained output views and preserve exact decisions [skip ci]\u201D; \u201Cfix(tui): localize activity and file receipts [skip ci]\u201D; \u201Cfix(tui): polish slice 2: honest chrome, quieter errors, cards that don\u0027t repeat themselves\u201D; \u201Cwip(0.10.2): plan-handoff-regression\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/history/checklist.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/history/checklist.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"78424b575bddefc6d878932b9adc3c6087939cc0f9211d17aba511794c9f9f54"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/tui/src/commands/debug_group.rs: crates/tui/src/commands/debug_group.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is codewhale_tui::commands::debug_group::host_result at line 81), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(undo): bind file rollback to the selected recorded invocations [skip ci]\u201D; \u201Cfix(tui): persist conversation rewind after restoring request files [skip ci]\u201D; \u201Cfix(tui): cancelled turns release input at once; /edit never loses the revision; short paste toast\u201D; \u201Cfix(tui): acknowledge and persist conversation undo before retry\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/commands/debug_group.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/commands/debug_group.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e9f1bb8f346094d5211fe6cbbe9bb2bd7988477fe3fe22a1478b2ab993d149"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/config/src/config_document.rs: crates/config/src/config_document.rs changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is codewhale_config::config_document::remove_key_preserving_leading_decor at line 521), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(runtime-api): make the provider-switch undo exact, detached and serialized; memory scope follow-ups\u201D; \u201Cfix(config): signing out of DeepSeek-CN keeps DeepSeek\u0027s own key (#6394)\u201D; \u201Cfix(config): read legacy top-level base_url/api_key by one rule (#6394)\u201D; \u201Cfix(mcp): serialize configuration edits and reject stale saves\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/config/src/config_document.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_document.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c437f24131f457b76637c927d00a043638ad6af948ddd161acbc62376bd8bb9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/app/[locale]/docs/guide/page.tsx: web/app/[locale]/docs/guide/page.tsx changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is page.GuidePage at line 22), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): lead terminal preview with the current composer\u201D; \u201Cfix(web): show the actual Codewhale terminal across public surfaces\u201D; \u201Cfix(web): correct false claims, fix focus and contrast gaps, lift the ombre\u201D; \u201Cfix(web): keep maintainer source notes off rendered docs pages\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/app/[locale]/docs/guide/page.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/docs/guide/page.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"675dc721e71eb49200897dfee28506881ddd3440f32fc797f1610ff8e1204671"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/config/src/local_reasoning.rs: crates/config/src/local_reasoning.rs changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is LocalReasoningSpec::normalize at line 30), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: retain the vision thinking off switch\u201D; \u201Cfix: retain legacy reasoning preference aliases\u201D; \u201Cfix: retain separate thinking model contracts\u201D; \u201Cfix: scope model effort to template kwargs\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/config/src/local_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":"crates/config/src/local_reasoning.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"602ec8cf2fc5146fcd75404b6157cb13d4dfc0d45c36f093ce722f89f7e43fcf"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: npm/codewhale/scripts/run.js: npm/codewhale/scripts/run.js changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is run.run at line 128), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(npm): warn on native HarmonyOS and point to the Linux subsystem\u201D; \u201Cfix(npm): forward only SIGTERM to the native binary\u201D; \u201Cfix(cli,npm): exit codes, hidden key prompt, config and alias routing, wrapper signals and download timeouts\u201D; \u201Cfix(cli): first-contact text names codewhale, the right updater, and real install state\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- npm/codewhale/scripts/run.js\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/run.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"903afd3f91fdade9479f78bc031379576b3e60123d58113a82bfc42f0f4fd9b8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/tui/src/tui/image_preview.rs: crates/tui/src/tui/image_preview.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is ThumbnailCache::request at line 198), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(tui): drain finished preview decodes with while let\u201D; \u201Cfix(tui): address clipboard review findings\u201D; \u201Cfix(tui): track an empty attachment list and localize the paste error\u201D; \u201Cfix(tui): keep clipboard image paste image-only and repaint on decode\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/image_preview.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/image_preview.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"8429c8461558f35ab774cdf1a82e288e43f15a60164ce39a2c88835256c24d73"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/workflow/src/named_fleet.rs: crates/workflow/src/named_fleet.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is codewhale_workflow::named_fleet::strip_toml_comment at line 456), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(workflow): match the construct deny list on code, unquote fleet TOML strings, hide slot_dropped (#7312)\u201D; \u201Cfix(workflow): refuse fleet and router names that leave their directory\u201D; \u201Cfix(fleet): workflow(fleet:) runs saved v2 Fleets as a frozen exact snapshot\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/workflow/src/named_fleet.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/workflow/src/named_fleet.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d57638db52f2c7eff6360b9b1a383c1c95ac8a8b6f1b317282a57043556d3ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/lib/deepseek.ts: web/lib/deepseek.ts changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is deepseek.requestChat at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): bound DeepSeek response bodies for both community clients [skip ci]\u201D; \u201Cfix(web): put every cron and page read of another host under a deadline\u201D; \u201Cfix(web): run the website agents on deepseek-flash (V4.1 Flash)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/lib/deepseek.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/deepseek.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8270d7632b209cfbcb10bfee5b74c325ab13aaeac02512fe9be142a283052a12"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: web/components/native-terminal-gallery.tsx: web/components/native-terminal-gallery.tsx changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is native-terminal-gallery.NativeTerminalGallery at line 37), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(web): restore ocean identity and explain the full product [skip ci]\u201D; \u201Cfix(web): make Fleet and provider previews readable; add Cargo install\u201D; \u201Cfix(web): lead terminal preview with the current composer\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- web/components/native-terminal-gallery.tsx\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/native-terminal-gallery.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab2f22e6c63a74f4c0d523fbfc2389c137ffa73e1ae1b09320a0e9f63199287"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/app-server-protocol/src/rpc.rs: crates/app-server-protocol/src/rpc.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is RpcMessage::into_call at line 77), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(app-server): accept and return the pinned thread/start contract\u201D; \u201Cfix(app-server): project thread/read onto the pinned ThreadReadResponse\u201D; \u201Cfix(app-server): return the pinned thread/list response shape\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/app-server-protocol/src/rpc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/app-server-protocol/src/rpc.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a689a333b88ebf6ce96c2a557af6fa637fca47437f5bf4b1560e481b3cc136a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/config/src/cloud_facts/catalog_patch.rs: crates/config/src/cloud_facts/catalog_patch.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is codewhale_config::cloud_facts::catalog_patch::apply_patches at line 62), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(catalog): reasoning controls Codewhale records hold online too (#6396)\u201D; \u201Cfix(catalog): Codewhale corrections hold online, not only offline (#6396)\u201D; \u201Cfix(catalog): the offline seed never marks image input unsupported (#6396)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/config/src/cloud_facts/catalog_patch.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/config/src/cloud_facts/catalog_patch.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"82250f7db04dc18f486e4dbb595eadf6cd5fb38b13b4f743222975b82fc1f513"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/tui/src/tui/git_mention.rs: crates/tui/src/tui/git_mention.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is codewhale_tui::tui::git_mention::resolve_git_mention at line 162), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: show non-ASCII paths as written in /diff and git mentions (#7317)\u201D; \u201Cfix(tui): bound the git and Wayland clipboard calls that could hang the UI\u201D; \u201Cfix: keep blame, working-tree reads and fetch tags from running repo config\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/tui/git_mention.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/tui/git_mention.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5217dc2fb7734777871204823f790557322cb13aaca81f82a2a622e1deda57e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/engine/src/llm_error_envelope.rs: crates/engine/src/llm_error_envelope.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is codewhale_engine::llm_error_envelope::envelope_for_other_llm_error at line 158), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): stop reporting provider timeouts as \u0022after 0ns\u0022 (#7253)\u201D; \u201Cfix: address rate limit review findings\u201D; \u201Cfix(engine): stop replaying inference with unknown outcomes [skip ci]\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/engine/src/llm_error_envelope.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/engine/src/llm_error_envelope.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae5a771a625629acafab7841f8485108b0cb63f7b5a4f3488f18e9c35c746d1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/runtime/src/runtime_control.rs: crates/runtime/src/runtime_control.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is codewhale_runtime::runtime_control::owner_work at line 13), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(engine): Anthropic tool-name encoding, usage-journal headroom, pre-turn watchdog, lenient session list\u201D; \u201Cfix(engine): bound turn-start work and log each turn phase (#6184 hardening)\u201D; \u201Cfix(engine): serialize worker admission and persist terminal receipts [skip ci]\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/runtime/src/runtime_control.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/runtime/src/runtime_control.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfcc1d5eb6c71899a2050772dc3d677f47f328ad6d228c4c19bfa386aec2662"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: integrations/wecom-bridge/src/lib.mjs: integrations/wecom-bridge/src/lib.mjs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is lib.validateBridgeConfig at line 188), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(bridges): rotate WeCom stream replies before the 10-minute expiry\u201D; \u201Cfix(bridges): surface WeCom API error details in bridge replies\u201D; \u201Cfix(security): tighten approval, execution and endpoint boundaries for 0.10.1\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- integrations/wecom-bridge/src/lib.mjs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/lib.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"41b68c8c212dd9bcf8402b256e3703399c1970df4e4049d61b684cc21d03f840"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/lane/src/worktree.rs: crates/lane/src/worktree.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is codewhale_lane::worktree::remove_worktree_if_expired at line 116), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: more workspace .codewhale writers go through confined or link-refusing paths\u201D; \u201Cfix(lane): inline start cleans up its worktree; tmux dry-run is test-only\u201D; \u201Cfix(subagent): keep sub-agent worktrees under their root and harden worktree add\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/lane/src/worktree.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/lane/src/worktree.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ce8d5b88e9108f3a6d70dcc9406f6f0aa40e1df6bda2f83e8d82e5f2526118"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: crates/tui/src/integrations/dsh/detect.rs: crates/tui/src/integrations/dsh/detect.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is codewhale_tui::integrations::dsh::detect::detect at line 214), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(dsh): read current DeepSeek Harness prerelease versions as semver\u201D; \u201Cfix(tui): preserve actionable error guidance without runtime probes\u201D; \u201Cfix(tui): actionable CLI error messages (doctor, exec, stream, review)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 21:46:32 -08:00\u0027 --until=\u00272026-11-13 21:46:32 -08:00\u0027 --full-history --no-merges -- crates/tui/src/integrations/dsh/detect.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once 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/tui/src/integrations/dsh/detect.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10accf0ab7fbacf752233e56cb435223b757832c665f792c43fdf13619364d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Todo list for the canonical \u0060work_update\u0060 progress surface. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":2365}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dda30b8e947e1726d1dd092e14b8baba229fa3ff77b4448707ddab02b6e8ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // when another view was up (the dock opens on TODO), any painted row \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/input.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d697ab4feac0fbfca00cb30c132eb4697db4657d4354699590830a05262ba2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// dock opens on TODO; AGENTS is the next tab (founder, 2026-09-03). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/mod.rs"},"region":{"startLine":3843}}}],"partialFingerprints":{"codehealthFindingId/v1":"841f8a160c6971071145a15172fd7157f19db757deef96b11d6a74d170a1eae9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// text beside them. The plan-step list reads TODO, not TASKS \u2014 the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/model.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d28633d582d3129241344b49877d3f4c7215fa3b98d53dfe615f235753933a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // open on TODO when the workers themselves live one tab over. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/model.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f701001cb090924788f55433d68cbe3166e23f592a5ec18f7852b278b81d1d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // resolved view stays TODO. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/layout.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb3efff759a1c7ebfc4973f47166409bacd2f6f4c93670bdd28f524998628ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // The oldest two actions (\u0022read README.md\u0022, \u0022grep TODO\u0022) were dropped. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/agent_card.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b7334164252aa893dd852bad6b8b71c6869936804a5751c98311b654b4d027"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// \u2192 BACKGROUND, automations \u2192 their own view, the idle \u0060todo\u0060 word \u2192 TODO). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/frame.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2dea10ff6313c1fedbc5ba707e557579b752384d756226f88df301aee45b414"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo list and a non-empty plan. These should NOT bleed into the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/user_commands.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58ec1b1081e3a2f847c622890b6c1be4b7d276c860bb83c76fe28f84fe9182e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo list on every call, so once an item is cancelled every later call \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/work_graph/reducer.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6bbdd72cb9d767f4997e430110a00fa6102e14a88b169eff904bf728946584d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! Todo list tool and supporting data structures. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/todo.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1c6ed772ec4b8c710328b54d7cccf68ab877958fb7f256a376fc381cf8b0ca"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/rfcs/2189-persistence-sqlite.md\u0060 declares no status, while 5 of the 8 other records in \u0060docs/rfcs\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/rfcs/2189-persistence-sqlite.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7384f04fc4eeb4e93bf037d530b6aedcd0b31de62e53d5bce75313d5f5967ca"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/rfcs/4468-output-presentation-filters.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/rfcs/4468-output-presentation-filters.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2a7fa36b3680f1361fdf0b7096e8b9702182f438f6a24f2506e37c677b4358"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/rfcs/FILE_DECOMPOSITION_0_9_0.md\u0060 declares no status, while 5 of the 8 other records in \u0060docs/rfcs\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/rfcs/FILE_DECOMPOSITION_0_9_0.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e30d9603f1dd4e611801f2ee09566728ba635d04dca5693b4e276bf9f8a2936"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/rfcs/HARNESS_PROFILE_CUTLINE.md\u0060 declares no status, while 5 of the 8 other records in \u0060docs/rfcs\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/rfcs/HARNESS_PROFILE_CUTLINE.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"883a0a113fc280eb33fea9dee54ee5b0d48cd2d992b42e091e305e7cf5d71a3d"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context section: docs/rfcs/UNIFIED_PROVIDER_LOGIN.md has no Context section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/rfcs/UNIFIED_PROVIDER_LOGIN.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af90099133cc8e51cbd1e5f0497d7abe1f8558e121be1888f06ac79788f823a"}},{"ruleId":"D20","level":"note","message":{"text":"ADR declares no status: \u0060docs/rfcs/WORKFLOW_EXTERNAL_MEMORY.md\u0060 declares no status, while 5 of the 8 other records in \u0060docs/rfcs\u0060 do, so a reader cannot tell whether this decision is in force. Add a \u0060Status:\u0060 line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/rfcs/WORKFLOW_EXTERNAL_MEMORY.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1f5a6300830b5341537dca701d43811da038b0f6cd14beae903deee75853b9"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 13 of 64 project(s) overshoot their size bounds, lowering Project Cohesion to 6.0/10. The most over is \u0060crates/engine\u0060 (580228 LoC, 1973 module-visible types across 45 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"193bec48a263f6633c7f886987160c994c71ed7ddc7e4bb0b76772c3c7dd3037"},"properties":{"commitSha":"44b547dace6fc0da6f730f8c2c4ee7ed8e6e116b"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8df188198198c9f1e69d73edc05fb4239f0ac2181b1ec7b07bb4d3fca9ca4569"},"properties":{"commitSha":"1887bd002e18fcc2295ce2363f8b5c080fe49a75"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e071bd94e9da3ee03c4ac5ca68c80043bd2b4da9320d9ec71fa1612316ef197"},"properties":{"commitSha":"be980da403aa39544e5c2b061871f1fde8944117"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5ee15e2df6ad6ca7d927254ab213415999ed16d3d2543835e1d87d1c29baa2b"},"properties":{"commitSha":"be980da403aa39544e5c2b061871f1fde8944117"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90b921cd624a1a98819939c5160273b71bc673d69e95cfcb039eaaf11e2ba8e9"},"properties":{"commitSha":"67de548a97f4fae466883b3358f549f40201a829"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"86180adbdbdecd989ce1c2de774f7379049905660a38861519e7811100fc8ca8"},"properties":{"commitSha":"67de548a97f4fae466883b3358f549f40201a829"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"280b78a9a31be237bccbf35d4ccc549c684b9edb8f947b73d7c0c0fd8ed5855c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a978dd010a80e385fee1b7717e456f41ac5dcb15c03610416c0cb48aca084817"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46cacc027a83053b8e028f937d19a7ad8542fd8c1406813bd50c04eebda90c16"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"595d80ca071e66e1b0dd19f67cb052bc83e121242b07f3abdf10938e36fdb709"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae4b19a624088a80ae967fa19fc6e2d3b4d86bf95f6afb9918729adad8224e32"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"594ba20856faebb900e8f635978e37e019356a968254d953432a089b831a6265"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6e82f276bfb6d672886184c0931cbb9b9bee34c2519b9e181f9a509df6e826e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82a1893f62fe8dee3fcdaad2e3da3e94b86729172346ee8d336b86cb9d8780c6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ce5199733a1d684f41bd2201463ed6944b17ebfbd592035c67e621e1128b6744"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fabc9fa2f4d2debe0d367090cd5d27a1cf0d147153b6b2fc12e92dc9cf635786"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b562a86ba4fad32d6ccdcd6ca2d4c34c2236a59e5d8276adbfb83a1790cdee0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae8092dcd62b4908d31133b76529122f0b950da0c5d37ab56bfa03703feb8e5a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d60b62d604c56131cc6d1647d08df39006ee547da95a9ea6d0cc8e147867a1f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab979ab2dc46515c14a5a4f004fc991e04e40404eedb88f91aeaa5242f0df4a2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91a9a07de525ab8ad2fcc8a0d030e63b249791ca7a01a8c961bcb33d20857531"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36447e2e1b576962ab96dd786e91076fe267f5c1d70c5c976aee44a0f576bcaf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54015389eb5f9a0beb6433e209224f32665bbffd45f48b4ac71eacdc7584cddd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01293f96e0f9d37d9caa952fee9fa30ef0aa476b6f4332ead926b9c328b431b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"328e2c284f3e7941ffd012bb854ec8f23de2c1fe4f922418ea7f15818545bfba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4014e7719155abad9ee780737c6a29d8c31bcf1e70b94286734d74edc799576"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"544c4a2303e57e60958ebdb6fd0080ef710d74b76fe4c14761c1aedd5f552ab7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1e7c8176f19edef894e9a7206256544b1cc8ddcd5ec6853c8394f7216a29fa11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58416306c1a27a37c4768b939e55dd2865e8672774adab59964be2ffeffdd74f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ba1bd8cd7cc00ffea37dae7b5e07643f624b23874e3cb0759fc3e4878f73406"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9288cb9601314ea9a5685f9e586cf1ba51ab0bb8838969a5bcd635c80eff2bf4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"99c8716916ca0dd9ddee8302208a5745bab6513f34ca12c2672d93f07c07be5f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fe915542e9ef9e0e2030d13e5e967c9edc93ad44e0043112709e63c307bce8b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13b0d3295f5145c271d64adc19ce10727d925fb7b8c978aa592df49c5e78998f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"260f9ea948830093c9c00b3044eb1d222327e844586a9a326fcf67b5b4b08441"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b81debfdf26ad72c8d0b6ae327091ed6b094389fdb86a94cad6363ea8f38e48"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e9323362030c11a89ee75d7211b2720333c55d8869ae68ed4aebea060c08384"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de87decaa53b7ed723ebb58e81b37ffbd549c452394c8572a9ac880e5f9dffae"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f62fd35f276c347c16c53ccbb1e1206e048f995f0931d9d2ccc56e43aa71d772"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"233c283afabc3cbe9e1fb2c663cda67ee401e34fde1c1baa92c564e85ddd0b79"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a49921ff9658e600a3f453afc37654f66957d2397d9256fe1e8e6cc5677e9294"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c7ebd20495970c1c2f6c862f84fc8b47c598e441c90ece64c011cab5b4dab1c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc17439367157c6f6ff8590f4dfe29bc3a0ce4e328d99df310f8a49a2877af10"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbb3016e08588da0295feed2d3c1aabf07e14aa98db895f7d8608ac6dac5e7fc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff5cedb76841c30e69fc36a5907f71f7707dd4ad1a72f8101348786e2c675d1b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7493bb85aa2303f31804b6ff88c48fe50f76a3545417f12a1295f805c1a6f8d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d0de97403200e65c290d26b5d3e45e5bdda744961644dbbc94cf1a5c355ce56d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f052e3b915703ce74dbe254ce3507080529b36b18c985045e6219d12e5a0d05"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c178da23d5dfc12a928a90f7d5596cf295aa8c66dc6c666d793acf3eed7c78ff"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13666d7f082d11493c6d689afca054851fdb1f4b6acd5ae2e203e769a853c4da"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af0f14e8ddced3c080996807bc2349333c352d6a4333ab754d3567d30881d3bd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d39955a92f58915f4a1a014d8271144bbd15e442738d441b844c1faa56507716"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8358801f39b00898552496f70ea14d5cd30197b985656c6109c836b3d66a18b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fa03dd5c6754319f00472b439d942249818b769fc19844a54ae6a1ada7702aa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e8f29d6f96dfa86a46d1d90b1d93c60bd8e69d849b3d521763d602fdca41143b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"93d3e50834e48890766bf54ed1de547a68a4a140239d5e8640ffcac97a288ef5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"df38043f089cc380f0507d28c25a6e9fb75594e3ba57309dfa9892cd52cb6a01"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"79b1f05e5e0fc760b813df5563155e75e80e97eb4a6a74b128d6ee16a9b98bf7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0cfe2ca16cc873d4e4dabdfa21c1c31f6152c7047e4817690ee9ccc451866e58"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0964660517e2fb4aa579fd4644350b7882ba94beded2bc7ffb3cedf7f3e6faf6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d16c7da82ec109909ce442de7d8db8b80df5a0d8d155ff2a13c6bcf0c900c61"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35556a5475cb1c5234059a0b3c30dda978f5fd4eceae301f3db788741b04bfcc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd57e0c8e62c11154d32a4287e123d1910402bee54ff14cb73e5663fb4b153e3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"565cb0a25235d1502010c8d34a025c6ae5aeb826c7d5e305b97bb45399050c67"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdd80ff4efa055538dc59aafc5e380459b7d05030fbc7ee936f19fa678b3e896"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cac3b2c35b1859c9cccca383c8cdc7b1c721b6a5f53bc2c3f11a3324a1c63b93"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a7b2bafbb8959b78bd57e5586e023c03b6472b98a6f29bba3c52d2a7d19a364"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"341fef30e40c699fa8a97a3d601f89fa38aa7f3e554faea4a64aa429c32105e0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0089d67acf70eba6e17990db9054fc6e71ecc9349f5bb17cd812b777aef47c3f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd95268d45d74f39e20d65cefe23ae841c8551d2f0b14f3dfe83319df97bfd11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14a4fd8882763642988fb1bda330c5fb8cb7a83b32ec3bd1c6378613e4c9634f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2762566b0c29de4b54311e626bb858d36157a27029e10244ae4d519357a2f3e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e7dd7d5b8d844340b3c71cdedf8db9328c5834dcc5b871c16f273dc301ece74"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f83e3892fb131d2fa770190434362ee16e64eb67372a20816c0a786578910fec"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8aac6fbf7cef5c9a2b175cfb50def2c4d617fadf1feee53d39a6048bad157b86"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c897529219ba38b69db10a2e37615753c6c4d065f50af8e69c849fae9f0b2e08"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de9d74b0f9c57fdf43c233ceed27410f0a7dc715c7acf409c429373b9a156181"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"821f5ba3e3d5608d4e58e4a747fdf2ced08e080bd53f0725de040778ee38dc21"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b8a13bbeac04aa36fd940058bcc1ff5ade9ce0c170bb93ed23dbabb036053157"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08fe3c2d4e30852158b40657da127033cc3dd237b678d3626105770bb599ffb0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"456c506ad87f9560299a19771aa05f8707358f1837a37cd3a1cb2dac99022686"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83be7900b4b38ad2b1e1f8b1b392c6466186ed950f1cf5e0a25c1c90053b8d8e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"520ed02ecac752b847e45d28f31e80d64d2ec85e496c1d8d8e7bb2c312876844"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40a8dda92134584f0fc9cdd4780a8d09fde8e89891b00fde504d84f7ab0a049e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d47eab9cc1e7404b4b9540ca0388d1a7d531563f7f5ed7f07525fc137327306a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ac79baf7c40ac741b2560f6a62dee0fa696fb299416d4d4d4f242271079212e3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f38445b8b9d2dd69e99757f23b9e79cba1239acf8f1ad9754d0e6ee6623024a"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1a360e034f0d899f5768640850fdaff422e82e994b51b408d20609663af0aaf"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ee5ab338e0d88b6bff3c538070151120e6d12217de6cefaf490ba414e21c2b51"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4481f369a4fb4928448dd6fed4227218ab2c065e487e20c3ef80df831a8abd72"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d99fbca79a99c9380ced0b86a5bfbb2634f2b45bc99e3d127d34e61a9e2ff034"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"647358e01588dc8cfeb355c4514819c91ba3d94af6bb39e7888a37692f792048"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7dc5911041c643f59d53ba50e4cabc93534cb4f31f03b4601fb839136a7509bc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24604682602ff472b10c1336c579d97e73083c7d071751abb4472a9d6a073dad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af88c3faa7298e4ff29f507aff6710d733929b8dbdc7097f2c154d7521a42510"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"645819a97e243457f5e010a623a5727bc814c9d5eeea2a3e0b8c685fcfda3dc2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69c79c62d112caaadaf45ab62e74b98669a65456556e81baf1ade903e281e87e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2766e68b95e4ba02d777e3dceea9a30a04e3040df867eadfbf4af2a3da3ed77"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35e4f106d04789679bb7369670c26e731705004e1f69a48cdc46dd2b14ffe222"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fddddc39898191bbac978b8c6ad422479e92b9409c4596f9b7f66806dc9df872"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2ebca542b80906c6ce8ead365f7d65862c8c0dafd0a09874272c1a86941c3a66"},"taxa":[{"id":"CWE-116","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04c4f1f5d78af79c16b06371cf54b40ee1bd4630cd17d49252cc9cd81fa700e5"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a194b0a1070d6515b405b6c8bc9190f4efae7e54a811c4bfb287d02b6002bdc9"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9150530f05e27f276c5a816ec8731d266d0e502e09f938e43f00770fff00a6e4"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4f18fa3a30f0e27119519590fd0830fc8e4d3e0dde2d075b16bd3f28066ab31"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3243041702bfc8f16b9be1cb681a267ef9e5c90850cbb84b922fbd2004f57e3e"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d971823bec3f97bb883023bdf0ebfcc3afbc9a01af25bbba2b3aa28a388bc3c8"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9924b4cf8293c3af1c8b7a19ae9d983755af68ad107f5b0515bd58f5cdaba96"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"803a63a04093133693ef56131ab5016ba90c33e6edfffc58146c0f6f03c4eb87"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d4fbe5c0f294ab5efd1854adc1c8106c4e9380cbcdaf8cd3eaebdb39abe681bc"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c813eb0822baca23494229145a2832d270e4cdf3ba62af8b3b3c3a44230d5bb7"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"206b915c36688481d23c594b38950110beafa903a0985db19e3f3755e00d8ae6"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2c349fcf90ac24ac857475efc178f629e2790c8a009c9ec7b59d14469346d9d5"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c66469057142ec2cabb2b617a812dea02ac0ea2816abc7830fef0b8c8f23ee27"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f7d45d964529bd7efe8d491e7af167f16400fba90e3a247b21911539a21a3ed9"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"428e581aa7181a07f32d1979eebf308b3d0613f615b3342f27ed8a360d47a7cf"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e76b179f7e8bb47a8f7bf32336be37d0919ef69aec17be48a55c6ee6dc00046c"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c41de9b215d4a34d0c068ade1384bc5db95464f4fe2efbf7b9a03ba45cc71ab"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e511f5e277eaf5a6fcef2c506d6e14776f90bf9fd6c6a0fb4cbe34507f5a499d"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c83583b52a3b26f1de02c4bdc70706339289607b63e25fb6da72bc8b0d1bd8f8"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d8addb173a1e4be6eae92214f3ed19939df7f42b8599aed40d2fa2217483bdae"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"612e12d887dba7595546a8813ad3196b460817ceee92272e380be7efbaf0d9c6"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdd7578cd00c4292e503e43719269f0f50e2ef513ad885e1c38417d1565e52a"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f0f51c4da335ec4a441d200decf5dc1c7142186f1ef8b9dd8c67427fbd72aa8"},"taxa":[{"id":"CWE-117","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be3a492097eb7e67f9480d3b717b6e1f84a8e123acef8de382e5abc85dea30d4"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a6d98a792e762ad566e1262a69516ac59592dd390b99700b8bb5f07930c54ec3"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be702f2e4f0989e7b43d431cbc15fc1284bbea75d6fdc92a9a24b85b5b7036d5"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c363159d22f652e0bc07e3c846a7ae19c20bf1e67a157b4749e1b6c48ac25037"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"de70eaa1f5836783f86402fd5b4d9b4b5c2c9435b758bd4d128c9bcd8bc2786d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"338b1e8fb68e68c55406ccd58470c54c59855a3be232d8b8d287d752b685e97d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d6dba47009897017101e8450d0bc65de36c74622fa64f5be4d71c81e669bfbe"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ad5ecdcbe6b3f1ce644c59132e3f46cf57d6bc6727702e6117cc0decf3ab6bd8"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"318f7ab95d9856a639055f9cab5fc229c827668a0cef4af3c51924c9de9c758c"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"724a096c24c1e40de37c72a706d5de9f9f3b25cdc16b96f205d3179e35195135"},"taxa":[{"id":"CWE-209","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fff2d63dbdd4f354839959182ff294d52bb45ad24d5ffe17bd79763fadbe1ba9"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"455bb1afd3556861a248db8d768387769ac48e758f02c0dd636ecc9a13b97f22"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c62dd50c998765c0aac743c4364ffc2226caafa04580d3a769615c78b92deffc"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32f48efbcc750265803f5eb3ff85a9f5922b929e1deaf536f45a08dc5ee518a3"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c39601377810c338ea444cbcc604f3b26fdc1a7cc44f673ce21d839742a1463"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef710b3f51b684641a22390149c336a0ab427ff488f375b8d5084f55b6f9b50d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d6972c1b4c5b32fc06b943dda23e69e730b1e45e3c18b1543e2a14ad405a42d7"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7020ab27b8aaad5d1742a18f5be44a98a4aaf93d6001aaab1ab4938a40fa5da7"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0303839b3e44614c840b26ff819a226288f104f63e6ca3794edfb4baacaa23db"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7abeb32be4aaa6d89b4433e3c51fc8947757a815acc65271edf87f0093f5d523"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"980723e77518a00e482bb1c5d6a4c435e4ecb9cf2659726e4e4dd40414d2f984"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3260c05a4ec9a6ebb2d202ee2400433a983c7b640a543b716241694f0a4d52ca"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"936cae48a487aa4cf7726936fa44f7b6303f6c444892e6b9c3083d617565041d"},"taxa":[{"id":"CWE-862","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6600c2425f5ccfa0845ed973f06a7620ba5a08a1b9626e3af99e050cd167203"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"87b708bb14017ba2d3a701bb7ddaad85190d926a40f8cfadef5ea010128c774f"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"822d3ec93aba50393e7155de1ed04038712ce3c9c0794c1f3b8eded8e95ac6a9"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"885b9db01586948e02372c968d467e24a31f0d977eacdda7971df0ab6fe3c61c"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c1b0e23eab381734285b942ff27ecbe5ce4f498ca2e8a5dfc3c944a763e46dc"},"taxa":[{"id":"CWE-125","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eabf8509c433654ae647059f5c75a0cc923937e37466b2a0e0d117d8c05151a9"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"497af87d2264fa1b168142b28f4273750bfab67753de446bf70b9cd4fa8725b7"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"3.0.0","advisory":"RUSTSEC-2026-0371","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":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"4.2.0","advisory":"RUSTSEC-2026-0370","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":"f67f0700e108bacf2f3dfd2008273e31f01b0ea1f2d5f9ef71c4f46ace73bbe9"},"properties":{"dependency":{"package":"zvariant_derive","version":"4.2.0","advisory":"RUSTSEC-2026-0372","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":"b46d78aa043c305da47f4d94cb4ddf7cbf3590ee7ce3f49853933ae3d01401ea"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9042347813aa57ae5c5328b2992b9d23dcb83af08df8f228ac22e3d1dd286465"},"properties":{"dependency":{"package":"glob","version":"13.0.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"f7a3cfdcf0af42325e5befca57277578382f27acb2875a120a8d639c8e635ee2"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","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":"6c940d450910dacdfa1637c4ed5eb6e0a3812908994fcd608d3cba40db6897f1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"1f3de5ef0b48ca1917c9f9f2286bd0eae7c590636bcadbe579e0347bfdcbbb38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","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":"10ed20ee0463ded7e503a31a7325908ec962c227ec0c3a1e4dba96748234967d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b1568673c97a5ce9b1ec5a08dba083d705b7ca92047378b6f33333438b27491"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: provider_defaults.rs \u2192 provider.rs, provider_kind.rs, tests.rs, client.rs, config.rs: \u0060crates/config/src/provider_defaults.rs\u0060 changes together with 5 other files \u2014 \u0060crates/config/src/provider.rs\u0060, \u0060crates/config/src/provider_kind.rs\u0060, \u0060crates/config/src/tests.rs\u0060, \u0060crates/engine/src/client.rs\u0060, \u0060crates/runtime/src/config.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/config/src/provider_defaults.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"698bc0013a30df5d459754aa6064579fa0db3fd1e50adcc0a8283b250bd00c27"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: contract.rs \u2194 search.rs: \u0060crates/engine/src/tools/web/contract.rs\u0060 and \u0060crates/runtime/src/config/search.rs\u0060 change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006085688ac2\u0060 feat(search): DeepSeek Search API as a web_search backend (at that commit the files were still \u0060crates/tui/src/tools/web/contract.rs\u0060 and \u0060crates/tui/src/config/search.rs\u0060); \u006096555d81\u0060 fix(search): a pinned provider wins over native search; full native a\u2026 (at that commit the files were still \u0060crates/tui/src/tools/web/contract.rs\u0060 and \u0060crates/tui/src/config/search.rs\u0060); \u0060636bd4d9\u0060 Revert \u0022Add TinyFish as a first-class search provider with key autode\u2026 (at that commit the files were still \u0060crates/tui/src/tools/web/contract.rs\u0060 and \u0060crates/tui/src/config/search.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/contract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec90b89d223574cb952b9cd880bece962a12546e88bf8428db7d10db42143f1b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: tests.rs \u2192 handle.rs, tests.rs, tool_inspection.rs: \u0060crates/engine/src/core/engine/tests.rs\u0060 changes together with 3 other files \u2014 \u0060crates/engine/src/core/engine/handle.rs\u0060, \u0060crates/engine/src/core/engine/preview/tests.rs\u0060, \u0060crates/engine/src/tool_inspection.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/engine/src/core/engine/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f5d6fde951a12bb6994d8c7470c0e2b9e1b048e3e842acfe8efb47c08cf87e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: voice.rs \u2194 event_loop.rs: \u0060crates/tui/src/commands/groups/core/voice.rs\u0060 and \u0060crates/tui/src/tui/ui/event_loop.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060a1b7888b\u0060 fix(tui): repaint when a session preview lands; voice status says how\u2026; \u006047834cc6\u0060 fix(runtime): keep blocking calls off Tokio workers (#6149); \u0060f7b5c412\u0060 feat(openrouter): pin upstream vendors across request paths \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/voice.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2181abd08e167ee3e3fed0476bfd4e61afa619219bfc3741533fd6339d999c7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: session.rs \u2194 tests.rs: \u0060crates/tui/src/commands/groups/session/session.rs\u0060 and \u0060crates/tui/src/tui/ui/tests.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, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00602365ead4\u0060 fix(cost): count detached interactive agent usage in session totals; \u006081e2c4a7\u0060 fix(tui): dedupe child usage by response; \u0060df0afabb\u0060 fix(gates): land the owed workspace clippy baseline (-D warnings) and\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53459de57a1c420cfb9a48ac72f8797c83e2aec20bf64dd384f686ec888bf44"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: agent_details.rs \u2194 mod.rs: \u0060crates/tui/src/tui/agent_details.rs\u0060 and \u0060crates/tui/src/tui/work_surface/mod.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060ab9d13b0\u0060 feat(agents): show a parked child as parked, not \u0022waiting for input\u0022; \u00604ed1869a\u0060 feat(subagent): persist child route receipts (#5305); \u00603815bd70\u0060 feat(tui): open an agent\u0027s transcript directly from every agent row \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_details.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d230056d17788c266a4ef076138618c9e6f1433d6b76d15998289f811445b06a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 mod.rs: \u0060crates/localization/src/lib.rs\u0060 and \u0060crates/tui/src/commands/groups/session/mod.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060910a4e9d\u0060 fix(tui): make copy recovery interruption-safe (at that commit the file was still \u0060crates/tui/src/localization.rs\u0060); \u006073c4b815\u0060 feat(remote-env): disclose source handoff boundary (at that commit the file was still \u0060crates/tui/src/localization.rs\u0060); \u00606444630c\u0060 feat(remote-env): disclose source handoff boundary (at that commit the file was still \u0060crates/tui/src/localization.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/localization/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"434ea3913338f08a6368700937a86bcbd47d57378c88f484687f128ffe962d96"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: contract.rs \u2194 mod.rs: \u0060crates/tui/src/commands/contract.rs\u0060 and \u0060crates/tui/src/commands/groups/session/mod.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060075ceb22\u0060 feat(export): write HTML and JSON, auto-name files, fence tool output; \u0060a0d05931\u0060 refactor(FEAT-026): isolate structcopy behind shared command shapes; \u0060c71c66dd\u0060 fix(share): preview first, upload the redacted /export page as a secr\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b845e5b5af63af9953d3c47faf26976becc8c50f15d3b1959f9723ffb2f4489a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: chat_completions.rs \u2194 tests.rs: \u0060crates/app-server/src/chat_completions.rs\u0060 and \u0060crates/config/src/tests.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00603cf6fa9e\u0060 fix(route): honor a custom table\u0027s wire on runtime routes; \u0060f7b5c412\u0060 feat(openrouter): pin upstream vendors across request paths; \u00602ec6b257\u0060 fix(auth): centralize sentinel credential classification \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/chat_completions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe189d6f31a939ef964736bd67f9639a50c85a113a4f71f88f88b036c578aa71"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: chat_completions.rs \u2194 client.rs: \u0060crates/app-server/src/chat_completions.rs\u0060 and \u0060crates/engine/src/client.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00603cf6fa9e\u0060 fix(route): honor a custom table\u0027s wire on runtime routes (at that commit the file was still \u0060crates/tui/src/client.rs\u0060); \u0060f7b5c412\u0060 feat(openrouter): pin upstream vendors across request paths (at that commit the file was still \u0060crates/tui/src/client.rs\u0060); \u0060d1fd0e3d\u0060 fix(provider): finish OpenCode Zen rebase (at that commit the file was still \u0060crates/tui/src/client.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/chat_completions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"590cabbc86a9b53aaee9566235ad73aef657df6c1b080fd7c4ddd32eb23486e5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: input.rs \u2194 mod.rs: \u0060crates/tui/src/tui/work_surface/input.rs\u0060 and \u0060crates/tui/src/tui/work_surface/render/mod.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060e6248cb9\u0060 fix(tui): keep painting inside tmux under a VTE host; Esc hint follow\u2026; \u0060f77ff182\u0060 feat(tui): the work surface sits under the composer by default (#5809); \u00603b221c7a\u0060 fix(tui): keep work visible in compact rail \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38953a0c863177e05e16fe8dfa1579503923b10e369d516e04962f78b08f1954"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: test_runner.rs \u2194 verifier.rs: \u0060crates/engine/src/tools/test_runner.rs\u0060 and \u0060crates/engine/src/tools/verifier.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006089ff6277\u0060 fix(tui): start model-run child processes from the scrubbed environment (at that commit the files were still \u0060crates/tui/src/tools/test_runner.rs\u0060 and \u0060crates/tui/src/tools/verifier.rs\u0060); \u0060380df06d\u0060 fix(tools): delete the per-tool output caps in run_tests, git and ver\u2026 (at that commit the files were still \u0060crates/tui/src/tools/test_runner.rs\u0060 and \u0060crates/tui/src/tools/verifier.rs\u0060); \u0060233da9fb\u0060 feat(verify): Run tests/verifiers accept a bounded cwd (#6296) (at that commit the files were still \u0060crates/tui/src/tools/test_runner.rs\u0060 and \u0060crates/tui/src/tools/verifier.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/test_runner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af212fadc225dceeb4d4b8faacd026c611d5fd77be25ddafded4fd3ddcc7e0e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: chrome.ts \u2194 links.ts: \u0060web/lib/i18n/dictionaries/zh/chrome.ts\u0060 and \u0060web/lib/i18n/links.ts\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060d5d2d531\u0060 web: footer Project column labels the storefront link Merchandise (CW\u2026; \u0060a0722085\u0060 feat(web): link /app from the footer in 18 languages, tighten the pro\u2026; \u0060c95e72f8\u0060 feat(web): add /plugins page with marketplace \u002B Computer Use feature \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/i18n/dictionaries/zh/chrome.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80fb2642555ccc195e13e7ac4fdcb5dcd2576d3f195dffb7a7ea3ee9a6bea9c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: chrome.ts \u2194 links.ts: \u0060web/lib/i18n/dictionaries/en/chrome.ts\u0060 and \u0060web/lib/i18n/links.ts\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060d5d2d531\u0060 web: footer Project column labels the storefront link Merchandise (CW\u2026; \u0060a0722085\u0060 feat(web): link /app from the footer in 18 languages, tighten the pro\u2026; \u0060c95e72f8\u0060 feat(web): add /plugins page with marketplace \u002B Computer Use feature \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/i18n/dictionaries/en/chrome.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2fa4e39d73635ddde8ce56558babb24eb0b1cf0ebc5707d83aaf87cb0d7ade"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c5928b81075799790cb18fed2980a6b6e8aa5072772041c9951633efe8eb3542"},"taxa":[{"id":"CICD-SEC-1","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/port.html"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cdf81df20fb5b1b003cfafbafc87c1891ee9219dde80aac8b67363b8c7eb20"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_mobile.html"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee24001e32407bffeaa51b188b3c265ae6e7b16ea0282b8ceb8b0c36f68f265"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_mobile.html"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"070c9564943bc6c99f957d2db0fbe3ea644f5476256b5ead2f72f4b6549d2f6b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/orca-evidence.html"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae5c68ac754d09f88f9d73a5c789fea5a6e983381b4bb6a7b75a0c5a35d05e7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/admin/admin-client.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b03ead72a8363f251d6ac4cab8b9e6cb1b00dbc86610d03b1008caa0984f62"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-interest.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea36ededf856282f11139644c84a227895eed98eae82b915665fa1318910f07"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003Cfieldset\u003E without a \u003Clegend\u003E: A fieldset groups related controls but has no \u003Clegend\u003E to name the group. Add a \u003Clegend\u003E as its first child \u2014 or, if the group already has a visible caption beside it (or the fieldset is there only to disable its subtree and carries no group box), point aria-labelledby at that caption\u0027s id instead, which names the group without rendering a second one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-storefront.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ee7b41c2f73bf502fbf13f3cb838daf0463faf20af73a1e189ff39172f4337"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/port.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"613217db43fb3b5503b341ddaee9ac275627127c6a9dbfadbefb04d7c9cf4fd5"}},{"ruleId":"AC3","level":"warning","message":{"text":"Heading level jumps from h2 to h4: Skipping heading levels breaks the document outline assistive tech relies on. Don\u0027t jump levels \u2014 increase by at most one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/ratatui/explorer.tsx"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92b394e21551cd326b969ef17ee567d3bcc37d43837d02f74e3f2b85d54cd7b"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .choice with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/orca-evidence.html"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac351488ded8687b902b8d1053e14f029fc6e8a593da98593c42e2f9b7ad7f3"}},{"ruleId":"AC4","level":"error","message":{"text":"Clickable element isn\u0027t keyboard-operable: The repo\u0027s own CSS styles .choice with \u0060cursor: pointer\u0060, so this \u003Cdiv\u003E is a control \u2014 but it has no role, no tabindex=\u00220\u0022 and no key handler, so it can only be reached with a mouse. Use a \u003Cbutton\u003E, or add role \u002B tabindex=\u00220\u0022 \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/orca-evidence.html"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c871c1683f18dfb522fc2875b593fafa88b096f58e6a6007552950f19d3d3bde"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-pressed on a \u003Cdiv\u003E with no role to carry it: A plain \u003Cdiv\u003E has the implicit role \u0022generic\u0022, which supports no ARIA states, so this aria-pressed is dropped and assistive tech is never told the state at all. Put aria-pressed on the element that owns the behaviour (the button or control the user operates), or give this \u003Cdiv\u003E a role that supports aria-pressed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/orca-evidence.html"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c61f360245c3d43d13a42f3d5f79f05f170e8502290b8e4b006a0f20bf0e720"}},{"ruleId":"AC5","level":"error","message":{"text":"aria-pressed on a \u003Cdiv\u003E with no role to carry it: A plain \u003Cdiv\u003E has the implicit role \u0022generic\u0022, which supports no ARIA states, so this aria-pressed is dropped and assistive tech is never told the state at all. Put aria-pressed on the element that owns the behaviour (the button or control the user operates), or give this \u003Cdiv\u003E a role that supports aria-pressed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/orca-evidence.html"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9c15b85689db0ef2dbd22eb782e7ad79837dd822142c40903cd9375a0da571"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.search-field input\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/styles.css"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ea890abcca92eccf8a2b78794f3cae639eddc8886485ffbf406ac9c9ee1f92"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.other-answer\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/styles.css"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"276a609419d8060b03bbdce45d3041984e3680b036ab39444d1cc6a9bfe21250"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.composer textarea\u0060 sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/styles.css"},"region":{"startLine":998}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14cfd35de62ed398df1b1e1bb62bcfd23fcb47b8c2905687711a17000f8c627"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: RuntimeEventJournal.load: \u0060RuntimeEventJournal.load\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d874cd19718bdb4c68e340314409144fe5428da9e9d5cc0407a292140c16d3f"}},{"ruleId":"DM4","level":"error","message":{"text":"Anemic domain model: FleetWorkerReportedRoute: \u0060FleetWorkerReportedRoute\u0060 is a data-only domain entity with \u0060pub\u0060 mutable state and no invariant-enforcing behaviour of its own, while the repo holds the logic in a foreign service/manager/use-case \u2014 the anemic domain model. Move the behaviour onto the entity so it enforces its own invariants (or make it an immutable value object with private fields) rather than being driven from outside."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/executor.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0bb16527734656eb53296d1dd46c54f4b2c9741d07bc4a9e717d9a569eb7fb"}},{"ruleId":"P12","level":"warning","message":{"text":"Tests run only outside the merge gate: \u0060npm test\u0060 is the only CI command that runs 135 test(s) in 8 file(s) (e.g. \u0060telemetry-ingest/test/funnel.test.ts\u0060, \u0060telemetry-ingest/test/ingest.test.ts\u0060), and the workflow runs only on workflow_dispatch \u2014 a failure there is found after the change merged, when the only remedy is a revert. Run them on pull requests (or in the merge queue)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/telemetry-ingest.yml"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbd690f17b2ebbe7d5653b49082232d833d1f97a1429a08567ee4d633a902a5"}},{"ruleId":"P12","level":"warning","message":{"text":"Tests run only outside the merge gate: \u0060npx vitest run\u0060 is the only CI command that runs 135 test(s) in 8 file(s) (e.g. \u0060telemetry-ingest/test/funnel.test.ts\u0060, \u0060telemetry-ingest/test/ingest.test.ts\u0060), and the workflow runs only on a schedule \u2014 a failure there is found after the change merged, when the only remedy is a revert. Run them on pull requests (or in the merge queue)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/web-maintainer.yml"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b29b24cb434cca480225036734585e64a11da1f5b5c64e0a42f77e4bcb8e630"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 23/33 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060.\u0060, \u0060crates/app-server-protocol\u0060, \u0060crates/memory\u0060, \u0060crates/skill-install\u0060 and 5 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch pip/gradle/composer: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060pip\u0060, \u0060gradle\u0060, \u0060composer\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"450d8a596183f743babd8e6bcb8a84a1c1cbdd90107a1093b79a88283fad1695"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (62 clone groups): 62 duplicated blocks under the repository root have copies in at least two of the sibling directories crates, extensions, pet, scripts, telemetry-ingest, web \u2014 58 of them are reported below, and 4 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 62 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 62 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 62 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"73da513b7ea0f0b23764ee3289f36b1639c9da612c5f9df3bbb0b8d14f0e9937"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (13 clone groups): 13 duplicated blocks under integrations/ have copies in at least two of the sibling directories bridge-core, feishu-bridge, telegram-bridge, wecom-bridge, weixin-bridge \u2014 11 of them are reported below, and 2 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 13 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 13 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 13 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"55722f308a5c2027527d49b7ef884df793a88f1433e05f4b11cb422c5b690f90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 12 sibling directories (12 clone groups): 12 duplicated blocks under web/app/[locale]/ have copies in at least two of the sibling directories app, changelog, computer-use, contribute, faq, features (\u002B6 more sibling(s) not listed) \u2014 9 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 12 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 12 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 12 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/models/page.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d11b982c535a0de009e6f7ce7d57c35a9ba915a8ab55ab36350bfc39d03b2c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (9 clone groups): 9 duplicated blocks under web/ have copies in at least two of the sibling directories app, components, lib, scripts \u2014 8 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 9 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 9 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 9 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/models/page.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0399dd62814a6f29e52987cb39b6621bfe6b3db9941695d11a5d5b3c1df264b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (346 matched lines \u00D7 2 locations): integrations/feishu-bridge/src/index.mjs:96 \u00B7 integrations/wecom-bridge/src/index.mjs:104 \u2014 the two spans are one implementation copied and then locally edited \u2014 2184 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"abacbda67a2df85ed94f27a7bd2a54333170b10d12d50f94e76178c57e1fb14e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (144 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:830 \u00B7 pet/ios/Resources/pet-native.js:830 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32012179c1906d3452bd357330d0417f3a3492a9b506541f59a09e08ef248d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (135 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1956 \u00B7 pet/ios/Resources/pet-native.js:1956 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b80f296f5c5eafdcc3b22912d6f43330c50eb2eb13f67f5c01975cf17faee3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (120 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1691 \u00B7 pet/ios/Resources/pet-native.js:1691 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20f971af704ac8bb19bce3ad25411cec506eeef23558a2ae19362b54822994b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (111 matched lines \u00D7 2 locations): web/lib/content/faq.tsx:144 \u00B7 web/lib/content/faq.tsx:531 \u2014 the two spans are one implementation copied and then locally edited \u2014 1040 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content/faq.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ddb80498ed4b52aeb2f66d2e694743d7e001286d9c1fdc667dc748389c9b30"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (107 matched lines \u00D7 2 locations): integrations/feishu-bridge/src/lib.mjs:91 \u00B7 integrations/telegram-bridge/src/lib.mjs:415 \u2014 the two spans are one implementation copied and then locally edited \u2014 757 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73d6c13a9bf6f8da3b4ea7e00e586ae6df71eab76f4a3839fbfa4a5d6f71611"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (92 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:182 \u00B7 pet/ios/Resources/pet-native.js:182 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5187d0b2548d4cec8b26a9db51270addd07999f7436702c3c1bb861f1a2d89"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (91 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:470 \u00B7 pet/ios/Resources/pet-native.js:470 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92b4e1ce2d4ea34c50dbb6f0647934466951b85eb0a1fcc074362da94ac5cc1"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (86 identical lines \u00D7 2 files): integrations/feishu-bridge/scripts/validate-config.mjs:2 \u00B7 integrations/telegram-bridge/scripts/validate-config.mjs:2 \u2014 these 2 files are line-for-line copies of one another \u2014 86 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/scripts/validate-config.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac6138fcee098c014509015d0cf0686d2eacd8b3368315e44a188ec078b7fd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (76 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:2008 \u00B7 pet/ios/Resources/pet-native.js:2008 \u00B7 pet/src/core/pet-engine.ts:327 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2008}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b9364676af33df7f3f34bf4bc8f0ca6de3f582fe802784e7445011b5ab7540"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (73 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1162 \u00B7 pet/ios/Resources/pet-native.js:1162 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db0aea298ea41950c3636f13513393f3a362e93afbe4afec52bd42a064853c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (70 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:653 \u00B7 pet/ios/Resources/pet-native.js:653 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc54a2458eeddd722acbeba4902a4cf9b899941be7b9909b163a5c1b76ef1d0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (64 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1324 \u00B7 pet/ios/Resources/pet-native.js:1324 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1324}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cade1b82fb3d67bf6facfadf06376836bc3e10cb8fff7b844d0c22365d2902e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (63 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:105 \u00B7 pet/ios/Resources/pet-native.js:105 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cdf94b7b11755ab14de5717a2fc7554ce580e2c00c6fc0899928d396a53d42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (58 matched lines \u00D7 2 locations): web/lib/content/faq.tsx:21 \u00B7 web/lib/content/faq.tsx:410 \u2014 the two spans are one implementation copied and then locally edited \u2014 450 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content/faq.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"493c8c23667c1be5854245425da5b23b2882e0517d34e8ce0d2f085a43de5d44"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (53 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1429 \u00B7 pet/ios/Resources/pet-native.js:1429 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7faf4582e96f52fb54b97033ee0cb33069022e9f2eee42cd2381e2853c245b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (52 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1504 \u00B7 pet/ios/Resources/pet-native.js:1504 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1504}}}],"partialFingerprints":{"codehealthFindingId/v1":"734a8fa449bf1ea25a2ccf21abdc23a718c6b3f3f7b9f0bbacd6a0cabfc10cc8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1256 \u00B7 pet/ios/Resources/pet-native.js:1256 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff9bb3604bdb2f411dec9cfa00dc33d5ac9a53532d4ba14fecaee9a21ef68c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1587 \u00B7 pet/ios/Resources/pet-native.js:1587 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2c9f18c625cb22cec5fd54e6c1c9121b2649fbbbf241b96bd2c12c6394d474"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (44 matched lines \u00D7 2 locations): web/app/[locale]/models/page.tsx:28 \u00B7 web/app/[locale]/plugins/page.tsx:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 314 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/models/page.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3939dcd486da33b2db76145af8be5efd31a4ea9d7616ac848c9ab6685a70fa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:2315 \u00B7 pet/ios/Resources/pet-native.js:2315 \u2014 the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04df728b01dbdaddab896e3f51d55f6dfc3aeef3aec74f226338d90b2889761"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:5114 \u00B7 pet/ios/Resources/pet-native.js:5114 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":5114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40f4d0a63bf3cd4f5300ca4045b275acd8f07e1f3061ddb389ef9e058657537"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:2241 \u00B7 pet/ios/Resources/pet-native.js:2241 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cc969c839a228855fc125eeeaeb79712e3651fe863d2203c9bbef6d7ed4a0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (35 matched lines \u00D7 2 locations): web/app/[locale]/legal/privacy/page.tsx:13 \u00B7 web/app/[locale]/legal/terms/page.tsx:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 287 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/legal/privacy/page.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f698dc94d8fb9e029176783ccdfbac7d6289ed601709ca3912303065b9d1a616"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:36 \u00B7 pet/ios/Resources/pet-native.js:36 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d286a66f96504ec063cc4bbb43d5c79627b99bb71e6093cd784e7418dbbaa8c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:71 \u00B7 pet/ios/Resources/pet-native.js:71 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"43af8de8df38dba608edba7b6e3a593685bcf0fe5c937bed831b9d94951cbca5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1395 \u00B7 pet/ios/Resources/pet-native.js:1395 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f6f2d134026dfd4f82641b334589719f738552fbd9aa9f5fcc9cd80d046cc9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): web/scripts/patch-glob.mjs:60 \u00B7 web/scripts/patch-minimatch.mjs:72 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/patch-glob.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbbe29a7ee280b6d36ecc57db95ca3742dc48ad86a4f1e3fa97a58ac8e7aa11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:2195 \u00B7 pet/ios/Resources/pet-native.js:2195 \u00B7 pet/src/core/dot-field.ts:88 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"245f9865c983d231ecc86e57db75e613f0188b2606959527baf5823a9c813439"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:2 \u00B7 pet/ios/Resources/pet-native.js:2 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19264e1153611eb11cbf214c643290e355f817c4468d42ab7929fecaf1d9eb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1062 \u00B7 pet/ios/Resources/pet-native.js:1062 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"b169eb5a577631e136de3a14b713b43e5c25e01f56982676d4ad0607515de8d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1652 \u00B7 pet/ios/Resources/pet-native.js:1652 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1652}}}],"partialFingerprints":{"codehealthFindingId/v1":"96960c4cffc35a562fed361ec0e0de25e21a73d867973a5206dac4feab49b950"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:2124 \u00B7 pet/ios/Resources/pet-native.js:2124 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b6ca88f42dfc6ccefc5347d36ee89d64be5ba0cbbc74205d04cb5116217052"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:1395 \u00B7 pet/ios/Resources/pet-native.js:1395 \u00B7 pet/src/core/signal.ts:31 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b33f203816e2ce6a1c60e1a5a32410b49210b107d7dadb467726106e5757f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:601 \u00B7 pet/ios/Resources/pet-native.js:601 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"470ca5e2e02dc68669f71ddb2dafe90fada05b3c4247431cc97bf9f2d21f201a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:797 \u00B7 pet/ios/Resources/pet-native.js:797 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26694d8a8ddacc01eddd01702af172af6d4717484d83a159a05966d73c68ebc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1130 \u00B7 pet/ios/Resources/pet-native.js:1130 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bac00cb239f50d1824f649ad360fa1fa61daf35abf3d6e6001e46036410ad7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1005 \u00B7 pet/ios/Resources/pet-native.js:1005 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"4946b43a53c5ec084c94473a3da4798607fd6c38b67f52ef1ccf00bab0c2887e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (21 matched lines \u00D7 2 locations): integrations/weixin-bridge/src/lib.mjs:194 \u00B7 integrations/weixin-bridge/src/lib.mjs:226 \u2014 the two spans are one implementation copied and then locally edited \u2014 146 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/lib.mjs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"de88a39a95f3afca59be1479dda23b9478e2f5dbb8faceca6daa36e9ed4ac207"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:770 \u00B7 pet/ios/Resources/pet-native.js:770 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb045f24f6053d67cf2f5d230f54279a465dcc2ec0ac4c41bc95e21b7948934c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): integrations/feishu-bridge/src/lib.mjs:60 \u00B7 integrations/wecom-bridge/src/lib.mjs:60 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ced5370facfa1556f42b9b047107edc86626255023bb3a20e8ec5e9f562c1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:6118 \u00B7 pet/ios/Resources/pet-native.js:6118 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":6118}}}],"partialFingerprints":{"codehealthFindingId/v1":"983fe1cc91d68cb005dbb389384799d7d88e520c70a5a6dc844a7c390d79a2da"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): web/app/[locale]/admin/admin-client.tsx:65 \u00B7 web/app/[locale]/admin/admin-client.tsx:150 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/admin/admin-client.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c710199c3dff0ece20127124b6c9d703e95734c8a7631b5a1838eb379f6cd54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:315 \u00B7 pet/ios/Resources/pet-native.js:315 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eae651befa81408175c53176a3ce6d24790cf83b6180d3669b86609e8c1e955"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:51 \u00B7 pet/ios/Resources/pet-native.js:51 \u00B7 pet/src/core/pet-native.ts:43 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91ecfaf648202eae1b4a2bdca7504de3e984d5dbd667edb11ff5e9f3c0f8fb8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:284 \u00B7 pet/ios/Resources/pet-native.js:284 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70721117e9047e63c071fb20ec8bc0a5ad9fc6d237ea47438f78fc1d870fbe0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:1284 \u00B7 pet/ios/Resources/pet-native.js:1284 \u00B7 pet/src/core/pet-telemetry.ts:118 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb372ba814483c5d00f13e3ac82aa43d2c5aa2c150fd2ca24b7f7c6041c1cba8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): npm/codewhale/scripts/verify-release-assets.js:165 \u00B7 npm/codewhale/scripts/verify-release-assets.js:212 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/verify-release-assets.js"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"37dc1092f0e4dd0bdb5f841b630fd199ae231b84c051f96d87f1944014a73c1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:342 \u00B7 pet/ios/Resources/pet-native.js:342 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2acc713eefc664c26bfc15238806a0d6e9597d673698b14b54461d97ce6d4d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): npm/codewhale/scripts/install.js:1180 \u00B7 npm/codewhale/scripts/verify-release-assets.js:368 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f644fdf374802267dcc00bfa1ed351c0380c05e54470da711f2eb94c3739b551"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): web/app/[locale]/models/page.tsx:136 \u00B7 web/components/models-catalog.tsx:23 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/models/page.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9971461ea1a4cd2492172aa599bef22d03edab9f06ffde2fa5733e0a8bc9c61"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): integrations/telegram-bridge/src/index.mjs:459 \u00B7 integrations/weixin-bridge/src/index.mjs:375 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"062848f623b10160b96c2dcfcce7bce5cb30daf118947e71f104a4a63baa9233"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): integrations/telegram-bridge/src/lib.mjs:242 \u00B7 integrations/telegram-bridge/src/lib.mjs:257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/lib.mjs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4fc885ec9726293294c495ffe336275638b79e07a7bba1da5e3f6179c2d52f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/app/[locale]/install/page.tsx:145 \u00B7 web/app/[locale]/install/page.tsx:194 \u2014 both copies are in the same file, so extract the block 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":"web/app/[locale]/install/page.tsx"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7375a13c6ba9051aec2d8f0bc3b1934fee19bb5990395d0ecbfcf61b0da5cb0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/components/docs-search.tsx:32 \u00B7 web/components/faq-search.tsx:22 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"497dc2e9cf82b9c5056045c8d29f0f89a233e7abfaaa0f4322a5706a63cafe93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): web/lib/facts-drift.ts:89 \u00B7 web/scripts/facts-lib.mjs:36 \u2014 the two spans are one implementation copied and then locally edited \u2014 119 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts-drift.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7fb8c76532f63346c5fcf480e47bc28712ace85c931273ce6a5fa4463b13a65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): web/scripts/patch-bundled-globs.mjs:142 \u00B7 web/scripts/patch-glob.mjs:71 \u00B7 web/scripts/patch-minimatch.mjs:83 \u2014 the 3 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/patch-bundled-globs.mjs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf58f8ef21123a1082c9d2237ab3e993c30b9295e5683d17d9dbdfb2cb4000c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): web/scripts/release-baseline-lib.mjs:63 \u00B7 web/scripts/release-docs-lib.mjs:52 \u2014 the two spans are one implementation copied and then locally edited \u2014 94 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/release-baseline-lib.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"de668aff8c00b62c4c1b2ef6d6cd381534541febb84b3cba0a4b8aa0ea83c7fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): integrations/feishu-bridge/src/index.mjs:159 \u00B7 integrations/weixin-bridge/src/index.mjs:302 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"5937f572cd7929e5c52ef285348035d25760d5d01554a198953a328ed721f928"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): integrations/telegram-bridge/src/index.mjs:269 \u00B7 integrations/telegram-bridge/src/index.mjs:360 \u2014 both copies are in the same file, so extract the block 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":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fa8b98b83ccafce4b7ab848f8d78463b6097810615ce23267ce08ecb914fd1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): npm/codewhale/scripts/install.js:705 \u00B7 npm/codewhale/scripts/install.js:772 \u00B7 npm/codewhale/scripts/install.js:835 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"beba324e64ccdefc6b8ddbe7f00952cd65a74d128fa20644ab5182638131e531"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/app-server/src/runtime_web/app.mjs:1802 \u00B7 crates/app-server/src/runtime_web/app.mjs:1905 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1802}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfce3656645466a10930fbb83dbcd13c49910bd8b93966be51b8854667212ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:416 \u00B7 pet/ios/Resources/pet-native.js:416 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1d13a0f406c22b89da61409be2c3af2c1438b0ba70ff26ce3bbbb8bb37c3f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:672 \u00B7 pet/ios/Resources/pet-native.js:672 \u00B7 pet/src/core/model.ts:84 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1a4dc6c89632ee37acc0e38356bca09116d4c7aeffba5571aec95ffce0c055"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/codewhale/scripts/install.js:535 \u00B7 npm/codewhale/scripts/install.js:1092 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bbda7764554eec053aa1496acf3d576d0aed81378dfd7cb9eb60aa2ac08012"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): npm/codewhale/scripts/install.js:779 \u00B7 npm/codewhale/scripts/install.js:842 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a304f1c39122ce9e54069778ac7f7b116f1c89a4ea6cd782b6ccf53c0d3d73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): pet/src/ui/storage.ts:75 \u00B7 pet/src/ui/storage.ts:107 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/ui/storage.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3222c523f7e7d38bd11bfd8190b01547e4be613868c461a3aaedb7ab4bc1a3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): telemetry-ingest/src/index.ts:98 \u00B7 web/scripts/repo-activity-lib.mjs:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 64 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/index.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"61eaa8a44b5c3c843732c1902a0473a4ba670edf783f6865db797a0c6c429d62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): telemetry-ingest/src/schema.ts:544 \u00B7 telemetry-ingest/src/schema.ts:561 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cec46f33bb647ad9b56d5101b21e09f0e05070484853c3b4f2e34d1d08cbf62"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/components/docs-search.tsx:200 \u00B7 web/components/faq-search.tsx:72 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"365150ef5638eff62b2c75c6144a4b5b77e697b69192eb7fc893149aa1527cba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): web/components/merch-interest.tsx:32 \u00B7 web/components/merch-storefront.tsx:46 \u2014 the two spans are one implementation copied and then locally edited \u2014 92 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-interest.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f0c25656d35c183cc9b803762f0a04be10637f1e9e4e622613c77ba69d5999"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/scripts/patch-glob.mjs:55 \u00B7 web/scripts/patch-minimatch.mjs:67 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/patch-glob.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0595a4061cbee8753956e03cb714ea359fbbb341de9a34c6f3e509cb9f63880"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:2151 \u00B7 pet/ios/Resources/pet-native.js:2151 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b25aa8d94e0d10b31de24a57a150fa3f925fb9e7c91f694516d77ab47d974aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): extensions/vscode/src/chat.ts:847 \u00B7 extensions/vscode/src/chat.ts:865 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d2657a42c7e59fd33b963fb0a73886fb1053a819214fa22146d4f8e8df429f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): integrations/telegram-bridge/src/index.mjs:1045 \u00B7 integrations/wecom-bridge/src/index.mjs:597 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42bc075cc40106a8938531aac829cd0fad20732d619a6c9e2914e72a121ec11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): integrations/telegram-bridge/src/lib.mjs:289 \u00B7 integrations/telegram-bridge/src/lib.mjs:309 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/lib.mjs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0515b7c6db93281ee3d278b5de3207973d1c498ca23c7cf970c7ebdd5f337bc0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): npm/codewhale/scripts/install.js:766 \u00B7 npm/codewhale/scripts/install.js:830 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a61478f871518a232b85f787d1ce27c58614c81a526fc73625bc91ff5c268d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): crates/app-server/src/runtime_web/app.mjs:1747 \u00B7 crates/app-server/src/runtime_web/app.mjs:1811 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab93399a6f7d6b1f2b26b36b0633c2e9c1113c6cad9d1287d480bde95f79e21c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:2182 \u00B7 pet/ios/Resources/pet-native.js:2182 \u00B7 pet/src/core/dot-field.ts:77 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e05ccdf1854576e0b7a82e9cf49e5ecb2c3bba2f9c8b774e196471e73ce3a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): extensions/vscode/src/api.ts:507 \u00B7 extensions/vscode/src/api.ts:522 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/api.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1008e830815f6019c822abdb24ead86dc8f7cd8df965a334bb16e38cee29a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): integrations/telegram-bridge/src/index.mjs:61 \u00B7 integrations/weixin-bridge/src/index.mjs:106 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e7ab32e5b08b486ea043f913d5f28d0dbbf69e1b4bfa33d2058c4a2bebc79c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): npm/codewhale/scripts/verify-release-assets.js:97 \u00B7 npm/codewhale/scripts/verify-release-assets.js:141 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/verify-release-assets.js"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"61225383093e90717e86ad1fafaa2951d11f5081d9931d33afdd30b51453dc7a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): scripts/github-action/publish.mjs:76 \u00B7 scripts/github-action/review.mjs:163 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/publish.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69842e6fb77b1d4d0ca725d19d7f0e7156510b5e79dfc19e0a338466bf03392"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/app/[locale]/app/page.tsx:122 \u00B7 web/app/[locale]/models/page.tsx:141 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/app/page.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3991130324018d452201a8a72567b5984cdd040bbb99eb796bb0413bded89a27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6 locations): web/app/[locale]/changelog/page.tsx:22 \u00B7 web/app/[locale]/contribute/page.tsx:27 \u00B7 web/app/[locale]/faq/page.tsx:11 \u00B7 web/app/[locale]/legal/privacy/page.tsx:13 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 6 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/changelog/page.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8742f5ac6c1054d72e2fbd1cb6c494ffe94315bc99d5928de2387a7d84db60f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5 locations): web/app/[locale]/contribute/page.tsx:27 \u00B7 web/app/[locale]/faq/page.tsx:11 \u00B7 web/app/[locale]/legal/privacy/page.tsx:13 \u00B7 web/app/[locale]/legal/terms/page.tsx:10 \u00B7 \u002B1 more site(s) not listed \u2014 the 5 copies are spread across 5 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 5 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/contribute/page.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9239f49ee23fe548d9cada6b8dd59e00d48a44de3216a0eec34b07a99f7c4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): web/app/[locale]/faq/page.tsx:11 \u00B7 web/app/[locale]/legal/privacy/page.tsx:13 \u00B7 web/app/[locale]/legal/terms/page.tsx:10 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/faq/page.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a17d46ca6fda04b7ce23f97a779408c2feb0b613c2fca15c806a4365e7c3605"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): web/lib/community-agent.ts:390 \u00B7 web/lib/community-agent.ts:412 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"064e4a004b7e958ae78eb410f6f4d2bbd2fb82c98526f9af5b20dda0713f4466"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/app-server/src/runtime_web/app.mjs:2067 \u00B7 crates/app-server/src/runtime_web/app.mjs:2108 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":2067}}}],"partialFingerprints":{"codehealthFindingId/v1":"523ff3b91bc612cdadbee015e7e6ac899aed22d8b756c6c02762e6c27be58f91"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:1642 \u00B7 pet/ios/Resources/pet-native.js:1642 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eeef9d13438ed9f2004753a5fe0f96579ed308e34ad43854cd4e7a648edc6d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): extensions/vscode/scripts/audit-dependencies.mjs:17 \u00B7 web/scripts/audit-dependencies.mjs:65 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/scripts/audit-dependencies.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec52ddf04f7d547d874306e6af2eced1e4e5ba3439f17e8b4811c52ab2b7139"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): extensions/vscode/src/api.ts:637 \u00B7 extensions/vscode/src/api.ts:666 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/api.ts"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0d9fe65bb1a5affd642b6ee1c6eaa4cbdc314934a2bbc399d8f893a07c7320"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): integrations/feishu-bridge/src/lib.mjs:107 \u00B7 integrations/wecom-bridge/src/lib.mjs:194 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"473e511085928ffa9915add5f7c722719dfddfc5c36cf775e0f8db7e9ea257f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): integrations/weixin-bridge/src/index.mjs:965 \u00B7 integrations/weixin-bridge/src/index.mjs:995 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb796d8742faf754305b1633ca8d1a1698288ba787b39e1f9947e5b457bb357a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): integrations/weixin-bridge/src/lib.mjs:425 \u00B7 integrations/weixin-bridge/src/lib.mjs:438 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/lib.mjs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"595fae39a6848e9718eec3ecefe8e11d6df65d670e0ac9d877c0ba0957b2055b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): pet/web.ts:23 \u00B7 pet/web.ts:32 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/web.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb22445acbdfbd3ac29b0dfd0f3c2cb079788dbcb918fb040b0904a071f2fe01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/ci/cnb-github-checkrun.mjs:36 \u00B7 web/scripts/facts-publish.mjs:319 \u2014 the two spans are one implementation copied and then locally edited \u2014 50 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/cnb-github-checkrun.mjs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d70184bec33b4127c8bfa79603bc8c6ece3de70632e3c07aaaa1b3291dfdbc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): scripts/release/assemble-release-assets.js:58 \u00B7 scripts/release/verify-release-inventory.js:84 \u2014 the two spans are one implementation copied and then locally edited \u2014 106 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/assemble-release-assets.js"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3ce28d0323c363ee949d9ca06ecd47b7db623eba04a2ecb2ef523255be2d81"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/app/[locale]/computer-use/page.tsx:123 \u00B7 web/app/[locale]/computer-use/page.tsx:132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/computer-use/page.tsx"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4a3c3285e0d563c453ecda929ef14c7ba6d27b9e269ba9f717447b2df47d1d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): web/app/[locale]/install/page.tsx:116 \u00B7 web/app/[locale]/install/page.tsx:153 \u00B7 web/app/[locale]/install/page.tsx:166 \u00B7 web/app/[locale]/install/page.tsx:202 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/install/page.tsx"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc165a48c113dc60082a0bf9deb57c746b8a1ac8970a034c636a25b7a43dec97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/app/[locale]/merch/contributor/page.tsx:5 \u00B7 web/app/[locale]/merch/page.tsx:5 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/merch/contributor/page.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eea7c02022d5fb56f3db03324c9f01e0981febf07a90c98782cf6412e495e60"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/app/api/admin/login/route.ts:9 \u00B7 web/app/api/admin/logout/route.ts:6 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/login/route.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e694448f8d1e25aea935195d03b6a65674314e4b7551950c7129944dc8384e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/app/api/admin/logout/route.ts:18 \u00B7 web/app/api/admin/post/route.ts:32 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/logout/route.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4128f6e158124fbf4878977fbcee14882697458aa1c3073312b002173174bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/components/docs-search.tsx:192 \u00B7 web/lib/docs-map.ts:412 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4d756244fc1ef5a649ec9d0e22284547e0029b9f9e35375e1eb607b91b3835"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): web/scripts/check-facts.mjs:26 \u00B7 web/scripts/derive-facts.mjs:16 \u2014 the two spans are one implementation copied and then locally edited \u2014 69 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-facts.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cfcb125ca2a4bf28ccdeaf0a23ebe841ab2db7307523a64e18fef543f412cd4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/app-server/src/runtime_web/app.mjs:2051 \u00B7 crates/app-server/src/runtime_web/app.mjs:2097 \u2014 both copies are in the same file, so extract the block 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/app-server/src/runtime_web/app.mjs"},"region":{"startLine":2051}}}],"partialFingerprints":{"codehealthFindingId/v1":"be30660e4b23a205e4fa5d327643acdb2cf3204bf2e529538c89722d375f1d64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:385 \u00B7 pet/ios/Resources/pet-native.js:385 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8d4e77bdcb4d454da3c012451d3c60771205ceeec285f6f0d2a05ec44e9818"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:568 \u00B7 pet/ios/Resources/pet-native.js:568 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b303eba3d1b793bb7c3a886623e410e830c52231a70810bea2d55a6c4e6adc6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:1029 \u00B7 pet/ios/Resources/pet-native.js:1029 \u00B7 pet/src/core/pet-sim.ts:351 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2465354c66e17c5b8a97f671f7c189efd4cd3f12c13bebd518c3c0b50f38e7d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): extensions/vscode/src/api.ts:495 \u00B7 extensions/vscode/src/sse.ts:103 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/api.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"734bdde585eea555d342f736039b67802627520e62b2c1d5aba5674cc4e2cd84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): npm/codewhale/scripts/verify-release-assets.js:155 \u00B7 npm/codewhale/scripts/verify-release-assets.js:207 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/verify-release-assets.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"961db320ad6439837bc866d793760415b45a14445f264d0dbb66fc0100715d2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): web/app/[locale]/app/page.tsx:92 \u00B7 web/app/[locale]/app/page.tsx:103 \u00B7 web/app/[locale]/plugins/page.tsx:62 \u00B7 web/app/[locale]/plugins/page.tsx:86 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/app/page.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce27717e443cd9d70e389b1e468e43525fb0776befebc7324d69f08d3a5aca7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/lib/bounded-body.ts:22 \u00B7 web/scripts/facts-publish.mjs:532 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/bounded-body.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d644a1ef40e7cdac099505be27db1eaca46749767d201a09744c4cbe0b1076c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/lib/llms-txt.ts:156 \u00B7 web/lib/llms-txt.ts:164 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/llms-txt.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf6e5be35f7fe3953dac312a49d1483efdf188cd1f367c146023c1d05615a8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/scripts/check-cloud-facts.mjs:11 \u00B7 web/scripts/facts-publish.mjs:383 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-cloud-facts.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af28c5edd055c0537cbd00b53edfdf981da30b605091e30e326b2da63c861f9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/app-server/src/runtime_web/app.mjs:1720 \u00B7 crates/app-server/src/runtime_web/app.mjs:1727 \u2014 both copies are in the same file, so extract the block 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/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1720}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb5523f953a7f8b0e43ed4ea83b81d7f76326e9f93761137dd070c6abc96a85"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:372 \u00B7 pet/ios/Resources/pet-native.js:372 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dc688c2f242452be200b6150efb9976d7fdc6cfb36b83b1f7fdfeee19fdb6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:593 \u00B7 pet/ios/Resources/pet-native.js:593 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3cac092910533116612eeae7379815300017065d3e0b3ebeed06c85b29f6b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:996 \u00B7 pet/ios/Resources/pet-native.js:996 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a38a90d152e3f390db56f3a4b7aa44b09aa9b34deeb14cf6bf3f53fda4323f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): crates/tui/src/tui/pet_watch/pet-native.js:2163 \u00B7 pet/ios/Resources/pet-native.js:2163 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b3076396264dd72100ed61391996b5163800b1710e6a58d65bb2e03d88e5e9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:1642 \u00B7 pet/ios/Resources/pet-native.js:1642 \u00B7 pet/src/core/pet-audio.ts:42 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8747fe28b298b6061fa4aebc715e2115b23a8bb872d83752d272ebd8c71b8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): integrations/feishu-bridge/src/index.mjs:534 \u00B7 integrations/weixin-bridge/src/index.mjs:1025 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfccfda59721f7112738af5e26f169d18d49438d4c7914fe22d54e94c4fa545d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): scripts/release/npm-wrapper-smoke.js:45 \u00B7 scripts/release/npm-wrapper-smoke.js:67 \u2014 the two spans are one implementation copied and then locally edited \u2014 56 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/npm-wrapper-smoke.js"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaecf6b07c9dd1f8cf37fe22c35e261e9ef8283c637c33bcd627f1ab160c7b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/review-eval.mjs:104 \u00B7 scripts/review-eval.mjs:128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf69798e716e1a643ff177e361ea3709e48a6cecc19db56401ef659b9cf7d335"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/review-eval.mjs:558 \u00B7 scripts/review-eval.mjs:646 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5e6d5f31c6e85e7ea91cf27f4e78fe6108c28c6790d8aa414fc10ba0438026"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/lib/desktop-release.ts:33 \u00B7 web/lib/repo-activity.ts:73 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/desktop-release.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4f40be523628c8e728082142a6c3819b4e13127cb304f3ef5433e37c193152"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/lib/i18n/links.ts:44 \u00B7 web/lib/i18n/links.ts:54 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/i18n/links.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10d342333abe5e3c5fdcb9d2b40da3828a3f68e0c729bed81d2d1f0e6f50beb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/lib/llms-txt.ts:133 \u00B7 web/lib/llms-txt.ts:177 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/llms-txt.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8bdb4b872ac276e58c4cced490e4dee354c01bcbb60eb327758d9710e355d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:432 \u00B7 pet/ios/Resources/pet-native.js:432 \u00B7 pet/src/core/pet-world.ts:249 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dc59b479b71a0d4f0eae65d20c485ea35c21d3399b339f468379d7c9f8b71f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:577 \u00B7 pet/ios/Resources/pet-native.js:577 \u00B7 pet/src/core/pet-world.ts:363 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a013403b6d5e3bc029b43a7508987d738b9ed35640be5382fdef1b038cc05a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): extensions/vscode/src/chat.ts:377 \u00B7 extensions/vscode/src/chat.ts:882 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"91323c6690dba175fb571dace0e796d409a2053d7afefbac7d83330fc7b6e8b5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/app/[locale]/computer-use/page.tsx:92 \u00B7 web/app/[locale]/models/page.tsx:90 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/computer-use/page.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f60356d4faf818647796e217b4b3a83bb6def025fe3ec8c59aab7e284c6d05c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): web/app/[locale]/computer-use/page.tsx:157 \u00B7 web/app/[locale]/legal/privacy/page.tsx:47 \u00B7 web/app/[locale]/legal/terms/page.tsx:36 \u00B7 web/components/route-state.tsx:59 \u2014 the 4 copies are spread across 4 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/computer-use/page.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2563f9fbedbfa19f5d0ea34a4818cf365590edeed321159d86a7499d47242bde"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/app/[locale]/install/page.tsx:19 \u00B7 web/app/[locale]/plugins/page.tsx:26 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/install/page.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41a62be2b80e22e842f1d33d201a9b6c0bbf85b021a30f9c5be22b941c3c491"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): web/app/[locale]/page.tsx:200 \u00B7 web/app/[locale]/page.tsx:231 \u00B7 web/app/[locale]/page.tsx:252 \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":"web/app/[locale]/page.tsx"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ff090ecd4a3f0b21416656fb9afb08d078ae6ac9a90e41a3937f38175ecebc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/lib/content-watch.ts:221 \u00B7 web/lib/content-watch.ts:228 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content-watch.ts"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"093eed5f3ff2f64f18d2371a9646ae177e052134d8e1253205ab3f1a311bd599"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/lib/facts-drift.ts:108 \u00B7 web/scripts/facts-lib.mjs:119 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts-drift.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ddde7da93f48d286b3fb40ab1a69093b265e7e4f1ada5ff2a0892dd572b98e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/lib/i18n/plural.ts:26 \u00B7 web/scripts/check-locales.mjs:93 \u2014 the two spans are one implementation copied and then locally edited \u2014 68 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/i18n/plural.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bb1138003b3f7e280117113ee0c8c4d15b8183fe0d97a088f031843f8ff7c7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:1054 \u00B7 pet/ios/Resources/pet-native.js:1054 \u00B7 pet/src/core/pet-sim.ts:367 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6acd7bc05826837a6255ffa04bf89c7072ec5a79efbce5deb78859d948427b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): crates/tui/src/tui/pet_watch/pet-native.js:2174 \u00B7 pet/ios/Resources/pet-native.js:2174 \u00B7 pet/src/core/dot-field.ts:69 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea5b05cae7c21b5429c7beee8b2be9f2cc2716321b2745f71c3fe942a1fd591"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): integrations/bridge-core/src/lib.mjs:1016 \u00B7 integrations/weixin-bridge/src/index.mjs:514 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2f225500e0f8666528bd13c97a6f2b9a8ed7d74b515e558f56dd82158a5dc2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): integrations/wecom-bridge/src/lib.mjs:139 \u00B7 integrations/wecom-bridge/src/lib.mjs:149 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/lib.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45ccea10345247b0b951425e24ca5b6fee9e858f79792b0db277f4cc472e9b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): scripts/github-action/setup.mjs:196 \u00B7 web/scripts/check-cloud-facts.mjs:51 \u2014 the two spans are one implementation copied and then locally edited \u2014 55 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/setup.mjs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a14aa9764ea669767e339099e30e11c717839ea07fa01751014b7f1e07467b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/review-eval.mjs:488 \u00B7 scripts/review-eval.mjs:497 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7939eb16f5096493baac00dd5bd70559bff3c84573de1fc17da33a91e4f6cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): telemetry-ingest/scripts/report-contribution-cohorts.mjs:12 \u00B7 telemetry-ingest/scripts/report-funnel.mjs:19 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/scripts/report-contribution-cohorts.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e8dda64dc9b57c2bbefa8207fd2173243cd98b4f8d474998d372647cbad0937"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): telemetry-ingest/scripts/report-contribution-cohorts.mjs:113 \u00B7 telemetry-ingest/scripts/report-funnel.mjs:144 \u2014 the two spans are one implementation copied and then locally edited \u2014 93 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/scripts/report-contribution-cohorts.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f397fecabe9aab4bacc2bbf373716210bb7859f50e859f1131efbafabe30481"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7 locations): web/app/[locale]/changelog/page.tsx:20 \u00B7 web/app/[locale]/computer-use/page.tsx:19 \u00B7 web/app/[locale]/faq/page.tsx:9 \u00B7 web/app/[locale]/features/page.tsx:12 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/changelog/page.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57d5e7de66a69991f60d489a75a964f3b323a3f6f779d185d682802627aaea3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/app/[locale]/install/page.tsx:105 \u00B7 web/app/[locale]/install/page.tsx:112 \u2014 both copies are in the same file, so extract the block 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":"web/app/[locale]/install/page.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc4a05c97ff0ad065cb335b973ea70a8eedfe2abd1ce982e3531828fc0b0a74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/app/[locale]/ratatui/[component]/page.tsx:20 \u00B7 web/app/[locale]/ratatui/[component]/page.tsx:34 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/ratatui/[component]/page.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5bc51847b85510c087053e4da8027b5a6e04f4223fcc521b694d754c190d84"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/lib/facts.ts:67 \u00B7 web/lib/facts.ts:132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c290e1a0a9ee25c481c1e6630f670922a5a0e17819756efa15b8f7d709fd127"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/lib/facts.ts:84 \u00B7 web/scripts/facts-lib.mjs:136 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6a73f08687ea4dca28f14e4930f72adf959676c0e13800f5337fe37d14e392"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/lib/telemetry/product-usage.ts:327 \u00B7 web/lib/telemetry/product-usage.ts:349 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/telemetry/product-usage.ts"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f70cd6d81837f8d8a93a83c185474ca1ba8c2a610dd7c59f9a5001a01d13dd8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): web/scripts/render-terminal-capture.mjs:178 \u00B7 web/scripts/render-terminal-capture.mjs:224 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-terminal-capture.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f296f900efe829580873111127a72392066afa14a4ea1157f41abc2b5957223b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: integrations/bridge-core/test/approvals.test.mjs:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../telegram-bridge/src/lib.mjs) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/test/approvals.test.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e01b8689952b0e5533bc54f1622f87385675d967a7a9890447bb2468efcc262"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: integrations/bridge-core/test/approvals.test.mjs:15 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../wecom-bridge/src/lib.mjs) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/test/approvals.test.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"431f3b59522d59f41cfc0085314bbdf73ad8c3365ee572d657702807d0d0f80e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: integrations/bridge-core/test/approvals.test.mjs:314 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../telegram-bridge/src/lib.mjs) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/test/approvals.test.mjs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a145d409395a1aae2c990628529c11694bf30d8921ac9fb0f9afcb22ff4c90"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: integrations/bridge-core/test/approvals.test.mjs:432 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../wecom-bridge/src/lib.mjs) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/test/approvals.test.mjs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4217d777f213485af187492e28e27a8fed04a652a0ca7edacf44315cb8a52f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/dingtalk-bridge/src/index.mjs:1 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1228d5b86a8e94d5e3cca6983891a78d9083915898cfd0b4b03e224bc41fcfc8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/dingtalk-bridge/src/lib.mjs:4 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"97878e0b480c54f25320c6cd6c715a6c8fb83cee97ed05c5afd0a5649248becb"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/feishu-bridge/src/index.mjs:21 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f56b588cbfbe9f3ac52ce0c68cdd39ddfecf8cfe03a7ba21c0ecf65315f9168"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/feishu-bridge/src/lib.mjs:1 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbe048f0c876aa198aacf030c32848d1e83964be106aee2f9820418b7bea4ab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/telegram-bridge/src/index.mjs:30 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8c2ed349300abafde8716fddff13584196a85dfb2a72f20be2f6a99232b977"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/telegram-bridge/src/lib.mjs:1 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f3928549ac13fd961630db826cad2f8ad86d111485d2271c834ed86025eaa4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/wecom-bridge/src/index.mjs:29 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c6c49012cb37e28f37bafde883525cc5ff24f5b04cdc71ea91b2c7b6373663"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/wecom-bridge/src/lib.mjs:1 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fc796609765310a99e4ad7815d4b2cdcbcfba1df742a018cb1de6eb08ad147"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/weixin-bridge/src/index.mjs:37 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2224b915aa952553f85152b5b49fa5b69d92d9f98a2affb158a6aecda5c81b0c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/weixin-bridge/src/lib.mjs:3 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/lib.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e97b060abe36f4e7a1b82c5e1f13f3ca1db35bd18a79e9768bfff0f7844113"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: integrations/weixin-bridge/src/lib.mjs:165 reaches into another package with a relative path (../../bridge-core/src/lib.mjs) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/lib.mjs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"a772b971a19330667d13bb13ff72a1fe5f47128ab430e3319c93c1a9f544c53b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: pet/scripts/lib/pet-runtime.mjs:24 reaches into another package with a relative path (../../../npm/runtime-sdk/index.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-runtime.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"809a23632989dcc0962880d502a9658069bc3e117c425b5038a28cf29493bb15"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/release/assemble-release-assets.js:14 reaches into another package with a relative path (../../npm/codewhale/scripts/artifacts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/assemble-release-assets.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"101fdc1e03c455b9d660993a7bb11c0a49b1842adf09a337a14c8a005dfd91ec"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/release/assemble-release-assets.js:16 reaches into another package with a relative path (../../npm/codewhale/scripts/compiled-hosts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/assemble-release-assets.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2f9b970c5c0fcece0aa9740e08009651409e73dbc5ddc2ab591cfb4f5390ff"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/release/fetch-compiled-host-proof.js:7 reaches into another package with a relative path (../../npm/codewhale/scripts/compiled-hosts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/fetch-compiled-host-proof.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db21d6f818f6f8d85ca0fe9e5834c2d3e8c7fd04ec4920004ffe7f75bcc2967"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/release/prepare-local-release-assets.js:13 reaches into another package with a relative path (../../npm/codewhale/scripts/artifacts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/prepare-local-release-assets.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85614c690d911651c24d00b6108fb323978d78608789a64ccfe16089f8fd1df"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/release/stage-compiled-host.mjs:10 reaches into another package with a relative path (../../npm/codewhale/scripts/compiled-hosts.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/stage-compiled-host.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c269976553181e78221fded7f9e55883ec6d0c8122b2861c3c8e6a81a922b5d5"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/release/verify-release-inventory.js:27 reaches into another package with a relative path (../../npm/codewhale/scripts/artifacts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/verify-release-inventory.js"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea95f7d262f1e217d2572d052d44bac059d2e521ee13200f59a56b8c81a2e9e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/release/verify-release-inventory.js:28 reaches into another package with a relative path (../../npm/codewhale/scripts/compiled-hosts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/verify-release-inventory.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"37330714b15d3955307aa8c9460e280b9e45a1034f90a61cbbfcfef60f6917a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeEvidence (cyclomatic 107, cognitive 206): analyzeEvidence has cyclomatic complexity 107 and cognitive complexity 206; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/evidence.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea8db0679366e727dbcb4b24f0fcf0812fa796b6578e5f07a2a6cca2a81bf6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 90, cognitive 168): POST has cyclomatic complexity 90 and cognitive complexity 168; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/post/route.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a88638792e00c78ea1c70ceb65ccc5dbdb55fc8dff6bf6c7e6941b9e146be0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function append (cyclomatic 78, cognitive 151): append has cyclomatic complexity 78 and cognitive complexity 151; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a2cb95c051dc40be2aee46351ec811215d01bb3a8e33e6d3a250003fe9090e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 72, cognitive 81): observe has cyclomatic complexity 72 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"77df242e527bd25713cb9698f995575e88fe9592e5c3860d61888f4984208461"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 72, cognitive 81): observe has cyclomatic complexity 72 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30612605c98a688ad91eddd6f5cb71db2748d155c6b1065b1f501139ec91028"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function observe (cyclomatic 72, cognitive 81): observe has cyclomatic complexity 72 and cognitive complexity 81; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-engine.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b39593f6bd1b7d0a3483b2c268439446de8ee1d0d61a025d3e94259226e46b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateBatch (cyclomatic 68, cognitive 73): validateBatch has cyclomatic complexity 68 and cognitive complexity 73; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"427680c0331018f6bc9bd04be579e54a6064ef764122f79bd2460252ee821577"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRuntimeEvent (cyclomatic 65, cognitive 66): applyRuntimeEvent has cyclomatic complexity 65 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"79c66d955bd5c0eb8b77ee620f696da48de279d88e24277ac159645de87d33d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCorpus (cyclomatic 61, cognitive 146): buildCorpus has cyclomatic complexity 61 and cognitive complexity 146; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"478976e76eafa8751fd2250aea5fb3504420562644752e684f6fe50bbfd6d591"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compilePetTelemetry (cyclomatic 61, cognitive 87): compilePetTelemetry has cyclomatic complexity 61 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7562ec220dbaa9a637d18bf489a6cb9ee20b42648e7a0bacba94a51d623d587"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compilePetTelemetry (cyclomatic 61, cognitive 87): compilePetTelemetry has cyclomatic complexity 61 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede4e704f199f91f7bc081a673046748b34a6d77bab8a977755a53da1c6fd777"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compilePetTelemetry (cyclomatic 61, cognitive 87): compilePetTelemetry has cyclomatic complexity 61 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-telemetry.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb460bc364e3e4434df706d22ac45af277e9eeac6bc0e0a48af2ec0f052d876"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeFrame (cyclomatic 60, cognitive 71): makeFrame has cyclomatic complexity 60 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"492edb3f4341ddb7bb2b2988e638a16e163969bf3bb502cb95419b1f0a9958c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeFrame (cyclomatic 60, cognitive 71): makeFrame has cyclomatic complexity 60 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f02dcf009b1e3cc125046997080afd99f049b478e5fa7b94740dd6741b56c74"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeFrame (cyclomatic 60, cognitive 71): makeFrame has cyclomatic complexity 60 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-world.ts"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a79e88eaa8707e7416f2d2f4f3f435613a464983cd26194ff082348077e2ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 60, cognitive 48): restore has cyclomatic complexity 60 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d183d3da2b2068007eee9cf575671838ed28d6fbde47ad7c68d4593f679d2db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 60, cognitive 48): restore has cyclomatic complexity 60 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"607816fd0db821667125af7ea65518d2e1dd86781e605ad79ec6e445412602bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 60, cognitive 48): restore has cyclomatic complexity 60 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-world.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fee48ae3c13ece2f4e6beddaa0e69ced5bc1a0c51bd8c27b12153a1fc280f7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromCodewhaleSession (cyclomatic 55, cognitive 102): fromCodewhaleSession has cyclomatic complexity 55 and cognitive complexity 102; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d109b21d46063c86ce93c65d0316e12584ffe9757ab29d980c61a54b44cd23af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildFunnelReport (cyclomatic 55, cognitive 77): buildFunnelReport has cyclomatic complexity 55 and cognitive complexity 77; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/scripts/report-funnel.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"729e54931d68a63fec525024b5fcd8cb792f249b41524f32345e20d42d1495ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEvent (cyclomatic 52, cognitive 66): validateEvent has cyclomatic complexity 52 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a256629d3401703c32712bebbd9c3723c5843de1d3c10d6e7fc9f1e74b12df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseProviderDescriptors (cyclomatic 52, cognitive 36): parseProviderDescriptors has cyclomatic complexity 52 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/provider-descriptors.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9901aad5fcc9b0b507055f83a4cc1f3bfa6727cf69b5abe690c7ad56a70c849"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamTurnEvents (cyclomatic 49, cognitive 79): streamTurnEvents has cyclomatic complexity 49 and cognitive complexity 79; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb51575ff4e5627038695ced109a4bcbe4fda6cc428f7f46396f1a7beb7b076"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 49, cognitive 62): main has cyclomatic complexity 49 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d92e171487cba2eaeee5be887210879a28a002ad0b1285bef4dfeb321d6a022"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateBridgeConfig (cyclomatic 49, cognitive 46): validateBridgeConfig has cyclomatic complexity 49 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/lib.mjs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"81317b9decb057c005819cd143308764996d5ad8983ea221915ea2bb3ecffe30"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleStreamEvent (cyclomatic 47, cognitive 38): handleStreamEvent has cyclomatic complexity 47 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4660038cadfdff6447760c5de0e9af573058bdac40fa932009e9174a8c2b04a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateBridgeConfig (cyclomatic 46, cognitive 46): validateBridgeConfig has cyclomatic complexity 46 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b30400f34362b758a80a05ccd0373c45ba98097b1973ecb73bd89dea83c874"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectDotField (cyclomatic 43, cognitive 45): projectDotField has cyclomatic complexity 43 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a067bf4c3059819c337edb51c98410e08f2e734113780c8efc669e84b515e2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectDotField (cyclomatic 43, cognitive 45): projectDotField has cyclomatic complexity 43 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":2159}}}],"partialFingerprints":{"codehealthFindingId/v1":"706be8a6e10149b470a32a7fc7b54fce89c4c643f5ae64b88a86d486cfa6cda6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectDotField (cyclomatic 43, cognitive 45): projectDotField has cyclomatic complexity 43 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/dot-field.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1197b4f4a1bafddedbdb1cd605c505d8aeecea4307a23996164142170f20562"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyEnvelope (cyclomatic 42, cognitive 48): verifyEnvelope has cyclomatic complexity 42 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4e0c4e2c500c3abedc7d43e07d6cdaecbaf418050877ca844d47542f8beacd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateEnvelope (cyclomatic 42, cognitive 48): validateEnvelope has cyclomatic complexity 42 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/telemetry/product-usage.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d8ab79d779724156cd137f94aba1b9d45f1a1104e0e8797db0be45b6620228"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseCatalog (cyclomatic 42, cognitive 41): parseCatalog has cyclomatic complexity 42 and cognitive complexity 41; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/compiled-hosts.js"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c73eed8f12546726b91d254b3cadcf1fa9e8530d0917f97b14f8b3fa1d5106a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function verifyEnvelope (cyclomatic 41, cognitive 48): verifyEnvelope has cyclomatic complexity 41 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"514b3a49e8fef6f9bcea1eea6e3115e50d7d89144d54f3c4caf8f514e7739c41"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RatatuiExplorer (cyclomatic 40, cognitive 38): RatatuiExplorer has cyclomatic complexity 40 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/ratatui/explorer.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8a55b249879e89e687cfb4466617aba92cc965f7ef5eac669533a60eb7a765"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activity (cyclomatic 40, cognitive 37): activity has cyclomatic complexity 40 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2148e343eebfba30e07afacb5f3989dc7072c45f03d8f5692b085696f23b03a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activity (cyclomatic 40, cognitive 37): activity has cyclomatic complexity 40 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83195b3582fd2a439e1339bcb00892372bc517245d8445b34f22689c397e8c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function activity (cyclomatic 40, cognitive 37): activity has cyclomatic complexity 40 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-engine.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"08da2e5e01779c9faaa24af02d7ea2008026b3b89bda522482752daee558216b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSource (cyclomatic 38, cognitive 53): validateSource has cyclomatic complexity 38 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"f203317640599311dabe281c04f05e015475b09ac201fd5ec80f9aba16fe72e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromOTLP (cyclomatic 36, cognitive 45): fromOTLP has cyclomatic complexity 36 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7909874f2ad421dfbb935731e4516fe57eae496d6e2943ce00099af141774d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function request (cyclomatic 36, cognitive 42): request has cyclomatic complexity 36 and cognitive complexity 42; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/test/mcp-http.test.mjs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6335bb2b66b462ace83f317bbc7ab8710edf94698716096ed85acdd88f98c65f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySgr (cyclomatic 36, cognitive 39): applySgr has cyclomatic complexity 36 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-released-capture.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9df5d9ba3f9b78f5511f2943a0765679a566f98584cd82a98789d39a8e162d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handle (cyclomatic 35, cognitive 46): handle has cyclomatic complexity 35 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"14af86b8ec3a926ec929de7576155be9ac26baf5f57aaa6c046f649848be5817"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleWebviewMessage (cyclomatic 34, cognitive 20): handleWebviewMessage has cyclomatic complexity 34 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"7342affc489a469dc62de60b3d9f1779efd1a000ae9f0e0807ac64fb4bebf08d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPyramid (cyclomatic 33, cognitive 58): buildPyramid has cyclomatic complexity 33 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5409937c5eecc6bb7570bc8132924e0a4583ba6bcd60924577c3585dbcbe2f75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPyramid (cyclomatic 33, cognitive 58): buildPyramid has cyclomatic complexity 33 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1363}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3c2bef065d0ce0932950823f2ba3efcf06aff48e025ceac3676dd661d10b40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPyramid (cyclomatic 33, cognitive 58): buildPyramid has cyclomatic complexity 33 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/signal.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"144120da0a5e97e7c1d5a64b1f5f2ce45e93b3c2684913d2f1626801d6f68482"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function publish (cyclomatic 33, cognitive 30): publish has cyclomatic complexity 33 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/publish.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"58315e4f5d96c07d838352777c4687ae0ab0c09aa45dcd1537526566d3af781c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classify (cyclomatic 33, cognitive 24): classify has cyclomatic complexity 33 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/review.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"58097fee1f23525631fbe38356fa96612698b134582fc3972c40023693fb9d33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 69): (anonymous) has cyclomatic complexity 32 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-runtime.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbd060ad2ba788be28639b9635461c7ceb20961ae0534196c1fb31f07d4d497"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamTurnEvents (cyclomatic 32, cognitive 49): streamTurnEvents has cyclomatic complexity 32 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de1a0d53bcd4acb04c271bd22567a948bf7294bd3048f528b0d044c13e0f429"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 39): (anonymous) has cyclomatic complexity 32 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/test/runtime.test.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc0d6763237305197dd253ca907ce2a68026cb3a26aafdaeef130d6a1e2e50d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function importTrace (cyclomatic 32, cognitive 33): importTrace has cyclomatic complexity 32 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2a4fa2d69c44b7a2f39cb1f2c78abe42045e70d75d16612d4655c51280f15c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function target (cyclomatic 31, cognitive 38): target has cyclomatic complexity 31 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/review.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34e93573f2d64453e14f370650398f05dcb7cc047e335c578ce75ad9389aa5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runtime (cyclomatic 31, cognitive 31): runtime has cyclomatic complexity 31 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/test/support/stub-server.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bb663cb6b0265e1a0ef3dec408fdb24a6c82db0464bdc76c4a245d56ca37b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromRecording (cyclomatic 31, cognitive 29): fromRecording has cyclomatic complexity 31 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"421ea3ebf62b9e0d61246c8ac0387b050142e3858f96c36ac8daeb1b208937e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromRecording (cyclomatic 31, cognitive 29): fromRecording has cyclomatic complexity 31 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"df507d74ae92573115bfd8a14a486cbed002eefa43f556d9db7795d23325e279"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fromRecording (cyclomatic 31, cognitive 29): fromRecording has cyclomatic complexity 31 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-world.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca998be6b37499bd953fe361f0c8247000028afc119b030638e352e5cca2297b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamTurnEvents (cyclomatic 30, cognitive 45): streamTurnEvents has cyclomatic complexity 30 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6c54147ab4ff534f5b3868e3623bc6bcd5418086ac7d8d3425993b7c33968c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contributionCohorts (cyclomatic 30, cognitive 35): contributionCohorts has cyclomatic complexity 30 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/scripts/report-contribution-cohorts.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"345516c1d3fb71772192c35052b76f9b8e09eb11953924a44432adacd4fbda1f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseModelCatalog (cyclomatic 30, cognitive 18): parseModelCatalog has cyclomatic complexity 30 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/model-catalog.mjs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"7724d5a3e5738a441659a521c03941d89fe4bf1438d9d3767b2d1f930853d6d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gaitTarget (cyclomatic 29, cognitive 62): gaitTarget has cyclomatic complexity 29 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"768ae3749442159b782623a061b0893319544537d1971cb4cb4aa6ee8ae9b389"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gaitTarget (cyclomatic 29, cognitive 62): gaitTarget has cyclomatic complexity 29 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12f46cb84449587202f7d543cb4a18366f0bd39f6a28fc5bfc113ffcce373f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gaitTarget (cyclomatic 29, cognitive 62): gaitTarget has cyclomatic complexity 29 and cognitive complexity 62; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-sim.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"8792b42c0ece0619ff6d8fb56554f8919f8b5b0964bfa14029782ee964edf343"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 29, cognitive 34): run has cyclomatic complexity 29 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/review.mjs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd6b480a5a8b5666393c4abfea53b9984ac27b946d1c70eb7ba663dea5507cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRepoFacts (cyclomatic 29, cognitive 18): isRepoFacts has cyclomatic complexity 29 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af9965936ccd766a51325cf8609eab96e68e110f817809215c9f54a6da576ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reviewedRoute (cyclomatic 29, cognitive 15): reviewedRoute has cyclomatic complexity 29 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/model.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e8c9b6a225b39e7747c100e6d2040944f3c02d0d2565024af92ec2e5401a56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function createPetRecorder (cyclomatic 28, cognitive 38): createPetRecorder has cyclomatic complexity 28 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-recorder.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85419876fb0490437800dc176880ceaa5f37df712a576f50021462a67277e8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 30): (anonymous) has cyclomatic complexity 28 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93c372ac51ec8ce3d021296315da45dafd5bcfc1f5cf2737df2785c2135bbe2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorizeRequest (cyclomatic 28, cognitive 25): authorizeRequest has cyclomatic complexity 28 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/review.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"41dd9d59f7b435233bca50394c8fda8b59d8e441cb81877524a958f63e15c7ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 37): (anonymous) has cyclomatic complexity 27 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1f7eb141e8977c33dd85a1ce98430c6ff3ada8c8a8fbfd67caa799f6a324df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function operatorAction (cyclomatic 27, cognitive 30): operatorAction has cyclomatic complexity 27 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/operator.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c4ee3003f48e76d41a3500017e409f1ffde996002167be1a8948f7ede6ff3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 27, cognitive 17): restore has cyclomatic complexity 27 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f7fd1911dab5e2d76b2da343328e3b7f67360e5c5dfdd4915352b03509bd22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 27, cognitive 17): restore has cyclomatic complexity 27 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"742d71b06c0f3d802c0884dd6f535f1dae8ce4a02be747acaa8cea7bbd5ffb0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 27, cognitive 17): restore has cyclomatic complexity 27 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-sim.ts"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bebb1441def51c34a25bfea8c8b39f7316d013a6aefe152ba2cb5958ef7d38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyDraftLock (cyclomatic 26, cognitive 38): applyDraftLock has cyclomatic complexity 26 and cognitive complexity 38; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/draft-claim-lock.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdab94aeb03ee03431e3d6aa69e4303b29905b648fb92251955b63eb1bfc3825"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function withRetry (cyclomatic 26, cognitive 35): withRetry has cyclomatic complexity 26 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":937}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5714d3e3e2454455eb1f0b33304f05a7bbcb4de7d3ae42f89c57fa67c523d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function append (cyclomatic 26, cognitive 30): append has cyclomatic complexity 26 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/lib/pet-recorder.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"862084537648ea4fdc445632a1e96bced15b3f32eefcddb53a64ce3e92bcbafa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 24): (anonymous) has cyclomatic complexity 26 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-lib.mjs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cac9cc302b1a0539fe7cfcb0326227c42ee42e25dc852d9ec04115e271b3aef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function voices (cyclomatic 25, cognitive 45): voices has cyclomatic complexity 25 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd504228f4518956c8041d646070d815f1991d38655c3202132b38f84184633"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function voices (cyclomatic 25, cognitive 45): voices has cyclomatic complexity 25 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59c14da45237f01208b32e57ad22ce3e7aeca97ec5fca06b57116401057cf62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function voices (cyclomatic 25, cognitive 45): voices has cyclomatic complexity 25 and cognitive complexity 45; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-audio.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f8e895f36d94237969323d08fbe802f6af62e76e54cefd314449607afc3450"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replay (cyclomatic 25, cognitive 28): replay has cyclomatic complexity 25 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f86b6180c97ad54b97bb95455307440c51fadb58d7956d65428390350a43326"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function request (cyclomatic 25, cognitive 27): request has cyclomatic complexity 25 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/test/mcp.test.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"91cd4c6028750a8ec095e323f06d665d562691ad832d7119199ea446afde89a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRepoActivity (cyclomatic 25, cognitive 20): readRepoActivity has cyclomatic complexity 25 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/repo-activity.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f175c762d057014ccb5b4e84131905edbbb85d78d93bbf06765986dca64c070"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function categoryFor (cyclomatic 25, cognitive 19): categoryFor has cyclomatic complexity 25 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f380e020eb936a778ae18f2af477c696aacf0058aa5d3157b11e3798742d496"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function releaseAssets (cyclomatic 25, cognitive 12): releaseAssets has cyclomatic complexity 25 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/computer-use-release.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2479735bb6880f8f39f44fb7b380ffcc94b191f5335fa83a5ed4310df09082ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runtimeRouteInventory (cyclomatic 24, cognitive 48): runtimeRouteInventory has cyclomatic complexity 24 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-runtime-routes.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c5cce46de28c360823238205dee652a395623084ed428741223cd42b5333214"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function makeMatrix (cyclomatic 24, cognitive 46): makeMatrix has cyclomatic complexity 24 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a1adb44f10eb922b41854ad24106a91abb6d7f630c87fe777c9045a2d79c9f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tick (cyclomatic 24, cognitive 32): tick has cyclomatic complexity 24 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/pet.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8343d88135029b99c8cf3e49533df6997750bbf65e44bc74d61479fb3dbce5cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chatToResponses (cyclomatic 24, cognitive 30): chatToResponses has cyclomatic complexity 24 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/opencode-chat2responses-proxy.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a0b95805b7a9245d4f9bf53e8811bb334334035d1be5ffb899b7c418fef3d2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function workflowReceiptPresentation (cyclomatic 24, cognitive 20): workflowReceiptPresentation has cyclomatic complexity 24 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea386a7be179b60e4647777a8b94b7337f3bf62fdfda49800363ca6f3eb7845"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchProof (cyclomatic 24, cognitive 11): fetchProof has cyclomatic complexity 24 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/fetch-compiled-host-proof.js"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf3eed812e473cbc98c732929549c2ba771ee34b001ae6570e63c0579a38224"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySnapshot (cyclomatic 23, cognitive 31): applySnapshot has cyclomatic complexity 23 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f61247ea1de8eb28cea4d7556bd83677ca6787cfc664d19ae274b583be85fc6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rightLines (cyclomatic 23, cognitive 30): rightLines has cyclomatic complexity 23 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/publish.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b3bb3e478c1e9c208aeea9a14c8289684dfa335435f86edf7f32c25293bf15"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 25): (anonymous) has cyclomatic complexity 23 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/opencode-chat2responses-proxy.mjs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7162dcb0fd2d8c011a1361163f2c994deb41db16b7ba85806f9de7e270ecad9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadNewThreadModels (cyclomatic 23, cognitive 24): loadNewThreadModels has cyclomatic complexity 23 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"91101a3661cf7c0deb3a40be5f9f53427ae45de6cd93255034b54e09b83da720"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 23, cognitive 23): main has cyclomatic complexity 23 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/compare-deployed-facts.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd30c90c5abf7eef344d953416c054500852b8f59a6603b508ab4ed932baebb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPetPCM (cyclomatic 23, cognitive 12): renderPetPCM has cyclomatic complexity 23 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e4eab86a1f49d55a56f718bfcee0ce773035f1056a14e3b0abbb5d470b7ae6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPetPCM (cyclomatic 23, cognitive 12): renderPetPCM has cyclomatic complexity 23 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71b1f7aef3a4ac72ea17e1fd4026a14030fe9353f077699e11347e0c5cd1501"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPetPCM (cyclomatic 23, cognitive 12): renderPetPCM has cyclomatic complexity 23 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-audio.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0163c9e04efb031275061a9cbdd000fccd758d0c29cad91d97cde2092d48435e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseChangelog (cyclomatic 22, cognitive 32): parseChangelog has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/changelog-lib.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"563a8cc0c3123ce8dfcfdbbba5d378de162c31b6cddfefeeb0ad6403f62ec664"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectProviderModelPages (cyclomatic 22, cognitive 29): collectProviderModelPages has cyclomatic complexity 22 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c31d4e4416d6d8a5b2c49ff226060969564df418eabca50da98cf7af884d2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function admitTurn (cyclomatic 22, cognitive 29): admitTurn has cyclomatic complexity 22 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fd5ec163fa1fc45e12366ddc75a9e2969b7fffbb1c5f1d8c96495f3eb62b2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 22, cognitive 23): run has cyclomatic complexity 22 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/verify-release-inventory.js"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c2c6a1327f12f8a5f83b34e53991fb4eb6239f492da009813b4236ee306083"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readSse (cyclomatic 21, cognitive 50): readSse has cyclomatic complexity 21 and cognitive complexity 50; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90e9071cfeac9db2ebfa4e48aa84345673bdd557cf06b7774ca2b7e561410cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMarkdown (cyclomatic 21, cognitive 33): renderMarkdown has cyclomatic complexity 21 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/markdown.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9867e0226d0e2a05b09a5128375f62245d1936657550564a74657b44702d51da"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 22): (anonymous) has cyclomatic complexity 21 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/test/api.test.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e928b6f11cd9e97c4162cebc36f9a23a5f301f566f8255b9e708bc62edf3ab96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receiptQualifiedRelease (cyclomatic 21, cognitive 15): receiptQualifiedRelease has cyclomatic complexity 21 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/computer-use-release.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5ddb68aa27928b748b6df14273793b2c08994cc7aa05860f64d56f99494bbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isEnvelope (cyclomatic 21, cognitive 9): isEnvelope has cyclomatic complexity 21 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"09806aeb8fd56ebe26fcc1d391936a7314fdc40ea100da740a2f1cac8ac96e62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertInventory (cyclomatic 20, cognitive 28): assertInventory has cyclomatic complexity 20 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/verify-release-inventory.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2e64c408e9bf8d1259fe2e25e0f4b89d6545c0bbd02f021b346d6a509795e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function answersForUserInput (cyclomatic 20, cognitive 26): answersForUserInput has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"c359a6ce5fe8e2dabc2ba14560ee57d1e1c1808b677bf815ae64c5fc3ad3165e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSemanticDrift (cyclomatic 20, cognitive 26): runSemanticDrift has cyclomatic complexity 20 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content-watch.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ee6f1083d79e93f41b4eb658c496a9c191ddd32e8c7f795d198b0339a6fb1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reattachActiveTurns (cyclomatic 20, cognitive 24): reattachActiveTurns has cyclomatic complexity 20 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8869b5c93c106e74bd414db1c4917283d342066a8a6de5bd8fffd278124584"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleAdminMerchInterest (cyclomatic 20, cognitive 23): handleAdminMerchInterest has cyclomatic complexity 20 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/interest.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b14ab3c05fe20f05d40558ec5cd399d9710044e7d9b9a5a1d069a3393238f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function redact (cyclomatic 20, cognitive 21): redact has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c21062367e106949ba22fb1566fcd4959d05134ee5aa34dde015b828717c69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function settings (cyclomatic 20, cognitive 21): settings has cyclomatic complexity 20 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/review.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bb6c752d7c5f036a046d360efcad39ca0347f14f3e014ae5350f1ed315ca54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function workflow (cyclomatic 20, cognitive 17): workflow has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/setup.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b48a64dd45ddc9dd48f1ed9d1860b434b3c25bc614cfc67debb19943ede5d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DocsSearch (cyclomatic 20, cognitive 17): DocsSearch has cyclomatic complexity 20 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20d18d115d9bc13c93a7ff84713cb47de3fb6ecbd383e040eff0b6227718013"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateQuoteInput (cyclomatic 20, cognitive 14): validateQuoteInput has cyclomatic complexity 20 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/model.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5557da1accc9d3171976b96dc3b6357b0dafcc77342b220452c9263fb7ad0b17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTurn (cyclomatic 19, cognitive 46): runTurn has cyclomatic complexity 19 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"854895857b165d6616a0a9cee8519de912f4891d9134d8595400aaa9385cb97b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 19, cognitive 37): tokenize has cyclomatic complexity 19 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/ratatui/highlight.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"706b9a0b79b0986cce7dad1f7278f33f56743cc4842d09936439753695257293"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flushOutputs (cyclomatic 19, cognitive 31): flushOutputs has cyclomatic complexity 19 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96d2fb5aead5c4c003805290808f09aa32aad88ccdf78586c329cb271378782"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 25): main has cyclomatic complexity 19 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaffbdeffc877a63057ac4f4b99251c1438447868c6398ae9449093096b6cfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function step (cyclomatic 19, cognitive 23): step has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"9545b2096fb133aa3151288a56cef5a8f7786da0fb089a2548f6531116f536b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reconcileAdmission (cyclomatic 19, cognitive 23): reconcileAdmission has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"775b6166cb3391eec4cc81af631186ba78a97a95d40668560757059657751345"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function step (cyclomatic 19, cognitive 23): step has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e220fb167fd776505dd95cdc9e0d402ca897d1076c38f1da8143c4e08227132"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function step (cyclomatic 19, cognitive 23): step has cyclomatic complexity 19 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-sim.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"192cb0e3f16bdd3676ea5bfafe57f040d6eb09dea7c1b3c4f4b5cc5540f5209c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function grade (cyclomatic 19, cognitive 22): grade has cyclomatic complexity 19 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22be28f474c845ee0a9a3bcfd40ddbc3c583c706321dadbf56b2ec62ab21282"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function translateResponsesSseToChat (cyclomatic 19, cognitive 21): translateResponsesSseToChat has cyclomatic complexity 19 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/opencode-chat2responses-proxy.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc8828d77c4ba3739038132ef8788a1c57029792bd1a4859eb88b4a17b9ffef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchRepoStats (cyclomatic 19, cognitive 20): fetchRepoStats has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/github.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a88ef269d7d600c673af11edbc12a343d8b4728f5c89c5d855ec799acc836b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 19): main has cyclomatic complexity 19 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/cnb-github-checkrun.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f1fa17e42df0368ecc04e6349c9123ed42a1f67adcd191645255af46a741f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HomePage (cyclomatic 19, cognitive 18): HomePage has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/page.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bdd3d89de26c8c645d168d4e7dd9cfe6e357f508a97e2dcf45894218d1ca22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MerchCheckout (cyclomatic 19, cognitive 18): MerchCheckout has cyclomatic complexity 19 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-storefront.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af475b5ed1185222c697dc12114195b1774781a081b074dcadff4299e72160f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleInbound (cyclomatic 19, cognitive 17): handleInbound has cyclomatic complexity 19 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"1accdf28b22e76dff1c4ac68ba5b3e3833005a0fb9832bdd5916923c3a470be3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setFinder (cyclomatic 19, cognitive 14): setFinder has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d855fd42dd20631c0c63c9e291518ff8024dc7915190518e374f35011384cf0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function webhook (cyclomatic 19, cognitive 14): webhook has cyclomatic complexity 19 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/server.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd3bbc88222824e070dce97daf53847657ee3c1eb02bb3887be1dfe151217f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchCurrentRow (cyclomatic 19, cognitive 13): fetchCurrentRow has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2617dd3e9ee521c076bd14aac65b4cac33a66ee70af071cf318635591fc84fda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validated (cyclomatic 19, cognitive 13): validated has cyclomatic complexity 19 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/interest.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e898a159e958049ecf767ca34fc6c6e83873dc09c4966fb17ea931cc20495341"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function penalty (cyclomatic 18, cognitive 39): penalty has cyclomatic complexity 18 and cognitive complexity 39; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea33019354992c44b23a64d106988da76f28d3ea5a477347685d868c5b0a54d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function monitorLoop (cyclomatic 18, cognitive 35): monitorLoop has cyclomatic complexity 18 and cognitive complexity 35; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ad670afc1798e9867ba5ffc5640e77409bfc9863701fab3a9fb07bea04b74f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareCompiledHost (cyclomatic 18, cognitive 25): prepareCompiledHost has cyclomatic complexity 18 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f9a95430228cb1cedcc6ac60cfeb8a90afef79069bdd5cc18a21644e85e439"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureBinary (cyclomatic 18, cognitive 24): ensureBinary has cyclomatic complexity 18 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2965227bfd0a16669e7d8233f8a8c50d595c145edef8f7d649b3fab9567697"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onchange (cyclomatic 18, cognitive 22): onchange has cyclomatic complexity 18 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/ui/pet.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebcd8fe2b7d621790a869046203f9cd74b3bed62bf69a06373d28ddc0655c65"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function presentation (cyclomatic 18, cognitive 18): presentation has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a90ddc865d2e3252099f319d6d5aacbd7ab68063f1c22e2ae91db7eb4e99c3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function presentation (cyclomatic 18, cognitive 18): presentation has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5eabb92f1c2bc6dfedd0388d4ee495ade73562e60faa2c10d1ed740c192d4a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function presentation (cyclomatic 18, cognitive 18): presentation has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-native.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9fcbace791eb54bfb49867c6c5db2d10a0b2842c6e64b685ea684e90adac86"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkReleaseDocs (cyclomatic 18, cognitive 18): checkReleaseDocs has cyclomatic complexity 18 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/release-docs-lib.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc1e5bf09041778736a4102cf74da3470a2e8a0e4e6596534989e728098e153"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 18, cognitive 17): constructor has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8319113d15bde804d36b06dd5c30a97fdc2ff9e21e4993f6dcf884f88d9df1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 18, cognitive 17): constructor has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3dde846299695d2172097661c23721d8c84cbe00c0d46a99c556c9a4eec70e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 18, cognitive 17): constructor has cyclomatic complexity 18 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-world.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31403c89108828cde4624da0041cbc4258e7b9c0c74d7bd2f5bc9fa3ffa7946"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizedEvent (cyclomatic 18, cognitive 16): normalizedEvent has cyclomatic complexity 18 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7a48c8527e2cb4cbb9ea6cea3f725b081a68c0828ad35743ae3191dcd42ad7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 26): (anonymous) has cyclomatic complexity 17 and cognitive complexity 26; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-terminal-capture.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0594c7eca74dc528de7d7ea7f956b7ad8aa6965eab4245b9d3c9d502e1d9d7ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCommand (cyclomatic 17, cognitive 24): handleCommand has cyclomatic complexity 17 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c3eac49704bfbf7f76f31dc3d6a4f25168658b724d707ce6ba03750bb8f629"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mitigated (cyclomatic 17, cognitive 21): mitigated has cyclomatic complexity 17 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/audit-dependencies.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dee7bb4c699b872509a730ccaa17d908c7898921ce60e243c966a3f425dbfb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 17, cognitive 20): main has cyclomatic complexity 17 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/prepare-local-release-assets.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7449b48c068587da3f95ceaa0ffd41e0bc7184b9fdc57f2105bcde0e4346eae0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 17): (anonymous) has cyclomatic complexity 17 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/ingest.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e0b23e755af7e8a95e23f3502897bd88f9861d2fb02a8ad3b21106c1b25e55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureShape (cyclomatic 17, cognitive 16): ensureShape has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6ff758b1cfed7e7e7d56323eae913cc439a2d844a019e4615626f78f250ccd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCallbackQuery (cyclomatic 17, cognitive 16): handleCallbackQuery has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91753596454a2b77ede0878966f752968950b278e1795a6bca3975656773236"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isRetryable (cyclomatic 17, cognitive 16): isRetryable has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"868e0a99ac31d17303d5058d3ae76dd94ab8f94efd59c7dea0dacb2e7c6986b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getGuidance (cyclomatic 17, cognitive 16): getGuidance has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/ratatui/learning.ts"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"12574b74881d8e0c558a9de2434520e5208c9cfa09a78cb0f15d32c7c2f9fcd8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleIncomingMessage (cyclomatic 17, cognitive 15): handleIncomingMessage has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"21aa2a32943e64a0c11702ace963fffe90a2a1b513dbc68ec8147684640b7f8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function authorize (cyclomatic 17, cognitive 15): authorize has cyclomatic complexity 17 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/evidence.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b35df4c9349e0fcf714010ff9711fa2d2c4cbccb210156f88727a4e522d8fb9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isAgentDraft (cyclomatic 17, cognitive 11): isAgentDraft has cyclomatic complexity 17 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba51ab90defabe9ec91f111bb676998bd0c7cba2ed9a46f0570637d435c2fe3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderUserInput (cyclomatic 16, cognitive 24): renderUserInput has cyclomatic complexity 16 and cognitive complexity 24; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb31c83373830a206c4014ca66bdfff3ecdadc3be7122e72bfb3e1ac2af82a96"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 23): (anonymous) has cyclomatic complexity 16 and cognitive complexity 23; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"f821fd6f1f90baf593a45d51f1d0ce4f682d031b4770f6a4b655bfef6963db16"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseQuestionAnswers (cyclomatic 16, cognitive 21): parseQuestionAnswers has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"d750bea44b46a65e9a183eda895ac96bf6ad96cf98a41f9df716de5d203ec6db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 16, cognitive 21): draw has cyclomatic complexity 16 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/ui/pet.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23e52cd261897f8b767be73ece30170892bb40ae9080229b87e293d454161b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPrompt (cyclomatic 16, cognitive 20): runPrompt has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"760f804799476c7007cd041d7f0dcda9017cb252c45fcd45979b2f47f4a42526"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateObservation (cyclomatic 16, cognitive 20): validateObservation has cyclomatic complexity 16 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/evidence.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c3289458127456f06a716e65697146cad4260f017c60855f26e1b8e428109c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateItemNode (cyclomatic 16, cognitive 19): updateItemNode has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbbcaf35fcf18ee7b418d9c05f4a2503cb10a15a1f882570cf7c092507c9945"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveCloudFacts (cyclomatic 16, cognitive 19): resolveCloudFacts has cyclomatic complexity 16 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8130aafe66508ab31b6d5db09d0f47928d276d140aa8e508db6fdeb855145feb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureThread (cyclomatic 16, cognitive 16): ensureThread has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d9ecde76f9c164c3afad523bd4da9d1f882fb2e523e33340d76b906aff181a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshFacts (cyclomatic 16, cognitive 16): refreshFacts has cyclomatic complexity 16 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts-drift.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"563bbc811d5fe56f2d06015b969041603a68fbbeddb3aa9ed468ea8786cf5986"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyTurnEvent (cyclomatic 16, cognitive 15): applyTurnEvent has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"197b0e72ca89941e324da08d572ae1ff987877c9b1b84f31128b31d70b2195f6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCliCase (cyclomatic 16, cognitive 15): runCliCase has cyclomatic complexity 16 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbaff48e555c9b8e0121dedd698a3894bd769d87b1b009923665eea6e69fe45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startPromptTurn (cyclomatic 16, cognitive 14): startPromptTurn has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2b56d016015508b3147dda619b33adc96404a4b255ceeda829e5b96b5c297c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 14): (anonymous) has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/operate_best_of_n.workflow.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"442e09d7255ad3de2b30c1921fcf1359a9cd617cd8a31fef10dd6f0dc12a6c33"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSkillCase (cyclomatic 16, cognitive 13): runSkillCase has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69fbed99683e534b0faca0d88d2c6973b9951c2df0714f655d4cfffb2a76028"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GET (cyclomatic 16, cognitive 13): GET has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/cron/route.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"99485806343e94f6b9930c61aa990abb8b6c2d764b9324d184b65fee457d07c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function statusOf (cyclomatic 16, cognitive 12): statusOf has cyclomatic complexity 16 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2750e4ef21784f0040f535ad0c12d7969424c8af536a3c11808f1b245e3826"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveLatestPublishedRelease (cyclomatic 16, cognitive 11): deriveLatestPublishedRelease has cyclomatic complexity 16 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-lib.mjs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91cd578088aaf251bf86e3e86471ecb6710edefe1335f70022985b37d72b777"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamTurnEvents (cyclomatic 15, cognitive 25): streamTurnEvents has cyclomatic complexity 15 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e66d1390e9de342c26fcc345970cd7ae2d458b0011e2b7054d7d59e76d8e8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claimDraft (cyclomatic 15, cognitive 22): claimDraft has cyclomatic complexity 15 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0813b4e5a500d7faceaaefb8e2cade94bf932a567a612650d7f648eb1532b05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 21): (anonymous) has cyclomatic complexity 15 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"835cd4430d2ff08e87f0497486d93b5b749af8d01cc16d4420faeedacd3a377c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveCurrent (cyclomatic 15, cognitive 18): saveCurrent has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/ui/pet.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff66c86a0999b91c029b36550c2d133754597c7232fdef41e02de2ab347b0ecb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function setup (cyclomatic 15, cognitive 18): setup has cyclomatic complexity 15 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/setup.mjs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b04ae9484682011fedd4c66c63e50314fc534ee68d1313a2f566e9d9f52c92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleIncomingUpdate (cyclomatic 15, cognitive 16): handleIncomingUpdate has cyclomatic complexity 15 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4addcd556b114d9a96acc37f56a8f9bd4088532458b5ca4d1257f63184008e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendStatus (cyclomatic 15, cognitive 14): sendStatus has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec1349a2784ba68611aafab72f73f9dea19ad5d4eab73365da61cfb6f74a158"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 15, cognitive 14): run has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22a858acb5fd3e56d70d06d492b463ac57ba5725a4389469eb7e727d682cfe8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function InstallPage (cyclomatic 15, cognitive 14): InstallPage has cyclomatic complexity 15 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/install/page.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e20228172974d54bae43a9acc577f6a7da750388e67d25f2eed022591433945"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #rawRequest (cyclomatic 15, cognitive 12): #rawRequest has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/runtime-sdk/index.js"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b56b2f14256bc784ef207472a9fcff92dc00367bbdc6b625d6c47638680621"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkout (cyclomatic 15, cognitive 12): checkout has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/server.ts"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"01877a0673a2b114a5c3d781e8958bfdc259e166ceb0b62f78a5e0107fbdad8d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPublishedDigest (cyclomatic 15, cognitive 11): isPublishedDigest has cyclomatic complexity 15 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a2aa6cb792ef3c03ef658053355206e2222c33906c7ec97cbd1a34834ab68f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoveryAllowed (cyclomatic 15, cognitive 10): recoveryAllowed has cyclomatic complexity 15 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56580a112941aeb527b851116da91c9a98c1d6a7a6d008f8df9ea6511854384"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readConfig (cyclomatic 15, cognitive 9): readConfig has cyclomatic complexity 15 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbaff836715895be9215a60fc68bca073d688ed7a5969b4ff30b44cc9034f1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 29): (anonymous) has cyclomatic complexity 14 and cognitive complexity 29; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"23207894bef5379e7d3b9c083437a98de0e557b50a26683948769da27f48024f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildCodewords (cyclomatic 14, cognitive 19): buildCodewords has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c58619212370fe9acbbf48aa121e6fd0948389c488119afeb3f8cc52a682329"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateDriftFindings (cyclomatic 14, cognitive 19): validateDriftFindings has cyclomatic complexity 14 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content-watch.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"493d2d758ab24ef612e344cec0ee7b38e8558257341d2070d01d1d74c89b60a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordingChunk (cyclomatic 14, cognitive 17): recordingChunk has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a09347ae33a9bfcc68f9b90ad4ecad047b9771faed05f74e446684cb98239d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordingChunk (cyclomatic 14, cognitive 17): recordingChunk has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ca1fef881e55ccdb24ddabaa8e2952916661783e55dcd7dfd3b85852e1bc6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recordingChunk (cyclomatic 14, cognitive 17): recordingChunk has cyclomatic complexity 14 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-world.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"85da2168cb5d3ea15254fb56185d1b546d241ae310b1638622ab054cfcdccbbe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ingest (cyclomatic 14, cognitive 15): ingest has cyclomatic complexity 14 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/index.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"b178782ed2a329b9a9b245ea253c5913db30f4152e4953a0f4c3f4b353b5eae8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertReleaseAssetsFresh (cyclomatic 14, cognitive 14): assertReleaseAssetsFresh has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/verify-release-assets.js"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"773535b006e49bdcfe32fe1336f8f7595277eb39ed9f689a965cc040b860b88c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyAudit (cyclomatic 14, cognitive 14): classifyAudit has cyclomatic complexity 14 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/audit-dependencies.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"4312be897368c0ae5de02bb9cb623a96fbef5800fc527a5a9c69d0f7ed43e0f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPrompt (cyclomatic 14, cognitive 13): runPrompt has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0b6d58be725e48fe943b84b5d02e064fc24fe4a2505318eeb279114a292696"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function selectReleaseSource (cyclomatic 14, cognitive 13): selectReleaseSource has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8738684d61bf7f76f9a3f2d4cfa7a669cf55b35964cb49381ab6debba313f7ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classify (cyclomatic 14, cognitive 13): classify has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"36874bf9120083a5e924b2ee5269f73f7c12d38a44fc90ad7031fe19b1140c46"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function flush (cyclomatic 14, cognitive 13): flush has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/telemetry/product-usage.ts"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfc6caa9ae615f07cc1b72725109c487b51e76ad8cdd798875711852360accc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decideApproval (cyclomatic 14, cognitive 12): decideApproval has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c645b8159d030e3652d4cb8e7fcd09dff8860a9f64ecdfc7bd9ab61eb539b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 12): (anonymous) has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0f3d0279cdb73e11c5e06204a8421e2f71393f99697e31ee5a58153546fe45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deriveFactsFromRemote (cyclomatic 14, cognitive 12): deriveFactsFromRemote has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts-drift.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"846b1cc6a0b6e55ecac311e18d34c06c77beaafa2c2acf30d1906c9ebb331dae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchLatestPublishedRelease (cyclomatic 14, cognitive 12): fetchLatestPublishedRelease has cyclomatic complexity 14 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/published-release.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"869349a9564ef3b185cc162e6aa99550cb46f8493c2e36bd3ebac07461f5e2dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateArtifact (cyclomatic 14, cognitive 11): validateArtifact has cyclomatic complexity 14 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/findings.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ef5cbe389588d782d7b46179af44e4cd9527eef0aa33c39f0669d61ed6b331"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectItem (cyclomatic 14, cognitive 10): projectItem has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/transcript.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc2eb5d9261cfb207f7ff977874539bb7a6233b5d6467c42e3b410dd744c646"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function incoming (cyclomatic 14, cognitive 10): incoming has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/dingtalk-bridge/src/lib.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac28cf4deccb189a0f36898aa09c91f2f751b7d1d83323cbfc54a87ba98ae525"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function review (cyclomatic 14, cognitive 10): review has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-storefront.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"21022f181fcc0ff2eb73a97fd9f45903ca575246e25ce4bb06a88bd4cc83459d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readConfig (cyclomatic 14, cognitive 10): readConfig has cyclomatic complexity 14 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/gt-site.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a6345a50ed15d20a02a6cd94f76ffad9645cf362ca2baa63f0b5e83fd35d04"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 33): (anonymous) has cyclomatic complexity 13 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-terminal-capture.mjs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44d72955c6186b4df19b798a39cdd6e29a51630fd872e86394b0f48fcaec4db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 20): (anonymous) has cyclomatic complexity 13 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/test/approvals.test.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"54098d7e6d9b51f3bed33cd2400e2254eace0f284eb88fb458af94b31296a605"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function claimsFromStructured (cyclomatic 13, cognitive 18): claimsFromStructured has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0689c0ea53618d85bbf9ddf92c75a8722d7723e59db911c6159531edf8b74cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getPostOutcomeUnknown (cyclomatic 13, cognitive 18): getPostOutcomeUnknown has cyclomatic complexity 13 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61acb1b87b4a9dfc10f1e60f6b8f5cb7a948100c17264759411d9962ed27dff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function api (cyclomatic 13, cognitive 16): api has cyclomatic complexity 13 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/publish.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"168ba63c85f58f6a7ffad4a6cab684458bfe3043444d5b2651f50fcba2d79279"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function periodogram (cyclomatic 13, cognitive 15): periodogram has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf581e7a898a450c37d83dba5bd14a1c219f6f8e8b3039853950bf5bd938fc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function periodogram (cyclomatic 13, cognitive 15): periodogram has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e33ca6fd0e00573743bc2d15f79f6dd0037303219c902dd64dff19be06744c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function periodogram (cyclomatic 13, cognitive 15): periodogram has cyclomatic complexity 13 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/signal.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5feada21c018ed5f5a0db5ad80efc78196998586af6759550bac0018ee1de0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fieldTarget (cyclomatic 13, cognitive 14): fieldTarget has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"842b83e20c1d5c1ea9ed2fe5987b38a5b42372505ef6107bd302a71472b92788"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function threadEvents (cyclomatic 13, cognitive 14): threadEvents has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/runtime-sdk/index.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7a7c41eaf0068bd4cc11fee6c7c43592f899b1720d983f5314785845ef749c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fieldTarget (cyclomatic 13, cognitive 14): fieldTarget has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6455417dfb7efc0f156222ae3d314cc347032677032fceb887ba2fe3874785"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fieldTarget (cyclomatic 13, cognitive 14): fieldTarget has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-sim.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc1c177d7afcad1259f0d94c05a1f5ec460b8ac0427b446d5b9a1632a5f0dfb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AdminPage (cyclomatic 13, cognitive 14): AdminPage has cyclomatic complexity 13 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/admin/page.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd07e949c591a4956aa3efb4511cf07fb1bd6be3225feebb3f76b823101fac1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectStream (cyclomatic 13, cognitive 13): connectStream has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24d4e792f74f38b3e34a6444a7948028ceed608aed325a4fd5fc02268463823"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eventMatches (cyclomatic 13, cognitive 13): eventMatches has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b226104ef03f8786cc7451acf8bfb1e49493e3693b1f582c067139f7f258b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendStatus (cyclomatic 13, cognitive 13): sendStatus has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d5a38e479f595150cae5e1ae1ba0732c4b4092b9bfbbbfc6eef884537168a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function run (cyclomatic 13, cognitive 13): run has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/run.js"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1befbedaee8b5592c7b2657781a2478015bdd9163396f7fffe2dd880aedf14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eventMatches (cyclomatic 13, cognitive 13): eventMatches has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3f0b1ac6e6edd6821e07199816f2872500e2bd88cd18574c1a3a6d57ae73ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function eventMatches (cyclomatic 13, cognitive 13): eventMatches has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/model.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f44206359dd3bfc45c43b5b40e1fcfd80ef516cc42eb860acc5cbf035b49b4b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextConnectionState (cyclomatic 13, cognitive 13): nextConnectionState has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/connection-state.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c34a4d2229c16c2d6515941feff33169112bf3267673f4646d70687679929c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function interestOriginAllowed (cyclomatic 13, cognitive 13): interestOriginAllowed has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/interest.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"37fdb9286c040b5ed4eed56786324da57ecd7030649da432841a8e9e60a49950"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installFixture (cyclomatic 13, cognitive 13): installFixture has cyclomatic complexity 13 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/public-installer-contract.test.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"be639f6cfc0fb687c8781fdfb556db74d1dd1fd2b734a65cc6d4e962f56a3653"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function incomingIdentity (cyclomatic 13, cognitive 12): incomingIdentity has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"534baedfdaf51a0232153974c12123868fc5e62ad00231b42eabc8c4f4695b3a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPrompt (cyclomatic 13, cognitive 12): runPrompt has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"076c1bcdb9f0a076ec979fee12105502b9e830f529b685cd4b16bc0d0fb88bcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function animate (cyclomatic 13, cognitive 12): animate has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/ui/pet.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34ab19e5f68d3e0cfb8ebea0170d6c91cc0ba056d515db292d63be7daf37ec1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function saveDraft (cyclomatic 13, cognitive 12): saveDraft has cyclomatic complexity 13 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"defa6a3135681028ef9bb58fe98adbebd27fa42087903f554ae9410b4511dfcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPrompt (cyclomatic 13, cognitive 11): runPrompt has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"c131fa2071307a199399bf25c71e3bfc9b7d05667928bb594652e2a54bc26072"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function telegramIdentity (cyclomatic 13, cognitive 11): telegramIdentity has cyclomatic complexity 13 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/lib.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"3787953c800550dfe58bcdb71b3192e9de87187cb7746ad35a26f1ebcd3a3525"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderHeader (cyclomatic 13, cognitive 10): renderHeader has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1460}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8b2f9dec3ccebb36c8bb24d3897467b79581e938e4a796b4157e3dd25826b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3fb2e4f990817258e810ceebcb49b88942c8cdb2da27b37731e69e7f27c1c18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildPayload (cyclomatic 13, cognitive 10): buildPayload has cyclomatic complexity 13 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"9386d34a790c6a0de098470632ae5b88ec3ff57316a424fb670b3e75001c6a29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 9): (anonymous) has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/release-updates.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed83261b0a0dfa90ed2ac5b24dfe4f27fa8683f2482c1cde975e54a2eb9ea38"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBoundedFile (cyclomatic 13, cognitive 9): readBoundedFile has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"23786297b1c28da0642da7b0eb88863ba1da88fef929aa7881685c231e422129"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postgrest (cyclomatic 13, cognitive 9): postgrest has cyclomatic complexity 13 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/facts-publish.mjs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fd809f7cca2b788d4d90bece4ebe338a66f63b47b4c71ee3261a472a615ba4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openFileAtPath (cyclomatic 12, cognitive 20): openFileAtPath has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9edf6fb9c3d5d8bc8d0bfaeac77a33c55225a205b9725dd0586fcc5cafea40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function listDrafts (cyclomatic 12, cognitive 20): listDrafts has cyclomatic complexity 12 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c892fa1082e877408ee26dee4bd50a806751cb70efb4741811a91e8fa89939"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function questionText (cyclomatic 12, cognitive 18): questionText has cyclomatic complexity 12 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6bbd78f0ccc1eb62e8a47bd4500db9b915c992a356f9053ade2ce03b61ae28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function step (cyclomatic 12, cognitive 17): step has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"628c47a6636c97e5a460ee6ecce7c3a8e9676b8c83e840618ef8dc6d256d80d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function step (cyclomatic 12, cognitive 17): step has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"8299f2c6ffed5cc5685ccde5117dbca2f748ed3f0083b5f5cc927e385bd4488f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function step (cyclomatic 12, cognitive 17): step has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-world.ts"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c9e6acc7ee266ab4f7e3c0fb01b2ecbd5e8b62ca16e7eb31449b698686b20a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readBoundedBody (cyclomatic 12, cognitive 17): readBoundedBody has cyclomatic complexity 12 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/bounded-body.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af5a3aadf8788907e09c00b4c1830cd726791e9e4cef67b4cc14ccfafb1a68e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function step (cyclomatic 12, cognitive 16): step has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/scene.js"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bd3b8557f794ed218bfbe8e6fe0e4870238b7ca64c20461c9eb97fe5a9b036"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fail (cyclomatic 12, cognitive 16): fail has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c1f074a3edd8f1c693a437cc6d6382ed17ae168d66a2bb31025c0d83432553"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 16): main has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-docs.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7908e5082d0b75ba6095ec83b887366c21aef92101c9efca8085e2cada12a2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendThreadGroup (cyclomatic 12, cognitive 14): appendThreadGroup has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e94c50bbb0cc09f09e0b5b7bed639c2470b7678f2bf022a6950c8583314c29"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseEnvText (cyclomatic 12, cognitive 14): parseEnvText has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"490d89e44bbf0c93e07965da02d10b3ca65dc6173601275defef053eb8257fd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 14): (anonymous) has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b058eb512799cadf0cc7c9b7210532577ce5cf53275938f83a28d772922e54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleProductTelemetry (cyclomatic 12, cognitive 14): handleProductTelemetry has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/product-telemetry/route.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bff7675b910de7cf8b8dc7c4f6163e334db2aba624ddf1b541546686920590"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function versionedMilestones (cyclomatic 12, cognitive 14): versionedMilestones has cyclomatic complexity 12 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/repo-activity-lib.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9208805c39b40851ff9c7291d89aad42ca70cabb672e07e24e4b94fbd560cd12"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderPeek (cyclomatic 12, cognitive 13): renderPeek has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"49acf084441d0c4497b1cf309280460b7840e3f009e5c7295df85aa388008c36"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function join (cyclomatic 12, cognitive 13): join has cyclomatic complexity 12 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-interest.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b9bca427f16afe9cd2e72cc0bb34a58ddf41bf5dfae392d3df0038a156d1f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateBridgeConfig (cyclomatic 12, cognitive 12): validateBridgeConfig has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/lib.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb05a02e1461f38467a63555b30b6d86792206ee03180a2fd14a44b50f8e63b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 12, cognitive 12): POST has cyclomatic complexity 12 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/login/route.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"586e6624dac54eac513be3c230b2410a806ddb2807ece19cb5cf7c5a69c21f9e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readPayloadItem (cyclomatic 12, cognitive 11): readPayloadItem has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e2449f7314a534ca23724d4f88f2418adbe68618dd46310d573c03bbeb3196"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function poll (cyclomatic 12, cognitive 11): poll has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/ui/pet.ts"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4909cadc8d5b6d9e8f98ce42e8dbcdfaa51dbe615c8ce4c128c2489087f316b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ComputerUsePage (cyclomatic 12, cognitive 11): ComputerUsePage has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/computer-use/page.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"3744e044acf5535094534dbb56b68ab5474e83f0eb275d4f73c931468e85d844"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateContributorIdentity (cyclomatic 12, cognitive 11): validateContributorIdentity has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/contributor-merch.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96c65173a0b958c1b7b608f54955ffed66106c5a2558b7eb37d1d6f320de0e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function middleware (cyclomatic 12, cognitive 11): middleware has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/middleware.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c28d28716829303cf60d01612d700df5cbff6f12e7f44a0850a3515a3ec81f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractFilePath (cyclomatic 12, cognitive 10): extractFilePath has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/transcript.ts"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ad0919636ef41dee4464a20622f55931e423a2436a2e6a533dfe148490286c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function answerQuestion (cyclomatic 12, cognitive 10): answerQuestion has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e4e00a68e0d4c7f1a8592581147d48eeeb9573b1e1cf3fa02dc3d7668865a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateSnapshot (cyclomatic 12, cognitive 10): validateSnapshot has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/github-action/review.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"946a68af5d92e095221029340006ff9ca93fa6175cd1f4233357c70afe63ae27"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadReviewed (cyclomatic 12, cognitive 10): loadReviewed has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/post/route.ts"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f96ce75b0dfb85a5ad8de9d620c36cffd3545c51296335ad4aab77899efd0f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isSearchSection (cyclomatic 12, cognitive 10): isSearchSection has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faba208ae0c03d8a2286e105bbc40ee0f59c3c0b80d09dea8a57eaad523a994"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function approveDigestRecord (cyclomatic 12, cognitive 10): approveDigestRecord has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a5c6e113178476da817c46f7f0fe01a6d0e298f7b967da4527d98ea20929f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadProjectPulse (cyclomatic 12, cognitive 10): loadProjectPulse has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/project-pulse.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fda0ed1153cb44204f95ac04f7c624b0a7a07fb3ff726e75fb31868a8e7a6ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergedPullFromSearchItem (cyclomatic 12, cognitive 10): mergedPullFromSearchItem has cyclomatic complexity 12 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/repo-activity-lib.mjs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d25a8ed31ace6fd4371b9a0b37a7435b2120e0ddd62970e0b2ca57ed233665"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getAction (cyclomatic 12, cognitive 9): getAction has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"40549a2a791c9007e3f89049b912e53a04269e215181a6f0b5bcfacda3e15fa5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Release (cyclomatic 12, cognitive 9): Release has cyclomatic complexity 12 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/changelog/page.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b537f332a3c5dc296fb3d433d4e2d6d43e471a8a6c7ca1f0588d904ed0f3ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function legacyThreadOwners (cyclomatic 11, cognitive 19): legacyThreadOwners has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe52e111e5ee3cca8a7bc462dfad30879ff278aa95fdb42851e9b23121d7df0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 19): (anonymous) has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/tests/pet-checkpoint.test.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"c340978f940a3e0688cc749b840f9bd05310114322473503cb7769406cef3d56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function addedLineSet (cyclomatic 11, cognitive 19): addedLineSet has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1470a8e8474fb3c2319c9d059e09465d182ce06785efcb74c40d3b1d0a084101"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matchCase (cyclomatic 11, cognitive 19): matchCase has cyclomatic complexity 11 and cognitive complexity 19; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a185ff0b4af456c9c2ad52dfe3b97a834f8900ec55fe635041b991f028c4bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 18): (anonymous) has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/test/inspect.test.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"584cd87b4d7823f08771d2cc1a6534f5f0671bef4f001c3317da5b478ac3e0b2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 11, cognitive 18): check has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/gt-site.mjs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f47721eac97ecb260cff506d05809ef090121f77d90516b33dea63cf8e339b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function searchMerged (cyclomatic 11, cognitive 18): searchMerged has cyclomatic complexity 11 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/sync-repo-stats.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"114039dd720b728d2e29fc89b59836785bbe393601b2bc93ca1e81713bc1b990"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readJsonSafe (cyclomatic 11, cognitive 16): readJsonSafe has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab5d40a6dfca6576c2d4640065fb421b8e15797408c666a4546fcdf3aff168f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseHunks (cyclomatic 11, cognitive 16): parseHunks has cyclomatic complexity 11 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"65853d4fa82fc0315d0c7774fe86aedc5652b3723fd935acf70f8ed03512447e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeFileDurable (cyclomatic 11, cognitive 15): writeFileDurable has cyclomatic complexity 11 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd29f0eef802a13102bbf679a9a499716d611b7c76d2ee365f4613354eb766f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function gh (cyclomatic 11, cognitive 14): gh has cyclomatic complexity 11 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/verify-release-inventory.test.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"487f24edb929873ceda3756e00d300cc0c47768b0b718db7cfb4b234d0de2820"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function rebuild (cyclomatic 11, cognitive 13): rebuild has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/ui/pet.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c03b321129157effe3882dda7f61650e93f5d39429c2e0cafc9cdb8975ff8c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 13): main has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/npm-wrapper-smoke.js"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d486be1886d4683d5d7a2a0c87f7085c008dc4574e9f05aaf375831f2ac2433e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function POST (cyclomatic 11, cognitive 13): POST has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/merch/route.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bcda791d7baae5848820a309ec05c8fcab2f104885c67f9b81ae2ad0d4c678"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function refreshReleaseDocs (cyclomatic 11, cognitive 13): refreshReleaseDocs has cyclomatic complexity 11 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/release-docs-lib.mjs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c022503ba2145046683ebed0999e71e86c0abcc19f5bc2e8cb088d86684a4485"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function report (cyclomatic 11, cognitive 12): report has cyclomatic complexity 11 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd7f010ebb4664bc0e4cd2437339bfbf39e99275307ec91d9683adf7db3cecf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recoverProjection (cyclomatic 11, cognitive 11): recoverProjection has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e22c61fbf188fec6fb5218116fff3f4c91169eeb38a26a610a951f6ab46afa9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openNewThreadDialog (cyclomatic 11, cognitive 11): openNewThreadDialog has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":2076}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdef14d4a4ac837078b7a5fc834ad5bfa0d19425725eaa64532fa481285e86e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6773efb6951d2342cf816e8b47a9d8c51545e874561fd90dcccc9816ebc861"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 11): (anonymous) has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/test/run.test.js"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3db9a70b8e1bd1dd9af90e69da9520725f477fd2d21f6258f8f322201bb17a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectFromBrowserSignals (cyclomatic 11, cognitive 11): detectFromBrowserSignals has cyclomatic complexity 11 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/install-platform.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"71373bf1d0e4e9db2427cf9bb1b2eb2f212bac72678b975a0042add26425921d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reset (cyclomatic 11, cognitive 10): reset has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/scene.js"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de1a1fcf891d59a13d8c889db0f9f3c208982fccb34fc245dfb1f000e89e302"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/admin/admin-client.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"22abfb056b9163555ac9948167ed0d20315017bcb8466c12e9d356afbf6580aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ContributorMerch (cyclomatic 11, cognitive 10): ContributorMerch has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/contributor-merch.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea3aa8dc12ca0bf9d857e0ff14c24ef73155a5c99983e6aa4f4ef14ec301ce2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKey (cyclomatic 11, cognitive 10): onKey has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/mobile-menu.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"dafb43f16264c21557b3a6031a84892224cb02878c64f3a0e092ed0ef0c02ab8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isModelFact (cyclomatic 11, cognitive 10): isModelFact has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfe007adc368f30de218f983df44fe617dbaa0c6da9a8da45e18194993a9275"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 10): (anonymous) has cyclomatic complexity 11 and cognitive complexity 10; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/server.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f523ac410b146c71f3109cb08d314e60d78c89e6c0779a142c17786311ea9b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/extension.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a72bf26369bb1cb9611239d01a658e95dc9ca82772a0c1bcd96ef82962a08d6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveFacts (cyclomatic 11, cognitive 9): resolveFacts has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/facts.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5ae2c78f814da956ce731113a393718938e62ea89d8e1ea0ff1dc3d9c95b3c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 9): (anonymous) has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/interest.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dd99f6b133a4790ba6fa338c29ad89b0e1e013de8b5eb7adae98e8f3ee8d67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function priceQuote (cyclomatic 11, cognitive 9): priceQuote has cyclomatic complexity 11 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/model.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"477d5e95e31ec06be11ac8e8eb5fa5ccdc7561f6811739ca863153ad97189a00"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/tui/src/tui/pet_watch/pet-native.js: 7107 lines of code: crates/tui/src/tui/pet_watch/pet-native.js has 7107 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6ed9b11755a197aaaf9287da9247426bc9f41846a156d03a03dbfcb71a6d3d3"}},{"ruleId":"R3","level":"warning","message":{"text":"pet/ios/Resources/pet-native.js: 7107 lines of code: pet/ios/Resources/pet-native.js has 7107 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d697f5898fb2ea365bed898bc0042ca47f6b4280be6e9c430b28e45e166cc3"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/app-server/src/runtime_web/app.mjs: 2283 lines of code: crates/app-server/src/runtime_web/app.mjs has 2283 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7abd895016dec558dc0aef360bab8784d2616cedf9b745afb324f01a588ee1e"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/weixin-bridge/src/index.mjs: 1391 lines of code: integrations/weixin-bridge/src/index.mjs has 1391 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a3e4f23104da01fdeb4828801365ad278daeb68a302a493200e4ca596b2abc"}},{"ruleId":"R3","level":"warning","message":{"text":"extensions/vscode/src/chat.ts: 1359 lines of code: extensions/vscode/src/chat.ts has 1359 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56cd9b00b89b7e2c8893dcd1b5e55090003d4c8f56f30646353be5c2145e93aa"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/telegram-bridge/src/index.mjs: 1136 lines of code: integrations/telegram-bridge/src/index.mjs has 1136 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71cebf85c909a8387cb680e77d7c30cb2daf9510e7ad8c1a0409e6c6385dd14"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/bridge-core/src/lib.mjs: 965 lines of code: integrations/bridge-core/src/lib.mjs has 965 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e15936aaaf3a3046b84f3dd306fb32bd83133338f8de7897f9b31ee347c597e3"}},{"ruleId":"R3","level":"warning","message":{"text":"web/lib/content/faq.tsx: 754 lines of code: web/lib/content/faq.tsx has 754 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content/faq.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06eae9802bfcdec09c24e9dc29799ae1eb1df7c18314e08a4f31d86ce21ffc9f"}},{"ruleId":"R3","level":"warning","message":{"text":"web/lib/community-agent.ts: 751 lines of code: web/lib/community-agent.ts has 751 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/community-agent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"caffa8ee7474b322c58ec9e5f17481d67155c0288a019d979fba21c7e6a8bf39"}},{"ruleId":"R3","level":"warning","message":{"text":"telemetry-ingest/src/schema.ts: 750 lines of code: telemetry-ingest/src/schema.ts has 750 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd01491e3e62a0c3c0af0355d3d08c23933fcaceea59d942b4968b582b718c7e"}},{"ruleId":"R3","level":"warning","message":{"text":"extensions/vscode/src/api.ts: 627 lines of code: extensions/vscode/src/api.ts has 627 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1097d65ad29d38de5c3970b9b5f68678b043ef203b9a8b255c7f9263e805d2f"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/wecom-bridge/src/index.mjs: 582 lines of code: integrations/wecom-bridge/src/index.mjs has 582 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"daff1bc91646039f39a9277fc1472dbb366350445a499eae73f9b2add99b4330"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/feishu-bridge/src/index.mjs: 577 lines of code: integrations/feishu-bridge/src/index.mjs has 577 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"798e7c717da275fedf394688030a9a4f52e62bdb8f5c1b70cbf00ce436968574"}},{"ruleId":"R3","level":"warning","message":{"text":"web/lib/i18n/dictionaries/index.ts: 556 lines of code: web/lib/i18n/dictionaries/index.ts has 556 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/i18n/dictionaries/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7b407994f781cb982a738bbd447246fb8b170eb83bfed2dad6cedf65c4d454"}},{"ruleId":"R3","level":"warning","message":{"text":"pet/src/core/codewhale.ts: 549 lines of code: pet/src/core/codewhale.ts has 549 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f339353654aa27b1f7a38e6ad1c80b2e96ab21db2a80d4025515b1845c2a3bc9"}},{"ruleId":"R3","level":"warning","message":{"text":"web/lib/telemetry/product-usage.ts: 537 lines of code: web/lib/telemetry/product-usage.ts has 537 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/telemetry/product-usage.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20d346bb9bf3b54401c275539608c8f22c3c8943409fde04adfbf1b0aaca3a3"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/telegram-bridge/src/lib.mjs: 511 lines of code: integrations/telegram-bridge/src/lib.mjs has 511 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67c0f3e63896241486f492ee792c88f881c51da26dfb55e0c701b22f907526b"}},{"ruleId":"R3","level":"warning","message":{"text":"crates/tui/src/integrations/dsh/scene.js: 458 lines of code: crates/tui/src/integrations/dsh/scene.js has 458 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/scene.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3464a239dc4257a8397a66fe23d07669c4196f68e779b2c04246500f902417c8"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/weixin-bridge/src/qr.mjs: 453 lines of code: integrations/weixin-bridge/src/qr.mjs has 453 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/qr.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26a868152e9457fe8cbf134d4fb9ec97d95ecce30a6d4a3bbe0bfb28fda9499"}},{"ruleId":"R3","level":"warning","message":{"text":"web/lib/docs-map.ts: 428 lines of code: web/lib/docs-map.ts has 428 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/docs-map.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ba48faf81cca1818d8644c3625926874ebe73923848b5ec65a95c0ec42624c"}},{"ruleId":"R3","level":"warning","message":{"text":"pet/src/core/pet-sim.ts: 411 lines of code: pet/src/core/pet-sim.ts has 411 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/pet-sim.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a44c569eeb831c7f53f7737a2048feb589b0147b1792143967521280a1d339"}},{"ruleId":"R3","level":"warning","message":{"text":"web/app/api/admin/post/route.ts: 409 lines of code: web/app/api/admin/post/route.ts has 409 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/post/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ab5bf64b0ede3b3aa9a755efd722cb8465245e266870556a3df7ecfcc9156c"}},{"ruleId":"R3","level":"warning","message":{"text":"integrations/weixin-bridge/src/lib.mjs: 406 lines of code: integrations/weixin-bridge/src/lib.mjs has 406 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/lib.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cb48a163b6d4fa7f86c5265eaa762cb80daffe4428b03a0ff8119b33e9e43f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d913a69ec396a90cf42eac5fc1dbc276d19d5d53b35d5c8bf9c99c92a8822cbf"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2810437c064c68f565eced129e43fa22e6a51f2bc71a5dc5811fc52f51a2a347"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/wecom-bridge/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2f8c0a5d62fe9167759fc47334f3594b01b112d5be3d20b66b9c026eee923e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/scene.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"438cd5bf4a1fe0bae7bbbeb1005a369dc24bddf41a945ece2c6cd3251abc0dff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/gt-site.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd41bc61ec18f93a121c9c5b7b80bf50f5c8b304a3820d058c6e22fda410102"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/extension.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af26abc54c41746c3b30514c1a39567d526ea16cb8e7ab1882a83d5ef56756b1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/render-released-capture.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5ab6caee12c9b3c26982a48d0d4b22aa9afa3c9f8fe9fb7deeaee558d73a1e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/changelog/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c8b386297917f96124b24274f84360890b8e5991fdaee17b780c34c128b9b2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-locales.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"146b41e7b95822ef8b377aace1b7b8fb9faa94c1119e112a53e0c746a8e2ebc7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/status.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3be915453654aa2d664bae84619d7baa0518b3e5a98402527830791281eb9af"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/admin/admin-client.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4a5465acd0c0faa97cca41f7614c930e6655f40e9bbdd6e91eeef03c49e2ad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-storefront.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf451a716b9b6abe53d4641003f60ccfb845e56f8e0d00977cf0bc328aaaceb7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/connection-banner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fc144d76fa5078ed3054fdf033e70cf6bc95e62330227b09d688015650fa7b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/compare-deployed-facts.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2900829e187780a6c510a6721a548ea5d1cc5cbfd11efb4d285a18766ec1a9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-docs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"720cfbc21c9534b1750ed36a412c05c75cfa6fc55d566ecde01842c96ee44f4a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/admin/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89435afc8ce8bb826c838a06ced0293c087ee17b2423a5731d98a49137ce6b16"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content/merch-storefront.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dccd92eac5af247f2e020dccd9fafb8c1643e6e6a8a76cf5ca4617fa86ecb95"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/stopship.workflow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b2bbfe99df7751e7342990eaa7a406a22ba9b9b6aecf826369f6a4bbe960e38"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/merch/sizing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f594a24624345c816957daeb8eb6d63d0cfa3b0fed53421342b3d5d6680d6d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/operate_best_of_n.workflow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacfa7315303d03b006d9e6579c47ea8777fbdf1bfcbff77381a3ddad73c0067"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/contributor-merch.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"483133f22b91505d466f0ac35927cd763e80f65f9ac367a2acba7ec384f64827"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/derive-facts.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f395e73648ba920033fcf9622c753efdd37c04ad4e8ca5496b1ce31f3e91033f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/whale-motion.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3262a7db8d757d024a3c1414d7195f1b5fe16019967d3eb31c1ab01094d569b7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/native-terminal-gallery.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d44e23b99a543d94bc9638692df0f83c904cff7b5881aa93489687609077c8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/changelog/[version]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cd819758fa03df62802ec7be23ccb6c39b423b2ada1126913d2d84613a3231"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/sync-repo-stats.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3229ad03ded868e80a42e91132896a2b2926247eb9f88c5e3557633c014a07f4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content/whale-states.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c42b7ab5def4762b391c6c998e89ed8d4f7399b1b1b2a0ae3af443b9d047f68"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-interest.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"204d347a471c589a9eeacf61748864bbbb14116498821e099fbea210855cc7b9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/runtime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c0dfdef584e015a843c2f7cb78511e15007229c3b1e3c11c8584bf45ae0513"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/secrets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dc7cd4967b7679b8889fae48b67f628688f9e093678cdbfaa42e560e5d5551"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/integrations/dsh/brand.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"445ff01487ce9307726b07d0cb105ea315ed2a24b9b60c047448181e551c7a8e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content/native-terminal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1921f0aeb5459f74c11d9a53d768c3fe2a1c6f4123aa27cd5d551031c96a84"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/build-pet.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6874c5249e6c65a58fe0bdea7f49d04399435cf5e2527ed87ab1079e0a86cd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"790b01a443533c2a59d5ee0126e43f963230e48d4465e2edba3523cb2f4876eb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-help.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2138f8c541aa2181e7124b4a480e87ffd454f0932aadd6636173b8088ae54eba"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/merch-size-guide.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"240a30e0697f26e29b2b395b7939158aac2a60ae31420347ca858303e698eb4a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/maintainer/link-report.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe13b3ec4d503e0e4b61a5b1a1e56310efd8b41640beb61c06d6bdc42e22ab2"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/operate_read_audit.workflow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96f3bf94036a485be75bbeae6aeec7cc5cbece2d8ec200a8a1c6ee5e8161f61"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content/merch-interest.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a959b488995e1ada2b49ea78c4d17ec7b87ea81231be4266eb730db7970aad"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/operate_staged_fix.workflow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"605215f7aafd4cb11e606cddd88a07c25b989098a37607a2c97eb6d09f4ca9ee"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-runtime-routes.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedcb9a8c41c733fda2ecc4dda36d5cf6fc41a978c52de38cb9fa415115f493e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/maintainer/check-allowlist.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0870180c69c67a20d2e464bfecdeeb0ca87d77ffa6b7e7cc4be25b2f2fd3e473"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/run-tape.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b847759c9b70e34e76358d8d52003a3419f75a7e955397f4230b64990fc1b4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/release-updates.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa5f521caae9cd29d8055b4d8956271f1105b7b68c3301bd53761b42eb80f02"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/getting-started-steps.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0c240dda618a57dd4869a8f3134b4f65801129294294225a913c63dced4bfd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/ratatui/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42b49e094ea5582d69b5bf87d22ebd0ae0d30882d7d247ec1403b9f2344b124"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/derive-changelog.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abfa179300a30d50c2b903d88e5252d27708fa54baaf228b0e7ee1a04f74584"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/issue_audit.workflow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dc90f4b1d4cd249587fc025932a017dde865d489a515aa85c52689fe0d6470"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"workflows/operate_parallel_scout.workflow.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3779fbd7f3099135080e437c33a95514917ef289b78d6b599007a13e70b65a9"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/content/merch-sizing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a43489fc0c4d59a339e1599ec137071a40f37ac30fe03f653d1de97c74b13c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/web.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34981615e35eb7f1a96f030ef342483c9447131646789543b4fe036ecaeac326"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/thinking-trace.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7553633d59e105356def80e34ddc5d8268fbab5c5033da5551789b85ad211de6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/logout/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d5b36c3b4fd80014a9f08c9b124282f0d9801e068a78ee5efb84a79584135f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/ratatui/quickstart.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4302a2396481ba51435eccd88480a110f17fa58d8784071221e7e188eb56ee60"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/worker.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e8062187b6ad4379a6473c9decbfabf7dfa44d3e470041a1f469d883d1d847"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-breadcrumb.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"216e2ea233002ab61a0b361d693c1747b892b7a0fa51e19051cfc61c8d51bac8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/goal-list.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bf8327e02661e3844dd9ceb36f58085942d2e3fd404d46e8c65f6bf5455ee4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/error.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33952a36956b180a576ce0c2f29a5b547ea21ae3b22dc550c302faa10b6525ba"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/release-truth.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fa752ff95a03cf386f890abad3cb20d2356606d4f44107588511aaaabe671e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/scripts/audit-dependencies.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d927353c08d71b074e9bf9545ec1f2dc5d64b0cfd05812b3db1e7cb261faabe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-language-region.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1afa2fff418ca9ee6ba228c6564d5c61232fc089ac101719cacc6cea90f1f1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/auth/callback/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c9092cd6b4aae9cab781e0417f147fa709e13e65e1b31b82bae1da7d5de75c"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/merch/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dadc88dca23b06e1a79d023ad93eb7c4406969f506e93c68134284e2739833"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/assets/dsh-creator/skills/cordis-plugin-development/templates/decoration/client.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c21b3292c74b15e2476326dedb26f95186dfd15dc6b6d49057a5c56518bfbe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/deepseek-tui/scripts/deprecation-notice.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"410693ef38ec82540f339be0a541654ce7973e1f9245ab41410d7f4e33e1066b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/admin/loading.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2770c7fd1f986bdb667e00c71f994223bd750720eafa1f2ce22944073266cc8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-kv-id.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d23e1d5165235c1e7de85ad869440580fab3d4f175a5c6c64e62b60836b0d5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/layout.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7206ef2fff55f00d168d593c4b4be82242f8084739cda93d377785487d1c2101"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-release-docs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"814e6c1dc81958cf1c6999baab8051e371953dc1973588a2dd2b04f180f34ee6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/opennext-config.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0b1f3e92221bdeae86ba3fc810c26da15c8bf9c5bdd39b9f9442130424db10"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/features.json/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"929d3137afa169c9d35942584eaaf464daeea0fbff4d27ed80d23a28c5d9e773"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/derive-release-docs.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc0d7b8fc940d34c0c7f50020aefacd64d24c0c57799f09bc10b461053bf256"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/[...rest]/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11177a6a91dcd8172f0193a605e403a26adccbb2f2b47a487cecb5a90abbc039"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/merch/contributor/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73eabc2941c030fe390fdeccbc3af15faab7dea09a56c9c6aeb6732f509bb90"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/merch/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b056d70bc62115109bec2b97956f95163f870f76783c52ab0401b21ca2cd4bce"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/releases/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da2100c811074467e8dd9ff6e6843b4fd5005ea3ecb343fb0e07341f6e22a99"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/derive-install.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2852720d0d2052ebdc675789e13384af3b9612a3006015d9ed0015576d29e8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/scripts/long-checkpoint.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bf6ed312d1c2d839f41859088549fe1080d6adfe89c3cacf0189577d36d14b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/use-country-label.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b2adef710ac2175d065a40689cd0e7cdee537e28bb57fb259a412d1b78a445"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/scripts/export-product-schema.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfb00809b7c9a98848359a2127a594723eb196120fbf1debfd735b76a5541a3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/redirect/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0025e827ff2e1d215bb305cd66245a9dfde77ab47332dad40968cae23b3452c4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/[locale]/legal/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f032525eebb9ce4ecfb20076d705187c896461787fd93f20241de8c27a25c9ed"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/admin/merch/interest/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9608d2c20a90a6c0a397d01b32a73efce68e6fca34a51336619620009f5527b4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/merch/interest/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69bc87eec056eb9316791b5ef19d4ada43ebcd5f9f67a461475b4eb2046b07d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/merch/checkout/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51671b476facf5698efbd3e90cae508da3dfb56c88cb95bbd167e971505fc860"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/merch/quote/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edf477491f377b717d29103fe67f89587dc0a23129741bbcd642e787f4119ea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/merch/status/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70a6f5a444dc7c74190dcc86738638038e7ab0f9d9ffbb99f3b5e147f8f5350"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/app/api/merch/webhook/route.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f2b9323e4adea2661ccc03080e946dd6b2e2a58940095322b8c33bedfa598a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/assets/dsh-creator/skills/cordis-plugin-development/templates/decoration/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fad7695c6f2d350a083ff060f25d36983072c83396db4d14b5ea61f8677e18e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7119 LoC): no import path from any entry point (302 application, 66 tooling, 224 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/ios/Resources/pet-native.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ec89e41f918c3e6889be76ad2d1e036af1b0796475c5824c0dbdc2eb8240ed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027EMPTY_FILTERS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/model.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab913403ef64d2f082cdee4f94ac8d5364df431f22b82f18d3236462c852dd83"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027eventMatches\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/model.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0746821d03e42f561ecc81958f8ef93b6c18f97a832f2ef6fe19abffcf594f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027durationOf\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/model.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2494eb1b1c161cb7a8ec9e617ce9694b291683602a5954c1d0cfa04f1921e65a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027formatTime\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/model.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4193b0a1f2a3d4c5ef169b0f1c2b156170ea56387b739e24058688430021a75"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027intensity\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/signal.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf7ab04e2665f480335050c3f55f2337b5f30b07860fc0f0a239d6f43a14e1c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027totals\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/signal.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c62242435a2cc9ff46abf66afb2cc4bcb085dd40031a9c81f1e370f9f72872b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027onsetSeries\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/signal.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ffe680494d984710bd6d68691dfde1949bbdccf8c12580f0e506fad1374fbe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027autocorrelation\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/signal.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf3fb66dc6394af0a4aac5e72b23169a25e75057019f573bbe582d9c8643a35"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027periodogram\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/signal.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3434d9debceca20c4ea694ea89b28c94aff0bfa997fc5da062ef00d241334bca"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027unionDuration\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/signal.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c4882b27e6196b0f51be4c33606cf40852fafe6689e368ab62d00ca762026a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_PANIC_SITE_LEN\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9cf997df72a61ebc4c19a6b5b2af1f0a4ae9d4c7f851eb4d3d1c8a12c6905d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MAX_PROVIDERS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"5951e4589f89f9a356a1e4e73f091889a295c06b8da64287613e4ab5ef9e1e64"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027docsCapabilityContext\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/docs-release.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5648bde05b937b85f5bf7cddfa710b242e8674300a7f04ffdeae3498c4dbbb"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027publishedDocUrl\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/docs-release.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c4e716427c98be29b50856c124ec2cce135948462042fc225a532dd4ca0d5d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027ProjectDict\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/i18n/dictionaries/types.ts"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c64896571ea63bf5a7bbd43a7f93978d1ca29914dc13aba9efafb7c0a8eb98"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027MACHINE_DRAFT_LOCALES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/i18n/review-state.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bec7c65c787acc3d1323c7c8450e0511ffea0559a79ec08a5c73a913f93a13b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027SITE_SECURITY_EMAIL\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/page-meta.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c8b0eb6d881f0c4e9c9fa0d719460914ee749ed5f857c8e1505b23a741cf8e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RECIPE_SOURCE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/ratatui/recipes.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f02cd506a8c454e162676ef739ca192c28258ffaa6e0619b427c86d08373981"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027loadWhaleReference\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/whale-motion.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b5bd2f4267da95942e408959eb23d6f89d895c50ca7aca67afbfef1aeb992f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027onWhaleCue\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/whale-motion.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ed73f073e3e17bd4724b5039b98134dd2395f8a786f4da0c98a3ad486fa316"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027WHALE_PERFORMANCE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/whale-motion.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"778f419066178b105d9ddb3fc8fd1522fa0d8bc920dc584a13fd0498d608a9c7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RELEASES_CREDITED\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/repo-activity-lib.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ce81b15ddcf03a199361c84d541acfecab5634b6322cf47ef39aa5b75b4f3c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027READ_DEADLINE_MS\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/repo-activity-lib.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b8c539ec07c6f2d4bf89614b73aab5b6e7ed4bd0771c63cd9506490ce24c51"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027READ_MAX_BYTES\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/repo-activity-lib.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"af80d96fe604d19e98201ba8831cd0d20e09dcf7da0ff9d89366bb1f3bfbcfb9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027extensionContext\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/chat.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d90cee325b18f8e7788f8ea900845d5f3806e91ec0f73807cd3701547c137c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027requiredEnv\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"30040ec2f5df2fc0a51936ebd1406aeb29c7566f0a3d3f0a69ef56203e55167e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027loadChecksums\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f8dd5bc790f31c4d61e6eaa3acd63c6fcf22d979ad57a99a0373d458db92c8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027RootUndefinedIsRejected\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/runtime-sdk/test/runtime-wire.types.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a980e1d912cb5c8cde760fdd60dc0d2f4752d76944107f961bfb42e3635a8411"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027ArrayUndefinedIsRejected\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/runtime-sdk/test/runtime-wire.types.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2842fb251a08f8158cad750336d5716dab7c531101df9cda49b03426dd7875c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027PublishedSpecRequiresDefault\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/runtime-sdk/test/runtime-wire.types.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3ba3b7a99b0664151d2a15a5f5ca729dee38307e543f77565b7213914ec3d5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027gitBuffer\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b317de672f5ef48bfd2c1cd345d147241435dbb67033072b3964341952f82f2"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027nullSeparated\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/review-eval.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf8d9f268c678262cfb5f059983869a5e6e20a0b9fc83251dc69adbbde486c8"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027react\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/assets/dsh-creator/skills/cordis-plugin-development/templates/decoration/client.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cef7f017f7b8b4baecb0f4bbb9528fd039892de82930aecf95a1019c057bbf5"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027braces\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/dependency-security.test.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"95edce4f23ff0e62299f971440eeb96bf61cf1950ba06fbd919d80a566db952c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027gt\u0027: Declared in web/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"51fc914cd22840b7ccfd01a79063a7aa4398f8fd227aa612a3ee846aebcbf905"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): pet/src/core/evidence.ts \u2192 pet/src/core/model.ts \u2192 pet/src/core/evidence.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/evidence.ts"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0664cbd0cd0bb1e0110988dab0d6a003a4ab89229c187ac1fa55563ba73cbb"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository starts an HTTP server and nothing in its Rust source or committed \u0060Rocket.toml\u0060 secures the transport: no TLS served (actix-web \u0060bind_rustls\u0060/\u0060bind_openssl\u0060, axum-server \u0060bind_rustls\u0060 with a \u0060RustlsConfig\u0060, tonic \u0060ServerTlsConfig\u0060, a \u0060TlsAcceptor\u0060, Rocket\u0027s \u0060[default.tls]\u0060), no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (crates/tui/src/tui/pet_watch/owner.rs:489)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"Security headers incomplete: Set: Content-Security-Policy, Permissions-Policy, Referrer-Policy, X-Content-Type-Options. Missing: Strict-Transport-Security, X-Frame-Options \u2014 the four headers that carry the points of this card\u0027s security-headers term (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options), 0.5 each.(\u22121.0 on this card.) The server: \u0060axum::serve(\u0060 (crates/tui/src/tui/pet_watch/owner.rs:489)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e9931804dbad8b1657857c9b88c05b8faeff182b6e2bb88641bd59bac687876e"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/engine/extension-host/src/dsh/upstream/group/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/upstream/group/package.json"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9b125c869fa5d22bc0d091a009d10391233ba3688530b405dddf081b9ea7bb"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/engine/extension-host/src/dsh/upstream/include/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/upstream/include/package.json"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2331eaa6a74eccd944ef5ba49ed6a828015f18c0c59b1226cc9b393fc6c5fcc"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: crates/engine/extension-host/src/dsh/upstream/loader/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/upstream/loader/package.json"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef3e9fdb0bf10a562850c1d6352f9b5f44c7a64468ddd93df336c13d657dffd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(events) || events.length \u003E 64\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-native.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5260101a7cf8c58de1b71f9490d6dfc0ee014e0a902c7e0b39b2a211aa38c663"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(v) || v.length !== 3 || v[0] !== this.p[i].hx || v[1] !== this.p[i].hy || v[2] !== this.p[i].s\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-sim.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44f05080070624818bde60907875c7f7a2f406ef1c74571257f0f43773a8539"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(at) || at \u003C this.lastTime || at \u003E pet_sim_js_1.PET_MAX_SECONDS * 1000\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1910}}}],"partialFingerprints":{"codehealthFindingId/v1":"b073a17436cf034e43778968c8e89281501bbe25b6ee0999def3dc4c1531c517"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(dt) || dt \u003C 0 || dt \u003E 10\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2d9f7ffd10b03905c1ce502075c28518d970cbf0099e21d12119ccd5610694"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(duration) || duration \u003C 0\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/signal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a656d97b3ddedd2340a1abc3db3ea6bf83d511ddcc260e9ee418a7b297ff48c1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(durationMs) || durationMs \u003C 0\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b4490df449dac246213c20bd789ec2ed85175d065a40b614299b0a0a18bc0c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(e.startTime) || !Number.isFinite(e.endTime) || e.startTime \u003C 0 || e.endTime \u003C e.startTime\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/signal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc176a9d032be883da13804691f77c9ac8251c865447b7b18284682df9836292"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(e.timeMs) || e.timeMs \u003C 0 || i \u003E 0 \u0026\u0026 e.timeMs \u003C this.interactionLog[i - 1].timeMs || ![\u0027attention\u0027, \u0027food\u0027].includes(e.kin\u2026\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"48a41bedbd9357a621f95da263bc7e1c353c7580366e471d1de7c532d9cf905e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(n) || n \u003C 0 || n \u003E 100_000_000\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"40aa0bc443c0f8f66046b795ee2ad4e93af28c0768aafd5e225f710ee5a22295"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(start) || !Number.isFinite(end) || end \u003C start || limit \u003C= 0\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/signal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf40fc8d70bb264e18a28752e2ea1b5d38503387674179f2e35a8df02a1f83f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(timeMs) || target \u003C this.engineTick || target - this.engineTick \u003E 300\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-native.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc762d3edf463f662bdddd8061125f7e7812fb9bb2027631a01bd7e424409c7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isFinite(turnTimeoutMs) || turnTimeoutMs \u003C 1000\u0060 appears character-identically in 2 files \u2014 integrations/feishu-bridge/src/lib.mjs, integrations/telegram-bridge/src/lib.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1eae8a1adbbdb5816d11c0b39e6a95fd278aa35ffd23fac3882b528ad563841"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(maxBins) || maxBins \u003C 16 || maxBins \u003E 1_048_576\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/signal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1364}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa425f6058bcda4c3ce899310405cad47edcff4bef653a9b6e0cdaa0e4709d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(runtimePort) || runtimePort \u003C= 0 || runtimePort \u003E 65535\u0060 appears character-identically in 2 files \u2014 integrations/feishu-bridge/src/lib.mjs, integrations/telegram-bridge/src/lib.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b24863c0dd34cb3e8298715e38f3c74ebdc76e97b13fda8248f85766fc98901"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isInteger(sampleRate) || sampleRate \u003C 8000 || sampleRate \u003E 96000 || !Number.isSafeInteger(startSample) || startSample \u003C 0 || !Number\u2026\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-audio.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e75b5426ab0a7e28587c5b43a33bfec920864ded63f9f79ded45730aa67729"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(event.index) || event.index \u003C 0\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1935}}}],"partialFingerprints":{"codehealthFindingId/v1":"760d9620d77053166e5a592f2721c840a90f559afe25a1dd79ec6ca3f8748cf8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(firstSequence) || firstSequence \u003C 0\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"465f6e1b655de0c05d0f1144f1df24eb47a9e2fcf122f2da2b6cc1744f0c06a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(index) || index \u003C 0\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d843aca43ae5b4738c1f1dedb2d85498e635340ef5dc3e50f429fa2e1201ca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(n) || n \u003C 0 || n \u003E 250_000\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aba6696170fdba73399c95572a7f1c213138445668947a49c4f6e410345b6de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Number.isSafeInteger(state) || state \u003C 0 || state \u003E 0xffffffff\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-sim.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"740b0ccd459fa13134d2e48ee87c169e8ec07033f6ac4ab32a09bcc22ffa05fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060![\u0027attention\u0027, \u0027food\u0027].includes(kind) || !Number.isFinite(x) || !Number.isFinite(y) || Math.abs(x) \u003E 1 || Math.abs(y) \u003E 1\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d81ccb3ac30aa47977b040825c0bdecfbc037c25d589a769a61cd6b4475f57"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060![v.start, v.duration, v.frequency, v.gain, v.pan].every(Number.isFinite) || v.start \u003C 0 || v.duration \u003C= 0 || v.duration \u003E 10 || v.frequenc\u2026\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-audio.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"606cbaaa3e955ea8a744e3cc9e5f173d06185501d4a08d430673b7acc6b04cdd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!busy \u0026\u0026 !addressed \u0026\u0026 time - this.lastActivity \u003E= 75\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d16a8f9ec31b6e9c9a16e985677c00f7e66ac5d169e81ce89cdc3e23c128a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!c.frame.food || !range(c.frame.food.x, -1, 1) || !range(c.frame.food.y, -1, 1.21) || !range(c.frame.food.life, 0, 1)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f7b3e79ac700e84d40b6252ebed66e77b4d37b9d5302383fcda490aab81399"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!config.allowlist.length \u0026\u0026 !config.allowUnlisted\u0060 appears character-identically in 4 files \u2014 integrations/feishu-bridge/src/index.mjs, integrations/telegram-bridge/src/index.mjs, integrations/wecom-bridge/src/index.mjs, integrations/weixin-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f89ab6e2d07912d11749a1d00aba35d139b1eb15b22f0b54c9f3868c04fad180"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!definition || typeof definition !== \u0027object\u0027\u0060 appears character-identically in 2 files \u2014 crates/engine/extension-host/src/root.ts, crates/engine/extension-host/src/shims/commands.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/root.ts"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e1956a947ca0a165a7fb7a2172a8767c9b633b7a1df7364279227957c9a90b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!integer(c.historyStart, 0, c.tick) || typeof c.hasTelemetry !== \u0027boolean\u0027\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"336bae0516f6b614342e954c41fdbc26fe39bb525f46214a97304e06ab09e553"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!isContainer(e) \u0026\u0026 !(e.category === \u0027orchestration\u0027 \u0026\u0026 parents.has(e.id))\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcbe801f718ebfc8fb7cf22c9a54a8c2cb023d3285e3ee6996c7e5336c62e32"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!m || typeof m.id !== \u0027string\u0027 || !m.id || m.id.length \u003E 4096 || !integer(m.slot, 0, 5) || !range(m.phase, 0, Math.PI * 2) || typeof m.prese\u2026\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1ed751db316d75a792531cd74a6fb90ec0ff1b7f59bcb8bd7f3d9de6707a02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!metadata.isFile() || metadata.isSymbolicLink()\u0060 appears character-identically in 2 files \u2014 npm/codewhale/scripts/install.js, scripts/release/assemble-release-assets.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"420c8f3c36fb9f68eca6debe3360538769680eabb7b9207efcc4e4ffed8fba4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!n || channel.sustained || [\u0027human\u0027, \u0027error\u0027].includes(channel.key)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-audio.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d39cccb9f50b3b53979d60e48445720253165f092f7b109abee9c45a3be9ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || typeof parsed !== \u0022object\u0022 || Array.isArray(parsed)\u0060 appears character-identically in 2 files \u2014 extensions/vscode/src/transcript.ts, web/scripts/gt-site.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/transcript.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e783da15e54eab870f11e6f40733b08d07422f5e1292be7f4c5215934635d5c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!r || ![1, 2].includes(r.petReplayVersion) || !Array.isArray(r.tape) || !Array.isArray(r.interactions)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e361b643379583216709c22a7adee2284285c25079a10c8ea03353aa6efbb95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!release || !Array.isArray(release.assets)\u0060 appears character-identically in 2 files \u2014 scripts/release/ensure-release-assets-absent.js, scripts/release/verify-release-inventory.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/ensure-release-assets-absent.js"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"865cdc55687eebe1f26e98041375dfbae9e04d5a785aad32f3e4d27a8b12cf1b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!this.segmented \u0026\u0026 this.tapeLog.length \u003C 1024 \u0026\u0026 this.interactionLog.length \u003C 4096 || this.bucketIndex \u003E= 1024 || this.interactionIndex \u003E= 4\u2026\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f21b21897725079638921c4a9d92465d0753bad022c4348bafeee9759f90ddc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!turn?.id || turn.thread_id !== pending.threadId\u0060 appears character-identically in 2 files \u2014 integrations/bridge-core/src/lib.mjs, integrations/weixin-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/bridge-core/src/lib.mjs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4f11e7e6f9544d6e50d2f4e1b3609036f0c499d5931b61ba10267bf031f9ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!v || typeof v.id !== \u0027string\u0027 || v.id.length \u003E 256\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"c774e7a2198bf20ae3fc053478eaede69fd4735c06ff855550420b5d373e9421"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0022object\u0022 || Array.isArray(value)\u0060 appears character-identically in 3 files \u2014 web/components/docs-search.tsx, web/lib/merch/interest.ts, web/scripts/gt-site.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/docs-search.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c3aed6f4f60fba1e8d8af3046de4f3c80b17217b81228aa13dac5526a464a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!value || typeof value !== \u0027object\u0027 || Array.isArray(value)\u0060 appears character-identically in 6 files \u2014 crates/engine/extension-host/src/builtin/shared/github-adapter.ts, crates/engine/extension-host/src/builtin/shared/stock-adapters.ts, crates/engine/extension-host/src/dsh/persona.ts, crates/tui/src/tui/pet_watch/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/builtin/shared/github-adapter.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d40ab3b085604e5e2c392e054acda624ba669dd0ea5a337ff2219ea0106678"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!world.segmented || world.tick \u003C first.tick || r.checkpoint \u0026\u0026 r.checkpoint.historyStart !== first.tick\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"845c12f32a86aaff172c0d28990637e5bd209dbccc290244a29c15ad7ab1c2a0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(!category || e.category === category) \u0026\u0026 e.startTime \u003E= start \u0026\u0026 e.startTime \u003C end\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/signal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1892d1d469a97b71d1ca81b888d3043f66478648003124ab065131b41377b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number(a.group === \u0027agent\u0027) - Number(b.group === \u0027agent\u0027) || b.startedAtMs - a.startedAtMs || a.key.localeCompare(b.key)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"c645f3a7a0516c536e168b7989fc51721db20378f47a8ba9b4338bab64bde267"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isFinite(n) \u0026\u0026 n \u003E= low \u0026\u0026 n \u003C= high\u0060 appears character-identically in 4 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-sim.ts, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"f458c43dd6ccb1d2541e6035cf97bea24674625d9c9d5badc79c11b6cb003665"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isFinite(time) \u0026\u0026 new Date(time).toISOString().slice(0, 19) === value.slice(0, 19)\u0060 appears character-identically in 2 files \u2014 web/lib/cloud-facts.ts, web/scripts/facts-publish.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d703a3920b8ce3adfb17ddb6ec5b7fbe3041baf57a735ad3d6e2ae9352ac8cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isInteger(n) \u0026\u0026 n \u003E= 0 \u0026\u0026 n \u003C exports.CHANNELS.length\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"952daa2ccb1f00d5d81cfb537a9b26a7d49394a19bb556dd0c6b6959a51397ff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(n) \u0026\u0026 n \u003E= -1 \u0026\u0026 n \u003C= pet_sim_js_1.PET_MAX_SECONDS * 2.5\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2e0a3736bc151b91cea5c69a84ec97056735ee7a39ea29e112fa613fcb13b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(n) \u0026\u0026 n \u003E= 1 \u0026\u0026 n \u003C= 512\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-native.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"949a5b7701146742d27c3b03d44547bd9d1f03cb1d1022be01cd05fdd5745865"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Number.isSafeInteger(n) \u0026\u0026 range(n, low, high)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"496ceb0f986985334ca5c63698414cd869e4861053396161a9262032bc08cbf0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.activeSpans.length === 0 \u0026\u0026 !!a.failedToolAge\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/dot-field.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"27357fc2b67640d7fb0836b7d9c8f24737c0599ca1e66994b06250fcc823ace6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.startTime - b.startTime || a.id.localeCompare(b.id)\u0060 appears character-identically in 4 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/ingest.ts, pet/src/core/signal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a3608fd280ae756af9ef9c346c03adef1c4645cc313df88e7ebacf6f85b12f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.startTime - b.startTime || order(a.id, b.id)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2296208e009ea359e8018e0696a715ae5a0b66555150181b15dd3f44080d4b52"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activeMs[c] \u003E activeMs[dominant] || activeMs[c] === activeMs[dominant] \u0026\u0026 onsets[c] \u003E onsets[dominant]\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a07c214c327364366f6ca3f5165c66b6b8ac291999b8895be03bbb1d12054a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activity.actionId || activity.activityKind || \u0027whale\u0027\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/dot-field.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2160}}}],"partialFingerprints":{"codehealthFindingId/v1":"82dd202c26edc10dc092ac7fa5e3dc038071d98273abb8063ad1747ddfaad77a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activity.freshness === \u0027fresh\u0027 \u0026\u0026 activity.observed\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/dot-field.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"af09d1419b4307af31a4979106f694511b5a19995aaa1ee94f499b1384d287f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activity.observed \u0026\u0026 activity.freshness === \u0027fresh\u0027\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-native.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e197de48388f71691dddcfe7e2a0445e1ea63cbec06669c469d8429ebadf62"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060address \u0026\u0026 (!this.lastAddress || fresh \u0026\u0026 t.onsets[11] \u003E 0)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"8beed48e8fc425eeda91ab8f6f91a70ed4d4bc1f0fc5089ddebe1194327a62bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060at \u003E= 0 \u0026\u0026 this.tapeLog[at].sequence === sequence\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d5d4e01be17995d4374839da14c6bde82bebc0819f3de6b16c3399c4aaf223"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060at \u003E= span.startedAtMs \u0026\u0026 at - span.event.endTime \u003C= exports.ENGINE_OWNER_STALE_MS\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd559c4897d1b67b370de256a37ed7b5343d4f532fab5bb75215def8a6f43d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060authoritativePresence === \u0027done\u0027 \u0026\u0026 terminalFresh \u0026\u0026 this.turnOutcome === \u0027completed\u0027 \u0026\u0026 this.turnId\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1799}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af15ee0f6d84eda35688f35b49fcb23d6dd072d02dd9f81763b1fae9271e583"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate \u0026\u0026 c.frame.timeMs \u003C candidate.simTimeMs \u002B candidate.durationMs\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"631bd0ab788bef964cb3a023fec6b5b56cdbcb99741c95bd99d4b741426e7186"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate \u0026\u0026 timeMs \u003C candidate.simTimeMs \u002B candidate.durationMs\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdcd8d3098dbeba8bbb0e0ed34b1c31a646d5cf6ed519a97011e47bd4e1ba99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060channel.sustained \u0026\u0026 frame.behaviour !== \u0027doze\u0027\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-audio.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c5098441d8e961f559ea723a85c73c21ce5904094915f1a2ad5fe29a76f2e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060committed || this.origin !== previous || this.tick \u003C c.tick\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50649ef88b810e53963a5bbfa124c9af4a2e812489a318207c79668e16e9ea1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060completed \u0026\u0026 this.addOnce(this.completedSpans, spanId, 4096)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2012}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdda7b291d7e323745dad004ae2da15c91bb2545fe3810d4df39774d1643c0b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060count - firstSequence \u003E 216_000 || count \u003E pet_sim_js_1.PET_MAX_SECONDS * 2.5\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"386a3f2ac207c3f482660ae7d5489dc25d262b8ca2a20ea69d482892c49650e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e \u0026\u0026 (e.endTime \u003E start || e.startTime === e.endTime \u0026\u0026 e.startTime \u003E= start)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/signal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"899bdfd1c6d331db6116107e31b39b8a8208ad0b554ca5332d469388c8dc9490"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.agentId \u0026\u0026 ![\u0027unknown\u0027, \u0027unattributed\u0027].includes(e.agentId)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d366c96ec952c643ed3c2d8b3fc5bc79437f52e9546076733545a968d15fe8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.attributes[\u0027whalesong.container\u0027] === true || e.attributes[\u0027codewhale.container\u0027] === true\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"649c9e744dcbf22c00a11c86d82e9959c144c4dd30fcd0e8ff63509f1da0ba39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.category === \u0027error\u0027 || e.status === \u0027error\u0027\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6052a6c38be0b75dc1f41cb2ec2e653b0e561dfa57f2442ebf5187267003f509"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.endTime \u003E e.startTime \u0026\u0026 e.endTime \u003E start \u0026\u0026 e.startTime \u003C end\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/signal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"353cb1fb6cf3a63fd416e047b88f1284950edc05150fdedcc35d03e66f4c022b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.schemaVersion !== 1 || !e.id || !e.traceId || !model_js_1.CATEGORIES.includes(e.category) || !Number.isFinite(e.startTime) || !Number.isFi\u2026\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cbe42610d62a3c556559886a10608e5fba65f5c1f979ccc0db8eb926eff691"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.status === \u0027pending\u0027 || e.status === \u0027running\u0027 || e.attributes[\u0027whalesong.waiting\u0027] === true\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"58db3c97edda1020b03394cec1a16e47cf09d87e3cbf9d7dcbc756237e757ebf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060envFirst(process.env, \u0022CODEWHALE_MODE\u0022, \u0022DEEPSEEK_MODE\u0022) || \u0022agent\u0022\u0060 appears character-identically in 2 files \u2014 integrations/telegram-bridge/src/index.mjs, integrations/weixin-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2a385c82ad54af588a016ff2b2af9e2b67a260977688cabec5948ee04b1e5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060envFirst(process.env, \u0022CODEWHALE_MODEL\u0022, \u0022DEEPSEEK_MODEL\u0022) || \u0022auto\u0022\u0060 appears character-identically in 2 files \u2014 integrations/telegram-bridge/src/index.mjs, integrations/weixin-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cf7dcc17fbdde1e3d0822e65db0105384ef1bfd7d241bd46e32a9778588bde"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060envFirst(process.env, \u0022CODEWHALE_RUNTIME_URL\u0022, \u0022DEEPSEEK_RUNTIME_URL\u0022) || \u0022http://127.0.0.1:7878\u0022\u0060 appears character-identically in 2 files \u2014 integrations/telegram-bridge/src/index.mjs, integrations/weixin-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2fbe7ef8b1edaa1487dd7f4ef868f3281d380d441da7c403d4dfe18472e1cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060envFirst(process.env, \u0022CODEWHALE_WORKSPACE\u0022, \u0022DEEPSEEK_WORKSPACE\u0022) || process.cwd()\u0060 appears character-identically in 2 files \u2014 integrations/telegram-bridge/src/index.mjs, integrations/weixin-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"848839efb4928a3da589d3f9a1154d08ee5e31151b70de1c313afdd31fc374df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event === \u0027UserPromptSubmit\u0027 || event === \u0027Stop\u0027\u0060 appears character-identically in 2 files \u2014 crates/engine/extension-host/src/dsh/upstream/hooks/hooks-claude-code/src/config.ts, crates/engine/extension-host/src/dsh/upstream/hooks/hooks-codex/src/config.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/upstream/hooks/hooks-claude-code/src/config.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a960a371dfd6cdf4ed9ea2fefd44d2b91f2826233588a2bc710a528de7b026"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.startTime \u003C end \u0026\u0026 event.endTime \u003E= end - 12_400\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d58b23627cd7d507d15ef936dd10d6f62386e053de89ee6cb005d87ae1e3d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event[key] !== undefined \u0026\u0026 typeof event[key] !== \u0027string\u0027\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd702cecfbfcd50e9257c85ed34a0e439fe7408ffcf21e1c06d0a0bb4e5c4112"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expired \u003C recent.length \u0026\u0026 recent[expired].startTime \u003C end - 12_000\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d86eb49e4319dab351f7fe1e6a6b0457624c0f71c6ee9ad554180137598848"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expressionVersion !== 1 \u0026\u0026 expressionVersion !== 2\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-sim.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"9614539bb7d6f78595c22ed685c87057962541f8818e39adf23fc41e9572d166"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060frame.behaviour === \u0027doze\u0027 \u0026\u0026 window % 5 === 0\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-audio.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"4634a0552c2c6f32c4fa1b894c513a5f3dc70be68c2b5f1176a06faff429e829"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060frame.needs === \u0027call\u0027 \u0026\u0026 window % 10 === 0\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-audio.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1658}}}],"partialFingerprints":{"codehealthFindingId/v1":"2929de5b97b03baab644471bf49f11cd547787dd1417b1ab34ad6f69f1aa5e0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060frame.state.channel === \u0027human\u0027 \u0026\u0026 frame.state.attention \u003E .5\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-audio.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"a299f5646b17f6519363ba94e92e35c6371acce362aa1cf3168f15ae5fc0e5f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060frame.state.observed \u003C .92 \u0026\u0026 i % 2 === 1\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-native.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd1c7f8c0dd1e90bd6d9c7a8391e57ba7ce4b5bb3960fdf9be75eded04f0643"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fresh \u0026\u0026 !activity.activeSpans.length \u0026\u0026 !!activity.failedToolAge\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/dot-field.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfd8d5e0ea5f045536d439d3da3ff0b3743ac8d8e5dec2d8ba0ccc80d928be0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fresh \u0026\u0026 authoritativePresence !== \u0027needs_you\u0027 \u0026\u0026 authoritativePresence !== \u0027done\u0027 \u0026\u0026 authoritativePresence !== \u0027idle\u0027\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"134ce293140b2280f941436b07254a1c376d4a12d6e4a71ef42ec48541cb055e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fresh \u0026\u0026 this.lastFailedTool \u0026\u0026 at \u003E= this.lastFailedTool.failedAtMs \u0026\u0026 at - this.lastFailedTool.failedAtMs \u003C= exports.ENGINE_OWNER_STALE_MS\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd6b9cfeb47aa1d57a87380e34a1b0a1e56a641c27a87a2f333f0afa88056f0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fresh \u0026\u0026 this.terminalAt !== undefined \u0026\u0026 at \u003E= this.terminalAt \u0026\u0026 at - this.terminalAt \u003C= exports.ENGINE_OWNER_STALE_MS\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"daaaede210d2439874cad0d488792023035b52d35d1bed8f6181de2ea9292680"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003E 0 \u0026\u0026 b.sequence \u003C= this.tape[i - 1].sequence\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0973c9b856d04f04d1e069c057a889ab236f9c7e50ba6d6ba12f2c6ff7cdf99"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060i \u003E c.bucketIndex \u0026\u0026 b.simTimeMs \u003C= c.frame.timeMs \u002B 1e-7 \u0026\u0026 (b.observed !== 0 || b.channel !== \u0027other\u0027 || b.errors || b.waiting || b.agentI\u2026\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"73de3be016074f517b7a74e52ca6eef59b91421c7a7d0f7a0e98b91077c2c06a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key === \u0027communication\u0027 \u0026\u0026 q.pod % 2 === 1\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-sim.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70159eaca1cdb408da3d12e10134ff88f7d0f09406d9f33b0f6dcb436f6ad18"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key === \u0027network\u0027 || key === \u0027communication\u0027\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-sim.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"0495bf3fac77d812cb3add33c262a5ab0a3bd27e877eab78e01b9e18288ab805"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060l.status === \u0022shipped\u0022 || l.status === \u0022partial\u0022\u0060 appears character-identically in 2 files \u2014 web/components/locale-switcher.tsx, web/lib/i18n/config.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/components/locale-switcher.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b0ac7a18848ca62ed5da9825d2549f75b60cffa2197eaf00e6fd4d2a6b91a00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left \u003E= bound || this.maxEnd[node] \u003C start || found.length \u003E= limit\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/signal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70b2079dd77af1fc35ed7be67c244c6f8b45506496b73d1f14dd61758c41c1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060next \u003C events.length \u0026\u0026 events[next].startTime \u003C end\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"986ef856c6675f413bdfee1bfe54e8295e8efbf66675e2bdaca86eab9708b92c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060next.bodyStyle !== this.expressionOptions.bodyStyle || next.textLanguage !== this.expressionOptions.textLanguage\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-native.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ccfc66cbcf57cb2972219024da357e685321472974b5d215fc54109b0f8908"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nextFailure \u003C failures.length \u0026\u0026 failures[nextFailure] \u003C end\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"db474c13d18531dad7c3fb0343cf5811a66a0049b467bf58d6a69542d26042d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060nextFailure \u003C failures.length \u0026\u0026 failures[nextFailure] \u003C start\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"8048bc7e4cd655404b0df499ab92759ebadfd32fc4226693b1c739f780cf29c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options.group \u0026\u0026 Array.isArray(options.config)\u0060 appears character-identically in 3 files \u2014 crates/engine/extension-host/src/dsh/upstream/include/src/index.ts, crates/engine/extension-host/src/dsh/upstream/include/src/journal.ts, crates/engine/extension-host/src/dsh/upstream/include/src/patch.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/upstream/include/src/index.ts"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"126bf1be400716406b1f50cfc3930ec15bb35f77b5165e596998c07028fcb2e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.motion || signature !== this.lastStill || podSlots\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"324c2dc2b733b327ef49a744e34c807d133db369eed620d6b9e970d3dbfd6b42"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outcome === \u0027completed\u0027 \u0026\u0026 id \u0026\u0026 this.addOnce(this.completedTurns, id, 256)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fb6286f4f98a93cc94e013bc6836cac1b0e614d31d9b6c436f479d5cb80d2c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outcome === \u0027denied\u0027 || outcome === \u0027cancelled\u0027\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e87f947491c51cd12750e5d6a1773a2c49f8c33d8021169a9e47e73ca09125e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060owner.state !== \u0027activating\u0027 \u0026\u0026 owner.state !== \u0027active\u0027\u0060 appears character-identically in 3 files \u2014 crates/engine/extension-host/src/shims/avatars.ts, crates/engine/extension-host/src/shims/prompt.ts, crates/engine/extension-host/src/shims/skills.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/shims/avatars.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad46710a78d45a294594643d55e1e8462ddd77494da0b56c37927fb454419c7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed \u0026\u0026 typeof parsed === \u0022object\u0022 \u0026\u0026 !Array.isArray(parsed)\u0060 appears character-identically in 3 files \u2014 crates/app-server/src/runtime_web/app.mjs, npm/runtime-sdk/index.js, web/lib/facts-drift.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_web/app.mjs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a199ccdf2b99fd79b9eb08f1044cf9c6f625bb4cfd02a78ab7f3285f17b00d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previous === undefined || packet.sequence \u003C= previous\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"524e2195440c2403119e9a18851f778c78c4628794c4e4652f8b58ea3fd8bd3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CODEWHALE_SOURCE_REVISION || process.env.GITHUB_SHA || null\u0060 appears character-identically in 2 files \u2014 web/scripts/check-cloudflare-deploy-env.mjs, web/scripts/compare-deployed-facts.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/check-cloudflare-deploy-env.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdc97f3a4a29c4970b2e5abbe2262523ac9e1d0f46d2349af51cc8c782c3ead"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.CODEWHALE_VERSION || process.env.DEEPSEEK_TUI_VERSION || process.env.DEEPSEEK_VERSION || pkg.codewhaleBinaryVersion || pkg.deeps\u2026\u0060 appears character-identically in 2 files \u2014 npm/codewhale/scripts/run.js, npm/codewhale/scripts/verify-release-assets.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/run.js"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d561c17424aaa826dc4d8ede0f23ebf0e7512fa85e32b087310d6d2237150e1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.checkpoint !== undefined \u0026\u0026 !r.checkpoint || r.start !== undefined \u0026\u0026 !r.start\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bd7be233da718f2286d9259e7d9a3e0ec90da0eb9139e65be6bd1513f0a603"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.petReplayVersion === 1 \u0026\u0026 (r.start || r.checkpoint \u0026\u0026 r.checkpoint.petCheckpointVersion !== 1)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3ba4428fe20f5f321df38a992169e5c78cc1bdf91ed704909e5db870ff18a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.petReplayVersion === 2 \u0026\u0026 (!r.start || r.start.petCheckpointVersion !== 2 || r.start.historyStart !== r.start.tick)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e287f2379e9646e4c91348344ee2b20b1c8c021fa77802a2788fddc07db265"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r.start \u0026\u0026 PetWorld.restore(points, r.tape, r.interactions, r.start)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"464cd32eff7085a1d71230fc80ee459e1f2d74785d8e656a109d9be4f5c81e3f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record.event === \u0022item.delta\u0022 \u0026\u0026 record.payload?.kind === \u0022agent_message\u0022\u0060 appears character-identically in 3 files \u2014 integrations/feishu-bridge/src/index.mjs, integrations/telegram-bridge/src/index.mjs, integrations/wecom-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e3140c895f76f891a454f986fc6fdd6cb7723b74abdf97f19887ca8a589c14"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060record.payload?.turn?.status || record.payload?.status\u0060 appears character-identically in 2 files \u2014 integrations/feishu-bridge/src/index.mjs, integrations/telegram-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c81289968a35bf2d43faf7940213641629403af766d6c1036e41c8f597c641b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060report.error || !report.vulnerabilities || !report.metadata?.vulnerabilities\u0060 appears character-identically in 2 files \u2014 extensions/vscode/scripts/audit-dependencies.mjs, web/scripts/audit-dependencies.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/scripts/audit-dependencies.mjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a103ff790493150efc36f5841f4c89b6b0fa476567797526c6c08701c03cad"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060responseText.length \u003E config.maxReplyChars \u0026\u0026 now - sentProgressAt \u003E 15000\u0060 appears character-identically in 2 files \u2014 integrations/feishu-bridge/src/index.mjs, integrations/telegram-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"998d53a2b8223b2ff38a020520ac7233414302137aeb6a16ff83d2fcc3aefbfc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060responseText.trim() || \u0022Turn completed.\u0022\u0060 appears character-identically in 2 files \u2014 integrations/feishu-bridge/src/index.mjs, integrations/telegram-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/index.mjs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4743a789043e236444bf35d7cdfdbd97a6bc8067d65f69cc4345bd814ea85a47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.error || result.signal || ![0, 1].includes(result.status)\u0060 appears character-identically in 2 files \u2014 extensions/vscode/scripts/audit-dependencies.mjs, web/scripts/audit-dependencies.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/scripts/audit-dependencies.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee6fc5d56bb72c8fe98acd99653f1ac8e439e5ab86d553f2e40d4661e456c09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.group === true || row.name === \u0027cordis:group\u0027 || row.name === \u0027@deepseek-ai/cordis-plugin-group\u0027\u0060 appears character-identically in 2 files \u2014 crates/engine/extension-host/src/dsh/agent-presets.ts, crates/engine/extension-host/src/dsh/composition.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/agent-presets.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9f1a20ff434e5f35923ab51e76ffeec457eed842eb144d74481e5d44a74146"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtimeCapabilities.turn_operation_idempotency === true \u0026\u0026 runtimeCapabilities.turn_operation_lookup === true\u0060 appears character-identically in 2 files \u2014 integrations/telegram-bridge/src/index.mjs, integrations/weixin-bridge/src/index.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/telegram-bridge/src/index.mjs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"b617b01bf930355c0a3fae7c6b576554201de4ab89cfd9e6d495753d0c4de911"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060t !== undefined \u0026\u0026 t.sequence !== this.lastSequence\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-audio.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1626}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e02605b67643dceab6a023a344d7ee5af247bd131521144c503134e32156003"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tape.length \u003E 216_000 || interactions.length \u003E 100_000\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2890990c8d3bd0df55bc850c9d8d1942a357759d5095ab67d1d61a368057f7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060telemetry \u0026\u0026 telemetry.observed \u003E= .92 \u0026\u0026 telemetry.activity \u003E .2\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b0be466ff4f0462fed3f23c744277ae297368bd91f1fd9a9b9830e6cf9e29e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060terminalFresh \u0026\u0026 this.turnOutcome === \u0027completed\u0027 \u0026\u0026 this.turnId\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cc89df14d0adaad758bddbfe7848ba0bdccb04648055552ec9ea2b9effc485"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.behaviour === \u0027doze\u0027 \u0026\u0026 (busy || addressed)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c8a53c8e4b67c9aa0402bf640438f15050641f33235b01c09b1f43c208b659"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.bucketIndex \u002B 1 \u003C this.tape.length \u0026\u0026 this.tape[this.bucketIndex \u002B 1].simTimeMs \u003C= timeMs \u002B 1e-7\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"472e11797f0ce65b69090bf5a20ae4a5c19390934fc7d35f1769e593fa8c96dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.interactionIndex \u003C this.interactionLog.length \u0026\u0026 this.interactionLog[this.interactionIndex].timeMs \u003C= timeMs \u002B 1e-7\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f65885b9dd2950db1ec914b294b9986f14811acbbfef43196c98f813eed45a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.lastFailedTool \u0026\u0026 at \u003E= this.lastFailedTool.failedAtMs \u0026\u0026 at - this.lastFailedTool.failedAtMs \u003C= exports.ENGINE_OWNER_STALE_MS\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1787}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc2525240ed414d0479f2660b164bba618bd5489ab9cf209c52052f40904068"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.sim.expressionVersion === 1 \u0026\u0026 (needs === \u0027approach\u0027 || needs === \u0027call\u0027)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5aeed9c88e5925bda8d3739acf5f8e969b8815704757ef96d393f462b89e4d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.sim.expressionVersion === 1 \u0026\u0026 needs === \u0027call\u0027\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-world.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91e9fd08b5c629f460ace7e3dff5f2599063f728cf9d645a391cd28d5db3785"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.waiting \u0026\u0026 at \u003E= this.waiting.endTime\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f3460d07d94eda64d32d748dd9c62c80137478b565dbe01219f38fa1a80b9d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060threadMapPath \u0026\u0026 !threadMapPath.startsWith(\u0022/\u0022)\u0060 appears character-identically in 2 files \u2014 integrations/feishu-bridge/src/lib.mjs, integrations/telegram-bridge/src/lib.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/feishu-bridge/src/lib.mjs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"596457e343d64339c4e76b029b5e1e740c6fd5d90a30cc2fdf283770dfde2f23"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof event.turn_id === \u0027string\u0027 \u0026\u0026 event.turn_id.length\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-engine.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"0523d69600a2b3a524026f9679938cd85fbffecd0990e7bebed6ddb7096f4b7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof id !== \u0027string\u0027 || !id || id.length \u003E 4096\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-telemetry.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f836763693d4ef2ba885932dcdd2a501982d32868a1e2a78a1832f8c67e40e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof item !== \u0022number\u0022 || !Number.isInteger(item) || item \u003C 0 || item \u003E U32_MAX\u0060 appears character-identically in 2 files \u2014 telemetry-ingest/src/schema.ts, web/lib/telemetry/product-usage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c4575ad270d3e6ac196d34e4502cc2aab6bfa53d69fd0d4dffa0a8257d9e84"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof row.id === \u0027string\u0027 \u0026\u0026 row.id !== \u0027\u0027\u0060 appears character-identically in 2 files \u2014 crates/engine/extension-host/src/dsh/upstream/agent-presets/composition-inventory.ts, crates/engine/extension-host/src/dsh/upstream/agent-presets/discovery.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/upstream/agent-presets/composition-inventory.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"7360b12a6ecb276ce4336f5032b67a599ca7cadc29dc519bf4102420f52577c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof text !== \u0027string\u0027 || text.trim().length === 0\u0060 appears character-identically in 2 files \u2014 crates/engine/extension-host/src/shims/commands.ts, crates/engine/extension-host/src/shims/prompt.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/shims/commands.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"46695ba6143bb439986be60904416c7dd717917ad7781821175257597f722e3e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof time !== \u0027number\u0027 || !Number.isFinite(time) || time \u003C e.startTime\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/model.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a358a507e78868cb2e7a0eb3e2a901d874d95a92451782d081254cf7cc0839"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || !/^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(?:\\.\\d{1,3})?Z$/.test(value)\u0060 appears character-identically in 2 files \u2014 web/lib/cloud-facts.ts, web/scripts/facts-publish.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"717f87bab72fa557b7db0299ddbcc767c7afc9d61e9c69a5f7e92ddf30d925c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022string\u0022 || !value.length || value.length \u003E 4 * Math.ceil(maxBytes / 3) || (value.length % 4 !== 0 || !/^[A-Za-z0-9\u002B/]*={0,\u2026\u0060 appears character-identically in 2 files \u2014 web/lib/cloud-facts.ts, web/scripts/facts-publish.mjs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"942af443e200f450a0b9febb80a0f43649cd2e0979acf29f7dd7469f69149e95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027number\u0027 || !Number.isInteger(value) || value \u003C min || value \u003E max\u0060 appears character-identically in 2 files \u2014 crates/engine/extension-host/src/dsh/terminal.ts, crates/engine/extension-host/src/dsh/workspace.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/terminal.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"02452af545d3e4f857f7996666fb5afa2f6013454d93fa666dbc5bf7658ffaf1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027object\u0027 || value === null || Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 crates/engine/extension-host/src/dsh/settings.ts, crates/engine/extension-host/src/shims/prompt.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/settings.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"02530b4893e839381902349633e7c56d461d6895978a2f7cb669fe23471812b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0027string\u0027 || value.length === 0\u0060 appears character-identically in 4 files \u2014 crates/engine/extension-host/src/dsh/catalog.ts, crates/engine/extension-host/src/dsh/network.ts, crates/engine/extension-host/src/dsh/settings.ts, crates/engine/extension-host/src/dsh/terminal.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/catalog.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"758106e08ac09341fd34613a641c647f1897c8a7e2f1a9831ab20fac28fa4b5a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 \u0026\u0026 Number.isFinite(value)\u0060 appears character-identically in 2 files \u2014 extensions/vscode/src/api.ts, extensions/vscode/src/sse.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/api.ts"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"588913196b14bb758e966b46228b4922eeb19cacf05a313e9cfb9be6ec2f14fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 \u0026\u0026 Number.isSafeInteger(value) \u0026\u0026 value \u003E= 0\u0060 appears character-identically in 2 files \u2014 web/lib/github.ts, web/lib/repo-activity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/github.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb201552bd2a22cdbf3b0d59420e1c5a41b191ab7c3ea6deda5594d7a884e6a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022object\u0022 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 telemetry-ingest/src/schema.ts, web/lib/telemetry/product-usage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"224f2d8063ffec1171388ded937158039ab4b977d9080ebe3fdfe03c4ea58d1a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022string\u0022 \u0026\u0026 Number.isFinite(Date.parse(value))\u0060 appears character-identically in 2 files \u2014 web/lib/desktop-release.ts, web/lib/repo-activity.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/desktop-release.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"767ef148b8ea2d9a5b3c747f5ed73185b8f416ec9903e0961344dc9abc96975d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0027object\u0027 \u0026\u0026 value !== null \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 4 files \u2014 crates/engine/extension-host/src/dsh/upstream/hooks/hook-protocol/src/codec.ts, crates/engine/extension-host/src/dsh/upstream/hooks/hooks-claude-code/src/config.ts, crates/engine/extension-host/src/dsh/upstream/hooks/hooks-codex/src/config.ts, crates/engine/extension-host/src/protocol.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/upstream/hooks/hook-protocol/src/codec.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"51822426fb17fce7aa6fed8aad5c65fbf63bdc3921f98a59a1def2d57eda4197"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value.install_id !== \u0022string\u0022 || !INSTALL_ID_RE.test(value.install_id)\u0060 appears character-identically in 2 files \u2014 telemetry-ingest/src/schema.ts, web/lib/telemetry/product-usage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"d10d989520292b1fb0a45b5f611754289544779fa578b69a8b79e1136eb7f9c8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value.sent_at !== \u0022string\u0022 || !SENT_AT_RE.test(value.sent_at)\u0060 appears character-identically in 2 files \u2014 telemetry-ingest/src/schema.ts, web/lib/telemetry/product-usage.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"telemetry-ingest/src/schema.ts"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"ded32cc56524dc3dc1d01293779eced8bd06c181a0a52bbf3314e3bd18f7f951"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v !== null \u0026\u0026 typeof v === \u0027object\u0027 \u0026\u0026 !Array.isArray(v)\u0060 appears character-identically in 2 files \u2014 pet/src/core/codewhale.ts, pet/src/core/ingest.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pet/src/core/codewhale.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbac6756b6394191956be65853036f6433b1f0b7367f7e9dbe0539616f3029d7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value !== null \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 5 files \u2014 web/lib/cloud-facts.ts, web/lib/computer-use-release.ts, web/lib/desktop-release.ts, web/lib/facts.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/cloud-facts.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff4e94cd6b58ac404eff0025b70ab4db99365fef15a14a88486358b69c4b2d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value === null || typeof value !== \u0027object\u0027 || Array.isArray(value) || ![Object.prototype, null].includes(Object.getPrototypeOf(value))\u0060 appears character-identically in 2 files \u2014 crates/engine/extension-host/src/dsh/agents.ts, crates/engine/extension-host/src/root.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/agents.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"86326d543d8c7b1e49d0b62d1765b7c84585feff595b8303af342d222ba64390"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003E= 0 \u0026\u0026 x \u003C width * 2 \u0026\u0026 y \u003E= 0 \u0026\u0026 y \u003C height * 4\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/pet_watch/pet-native.js, pet/ios/Resources/pet-native.js, pet/src/core/pet-native.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/pet_watch/pet-native.js"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de40a39b9ca6486f654b98e81e5f77e09388605998c271bab3efd2548baba6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, int) or value \u003C 0\u0060 appears character-identically in 2 files \u2014 scripts/check-persistence-backlog-budget.py, scripts/check-runtime-contract-budget.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-persistence-backlog-budget.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f40f5b8e5d1f3464b0c0c42a122a5d2177ebe2b64c99183c8d816872a104f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.startswith(\u0022codewhale-\u0022) and name not in ALLOWED_WORKSPACE\u0060 appears character-identically in 2 files \u2014 scripts/check-command-config-proof.py, scripts/check-command-session-proof.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-command-config-proof.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c440ebd934aa3e8497493a80021f969a974f7828eb36cd128f0f6d9eed45b2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!animated || area.width \u003C AMBIENT_MIN_WIDTH || area.height \u003C AMBIENT_MIN_HEIGHT\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/ambient_life.rs, crates/tui/src/tui/ocean/guarded_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ambient_life.rs"},"region":{"startLine":1211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b7e2959950431203b0188ec0a01f45e5f2dcdabc5c32f2e9a353f03f20ac67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!app.collapsed_cells.is_empty() || !app.tool_run_cache.summaries.is_empty() || !app.tool_run_cache.superseded_todos.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"138ce4a30d8768aa182c082da11305ab90afd300656f3e0464f1e3a0f926436a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!cell.symbol().trim().is_empty() \u0026\u0026 cell.bg == palette::SELECTION_BG \u0026\u0026 cell.fg == palette::SELECTION_TEXT\u0060 appears character-identically in 4 files \u2014 crates/tui/src/tui/command_palette.rs, crates/tui/src/tui/session_picker.rs, crates/tui/src/tui/views/mod.rs, crates/tui/src/tui/widgets/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"5983fa1e62c36973a3c86538a3a05ee6a369cde76a5c24492270dbc6092448fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_protected || cell.bg == self.background\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/ocean/guarded_legacy.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ocean/guarded_legacy.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8557fbaf77f14b45c5e05c31e408b4ff9af0c74faf1c3bd171940a8f916c0e6f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!key.modifiers.contains(KeyModifiers::CONTROL) \u0026\u0026 !key.modifiers.contains(KeyModifiers::ALT)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/settings_picker/mod.rs, crates/tui/src/tui/worktree_manager.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/settings_picker/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea71eea9404096da691536e3688ee33f379a91cce4f81e7a3526e37a40121bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!metadata.is_file() || metadata.nlink() != 1\u0060 appears character-identically in 3 files \u2014 crates/engine/src/session_manager.rs, crates/plugins/src/registry.rs, crates/util/src/files.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"636eb140ae4975e9b427b6a87f72a2b7caae90557c156c6290ebd1ae5bd3b993"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!model.is_empty() \u0026\u0026 !model.eq_ignore_ascii_case(\u0022auto\u0022)\u0060 appears character-identically in 3 files \u2014 crates/engine/src/fleet/capability_badges.rs, crates/engine/src/fleet/worker_runtime.rs, crates/engine/src/route_runtime.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/capability_badges.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"413ff490e35990f6ef9a5cbad6f5a9750e6a55e417e80d899ecfdc9f967d8abe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!model.trim().is_empty() \u0026\u0026 !model.chars().any(char::is_control)\u0060 appears character-identically in 2 files \u2014 crates/plugins/src/providers.rs, crates/runtime/src/config_persistence.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/providers.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"359511ab85bdecc9285fb4cc8a008553acc942ae28ec7063f87e7b93d461ff20"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!normalized.starts_with(\u0022deepseek\u0022) \u0026\u0026 !normalized.contains(\u0022/deepseek\u0022)\u0060 appears character-identically in 2 files \u2014 crates/config/src/model_normalization.rs, crates/runtime/src/config.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/model_normalization.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5926081f574bc187088e8ae8887aae6248e3377d97a2e00d4067ca8e4fc07708"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!origin.trim().is_empty() \u0026\u0026 !bare.trim().is_empty()\u0060 appears character-identically in 2 files \u2014 crates/workflow/src/named_fleet.rs, crates/workflow/src/reasoning_router.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/named_fleet.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21357e4a0f8aa9073abbb1a3c79dea313df2a4e2004f3eb49b98010db770170"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed.username().is_empty() || parsed.password().is_some()\u0060 appears character-identically in 5 files \u2014 crates/engine/src/mcp.rs, crates/engine/src/tools/dev_server_readiness.rs, crates/plugins/src/manifest.rs, crates/runtime/src/oauth.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c46ae86f6313662f85009fa4329cbe858738aacc2817af14e0e75d45c634b7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!published \u0026\u0026 work.has_pending_publish()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/app.rs, crates/tui/src/tui/ui/session_state.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":7520}}}],"partialFingerprints":{"codehealthFindingId/v1":"3039fde8b1c33dd7eff1cd0fca9326554a524524584e12b7d21e8cfec7505c67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!report.from_settings.is_empty() || !report.session_overrides.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/runtime/src/settings.rs, crates/tui/src/commands/groups/config/config.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":1933}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79d07fdb8137576d48ad061f9d6e1919424b532a4a1a45efb3e53da00ba595a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!symbol.contains(\u0027\\x1b\u0027) \u0026\u0026 !symbol.contains(\u0022]8;;\u0022)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/color_compat.rs, crates/tui/src/tui/live_transcript.rs, crates/tui/src/tui/widgets/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/color_compat.rs"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb8a580139a9d4fcfcb1e1fa8735ad2dd2668b5f953a01d0b28121106bd3aa0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!url.username().is_empty() || url.password().is_some()\u0060 appears character-identically in 5 files \u2014 crates/account-cli/src/lib.rs, crates/app-server/src/runtime_api/targets.rs, crates/cli/src/config_bundles.rs, crates/engine/src/extension_host/dsh_network.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":3511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b5a412c90fd89f2b786723bf67c3d80dad8f9b257ad94b56ada61047b16db5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.dev() == b.dev() \u0026\u0026 a.ino() == b.ino()\u0060 appears character-identically in 2 files \u2014 crates/config/src/private_directory.rs, crates/util/src/files.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":3124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f102ad98f7d64460928188f9e869b03b50a275ae4c3fa6b529360b22e04275f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.current_session_metadata.as_mut() \u0026\u0026 cached.id == metadata.id\u0060 appears character-identically in 2 files \u2014 crates/tui/src/commands/contract.rs, crates/tui/src/tui/ui/handlers.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00e027b4a9a9cb821fd8a422336af7ea647cd6de38a516f8a8b0bbfd59f1534"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.is_compacting || app.manual_compaction_queued\u0060 appears character-identically in 4 files \u2014 crates/tui/src/tui/hotbar/actions.rs, crates/tui/src/tui/ui.rs, crates/tui/src/tui/ui/compaction_flow.rs, crates/tui/src/tui/ui/event_loop.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hotbar/actions.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"de795662c8625c3ba794562afaaadbac3ce8823192c80cbf441999a680d84144"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.is_loading || app.dispatch_in_flight\u0060 appears character-identically in 2 files \u2014 crates/tui/src/commands/contract.rs, crates/tui/src/tui/ui/remote_control_bridge.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"132e43f77a8ce1dec004c1c48f4d4d5a2825563eb8e5e7e4a8ad1989b7a8b3cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.is_loading || matches!(app.runtime_turn_status.as_deref(), Some(\u0022in_progress\u0022))\u0060 appears character-identically in 5 files \u2014 crates/tui/src/tui/control_socket.rs, crates/tui/src/tui/ui.rs, crates/tui/src/tui/ui/apply.rs, crates/tui/src/tui/ui/event_loop.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/control_socket.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"821fb380e5664c56f1e7167815b5ad43be6b1df0b23ed6bd49dd3bb0350d6f04"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.paused || app.paused_goal_objective.is_some()\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/composer_ui.rs, crates/tui/src/tui/control_socket.rs, crates/tui/src/tui/ui.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/composer_ui.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72aaa96ca0a2786b7f08d5b07f9bc730d784b8d7fa52e4dbfc2c8a1abce650c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.pin_last_prompt \u0026\u0026 content_area.height \u003E 1\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5bc1d4b1135086207821ee7cabe86afa9b6ccc18b89b2015ce557a98f64e48"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.queued_messages.is_empty() \u0026\u0026 app.queued_draft.is_none()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/ui/event_loop.rs, crates/tui/src/tui/ui/session_state.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2062}}}],"partialFingerprints":{"codehealthFindingId/v1":"be503436fc3779b5f552444e60067f2c3c904c5010f0638eea0a0dba094f8821"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.suppress_stream_events_until_turn_complete \u0026\u0026 app.is_loading\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/ui/apply.rs, crates/tui/src/tui/ui/event_loop.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":3499}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f25ca9bd5154675d1fe1497646dd0a653b78b8c543fa0c5b59b5738a3f8ab82"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.tool_run_cache.history_version == app.history_version \u0026\u0026 app.tool_run_cache.history_len == history_len \u0026\u0026 app.tool_run_cache.active_cell\u2026\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a6edbf9f0064066a0ba40b5a4c194398839ac63aac6767e5364909c0991bec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.use_mouse_capture \u0026\u0026 !app.viewport.transcript_scroll.is_at_tail()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef801e7540134f6a3e0367219dc47b48fd14e74d8c3c5a8d8be4dbc0328bc8f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060app.work_surface.opened.is_some() \u0026\u0026 app.view_stack.top_kind() == Some(ModalKind::Pager)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/ui/event_loop.rs, crates/tui/src/tui/ui/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":6773}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ea9bf765c186cb2d690afaa82b725b2273cfa0d350b717e80fc0efb00d9785"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body.get(\u0022temperature\u0022).is_none() \u0026\u0026 body.get(\u0022top_p\u0022).is_none()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/client/anthropic.rs, crates/engine/src/client/test_cases_04.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/anthropic.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"de48a6e2ada0d7f4e66cb5359667733aeff5da505ef3d60fc2e2e68d0c86d84f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060byte.is_ascii_alphanumeric() || byte == b\u0027_\u0027\u0060 appears character-identically in 3 files \u2014 crates/engine/src/mcp/oauth.rs, crates/plugins/src/matcher.rs, crates/skill-install/src/recommend.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/oauth.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bcb7188315f265cb98c202a2359128e4fbf093bc654c14fc940c522ba7b4eb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.len() \u003E= 2 \u0026\u0026 bytes[0].is_ascii_alphabetic() \u0026\u0026 bytes[1] == b\u0027:\u0027\u0060 appears character-identically in 3 files \u2014 crates/engine/src/tools/shell.rs, crates/execpolicy/src/lib.rs, crates/skills/src/mutation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":4950}}}],"partialFingerprints":{"codehealthFindingId/v1":"575e70a6224af75add86d48ae8d86708fa1952b8ad9e3871531b74502fbfb025"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes.starts_with(b\u0022GIF87a\u0022) || bytes.starts_with(b\u0022GIF89a\u0022)\u0060 appears character-identically in 2 files \u2014 crates/engine/src/image_attach.rs, crates/engine/src/tools/web/extract.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/image_attach.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcadff9838853169ef0596d63f24740dc76fbd7a1d38cf9b762f7786f96ebb4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes[0].is_ascii_lowercase() || bytes[0].is_ascii_digit()\u0060 appears character-identically in 2 files \u2014 crates/account-cli/src/lib.rs, crates/cloud-facts/src/lib.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c52afcecbb7ef95fd2f1635565411d8ac41682f83de2ba154c1e336e31ca5b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes[j] == 0x1b \u0026\u0026 j \u002B 1 \u003C bytes.len() \u0026\u0026 bytes[j \u002B 1] == b\u0027\\\\\u0027\u0060 appears character-identically in 2 files \u2014 crates/sanitize/src/sanitize.rs, crates/tui-kit/src/osc8.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/sanitize/src/sanitize.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca23b5f8ec180c80eedfd47cc5e454ec632e4626a35eaca45b5b5b45fbc4c49f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.is_ascii_alphanumeric() || c == \u0027-\u0027 || c == \u0027_\u0027\u0060 appears character-identically in 2 files \u2014 crates/app-server/src/eval.rs, crates/runtime/src/artifacts.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/eval.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1325f3f2492b9ab2f5f136467af67c4a20ff643b1a1898f1bf651b6f93e831df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cell.symbol() == \u0022 \u0022 || cell.symbol().is_empty()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/context_menu.rs, crates/tui/src/tui/ocean/guarded_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/context_menu.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ce7f6fab02ca2646a92a87b86769a5c7544402706d51342e4c9608e85440dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ch.is_ascii_alphanumeric() || ch == \u0027_\u0027 || ch == \u0027-\u0027\u0060 appears character-identically in 2 files \u2014 crates/engine/src/task_manager.rs, crates/engine/src/tools/github/shape.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":4266}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f745dfefef5a9c66182a279529bad8ad204bfdc6418f690c59151848ef253d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060column \u003E= area.x \u0026\u0026 column \u003C area.x.saturating_add(area.width) \u0026\u0026 row \u003E= area.y \u0026\u0026 row \u003C area.y.saturating_add(area.height)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/hover_hit.rs, crates/tui/src/tui/mouse_ui.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/hover_hit.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d91ae043bf2be1e3fd8bfe839ed43d8d0dabc0e8820fd4113c084b7ab444c2e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060complete \u0026\u0026 usage_has_reported_data(usage)\u0060 appears character-identically in 2 files \u2014 crates/engine/src/core/engine/rlm_host.rs, crates/engine/src/tools/subagent/engine.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/rlm_host.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faf4b3d1756812689dff4255604c8918d8b9e480d71c819d90de7aa581f1826"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060components.next().is_some() || !matches!(component, std::path::Component::Normal(_))\u0060 appears character-identically in 2 files \u2014 crates/engine/src/automation_manager.rs, crates/engine/src/task_manager.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3799}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b158e17dcc1f5221caa04890238667c00a9a52309e543e2956bb802ba89689"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060critical \u0026\u0026 self.request.owner.is_none()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/approval_band_legacy.rs, crates/tui/src/tui/widgets/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bc5de0e3dc2ae10b1084d9cb70f723099a186b0ec9de5cc3e0cdc177792118"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060end_chars \u003C chars.len() \u0026\u0026 !chars[end_chars].is_whitespace()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/file_mention.rs, crates/tui/src/tui/slash_menu.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_mention.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cdf0d7789074a2182d09815db8ff15f283991acf428598620732269f4f7b80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.thread_id != thread_id || entry.request.turn_id != turn_id\u0060 appears character-identically in 2 files \u2014 crates/engine/src/runtime_threads/manager.rs, crates/engine/src/runtime_threads/manager/external_agent.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":14754}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9843d9bb567b57d7bad4aa4adfd00fb3eb8c22d4a30a888e549183f60e4e97"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry_type.is_symlink() || entry_type.is_hard_link()\u0060 appears character-identically in 3 files \u2014 crates/plugins/src/install/tarball.rs, crates/skill-install/src/install.rs, crates/skills/src/mutation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/install/tarball.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b127c00f2f582b85424f5c2be5f4f86f9f9404589c55ca6938f5a2cb94e2c6d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing.id == id \u0026\u0026 existing.revision == revision\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/live_transcript.rs, crates/tui/src/tui/live_transcript/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/live_transcript.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ba7342e96241488b0cd71ca570e7dbe15bc636ebf1aacad762eacfce731325"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060feature.name == FEATURE_NAME \u0026\u0026 scenario.name == name\u0060 appears character-identically in 2 files \u2014 crates/tui/src/commands/groups/core/acceptance.rs, crates/tui/src/commands/session_acceptance.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/acceptance.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4069a14864a5a12ac6b15a783148d93d9aec7826ca98b4d98ba947a1be41321f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file_type.is_file() || file_type.is_symlink()\u0060 appears character-identically in 2 files \u2014 crates/config/src/project_config.rs, crates/engine/src/project_context.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/project_config.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0f05120225804778a66b71450dc8e56732fa0bed1cd2a50bab0d0304a873c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060focus.cells.is_empty() \u0026\u0026 result_cells.is_empty() \u0026\u0026 focus.local_cells.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/agent_focus.rs, crates/tui/src/tui/agent_focus/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/agent_focus.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61e7b96e8543b6654537661913279631114e8a3b47a80061e87e8157eddaf11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060grapheme.chars().next() \u0026\u0026 ch.len_utf8() == grapheme.len()\u0060 appears character-identically in 2 files \u2014 crates/tui-kit/src/markdown_render.rs, crates/tui-kit/src/ui_text.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui-kit/src/markdown_render.rs"},"region":{"startLine":2489}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e25f38d99d8ba17821a7c052ed9d6259e70319d5703f695e327476d90140542"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060image_url.url.starts_with(\u0022http://\u0022) || image_url.url.starts_with(\u0022https://\u0022)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/commands/contract.rs, crates/tui/src/commands/session_structcopy_host.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/contract.rs"},"region":{"startLine":1927}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5c7e51e7c18e956c875df7221f395155d5811eb029ef7150254cac133b789d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C text.len() \u0026\u0026 !text.is_char_boundary(index)\u0060 appears character-identically in 2 files \u2014 crates/engine/src/compaction_archive.rs, crates/engine/src/project_context/budget.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction_archive.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fdde9fb354c93a57aea3aac05f6a0b3bad73673a8b7113467fb28af22fb175"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060joined.contains(\u0022success\u0022) || joined.contains(\u0022explore\u0022)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/agent_card.rs, crates/tui/src/tui/widgets/workflow_panel.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/agent_card.rs"},"region":{"startLine":1419}}}],"partialFingerprints":{"codehealthFindingId/v1":"6208b554a112ed0a48793547ad1ba7105c8eadb881c950b996fee2de93ad2a11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.code == KeyCode::Char(\u0027c\u0027) \u0026\u0026 key.modifiers.contains(KeyModifiers::CONTROL)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/ui/event_loop.rs, crates/tui/src/tui/ui/provider_routes.rs, crates/tui/src/tui/ui/tests.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":6607}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ae5389d24aa51feff0a0081c8066ffc9990d83345ea89eabb7deb3592d63cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.modifiers.contains(KeyModifiers::ALT) \u0026\u0026 !key.modifiers.contains(KeyModifiers::CONTROL)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/ui/event_loop.rs, crates/tui/src/tui/work_surface/terminal.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":7103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad25a7b6175340367fea51b5e23257d0f9de59bb797e3756bacb05e356d4afe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.modifiers.contains(KeyModifiers::ALT) || key.modifiers.contains(KeyModifiers::SUPER)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/composer_ui.rs, crates/tui/src/tui/key_shortcuts.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/composer_ui.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac105136556c3208a5a610106138e4e98f37bca6af70f0190951a5457058aa3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.modifiers.contains(KeyModifiers::CONTROL) \u0026\u0026 !key.modifiers.contains(KeyModifiers::ALT)\u0060 appears character-identically in 4 files \u2014 crates/tui/src/tui/command_palette.rs, crates/tui/src/tui/pager.rs, crates/tui/src/tui/views/mod.rs, crates/tui/src/tui/work_surface/terminal.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"6606106a6e134b0f7afa095fd2bb61652b2b221f2fa61575b50cd1c371ecfe58"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.modifiers.contains(KeyModifiers::CONTROL) \u0026\u0026 key.modifiers.contains(KeyModifiers::SHIFT)\u0060 appears character-identically in 4 files \u2014 crates/tui/src/tui/key_shortcuts.rs, crates/tui/src/tui/live_transcript.rs, crates/tui/src/tui/live_transcript/transcript_legacy.rs, crates/tui/src/tui/ui/event_loop.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/key_shortcuts.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c857b114707ee0c1f4fe14b368f315dd58afae2d087d73747547d5e3cc2c555"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060key.modifiers.is_empty() || key.modifiers == KeyModifiers::SHIFT\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/command_palette.rs, crates/tui/src/tui/provider_picker.rs, crates/tui/src/tui/shell_key_routing.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/command_palette.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aafcedf7d5c0d89d7cc72e5c744bbf49cc922e28a6bbc801191d5a0ba454061"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind == \u0022tool_call\u0022 || kind == \u0022file_change\u0022 || kind == \u0022command_execution\u0022\u0060 appears character-identically in 2 files \u2014 crates/app-server/src/runtime_api.rs, crates/engine/src/task_manager.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":11638}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bbc60559335205da620f590e9d6a988c66760c4a653b3695f9bd9e235af026"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060label != row.label || detail != detail_candidate\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/work_surface/render/body_legacy.rs, crates/tui/src/tui/work_surface/render/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/body_legacy.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5e8d224cd5b5bc0b0c4fbdee0eea8aeeef6b76259b2e3df01624f151155c09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060laid_out.objective != facts.objective || laid_out.receipt != agent_receipt(facts, AgentRowTier::Full)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/work_surface/render/body_legacy.rs, crates/tui/src/tui/work_surface/render/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/body_legacy.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1019dea20d8bf7aa9850a28370642062acf56ba439cbac5cf69087bdc6d6d6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060left.starts_with(right) || right.starts_with(left)\u0060 appears character-identically in 2 files \u2014 crates/app-server/src/runtime_api/jobs.rs, crates/tools/src/resources.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/jobs.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b0a424b226cb9e49fe6b24a7e3561b21519dfa9336a90e817a43c32aed11b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.is_empty() || line.starts_with(\u0027#\u0027)\u0060 appears character-identically in 3 files \u2014 crates/engine/src/hooks/executor.rs, crates/runtime/src/dsh_credentials.rs, crates/skill-install/src/frontmatter.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/executor.rs"},"region":{"startLine":3347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9c3578a087a87ecdfb52e59e61e32f0aabc93fa713849bae85b2c1aafc1057"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line.starts_with(\u0022\u002B\u002B\u002B\u0022) || line.starts_with(\u0022---\u0022)\u0060 appears character-identically in 2 files \u2014 crates/engine/src/tools/review_triage.rs, crates/tui/src/tui/tool_routing.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_triage.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"688592303943b6eb29c949bb3d2cb142252ffc7e2116db625b9a89b59ed46fc9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line_index \u003C start.line_index || line_index \u003E end.line_index\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":2778}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e26e41e78ad536dd3837a79e3b6538e32d526f5c9a0d309b4ed4a930369771"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060line_meta.get(line_index) \u0026\u0026 original_index_map .get(*cell_index) .copied() .unwrap_or(*cell_index) == target_cell\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":2829}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b68a5b660db9e3b61f15b3af3ea825bf3ebbbcec3fd3a623429643a80f723f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.ends_with(\u0022.tar.gz\u0022) || lower.ends_with(\u0022.tgz\u0022)\u0060 appears character-identically in 2 files \u2014 crates/plugins/src/marketplace/parsers/kimi.rs, crates/skills/src/mutation.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/marketplace/parsers/kimi.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d2aad173b94683d57b7459db8425eaa936788587757bfff293afa97e49450d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.role == \u0022assistant\u0022 || message.role == codewhale_models::INTERRUPTED_ASSISTANT_ROLE\u0060 appears character-identically in 3 files \u2014 crates/engine/src/session_manager/test_cases_02.rs, crates/runtime/src/tool_history_repair.rs, crates/tui/src/tui/notifications.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager/test_cases_02.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"22475d7879833762bf2ce3ad1945535214cae332df223feed90260fe748ae546"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060messages.is_empty() \u0026\u0026 system_prompt.is_none()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/core/engine.rs, crates/tui/src/tui/ui/apply.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":4521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c20e2f92dae60b1f7b2c7961bd9a917fd2421381311b7a540d9a552c88097124"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060meta.file_type().is_symlink() || !meta.is_file()\u0060 appears character-identically in 3 files \u2014 crates/engine/src/tools/shell.rs, crates/memory/src/store.rs, crates/secrets/src/file_lock.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":7756}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b3566fa5bad96f52d15b0b7e1af37ded4e81b8aaf4959e24d2ef7141f3a3de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.file_type().is_symlink() || !metadata.is_dir()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/session_manager.rs, crates/palette/src/user_theme.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":2653}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee0238191b0f2e0fdcdba60af16101eb47e13f4dca5f9fdedf73caac3938abe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.file_type().is_symlink() || !metadata.is_file()\u0060 appears character-identically in 2 files \u2014 crates/app-server/src/runtime_api/diagnostics.rs, crates/engine/src/session_manager.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/diagnostics.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"76481c7e955e8832d61539f2067cf6b094833a00cb6f75c5951c21bf21eb575e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060metadata.is_file() \u0026\u0026 metadata.nlink() == 1\u0060 appears character-identically in 2 files \u2014 crates/engine/src/runtime_threads.rs, crates/runtime/src/skill_state.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":5829}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9295e82158545c5b364dc358623eb30b7dcb5e04725d2ef3c2f2332dc93d783"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model.eq_ignore_ascii_case(\u0022deepseek-chat\u0022) || model.eq_ignore_ascii_case(\u0022deepseek-reasoner\u0022)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/commands/groups/core/provider.rs, crates/tui/src/tui/model_picker.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/core/provider.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a0566afe108f04d4454dfb02c775638208b776b3e396dd5e04e36df98959011"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model.trim().is_empty() || model.eq_ignore_ascii_case(\u0022auto\u0022)\u0060 appears character-identically in 2 files \u2014 crates/app-server/src/owner_calls.rs, crates/engine/src/fleet/worker_runtime.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/owner_calls.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"387f98bb28f5460bb5ee54d032271269a46a8d9e376d3c7301287144a6d7362d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name == \u0022pandoc_convert\u0022 \u0026\u0026 input.get(\u0022output_path\u0022).is_some()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/tools/registry.rs, crates/engine/src/tools/subagent/engine.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bef4fe23a5439e6902b11e4da9d813b0475b6614f0e899df4c4508b396d3ef9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized == DEFAULT_KIMI_CODE_BASE_URL || normalized == \u0022https://api.kimi.com/coding\u0022 || normalized.starts_with(\u0022https://api.kimi.com/codi\u2026\u0060 appears character-identically in 2 files \u2014 crates/config/src/base_url_resolution.rs, crates/runtime/src/config.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"71edd12bc22656f86c2b79f46e4d375add47598e950b8860337b3fbd4212257b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized == XIAOMI_MIMO_TOKEN_PLAN_CN_BASE_URL || normalized == XIAOMI_MIMO_TOKEN_PLAN_SGP_BASE_URL || normalized == XIAOMI_MIMO_TOKEN_PLA\u2026\u0060 appears character-identically in 2 files \u2014 crates/config/src/base_url_resolution.rs, crates/runtime/src/config.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca82f2d2c8258f5c8b9d4220b251d69336c48b4870422ad489f46b9d5969b9fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized.ends_with(\u0022api_key\u0022) || normalized.ends_with(\u0022token\u0022) || normalized.ends_with(\u0022secret\u0022) || normalized.ends_with(\u0022password\u0022) || no\u2026\u0060 appears character-identically in 2 files \u2014 crates/engine/src/runtime_threads/manager.rs, crates/runtime/src/safe_label.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c085750c38ee5d4b2f95295cdc287e7234d573cba592942e3aece390397479e3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized_mode .as_deref() .and_then(xiaomi_mimo_base_url_for_mode) .is_some() || base_url.is_some_and(xiaomi_mimo_base_url_uses_token_plan\u2026\u0060 appears character-identically in 2 files \u2014 crates/config/src/base_url_resolution.rs, crates/runtime/src/config.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0481400c8663c7d16f0e49aae1da57de9e1dc4de9328fc3404f33031c5c31f06"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized_mode .as_deref() .is_some_and(xiaomi_mimo_mode_uses_standard_endpoint) || base_url.is_some_and(xiaomi_mimo_base_url_is_pay_as_you\u2026\u0060 appears character-identically in 2 files \u2014 crates/config/src/base_url_resolution.rs, crates/runtime/src/config.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/base_url_resolution.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b1155d256f913543ef8477b285d60dde18dbf56aca33046f72e7f95cf59ea8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opened.volume != current.volume || opened.index != current.index\u0060 appears character-identically in 2 files \u2014 crates/plugins/src/manifest.rs, crates/plugins/src/registry.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/manifest.rs"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1177ce4382ffbeef5ac140c5fe36c29262c30966cefa5cb8c1f0dfde572cec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060over_catalog \u0026\u0026 mouse.kind == MouseEventKind::Down(MouseButton::Left)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/model_picker.rs, crates/tui/src/tui/provider_picker.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/model_picker.rs"},"region":{"startLine":4445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ff2374213743f528f6b6c74d9899ddaf0965950cbccbe8d3c6833fb1fd33bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prefix_match || contains_match || close_typo\u0060 appears character-identically in 2 files \u2014 crates/config/src/suggest.rs, crates/engine/src/core/engine/tool_catalog.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/suggest.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1430a026cfd21414431e4b890aeab2da93964de3ac398287fb602ead52bf97"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060primary.symlink_metadata().is_ok() || workspace.join(\u0022.codewhale\u0022).is_symlink()\u0060 appears character-identically in 3 files \u2014 crates/engine/src/compaction/last_round.rs, crates/tui/src/commands/contract/core_navigation.rs, crates/tui/src/commands/groups/memory/note.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/compaction/last_round.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"91688d46d39b0c4ab9ab1212a02004820ce9d263d3322a259862486ac2073fc1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060prompt.is_empty() || prompt.chars().count() \u003E 32_000\u0060 appears character-identically in 2 files \u2014 crates/account-cli/src/lib.rs, crates/account-cli/src/work.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/account-cli/src/lib.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af439f5e05957f68557b8efd8e2058746b832c50d2f436364d6cd09273eaf7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060provider == ProviderKind::Anthropic \u0026\u0026 auth_mode.as_deref() == Some(\u0022oauth\u0022)\u0060 appears character-identically in 3 files \u2014 crates/engine/src/provider_readiness.rs, crates/runtime/src/config.rs, crates/runtime/src/config/credential_resolve.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_readiness.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5235e2615651675af062ae3d6315768f2db81cbfc423365333b16a42b0135d8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060provider == ProviderKind::OpenaiCodex \u0026\u0026 official_endpoint\u0060 appears character-identically in 2 files \u2014 crates/engine/src/provider_readiness.rs, crates/tui/src/tui/provider_picker.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_readiness.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb5fd22807f8feb10f25fdc6116a6fb8622ce5b7b25f976ce52e482065ea22d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw.is_empty() || raw.eq_ignore_ascii_case(\u0022list\u0022)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/commands/groups/utility/jobs.rs, crates/tui/src/commands/groups/utility/network.rs, crates/tui/src/commands/groups/utility/task.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/utility/jobs.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c76ff6c719f5d6e0c9209a5331f3cea1ab8b09e453a71365253757a1f1fc76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060raw.starts_with(\u0027-\u0027) \u0026\u0026 !raw.starts_with(\u0022---\u0022)\u0060 appears character-identically in 2 files \u2014 crates/engine/src/tools/review_core.rs, crates/tui-kit/src/diff_render.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/review_core.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"222fceaf6103839b59a8e6ebd96961c0c062d6d3424154364835339ebe1ef73a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060receipt[\u0022outcome\u0022] == \u0022completed\u0022 || receipt[\u0022outcome\u0022] == \u0022review_response\u0022\u0060 appears character-identically in 3 files \u2014 crates/app-server/src/exec_agent.rs, crates/engine/src/runtime_threads/manager.rs, crates/tui/src/tui/ui/event_loop.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/exec_agent.rs"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"904c0bee10d476118b244f17fe5752a986d6755b94a09862c561ef0d1093a46c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060receipt[\u0022outcome\u0022] == \u0022steered\u0022 || receipt[\u0022outcome\u0022] == \u0022steered_before_stream\u0022\u0060 appears character-identically in 2 files \u2014 crates/engine/src/runtime_threads/manager.rs, crates/tui/src/tui/ui/event_loop.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":18459}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b8ba58a6d2b06b8d9d4fca376ee040f9f7dc5a4b67b113d59901623c8f6180"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.mode.is_some() || req.permission_posture.is_some() || req.auto_approve.is_some()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/runtime_threads/manager.rs, crates/engine/src/runtime_threads/manager/external_agent.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":9290}}}],"partialFingerprints":{"codehealthFindingId/v1":"9267c9682e732e26b6cbc5a3ec2f3291992f36f817cdb3fd2dbfbedcb143f316"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request.owner.is_none() \u0026\u0026 request.can_save_allow_rule()\u0060 appears character-identically in 4 files \u2014 crates/tui/src/tui/approval/tests.rs, crates/tui/src/tui/approval/view.rs, crates/tui/src/tui/widgets/approval_band_legacy.rs, crates/tui/src/tui/widgets/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval/tests.rs"},"region":{"startLine":3209}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6a17d217bb4302b697da2072e2a7084b1af2f6b2685863ba1b895c06899f1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060requested_origin \u0026\u0026 !root.origin.eq_ignore_ascii_case(origin)\u0060 appears character-identically in 2 files \u2014 crates/workflow/src/named_fleet.rs, crates/workflow/src/reasoning_router.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/workflow/src/named_fleet.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1474e69408a896f4e809f44ab9de47b583cf13a414739748baf65373156d2d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.status != ShellStatus::Running || Instant::now() \u003E= deadline\u0060 appears character-identically in 2 files \u2014 crates/engine/src/tools/shell/tests.rs, crates/engine/src/tools/verifier.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell/tests.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1826c8d820a5957e988752f9efee5ba5b1487b27542c197885141bedce9c74"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060result.stdout.is_empty() \u0026\u0026 result.stderr.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/tools/shell.rs, crates/tui/src/tui/shell_job_routing.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":6581}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b2a241c7d17bf21b4b90939266533322d45c1481fcf3b92091cd247b82b47a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060row.tone != WorkTone::Heading \u0026\u0026 content_area.width \u003E= 44\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/work_surface/render/body_legacy.rs, crates/tui/src/tui/work_surface/render/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/body_legacy.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"39996d82dd8de969f940323a96829cf7c963bdda8a358b75ac5d5ce2ffdf3dd4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime.cancel_token.is_cancelled() || handle.is_cancelled()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/core/engine/child_host.rs, crates/engine/src/tools/subagent/engine.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/child_host.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf30b50c78d4268f53407c2fab3dcc037c9f49c425aa0a56c9bc96d20821bd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060runtime.host_generation.load(Ordering::SeqCst) != host_generation || cx.cancel.is_cancelled()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/extension_host/avatars.rs, crates/engine/src/extension_host/skills.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/avatars.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15d8597ae65f9438fefce4e4365eb4ce262868412f504105249d9af7251bc74"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scroll \u003E= max \u0026\u0026 matches!(self.mode, Mode::Tail)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/live_transcript.rs, crates/tui/src/tui/live_transcript/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/live_transcript.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e76394d6a398c9e098be509402525ba595a627c418aa560eef08595d348dd6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.cancel_token.is_cancelled() || withdraw.is_some_and(CancellationToken::is_cancelled)\u0060 appears character-identically in 2 files \u2014 crates/engine/src/core/engine/approval.rs, crates/engine/src/core/engine/turn_loop.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/approval.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b7658811f6765ce8cda5f3215456aa0aaf0234ed83e1dc192a0b34f810e28c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.child_host.is_some() || self.rlm_host.is_some()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/core/engine.rs, crates/engine/src/core/engine/turn_loop.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":9852}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fa8221187427f4d2b50c6e00280f19c7462a3ce9dc2346617bbec5b19deeff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060server.command.is_some() \u0026\u0026 server.url.is_none()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/mcp.rs, crates/engine/src/mcp/project_authority.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":7752}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db5106b2e98ebf0a6651338510946861c5e8629689f511c20c4ef7ae3f32e4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060snapshot.objective.is_none() \u0026\u0026 snapshot.status.trim() == \u0022none\u0022\u0060 appears character-identically in 2 files \u2014 crates/engine/src/session_manager.rs, crates/tui/src/tui/ui/apply.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"47eb8321d8ac31342fef7898bbf2f44a028b234d71aa7cc897a2b0f7efe5933d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start == 0 || is_word(haystack[start - 1]) != is_word(haystack[start])\u0060 appears character-identically in 2 files \u2014 crates/plugins/src/matcher.rs, crates/skill-install/src/recommend.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/matcher.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3b3a76c3bf515ed72db3386b4bd8e935e7c9d2bf96fa631e3f825cf7a03cc4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060std::io::stdin().is_terminal() \u0026\u0026 std::io::stdout().is_terminal()\u0060 appears character-identically in 2 files \u2014 crates/engine/src/telemetry_notice.rs, crates/telemetry/src/envelope.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/telemetry_notice.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcf52f181ae4c6760af24cb46cbec220e90e471f3b099f636f747a67ee53f4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060switched \u0026\u0026 app.onboarding == OnboardingState::Provider\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/ui/handlers.rs, crates/tui/src/tui/ui/provider_routes.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/handlers.rs"},"region":{"startLine":3304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8eed81718b22399995094d44957c0ba75e7d4552c1c6be6fd525a0f437100b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060task.entry.run_id == *run_id \u0026\u0026 matches!(task.status, FleetTaskLedgerStatus::Leased)\u0060 appears character-identically in 2 files \u2014 crates/engine/src/fleet/manager.rs, crates/engine/src/fleet/scheduler.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/manager.rs"},"region":{"startLine":2564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f316ceea4e34f606501cbc75e732bb2da3a8d121884e16422a25a07f877d807"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tool.name != \u0022todo_write\u0022 || tool.status != ToolStatus::Success\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4fe2972c43e2b7d37b121921a06a3afc7c68c7d6731392b80a70852a1a58df"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060total_lines \u003E visible_lines \u0026\u0026 transcript_area.width \u003E 1\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24847ddeed2bf7f64ace96fc298308dbd83a59659c67270d3c13636e9c9953c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.is_empty() || trimmed.starts_with(\u0027#\u0027)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/approval_band_legacy.rs, crates/tui/src/tui/widgets/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"39077278b1b3a29c7c61933c379193ccacb7556b984163d47a766108062c9568"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.starts_with(\u0022diff \u0022) || trimmed.starts_with(\u0022---\u0022) || trimmed.starts_with(\u0022\u002B\u002B\u002B\u0022)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/approval_band_legacy.rs, crates/tui/src/tui/widgets/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/approval_band_legacy.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"64718033d48758b6dc2b2de48221b59077af6ad7e6c044b244e7c69bb467e5b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.starts_with(\u0027\u002B\u0027) \u0026\u0026 !trimmed.starts_with(\u0022\u002B\u002B\u002B\u0022)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/history/tool_output.rs, crates/tui/src/tui/widgets/approval_band_legacy.rs, crates/tui/src/tui/widgets/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/tool_output.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfeae6d0257411f64c2a8477d144cf89cff222cf51b729cfc406e6e7a9900bc7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060trimmed.starts_with(\u0027-\u0027) \u0026\u0026 !trimmed.starts_with(\u0022---\u0022)\u0060 appears character-identically in 3 files \u2014 crates/tui/src/tui/history/tool_output.rs, crates/tui/src/tui/widgets/approval_band_legacy.rs, crates/tui/src/tui/widgets/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/history/tool_output.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bc67c7a2b9a9f8b118309ba9c585292b5dc5b91ce3dbbec9a2f2bbc3b62bec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060underwater_atmosphere \u0026\u0026 app.motion_policy().allows_decorative()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2495740d57efdb2f9dc24028a60754e8e16e66598ec47c461466d2e600989715"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060underwater_atmosphere \u0026\u0026 crate::tui::underwater::decorative_shell_motion_enabled(app)\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"92eafac941bfc40b37628a0c6e65c077ff521c60bfc5d8cd615e74c06eef1e28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usage.input_tokens \u003E 0 || usage.output_tokens \u003E 0 || usage.prompt_cache_hit_tokens.is_some() || usage.prompt_cache_miss_tokens.is_some() || \u2026\u0060 appears character-identically in 2 files \u2014 crates/engine/src/core/engine/turn_loop.rs, crates/engine/src/model_routing.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"2369b029a070cbd5e64141185d45999621ce4b69b52ebe8ade815d0980f12e0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usage.prompt_cache_hit_tokens.is_some() || usage.prompt_cache_miss_tokens.is_some() || usage.prompt_cache_write_tokens.is_some()\u0060 appears character-identically in 3 files \u2014 crates/engine/src/cost_status.rs, crates/tui/src/tui/app.rs, crates/tui/src/tui/ui/event_loop.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/cost_status.rs"},"region":{"startLine":4238}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bfb0fe0516280919633a056d4b68c86f3618f8244e5044a7941d9205de6dc8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060used \u003C UnicodeWidthStr::width(first) \u0026\u0026 !shown.is_empty()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d59c10ebc73911e7011f2954938ea0db2f1ec472a59ef364a1a5edda010fc8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060useful || panel == app.work_surface.panel\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/work_surface/render/dock_tabs_legacy.rs, crates/tui/src/tui/work_surface/render/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/dock_tabs_legacy.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7602f0864bded97e9b9023aa7638e3761f7545a3e0c304d55750f2b734f98a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060usize::from(local_x) \u003E= start \u0026\u0026 usize::from(local_x) \u003C end\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/ocean/guarded_legacy.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ocean/guarded_legacy.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a52edb2e3934315372845425b5c585d4a1671253d8b502e30d8baf2153ef33f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060visible.is_empty() \u0026\u0026 app.work_surface.explicit_view \u0026\u0026 content_area.height \u003E 0\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/work_surface/render/body_legacy.rs, crates/tui/src/tui/work_surface/render/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/work_surface/render/body_legacy.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b942b87e2aee36724d61f0aef4ad7781090d1748609235600aabbd5720f00e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060was_explicit_tail \u0026\u0026 total_lines \u003E visible_lines\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/widgets/mod.rs, crates/tui/src/tui/widgets/transcript_legacy.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/mod.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6740520739f279a892be7b85bbbb82c5439f83cfc167a7c471cd01d729df69"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060workflow_run_id == \u0022workflow_1\u0022 \u0026\u0026 event[\u0022type\u0022] == \u0022task_completed\u0022\u0060 appears character-identically in 2 files \u2014 crates/engine/src/fleet/ledger.rs, crates/protocol/src/fleet.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":4111}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbdc6617429bced9f60e27e6701244f38a1cf691a7d9b7fcc6f928baae1c8fb9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060written == 0 || written as usize \u003E= buffer.len()\u0060 appears character-identically in 3 files \u2014 crates/config/src/config_document.rs, crates/config/src/private_directory.rs, crates/runtime/src/external_credentials.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_document.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"5538099a2e59d5b350f15538326389db3138d6f4324e909961282ffd29152af2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003C area.x || x \u003E= area.right() || y \u003C area.y || y \u003E= area.bottom()\u0060 appears character-identically in 2 files \u2014 crates/tui/src/tui/approval/tests.rs, crates/tui/src/tui/widgets/pending_input_preview.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval/tests.rs"},"region":{"startLine":3289}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3a08f9a7fc7b1ac08d32a003b29eca0007f7c4ffe8d58d6f6d90ed61d21864"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 26/29 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchReceipt: \u0060fetchReceipt\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/scripts/compare-deployed-facts.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2ad287596201a068d39264e43c876544ed2c9e9f0260a165ce23f6eca5b230"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: downloadJson: \u0060downloadJson\u0060 awaits \u0060https.get(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060https.get(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/verify-release-assets.js"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"32794156b177078f9c91b5e42e7b8fb5af59bdf9bc0b7019a76cc5266b9514b1"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: requestJson: \u0060requestJson\u0060 awaits \u0060http.request(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060http.request(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/vscode/src/api.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f846aed9c733974f7a7f14268b3eef5f2d7829e1c0ffc1c77d0af7a4b55c1e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 798 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/utils.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a917ed32ed3b40415e703a15b9f44077fe7e23b9dfdbadedc03e171fe0a8173"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 831 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/utils.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c284f3dbe932612513fb510ba4fc2ed253148554fe6ce95c8c52d52252cee3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 903 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/util/src/utils.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb0c40cb9c523c10c46eddc487903090f77287b0cfdc1b3fa172ec7a12c5b1e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 93 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/composer_history.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c7b285f89f25046e32b145cc8718d42468fd5c1d78a950ca619ab99bbbe508"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 265 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/composer_history.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6235f2b65f679297fd6c61d484a315ecc8e03e112f3b4d0ecc3abad7b1581858"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 277 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/composer_history.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a03558d400d084070e79f343a92e867e06cb5df4d78ac9176356ece6028764"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 305 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/composer_history.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f1645465fe77f5855e75813028627fde701b7357371fd56da4b9ed54687e42"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 332 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/composer_history.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca7e307bdb56d71b2b8cf70051f79dc63c501c83c038d571fc616d86b0634e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 296 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/composer_stash.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"673db3f95d0744f9f3a3c60f3e685eb9503b210e3870b2dcb8d03d2bd3cc4cb3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 367 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/composer_stash.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d816203a69861189620d70fe89a4c992188c6e2f8d27e89e622f6953cbb7c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 372 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/composer_stash.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c02da7a3c1d3a111fac513684142d03748cd074b1d8585182842106646782e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 2167 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":2167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32a013c714bb3daa6a7a488a35fbcf6ca86b5868b3981e2b45dbccc6b75bdae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 14848 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":14848}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a19fe97cfd65b3acbc8220fdd915414f9227e2073c8ab4a83249617bd52f1d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 15215 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/lib.rs"},"region":{"startLine":15215}}}],"partialFingerprints":{"codehealthFindingId/v1":"806c3cf11050d9526435c5714cdc74d865472e5602d3927a3f930b98feca3d78"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 155 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_frecency.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de972d9b2df7137ddc883e4f3e62567f7be9a30deabd6695d6219ff90dc0284"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 182 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_frecency.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e10b1170c084385ff2ae8bf6fb251eb0c35cb6ec5807379668e8f5be1493596"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 189 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_frecency.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1fff1eac4d93d119ed9752d66d61cd77b8576f676c0a21983e69efa70d13eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 312 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_frecency.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3be1b0044cf3c9f8f9f5e0d014256b42a7325d1fb9e855c0b09faae9a2f3c3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 593 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6cf062e89921781758174ebe972218360e80f0771733c8120e589982463f30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 644 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cf1a39216b0d40abe3aec3e71624cbc3c606053b440740a2a3e7890c220f56"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 651 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e954b2e3bfd0ab6e8f705aa65b3da6cdd57a8bf1faa8f69ad5d143677e98113"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3385 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/apply.rs"},"region":{"startLine":3385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fd1dc4071ce1a82a5198d019957ea21108400462f1300521c9b4ff7672fcab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1346 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b37477c32eef0e316349c46645961867c784a09e9b6a675c145e92d2fc1534f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1594 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c2765aae8be5cfb8bafe5741dbb47e25451d4f82c0b4bf96612b45cac476aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2442 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2442}}}],"partialFingerprints":{"codehealthFindingId/v1":"084421e0f57c3940a62edf2750b4a7843fcdbc89a4852ba61f4a55249ae2b538"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2511 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":2511}}}],"partialFingerprints":{"codehealthFindingId/v1":"226a135b78d72cfe02c70dd861720e4b42df62a3be9a21656c037602f307e189"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3333 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b103cc1ee5d0a29a9caeaaf3ba13a909ac1e866ca27af7967e963f63d46cbaaa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3384 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":3384}}}],"partialFingerprints":{"codehealthFindingId/v1":"042701b55418b7387ce06ced317418abfce053513dacb0bf4b6b78d99f5756de"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6109 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/event_loop.rs"},"region":{"startLine":6109}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cb8788dceddaf70a496ebe22be24ec545aefce64db34a307fb5902da118c1b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 238 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/observer_hooks.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f252d759f8af859dbf982f9b370924a3db464b27d4455e3a34cec71d1a5c24f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 265 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/observer_hooks.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"89497e7b64184372d60fcbf1ce82af8a01afc3e1eeae21d4b05b3f6e1a7c0e39"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 17 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/overlays.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf85ebcbbafbe34aad8b3648bbf913d0f850d14563ab784fd4a563d8d692a75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 334 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/ui/provider_routes.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f229b9662143695c3daf78333732458a8f944dc50c128648c5cf8aa911f5822"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 72 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/init.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccccb8d73a2e8f7dc88a868082a4f0f99148de8492587bab9dbb537035ee083c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 98 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/init.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"019a3ea5a55bab1af565d015be6cf8017b1c74bc26216cda4e43f0f930bde8d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 105 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/init.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0f39e7f456de7c0295f00a4bdda8ecceccbf9c3dee5565ef7ba4b516e68200"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 113 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/init.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"943cda352845ef98b1ebee5f1aba8c81a77d363b641ae5f65f1a885d77a7c4e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 632 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app/init.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5929de5c19a76027265234d6b7292527756fd0c8928f2237845e23d65b169ae"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 314 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/telemetry/src/decision.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa695999b25aa3d4293ed031e9ba8798dfa17a0041df9efa16b78d5391f5678"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 412 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/telemetry/src/decision.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edcb277c0c2cd569c8d30ea0e12200794857dc7271c71dbd12de4664928666d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 104 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/telemetry/src/lib.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f88e78af8b5f005f3985891880183bcfcd5016896994c4756fcf071895c19c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1673 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/state/src/lib.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"50010525527bcdfaa5a4af5cc0c11eabb7a7e2cbb4b8782a373f0e69d9742889"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 465 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0955320a92fe9b28d40eb7a33df09c90be51f79db66c00afcb53b6e2d91d2a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 715 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0f6a2eb52d59118461aae441a6b8b392ed75b0bd08481596702843d3caaf20"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 726 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/snapshot/src/repo.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a5ad75fa645ba38dbc06329c39e6c1b7887fd33f5c08e4561b210a21e7a5c9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 121 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/file_lock.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1be0052a278415ae1a73dc07a5f018014c964456378720ff0755d503fa5655"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 254 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/file_lock.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94323dde14fe7fe25ffdfcbaaf7377318f659617ca24a5878371b451c51382c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 543 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"43384da562c734900f3525606b5eb6a1b6b4a1035ba901d6d254d9c7fdc223a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 551 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0b432f5ee4928a2f3509bfaf0ffbfec15ead2c63d6880181b49c41a7ce36e7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1089 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f57853f855b23adad624306ec96a8407be5f51a412a2528ad9b576e9fd9e58"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1124 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2656fbb0a3fbcf2f64378cc436b2dacf9a35adfd6640c866c70b2299e782a4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee49585aede36c6d701850a7f5be5ba9090b7d5dd1a8568cf03a26be22a89ab"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1157 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8506a8b812dba64ee30f21445f7a1094cac5dfd2f6dd30d09730e1cef83ec6af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1191 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/secrets/src/lib.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"966a396093ef63a762ce08aa63cee5a72e20582e61d167ebd11e296946d64a35"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 795 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"324f180b9b20cd088ca75e1acfb6e1fc505aa3ee704efd333ef7bc63221bc3c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3858 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba46b29b769015310979e53129b2dd532fb7b591635e8ba8ad507f3ddd3689d9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3879 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3879}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b90d18ff1b2c67089f49d09e12a05218b7e26e1f12029a2314e621137b0b3c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3953 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":3953}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3e58180c63f847361638715e0ee638c09e0cbec5290b8ba57f83504d1700db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6893 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":6893}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dc99b3dc13765035ca794e4d1961650145d22c6a1f27ef4c6c6648f834feb3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 7071 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":7071}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d04a64f26a19577914a81c16f6a72de3710ef902f3c50b745456044d34c446a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 7720 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":7720}}}],"partialFingerprints":{"codehealthFindingId/v1":"efecc5f3d68c9a6f1c49c3f636f9ea2b92e6971ceed0cabd1696644698d23355"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 12523 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":12523}}}],"partialFingerprints":{"codehealthFindingId/v1":"0728fdecdd63555aa61cebe6fc014bcf85aaa3c99035b17c36af229ca717302c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1010 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/oauth.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d8a45b49cce01181d73a4b108209a467030ec4ad97cc37459ad0ea18720f3a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/runtime_log.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa36614f2cae4ab58f4f7cb005eeb5d9c2545336dbf174e24c6d6e84848fccd5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 174 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/runtime_log.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc6d00ba9bbff6f8892343229f5a42d644e788ae2289adb0765cca82ca613ec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 74 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/runtime_policy.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d9e973e45f76becf2a15a328032254f5e454a922995e179b401dd24a6f736d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 222 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ade51007a887e51f5d711d504ee091cb97b77598f81ea62e034926c50ecffd9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 974 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"141f2dfe422c0ebdd7b582fac2c592d239368bc10ae645a26a21765f088ec72a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1117 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9c153af31d8a3b0ef85342c8971899c946b1e677abb628b39fe3871c055423"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1521 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ebfb7ec713ca456ed022818a749a04c5157dcf2e60824e8605074b4bbf877f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2852 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"434c23b6e44635936926966ee1ef29a4ea89d180b411ea7b1328896c4840a2f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2909 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/settings.rs"},"region":{"startLine":2909}}}],"partialFingerprints":{"codehealthFindingId/v1":"240139122026484d790b799e3ef4d32f057031c3fe2724bdbb7856f92663c001"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 118 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/stall_report.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"889e918cd400e580e8649d91894f6a5b5ccba43487c3c2307a0da810a4e868df"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 79 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/startup_trace.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"b793b5f8382f17e88879069fba44054d80c51cba5fd82d9959391559c26c4fe3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 152 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/worktree.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e653dccfa593513693e4b3d83b089799c1ad93d140ddc656b2b47750e3ff37"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 301 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/worktree.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21120ddc4fbde56d0cc12b022fa572154f2f5682f31a183eb0d59a5b63f1a24"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 307 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/lane/src/worktree.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6448958d9a9c5a27b888d1861fdae7208e517b956e765be356f670459acc066"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2100 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"53454b98c1c526f815cd0da2017bc976a90d1897aac910ddc51f1346d6a72a33"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2130 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c95cd367641d529e6ab64ff62b6308bdf98cad814bbf8f0e0f3d3090f4eedf7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2152 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0eea4e4b63914705f016502f754cf3b532577ba36f7bfc4ec89dc21ab45a68"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2177 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2177}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecf0283b96a4de243310c83fa868c6f25fb97327123cbef75514e510d2c8c94"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2382 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f1c6edccd8b6c3a3d7a853a744b07b210949ba551d4d177883f569e539ea71"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2444 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"64694c34b430b068a62b60a94d152de00f66c2488d72ce3461e46266b67f81ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2454 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2454}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7f4f8c69e2450182bc760d5fc9e057fb03b9b8aa50562e81ff6cf7259503f6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2594 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe324dbd7b70a9c2dc1ad4ad455fe99010025c7610630ace3de464bb116da91"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2728 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2728}}}],"partialFingerprints":{"codehealthFindingId/v1":"33180a8d6cc0e53c243e337b916cc4ceb919e041cc0e690b4d025552cea86048"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2743 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":2743}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6f756f606df7f103b08ad0b482e4ff8bdaf80c1344aa515ba128687a583135"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3244 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c1df9592ba2e632c23a62af134c1c47b155b8bbf69bf4f67eac2a05d154fe9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3257 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3257}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fc7210919de831d36ab1754a83de18df9ba8a78783e731ff11e47a53eca21f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3286 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3286}}}],"partialFingerprints":{"codehealthFindingId/v1":"99197bbc17acb065f4e3022c424f20467768ca712e150973427ead1b114626f8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3303 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3303}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2368e3bfcb6edce0f8b8ae2d94c0184fa8915ada26d0df12e06ac6238d40f59"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3458 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3458}}}],"partialFingerprints":{"codehealthFindingId/v1":"d749696f7e83cba0ccf814cf7452105a31cbea6b148bc45caab08780ff1e7f06"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3471 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3471}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8948551fa4c7a65ee561d6c325696900208dcc080c101228eff9552d826fe8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3490 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1787e88c88f457aef6b972e23241a0bb3e200ff5b16b3c64ff046e94cc736bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3655 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3655}}}],"partialFingerprints":{"codehealthFindingId/v1":"4389b0ff43e6094f92eb6b4bf0e62677e2ecd5aaf4d365e5b357f1211d46442d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3670 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3670}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ee35ced452a34fe0b826855429a10bfcd1b7f59b1172e3ccb2be7a14a5c695"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3728 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3728}}}],"partialFingerprints":{"codehealthFindingId/v1":"428265cc3cb8e04c14ab3fa90ea88f207444198507ff9d4ae057b59a68692818"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3910 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3910}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd458ee330e9e5df168d8d39e05e4d9271315c1f08aaf63d664476dafcd2685e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3914 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3914}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a5c4e63d8b38099974698c8e7edc0eec825cb8f61a51ecca0e7dcf4c86463a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3917 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3917}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4aa3ac8bab4d7a85f8bb7413a4401fc30c8146968c8e6920639deb2370fdfbb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3920 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/automation_manager.rs"},"region":{"startLine":3920}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfd6481a35f7f45273938aee4832c87ecd1cf0e8c0ebafea87f968414ba4333"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4212 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":4212}}}],"partialFingerprints":{"codehealthFindingId/v1":"f548156f99febce02cf612f5f007809179ad883f012752a1718338ee0d748526"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5917 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":5917}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69b458386a0fbb6ee93916afae93c6974b885b889507a69d9a7954737df7c41"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5945 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":5945}}}],"partialFingerprints":{"codehealthFindingId/v1":"0262d95c40998608d234620e453bfd3646a8a84efd634bc32361252b761fd638"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 247 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_relevance.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a38b6c0382c24eef23ad4790ab340e6d21ce072a100f35be8c91901e84c0e8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1039 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45425d8ecd68f2d5f6e1c968754c66f977733a8c29467fe2f80b6eaacafd4cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1883 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/project_context.rs"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0f2ce7a15aa1c77847981eb2658ccc6cb28a0c5408ea77a26d8ef570d5ee7c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 488 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d473a847f000027a3a0e637b1e9d0da32887059e37bb9c1904cf2129c81da56b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 501 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e821942d3ee78bae0c9fb17021b805f8aba1e0ed312e84350179dea65724ff75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 509 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"2891423d6c170d1bec3ec7888b6fb4a610087ab5d9ee3844d13bb4d1ae553f39"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 524 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"a605516737e231187ca0cdf02209d8d1216322b1a45e704e01de9ec5976411f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 650 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d5454e897d23da5182c2ae4ac5fc23b15fdbd138d6a1d6976dea3faf860346"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 657 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c18f1506164c1dca2c2c6b872f316463865fc36c2ca890a07583fbb643997b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 698 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"df613dd94227196d3c291aa2ba0e9a4cebc4302286933189ff433396daed830e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 720 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/prompts.rs"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dffcb0194f74f16402ff165e2d825bb81c4d57ebe36a00ad7fa56afde4780d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3143 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":3143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3389201e2ed12c043819171d39154bd760d60283e531baca2282994f4a6297e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 3152 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":3152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df18bfd6873556cbcd7f2622cf1698fba980aa209b28955722c1d8a748adfbe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 3163 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"13552fcda21c2c8dd075c5ec66931421e3265c4711fb92acf0bc7093caaab580"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 3418 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":3418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d0a219c442cd49bd3522bff353103ab6cc8041352c996811407ccfc0014f69"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5104 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads.rs"},"region":{"startLine":5104}}}],"partialFingerprints":{"codehealthFindingId/v1":"397098329f342a160b19ea8d9274bdd062eea47f66a0180a6bbd8e04a47948e1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 6776 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":6776}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c33a9428dab9e822e095850e262a5189c1cbc5ae79e135f3855ee8267557711"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6783 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":6783}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e28620e9eb431d37ffb5072143433c63103cd3a1e62ce8d6c9148716304ae5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 6870 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":6870}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c92f0779b89d1839e42bfc40b0b34427f5a522717c0a7dea3c8004ec78044f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6873 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":6873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e36a8bbd2386dc24cc25dcbb439e55d94e27902bf820f06e67fe510b07f060"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 287 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/superfast.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"1439aa65844123424332373eb3cb0373db7165dcb1f56f2919385e239604d78d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 3163 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":3163}}}],"partialFingerprints":{"codehealthFindingId/v1":"733d78ee8a5905a86e27413697722274b1432bf1201924f66ef8749741dc93e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 3227 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":3227}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf4a1a93a81604a5584c772f0a85fa12a56930aa6c684b4811e1d918b0f81bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 3275 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/task_manager.rs"},"region":{"startLine":3275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a22f20d48aae3dcbc54eecd1e7bef39c906b8b3b21cf4028de5f6bbb803047e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 111 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/telemetry_notice.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"6547898948f3dd1e3bc10c76420e75239b44a541b9f8bbe75db1b1a9a14970e5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 118 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/telemetry_notice.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f522a3db7d57f1141c642127da6eced48001ade864a810d5035f14ff1382916"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 139 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/telemetry_notice.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e030d6ff65a4ece5d09603d9a5c44ec1c6c46095f2f8d0c65fb8c06b68b7663"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 355 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/goal.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d70eca5daec8bd3217f4c3bc250d085f9f02d523acdb5538ff72385b53aa7db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1192 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/goal.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"874258f2039f35b7e5895833c12e41056ddf153cd8accf2f4360d537683c043b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 709 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/mcp_registry.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8766fbdaf5eed6878127a30e99dbdbc463ce894912ab2fe2811090b4ecc2363"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 129 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plugin.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"93148accb2d5b9a740b89455a2d370bff8a7dc0dfccdf3391d96556c76a7335a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 522 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plugin.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b37648be2975aad6ba65dec7899326e752dd3c605cb48dda29238e208e1a83a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 566 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plugin.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c818aa203ea1b633c118245a26ece7e3eeadb5caf508417a4c4061b54c650c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 620 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/plugin.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"f154fdcb39150ce4d41f75bb145b6010d8e1eb41a6f4fe9e79a46489f52f2cec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 65 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"349bb1df9c36dff473cf9445ede3d42131814be892418729505aa88352bba4c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 497 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed0372a4b42a03a22d02748cbc9541c90c4751528eeb24a52b6df39404d9c2e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 499 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d957094932b14e2b80c97931c6d177c044fb8b6e4d88075acf8983b16b8fdef8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 503 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8f060c0669b17aedd6c2efc9f6391ed8146f4bbd260c51f39d44cfc86edd32"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 517 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5174d5105656eed02dd2bb2b3032fb3c4d8e64880e6413b4e4e1b4c2f984f16"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 521 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"4145b70e4be1ddeccc73d2c249432ec341d580b6258e46e630f3b373e6f21854"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 526 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"228d46b397083c005504dd39ef2ac409a8c183a1537dbbd02a25789bd59f4eee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 557 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"315a0eae3f543d793bce3651514a90fcfe2667dc307311d02e5944e5278ed6dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 567 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f87c07d7b1562355e8a398ae226095589e2f0dcd55727b3d1843fb3729be652"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 579 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"db50905d972eacd48f3523b319b40d76d4f722dda2e74ab8523c0538f3418cc1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 993 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/registry.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab05852aba3ff1dd3000ef093b42ae62a764ac648c667446a08cabecc3a49320"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2997 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/shell.rs"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"413ebc19950ee5eedece66064b9ffe4aaaeb301fa52b56637b4b48940218c4f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 95 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/user_input.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eeb7aac7fca2bf05bc34a255c3b862693f2a24ea03c268abf5dd9c87799c39c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 65 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"70544023242876d7b581794b276bf46f4afc208841ba8db38d57d4c5c477c876"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 82 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77d045e4bc51d7ddab0e158a58d6ef818ea63c5b1e05ff68d083e4ea990f395"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 106 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed10969d580655a17aa06e2b73fba821fe5e9dc2da41ab35fd93c72fdbc07408"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 112 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa43862d526073201f11f3471d706f15c26278721726ff8e2b800d02c1bbaa5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 118 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"187d49a680baacc2540c3afe3c9046437988347bdeebb040c0905ab1f79855cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 208 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3a4373954f721b9a0c7d9261acca26a2b76a5e01f58bebe1d02384967ef903"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 226 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e7dc2bd4299647b7000e4bfd0290d0e43a39473581d4b158d6ecef96ccbab5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 291 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/journal.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"642777b8edcad9436732b9a366b0eccbdf7e71c513d05969e7f66a47474d2c04"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 334 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/advisor.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a92035d60bf22f283069a4ccf95501090d03b3c6f2b7019562361a7cc571d1d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 342 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/advisor.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d59b6a093b5c53707f575f6384fb19f18f26f58c70fb59aad1a7edc5b2ed89"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 357 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/advisor.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbce9f13fb6e5ef39f92ceb8a4c9380bff1d1ff6251ae2197d422ffc7e40d1cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 434 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/advisor.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"7831d013df598d5ab6b0c807f20b304e9447a02379f167627c326cf95e2a6314"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 459 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/advisor.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b4cc9d36d91ac629c848dfe877139dcc21964adb65c197c0db2630b4da4d75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 466 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/advisor.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc2f0092fd84ecccbfc73c5cb0a8ff863125ee8c14f26d544e9af5200ba6520"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 481 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/advisor.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2fa8c49686d5ed21ece62a4824bdca6a82f7e97911ef210af5e05ddf2a0d30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2249 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/engine.rs"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ed339cab3fbfcd2697234e953584d58f535d4fb215a35945b2631b0b622496"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 6477 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":6477}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4714022275a7c41cee399053013c02f44f68a4ee13f0f52597e4936c050def"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 20418 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":20418}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7ac7b37b20120af7da73695cfd4dbde359d64f8a6ebc7a5e96bf637a046ea1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 179 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/worktree.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc7bfe29b911bbee76e370e0764c6ca7cf5aa80f793842fed24e39163df1309"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 198 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/worktree.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa19a61bc0fa4c15d16c6462ae71d626b401b4dc7cf67da1def46234e211b81"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3849 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":3849}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc05edc96ed8e627af8df74e79205ca7d7adc1bd1832cc9192752a6d641df47"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 6003 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6003}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0efd3bea813b361c1604b853d314d8ad937fc4bf9f70febba94211b4b557644"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 6010 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6010}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9777fb86951a78bcf20b657181e25aa4956993712472f8761f31074a9fe4d0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 6024 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6024}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d501ad94f4d25622380473d95622a8cdd84fe573ec7f1cb68e3a600eaa5896b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 6032 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6032}}}],"partialFingerprints":{"codehealthFindingId/v1":"318837b9fdc1b606dcfb57b9fe678161bb8c10ed7cde5c9e420ad8da007368a3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6050 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6050}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b24ea107e87ced34c0893bac26b5aac1f069a3503ae3d8a797c9f9cff81a1ce"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6055 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6055}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e64592d1c8d8e3731f2cfb9ef033079e019228b58596db8d8299101fb72b4f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6085 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":6085}}}],"partialFingerprints":{"codehealthFindingId/v1":"162392a0928c723396c9918f9e3dcac3e39b6665ffe504380e41df59eaedc76d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 7345 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7345}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a61acbb36f2d9c802172367b3bb46836e55ed7d3bbebcf355a85f8bfbb17e3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 7492 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7492}}}],"partialFingerprints":{"codehealthFindingId/v1":"101592312de2775d89699abecd7f57561c44aa8db79badeca6a3b6fc51c2c4f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 7510 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":7510}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3175cf3b38f31fa808bbc74f3445e5ad4c9943e53d1433528f4b5ce9c743a3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 11558 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":11558}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e1ef2817a791d295184d3ebf73e503a776582b1891423104de0994f512c4ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 12186 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12186}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe3c0cbdb3d2ea4ddf5337c713cfa83b8ddb73d6b7acf8ed766d54069360c49"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 12196 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12196}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fecd373ea8486a0c37e218a9acf99344ba06a1be0738cd3a2ad1efef460633"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 12659 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e969c14e740f742aca5c94c0389cbd303ee26fc528d2c1978cf5940a6cd6a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 12676 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12676}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a31deb46191bf59759039cd8245f93268ae932a77b8fc20ada42583a6a18682"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 12688 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12688}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f6b7f148e109960abbc86904287628925927f31a65f8652d11a7ab3025f92a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 12768 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12768}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09c691cda6bf894793b2e58d98ac12b831d7c55f1e896d4ca644dcce6eaa66c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 12785 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12785}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5e1f7a83706726e4414e894426c7628fdafe6f7eb3bed942b6ad166c2ac068"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 12795 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12795}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0f7f394da016fab190c179c370f004e643b35bc63d9af2c01ada21e788a55f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 12914 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":12914}}}],"partialFingerprints":{"codehealthFindingId/v1":"66552ecb7cc55116f9103c3a72be9061e3df004ef6c5e8255ae53a8fe0330c11"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 13009 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13009}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee6b6cf0f9b295b330995caa07844f4e3a2903e8a64ffe1dafa75bc1969908f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 13043 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13043}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2d862d09b9b6bb3d3d23928cff84b9c31576384f00ef2f13bbd2c8a0de662d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 13113 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13113}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fd16bcd8ef0b8fae41722d3f4b013cea63526a1ac5e9cc50a57485fdb12d18"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 13133 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea72c59235b2870ad8abb2062c66d135fb060393ccd686b9538e1e45cd9118e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 13147 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3eed6baef4761f50b17a0e3d193b0e3f66bb9bafd4aef1f5624c2de7b3fd88f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 13167 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13167}}}],"partialFingerprints":{"codehealthFindingId/v1":"beacc7919bbddf6d9b72e1a22b7af29a897a87927bf7a474cb282f7a4d6a49cf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 13178 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":13178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ede2d82385fc601fe36ee6d7849fa7e564fcba37ce009694753513cd55d946"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 15786 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":15786}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3ae0077dd3d6da1420aed3d697ac7fc41a990548fb6f5083d71efdeb2e66f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 15896 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":15896}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48efd67045b6f55c1cd37f53ce52418d220a285fd182e9d0ee9abaf79f5ce5f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 18118 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":18118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c54bc32fb5ce5bafe58c534c699f2beeb3b4b951714425f0123885ab0b4a9cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 18573 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":18573}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ead310d84229b3a9017302f3e3ce9d62f22e1f4feeab60988bc4d6589eeff05"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 55 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/headers.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd4382b8461eef419aef5caa4286ce641e4d4aa9ef7f24c6d1979583b8417ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 154 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/http.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb64c98b167b7f41b4f682d44dddb9a929335a4e9b5e117176fac42575e9dcb7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 55 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/sse.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1a2ae6a2cccbb52ae0b76c43648c3a6699432de9fb1840aaaecbf43aeabc7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 60 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/sse.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a66ede54678e6ac225761e0681bd415be1e23f99f3f91c72458fdb1b1591e1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 62 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/sse.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0797e496b7ae61ab664b48111d4fb529b2dc1ff54e519a201106a05031d03728"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 174 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/hooks/config.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28ca7ae51a7bfacd336dad27f1d5c0d5f5bfaf416585467e2053a0cabf4c345"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1689 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7eabe58b5cb0757cae26233d42d3a3c2d02cf6b38b99eae38b08d1da96540c8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1703 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":1703}}}],"partialFingerprints":{"codehealthFindingId/v1":"8886f17badf7cb4061752f005f65fd51df0145a9d781b11e001f7f1901269e7f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1743 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f49c368a60d70aee884ab0a9eb535a7317afd991983e6dd7bb317743dab03ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1753 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/ledger.rs"},"region":{"startLine":1753}}}],"partialFingerprints":{"codehealthFindingId/v1":"486079d87a35f6d025dc9f0080f3015280ca8e1eb2c0bfd075b3f79d92e98de3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 319 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3da110f70622e073454c39c5ddb139ff6a2c2ddb53fdfcb65d43672344edaa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 325 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"512a442f9eb44bd15da281944e2125b4467522372df2acc380cf7a1d88174721"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 338 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e77813e60b81ad023b8c0323c0678b3cf1b25ed03f9d12f5bdd8641df8efc30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 371 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf202df374d79935bf3d725435a2f634aa4aa88c037ba331ed2620962f85e76"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 384 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"93298f869cdf814a061a2c405e5585949c96c3b25d7170fc1e3173c0a4321b11"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 396 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ff61d5d0a58400de992d820b95571d678d0ab4546cad22ef337293b7e5b72d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 410 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ddf7d9aa2c14593fb72045824af58ae6042dd2de254e14e62965ee5d944933"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 431 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"131d76cab2ab4c5f29d760b4c75313e4bde765a9fe575ab191b034823084c677"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 441 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95055f458ec2aa0bbda7098014a6a56b25ddbe45375f106b02184461f84dda0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 454 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"179b7ac50d1b4647ff320e5bcf389e9dd4ee445e19ddc0619a7311ee0ee1f462"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 461 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/roster.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"d758fc3cfc9189c8877edded618b9cd286dd53dd9c041013d65261831b596cad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 799 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/mod.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c87fd22cea73af9b993156ef5f2391d6b557015c8acbde0f6f90216fdea913"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1873 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":1873}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44e942218df62d7de8055dcab54e2d275c8621a0c00f1c0ab09a6ca9e2cadfe"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2447 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":2447}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2de43837953a9d5ea311504e046f64ace8de3456565b453f48129ed0d3418cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2448 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":2448}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f61ffe502cfc2a74d484dc8e871f11fa367cf5e07545f0efec44e98f43503f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2449 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/supervisor.rs"},"region":{"startLine":2449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a89a511c3d4ccc916af4e987c115fac96e8a911c22919eb7432c5f81fea77b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 137 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e2f0d88689526018e4ad4a31b16c1c9c04ff10172bd8067fd12981b917c76f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 296 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"3513039924e2adfb10e596dcbcf2245b0880527e73bbcf7ada97a9d48e5a3ab8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 304 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/extension_host/windows.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"39435e96cc4e98523a764e4712f0c0906e34b060bb485242bc416a1df62657ac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2578 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":2578}}}],"partialFingerprints":{"codehealthFindingId/v1":"847cf658c48cd264be687b00ba72d05ee0753be4dad5e2a2f2211273a916db06"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 3906 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":3906}}}],"partialFingerprints":{"codehealthFindingId/v1":"500ffb69b44693eed9cd527b4daf4bd299bc9215d12210a146e9f537d3de8b45"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 4207 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":4207}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ad09391152ad3a32922db7fe00a4583c282767afa6b52dd28b90afbf2213e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 4623 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":4623}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbecf08ff6aca49a44b0e2ef73e297e81450f6b1c47ddf61497446784b762843"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 4906 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":4906}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f89b648bc70f6d1c5322c203ac9c38dc12d504ddecfc7c2cf3e00fad12c12d9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5051 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5051}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca8cae12cccdc2a86914ccc47c81d36c4160d4a8451405bfb182be0eb81276b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5072 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5072}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a60398dfd669d0aac86751dd27dc031c352ce56626e68aa4046c07aac58bf2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5334 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1834b19947361b4395d31a1c6c7aeae2d3b8713fb82d68850653863a71353573"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5695 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5695}}}],"partialFingerprints":{"codehealthFindingId/v1":"40122287aefae745710535186ef36801578e63f356030a122876fa40ebba4e3f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5918 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5918}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c43ccb4edc5ee7b73eb386b3f7ed53505844d4dece5566b6139edf0a891842b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5939 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5939}}}],"partialFingerprints":{"codehealthFindingId/v1":"23de65a4ac86db94d6f7e5efdb319b89f0d7c6d9c3e9b4eb2a73afca3274f176"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5968 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5968}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e468750b9c4e5895dec579187135ac7e8c37d767e695ec2c121589b3cbd2fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5999 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":5999}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1659d0c9a42a583c6ee374f213057975a7308217234ec62145b1062b0df504"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6023 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":6023}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db60082608144c274052fc27433f74c012674f839b283272833eb792a2fc30e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6029 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":6029}}}],"partialFingerprints":{"codehealthFindingId/v1":"80371911ce5c3d83e41e81ca4391a600a2b256371d68ac93776499a64c8254d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6085 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":6085}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa64eeb42b1a2c32f8c674af4dc3659849c018a12e5054bca16b17103146287d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6165 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":6165}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bdeabe02a5f5cd8e80f107e3387cad215937071f8e2e02b3164f5933b9a132"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 6177 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":6177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5304e064b344f80751932fc17223f80f5777a26628f406c14b43e20621cf37"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 8795 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":8795}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a87a2a09dc4da2ae9838297932e9abab4351203df1a4aac43f6092252d848bb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 8804 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":8804}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ef03c19cc8450fe59ee605834a261a4d4835fc23f68c7e9b74ea5d4bcfc9bf"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 9444 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":9444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9968cbecac55cab41d0fc53cf8204eb745bc81cdd4731599593545e50cd82f75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 9466 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":9466}}}],"partialFingerprints":{"codehealthFindingId/v1":"926ecd471315b60b5f6de9c0ed71999e611abbf2a5bb39fee6fe5bab77471b02"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 9755 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":9755}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ee73b2d1a7c2695db8476831d220cd532fa55be57c24822e6e146976157132"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 10660 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":10660}}}],"partialFingerprints":{"codehealthFindingId/v1":"a213d147a3ef7c63c3d87612e0d282186ba2cb2e3fbf4db4aa41579257419a2d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 10676 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":10676}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc584d7d387c0d23cb8e86317a727ab24ed79fbe4f2ed1fdb84d65c584d5aed7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 791 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/turn.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec191a7abd2b500be382a751d9e246d815f78a7a83e769a68930a998e5d6276"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 820 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/turn.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c63daed2338b5566b51519517d6a890b8a43c511e640b2e6925a53417f1ea5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 832 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/turn.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aea75a62e6df707651f0959240acf56d14ffcef6c35a0e76c9179397b3bdccd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 840 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/turn.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa922d1395669f080488231c25cd8296e4acabee249cecf54b912a83389531e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 842 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/turn.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"990cb3bc20516f00fd379e151f6c2024fffedf36ce08437170b29b90e3787b5b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 568 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/approval.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c443928faa93f4075be9b03507797a66c3bf9de4abb03f477c415b2f7a8079"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 767 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/approval.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce6e4627398d36da3073df7452473304c1183e01e6f3d599901fa9172f23696"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 211 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/preview.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"211e5a5cd52d8bb4fea39c9ec0afb5164dcea08b141aa2c3f83a00bce0151d18"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 333 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_execution.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e57cc1117c46c3ab24059812a197101f0ea7aacac3e70630e84b042e0cec74a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 341 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_execution.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4112208929396b6f2fdccd7822a2cd79cedd273317dd85f1f23acf58c2e5e1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 348 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_execution.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9762575eacadbf9996a58c612f938485768b4633be3fed3e15122080c174e75"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 357 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_execution.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccab8bba37a87ad520b2f021a8dc3aac401d9fbf01d14f90c0335c0349a94e0d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 361 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/tool_execution.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3ca056a074f35b2b173b87f5c3ad70e241450b92eedfc5634311746eb9f88f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5602 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":5602}}}],"partialFingerprints":{"codehealthFindingId/v1":"be61e5db9714d464d659fd40e47ee1423de200b8833c8f98af1c687244040d30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5725 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":5725}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d85cb2fb665ed7c2e406a8ed02bd3dd4318c33904eb43a050d42e790291ba0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 6492 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop.rs"},"region":{"startLine":6492}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a690621851846319a9fac0ada754d6b93f68918b987480e0c4a01e3b495792"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 402 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/preparation.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f66299294a09dc9635db5664b40ee5d3c1cb3f83fdbabf76f30c5c82fcbc8a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 425 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/preparation.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec381afc42943fda6f20c9e29d11d6b1242c569bb03076f3b92bb7db650c897"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 481 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine/turn_loop/preparation.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"95defdfb98a61faec1327495c3803f5a68e90ff6d6450961b16b4fea52f3d7f7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 178 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_backup.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"343e4f3a44f672a543fa033b51809e9dacf9a2a1b3db3f2804e0b30c22ea0a30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 65 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_migration.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f439f8e8d371446132af443c325e6265c6d47fa073075307bd8bba47d145b4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 861 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/config_resolve.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"236cd652028efe9b7bb990568d4ff08491e120d3e45ce2f074fe9bd3a0941b1b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 184 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/env_overrides.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ad5f69563183f56154f7be0d2b1e23a8145105a7d5818ad733c820cd1b9aac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 290 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/env_overrides.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a8634c24e92e14c8073bc31f09c52c82d66e40cb64f578afe4f553153567af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 307 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/persistence.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61220976e794bacc41e253bfb56ade62eb80998c7bf970f80e2fd1431faa6ca"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 154 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7901de35510ab20a131efaa6a3d13261177092880b440064c01a5eb4c284ee5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 542 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/private_directory.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec534da03c5ac8dec626b6fd31ca791f6d6a9e2dc92d2c867e486f987b90797"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 178 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/project_config.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aa518fddf31fe2a639426040590a2a5eaa2d4119084c00c4f8487ee4d1db18"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 197 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/project_config.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc5e8469eebcdd0fd5c1d03e35f02cbf5765b4b23f0f0256e91f406a6308bd1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 217 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/project_config.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0229c2f985a029829e207cd2f99225ac59dac54ebf3fcf55af4df31000db7ceb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 656 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/setup_state.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2fb3edecd175652986e6faa6ff89450f24bd97f8e9f92218e979344610d0c6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 667 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/setup_state.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"764ad9ea264753746714450ed5e502ff9489cb7ece07ef4175607838c34b838a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 201 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/state_dirs.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"536d8dd68be2c85bfbf400b4deca4ef669f56b63f9e8d00bca17b8439411cd77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 210 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/state_dirs.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d137006f30bbf78725dd8e4aa44c57c0353dfdf0263ad598bab77f5f5d7d235"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 230 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/state_dirs.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1122e0a87f1f6035a36bbca0f6910455c81f370124a558ae6481d0b1746be4ec"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 251 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/state_dirs.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f218e6d503047fca808089224cb85bc0178949afbeadf7cec4b5a894c318fa7f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 765 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/user_constitution.rs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"df54d87fe316127564e4c3ceffdf8ddac46b22e30adaf247ddfa41d4a6d902eb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 705 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba7452fe0bc4efd685f5f059e55955b6abd2a704f53c6bed72ef5283ed9cb2f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 719 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"3606ee00ab1c39d4cb961b0b1fd8d31cacee5df488eefa2ba663e0e70decce5d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 733 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8d635ac6fb673df1abfbde98d7847301cec57c68df524f296581a5509b5485"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 923 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a7a43280066eb29fa6129361d918bbd7b98e1713165d2d44d64f100d762ea2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 960 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff24345da682a366f0e27a9d96690c1fbfb59b05abaaacdc477d3020777a4d7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 975 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":975}}}],"partialFingerprints":{"codehealthFindingId/v1":"47bf49a024cea579cf4c93ecf462949d0dd7ff82587693fb78f0f952652a98e2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1158 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9886159424cc9761b801b0db11a4e1a1fcde01af500ae39edd9745ed2d081da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1196 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0afc16f721706c254a90ef87f8f74a626d0bceb1c7818bebe61644b688b11f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1209 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"45101622ebfb96d4b0463bd8b7baee4a849dd0a01924a864282aa2615da1f076"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 1226 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/metrics.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6b3d4112000ae8bc06f6c75b00cdb139bfb316b510159c3f2649068baf35ba"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 913 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/daemon_socket.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cbd65c6523344dee76e421489e31b18006a786f9f0301062bd0a843c07cd0c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 5043 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/remote_control.rs"},"region":{"startLine":5043}}}],"partialFingerprints":{"codehealthFindingId/v1":"69eb3fb1ac1f2228af9318f94fee64ea9de98bc278395de59c4387b8f7cd7ff9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 450 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"904a3d3a1d541372cb258c23e92a8844f1f2d23f246b7403c7617e23cb96c1d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 10731 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":10731}}}],"partialFingerprints":{"codehealthFindingId/v1":"1559d4db90a34c4ad827fb2ffc59848c9a8b647b5444c52969073f8131376a8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 14626 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":14626}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f12e9e389088f7787f7d11514411bd2cb6d3d92ed01b30ac9cca085a2422da"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 14799 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api.rs"},"region":{"startLine":14799}}}],"partialFingerprints":{"codehealthFindingId/v1":"419be9f0ee58e1d391cb082f8541f75e6b4e5b8ae0b6cb1c5451e3e485bdf560"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~0.9 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 48 assertion(s) across the 50795 source line(s) of the 469 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: pet/src/core/codewhale.ts (5), pet/src/core/evidence.ts (3), pet/src/core/ingest.ts (3). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Rust code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"108be14e4fe9e8c61764def6772aaa82dd83e1211dee2180eb851b6d1ad5063e"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Rust code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa3b5c4cc1a37b8b1ce5d27361290e034599ce3741455add456d31761f8f82d"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Rust code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea262a7083a9c40bf2e487bb832e88baa61b145b24fa3f58f347d1b5573d30d"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Rust code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_run.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd782488b2acbf9d3ac080c4b4caa2a08869f2eeebeeab5339010185853285b9"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Rust code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/scrape.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a80c3448622b821fa7dbe7d433d801b8e5cc3d9d876aed8258b34e3946cc2f2"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Rust code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/scrape.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3c92c2ff37ecbd3aaa89d85e1adb96a3ed9d84b4051957862ab66eb6c577fb"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Rust code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/scrape.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40d44e626db345d31177bb1b05a1d474fecf3a1f9a1cad4cda6c6bf940dfdc3"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Rust code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/scrape.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7257668fa40abda8c16a75bef8397bae124807a22d0e6a305204ab93ea8bdfed"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Rust code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web/scrape.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"099120a42c7980cf534dd73d61c1dbb8f8c5766de2d9c2af78c97b1cd8758384"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060created_key\u0060 (in \u0060refresh_openrouter\u0060) returns \u00600.0\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/catalog_models_dev.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9718c31110776cbe1717df5af8f1673109487b87e896725745926f86125b2995"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060file_violations\u0060 returns \u0060[]\u0060 when \u0060(OSError, UnicodeDecodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/check-reqwest-builders.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd63abaeb3340dfa490972fb9f77a1ffdfcfcd9b073b2fd5cc341ccdbdda2d6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060disk_usage_bytes\u0060 returns \u00600\u0060 when \u0060(ValueError, IndexError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure-build-cache.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"85a85e5a81873c38b22797c19333144cfaf47389d9f8474cbb08b0e57f90c431"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_reason\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app-server/src/runtime_api/computer_display.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"959b4ba9a75b32899c6a3a33ade2f6abf80e81939e9fefbdb4389e1baac936df"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060json_or_fallback\u0060 turns every \u0060Err\u0060 into \u0060\u0022{\\\u0022error\\\u0022:\\\u0022cache inspection serialization failed\\\u0022}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/debug/cache.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7c4034ae332c61b557916aa963391330840f7fbe5c172798283e79f4bfcb1f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060render_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/diagnostics_reports/receipts.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1fea668cdba49f4a7d72439ccdf95bbd2c1098df6d0f4078d4cdfc6f5d6b0e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060json_string\u0060 turns every \u0060Err\u0060 into \u0060\u0022\\\u0022unavailable\\\u0022\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/commands/src/diagnostics_reports/tool_snapshot.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffd3e6e897d3fd5ac176cbe5dc2a4a0f05287ee02580687487c5e64a8b3a717"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060display\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cinvalid notification edit\u003E\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/notifications.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6113885f93c8af6625c36e17936cae2bddf705c15562ec17888eaa314b8756"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060unpriced_used_classes\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/pricing.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81f7ed9e8cb08a5f216edecd67a2656ff1cefbbc722d2e47dcf6aa77b52344e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060snapshot_at\u0060 turns every \u0060Err\u0060 into \u0060OverlaySnapshot::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/config/src/cloud_facts/overlay.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfc9c8d7a4257d135e01cedd41798073b16e4e87227cabc43791386df2bcb17"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sessions_with_logs\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/approval_log.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe04d64a6235c681a7dcaa3b5b08e8e7b8fa170d16dc0a841cdc72af970886c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060running_background_shell_survivors\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/core/engine.rs"},"region":{"startLine":8214}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c4d72cac8325545beeece1273e8b060a0b1e57f1da7318c09a913482a75e87"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060render_toml\u0060 turns every \u0060Err\u0060 into \u0060String::from(\u0022# failed to render profile\u0022)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/fleet/profile.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"326f7080ef36107dc50f429fa5bd5596058c9748a649ea9e6fcf08b733202b32"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060router_context_json\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_inventory.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d21757be270e3bfc4e57ee58975c3b6860ad16bcea20aa404a342af70846bac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060begin\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/codemode.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9717b316b3ea730bcac9ff82f094dda2a8cc780c8f603202c38a2e58acff1f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060terminal_gate_failure\u0060 turns every \u0060Err\u0060 into \u0060Some(\u0022workflow gate board was unavailable during terminal finalization\u0022.to_string())\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/workflow/mod.rs"},"region":{"startLine":4186}}}],"partialFingerprints":{"codehealthFindingId/v1":"64650649754830c1b699a09fb4e67c235d726c7a0057b29188ac2c9f86cceb45"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060listed_limits_by_model_id\u0060 turns every \u0060Err\u0060 into \u0060std::collections::BTreeMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client.rs"},"region":{"startLine":5774}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4ee189f385dc2dc09a209968ada91e977e2c00f724c7463d01587ead0e6ba1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060fallback_title\u0060 turns every \u0060Err\u0060 into \u0060\u0022Web source\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/provider_native_search.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3554845ca78f8b83c07ce025ae5e331bc1c160e2547bac6ddae5a2b132ce35"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060project_server_names\u0060 turns every \u0060Err\u0060 into \u0060BTreeSet::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp.rs"},"region":{"startLine":7476}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6b4b4baded34b4d9577fe95dc32863292ef554abc939c90afa1e998fda83b0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060destination\u0060 turns every \u0060Err\u0060 into \u0060\u0022Invalid URL\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/external_import.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccd39aeacdf28387915ad6158ccdfa3ffcebc6b100366a3ea97c94b90f16521"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060explicit_route_candidate_providers\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/model_routing.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"37551ed05c665344ed2d6d454190d1975f0e8c01eee339bd22ba1febc6302199"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060maybe_load_persisted_cache_for_config\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_catalog_live.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef52545d83016b6135a9ac472e677a9bcc9e546381b993140c6a40c7f8989799"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060configured_providers\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed506af661e07af4b824164afecb226bf41aefdcd127f3c38fde2d55c295c6e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060models_for_provider\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/provider_lake.rs"},"region":{"startLine":1530}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21ba140e03ce8c5cb33445f7071e18302896d843dc909e2668ae41c67ac81dd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060utf8_prefix\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/session_manager.rs"},"region":{"startLine":7253}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ae84ffe5337513e120f735ed0dcfeedae6303a497b422df1d66b01f1a7db8e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060artifact_refs_from_context\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/github/shape.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b203c78dcc482a2ebc0e8f81845bea358cb690f09c97bdde4d5958c7fd4912"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060epoch_millis_now\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/subagent/mod.rs"},"region":{"startLine":13252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf85cbe94186b527880da71d216e0cac863895fd895de07e3d4651ac7cd07c9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060take_output\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/terminal_session.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a2c8ffa730d285caaaa5ca9f8b7ae436265c7e8cca00d2954bc53aa5631318"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_volcengine_results\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/tools/web_search.rs"},"region":{"startLine":3342}}}],"partialFingerprints":{"codehealthFindingId/v1":"6110dcc98323ff5f85ac04870355dbb395c3f52f4d39f48a9304e1111b582c3d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060register_persistent_interactive_runtime_usage_sink_at\u0060 turns every \u0060Err\u0060 into \u0060false\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/usage_persistence.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cdfc781ed663e02e82c23e9882859de8474c4c686f7c65a1f15768d755e4b7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060readonly_network_reads\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/execpolicy/src/command_safety.rs"},"region":{"startLine":1001}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca12f4203b480cd6cf0d1cf55107b5082b29444098f126b718500568b412191"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060list_user_theme_options\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/palette/src/user_theme.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8bf7953a1e374f5575f3db2c290c6a7dd0c8a1b3b49d2f2dbd67d9e3c2eab5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_marketplace_candidates\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/plugins/src/recommend.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67d71cc106984c6e859afba799aa943256ed0bc99ca9200f0d0eecbde0c1831"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060recovery_folders\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/installs.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6be786f5b9069a48fbfc504c5dff39151e02dfd22c154a97dcc90a86eb83bd4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_manifest\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/release/src/installs.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"070b7f4cf4a3be8be480e6d88619f79977ca09bbe03ada6f09287a37a69534fc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060http_headers\u0060 turns every \u0060Err\u0060 into \u0060HashMap::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":5307}}}],"partialFingerprints":{"codehealthFindingId/v1":"4296bbea8d081c0442fa31a7217bdcd8e223b04be52f2a8f1178927f6eb8ee8d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060default_model\u0060 turns every \u0060Err\u0060 into \u0060String::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/config.rs"},"region":{"startLine":5420}}}],"partialFingerprints":{"codehealthFindingId/v1":"9524cc9fa5e7608237aa866ad7a9c9ddd34771a880330ed3510d4e2d2ef4d857"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060drain_completed\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/lane_control.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac21b3badff469a0b31c2f3e3eff36f672094922d4be64b36062b9386b7dd53"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060count\u0060 (in \u0060script_count\u0060) turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/mutation.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"572fd699480d01bb5a2026dd1a98066dd4fb569c45cce2ee6aeaa3c1377a0b6d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060installed_specs\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/skills/src/mutation.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"810b9708e14f09b0a2b28076cbc620f546f534b3d10f084874e8a2ec649510f0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060current_locale_tag\u0060 turns every \u0060Err\u0060 into \u0060\u0022auto\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/app.rs"},"region":{"startLine":3526}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bfb22e662a289275dd3bc13aaa3ba69bad3813931c9a879d88d27e329d9e4b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060entry_summary\u0060 turns every \u0060Err\u0060 into \u0060\u0022unreadable\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/views/fleet_list.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e58801af7594d240bc9387282acd2993d713c5e579ff6335d89ca2ee04ec2b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060redacted_json_text\u0060 turns every \u0060Err\u0060 into \u0060\u0022\\\u0022[structured content unavailable]\\\u0022\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/export.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a47bb3f201b86fe1db3b64541781824923f1204c8462cfa8f39e40a9cd4087c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060render\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/session/export_json.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6dec50220668d6ce164eec9b87e16672c3ea13479b7fb8bbcfc64e2fe4f75a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060mcp_unknown_id\u0060 turns every \u0060Err\u0060 into \u0060\u0022Unknown MCP suggestion. Run /mcp recommendations to see the list.\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/groups/utility/mcp.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2495d6c64c01e10be36101920745c6cab14515f1553b186e762dc80b938a680"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_command_entries_from_component\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/commands/user_commands.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcb545f43bba9600cda47b4533e78ed764c8885083bb594090c9ed5687924b2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_stash_from\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/composer_stash.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf635c0bfb8c470f1837e2468225c0eda0dd6825f96d3313a76cf929eef1994"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060stale_temp_files\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/doctor_fix.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6021fa7b06250f34ef17e8b18f8b5c62c80ad6044204379bed9c72b8f5254f2f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060secret_files_needing_tightening\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/doctor_fix.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"995ac6219fc6ed1f317a17b7372d38c1b99df2e68aa93b1ac818b289aeeb9622"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060build_apply_patch_ask_rules\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/approval/ask_rules.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3fac232dd6e0bef0d88f707bf016826739b693c654ee3b12a9956c4f888973"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060response_ok\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022id\u0022:\u0022\u0022,\u0022error\u0022:{\u0022code\u0022:\u0022internal_error\u0022,\u0022message\u0022:\u0022failed to encode response\u0022}}\u0022#.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/control_socket.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0bc08bda3304cacdbadfc5dc1aaae50507a642787c73cb4bcfdcbbfbb2e46e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060response_error\u0060 turns every \u0060Err\u0060 into \u0060r#\u0022{\u0022id\u0022:\u0022\u0022,\u0022error\u0022:{\u0022code\u0022:\u0022internal_error\u0022,\u0022message\u0022:\u0022failed to encode response\u0022}}\u0022#.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/control_socket.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d9220224ced9fe639818ae7c46c31d92f87c998f07f50aadb9e3e842a2d14d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060modified_workspace_paths\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/file_picker_relevance.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94ebc1a0ba67bdce734dccd5336eae3e344c3a867a0187e06131e62bfd73c4e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060web_search_presentation\u0060 turns every \u0060Err\u0060 into \u0060WebSearchPresentation::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/tool_routing.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca39962e9497f7b5dbbb2bacdf640dfb8401af4c169985b9aceb2c44be724dc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060memory_size_hint\u0060 turns every \u0060Err\u0060 into \u0060\u0022\\u{2014}\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/workspace_context.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"0221cb36c67398eace4082608588311d80c9facdd2eccf774f88d34aabb4dd0c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"vendor/codewhale-ratatui/src/whale_motion/rig.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe21f468c0af52163eba0c47e9c908fb5e90a94d8bc8ef21a45ed9d32633cec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060existsOrEmpty\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/scripts/gen-inspect-catalog.mjs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5dbe78df261d62437688332102d0165ef388b4a9da9670120d862fb1ce34ce"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readPresetMetadata\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/upstream/agent-presets/metadata.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b43b982e761fb95378ba0253fa9837221d4f63a89e7704a8c97ae51999f139"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060disabledContribution\u0060 swallows every exception into \u0060return \u0027conditional\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/upstream/agent-presets/composition-inventory.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"357f9a6b855023805c2a808e12088760f098e697568f1e437e8d5a7a18760253"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safelyIsJsonValue\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/dsh/dsh-tools-compat.js"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a147a7175bc583fdbc050186c82dc2a5d2f8888db81fbcd32e67bb5c7e63ff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060bundleDigest\u0060 swallows every exception into \u0060return \u0027unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/extension-host/src/main.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4236f5f167e0dbfd59ebe8087b11c67fb980032b8eaeb8b3d47c757f4e93749"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadSyncBuf\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"integrations/weixin-bridge/src/index.mjs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0378627d51c5318c32aaad7b99fff7717996b46f56e00a7a8037a03785d18d2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060fileExists\u0060 swallows every exception into \u0060return false\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/codewhale/scripts/install.js"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02d4914317b1ce06d115fccfa7cc0ad650eb3605962acbca14253fd4ad5b853"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readErrorBody\u0060 swallows every exception into \u0060return \u0022\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"npm/runtime-sdk/index.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"451c9990e9a73674a113e57d15a247256bce3ebb6b751f153e00ace3fef03967"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060pluralCategory\u0060 swallows every exception into \u0060return \u0022other\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/i18n/plural.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0378259bda5aaeb12fee38069289670de1f111c26d0f95c1062cffe9e212317"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060withGenerationLease\u0060 swallows every exception into \u0060return \u0022unavailable\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/draft-claim-lock.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6b67f2a9213c05339ef9486bd4724b3a69df70a4e8cabe6e042d481213d37d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060createUsageRecorder.preference\u0060 swallows every exception into \u0060return \u0022off\u0022\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/lib/telemetry/product-usage.ts"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fb573dcbae46dd405308c4e09022fa202e854e480a6e886db1293012d61b14"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060joined.contains(\u0022failed\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060joined.contains(\u0022failed\u0022)\u0060 also satisfies \u0060joined.contains(\u0022fail\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":3512}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd2ccd6fe10b07edf950de823862553b74bc3bc2156230c5c49dbbbac49af2b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060joined.contains(\u00223s\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060joined.contains(\u00223s\u0022)\u0060 also satisfies \u0060joined.contains(\u0022s\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":3605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72b11248c0f84f0ac1ae4b7ac96141939d885531cff5515c52ab04f5bebdf68"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060joined.contains(\u0022scout-b-fail\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060joined.contains(\u0022scout-b-fail\u0022)\u0060 also satisfies \u0060joined.contains(\u0022fail\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":3981}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b1149c6e21521f38f74172240b0bd412e9f2965dbdffd1218afb6aefc3c97e"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060header.contains(\u0022cancelled\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060header.contains(\u0022cancelled\u0022)\u0060 also satisfies \u0060header.contains(\u0022cancel\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/tui/src/tui/widgets/workflow_panel.rs"},"region":{"startLine":4055}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b297e5ed425084d96929a73273e80489273c2ad57f5511475019513d4fb5c07"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022proxy-authorization:\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022proxy-authorization:\u0022)\u0060 also satisfies \u0060lower.contains(\u0022authorization:\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/runtime/src/safe_label.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c4a06ac5b86cacf190e0cde6adce3d9898bc453b132bad89fee726f53358f9"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022step budget exhausted\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022step budget exhausted\u0022)\u0060 also satisfies \u0060lower.contains(\u0022budget exhausted\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/error-taxonomy/src/lib.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0cd76d8a850ff4363f6e9a8ba2bea611bbcbfcf69cd946856b427f15bb1689a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022maximum context length\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022maximum context length\u0022)\u0060 also satisfies \u0060lower.contains(\u0022context length\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/error-taxonomy/src/lib.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"732d506dbf8e77ddb203c5ab7a54795345ea9e79133660c8d07b68558de16e58"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022proxy-authorization:\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022proxy-authorization:\u0022)\u0060 also satisfies \u0060lower.contains(\u0022authorization:\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/runtime_threads/manager.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72a0a9fa3bbf6c3b06ca506b6bb1da07d9c358501c543a488a440eaca8b022e"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.contains(\u0022/mcp login\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.contains(\u0022/mcp login\u0022)\u0060 also satisfies \u0060text.contains(\u0022mcp login\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/mcp/oauth.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9d8d277a10e18b35fc9b5833aadee6f302d5657fc147e457d82c42b1661c0a"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022coder\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022coder\u0022)\u0060 also satisfies \u0060lower.contains(\u0022code\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/engine/src/client/ollama_catalog.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0691aad8136a17c990bf8ab5d9a95612993167f86dde7c0ed1df63910fa03e"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-116","guid":"c0134ca8-adc7-6959-bd17-5253a265d101","name":"Improper Encoding or Escaping of Output","shortDescription":{"text":"Improper Encoding or Escaping of Output"},"helpUri":"https://cwe.mitre.org/data/definitions/116.html"},{"id":"CWE-117","guid":"1cfadbc2-a979-485e-b768-c70fc922201e","name":"Improper Output Neutralization for Logs","shortDescription":{"text":"Improper Output Neutralization for Logs"},"helpUri":"https://cwe.mitre.org/data/definitions/117.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.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-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-209","guid":"da28ecd2-f5c1-7852-ac41-a93b2d668c73","name":"Generation of Error Message Containing Sensitive Information","shortDescription":{"text":"Generation of Error Message Containing Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/209.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.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-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-862","guid":"2d96ecd7-f7f1-7f55-9f3a-43bb5bafdf33","name":"Missing Authorization","shortDescription":{"text":"Missing Authorization"},"helpUri":"https://cwe.mitre.org/data/definitions/862.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-1","guid":"a40d9a4c-89f5-4b5d-b2dc-32dc9cbfe814","name":"Insufficient Flow Control Mechanisms","shortDescription":{"text":"Insufficient Flow Control Mechanisms"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-01-Insufficient-Flow-Control-Mechanisms"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"}]}],"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":176,"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."]}]}