{"$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":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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":"AX7","name":"Slice cohesion","shortDescription":{"text":"Slice cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/AX7"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXA1","name":"Runtime unauthenticated reachability","shortDescription":{"text":"Runtime unauthenticated reachability"},"helpUri":"https://codehealth.canine.dev/dimensions/AXA1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXH1","name":"Runtime security headers","shortDescription":{"text":"Runtime security headers"},"helpUri":"https://codehealth.canine.dev/dimensions/AXH1"},{"id":"AXI1","name":"Runtime container hardening","shortDescription":{"text":"Runtime container hardening"},"helpUri":"https://codehealth.canine.dev/dimensions/AXI1"},{"id":"AXR1","name":"Runtime accessibility (rendered)","shortDescription":{"text":"Runtime accessibility (rendered)"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"id":"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":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"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":"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":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"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":"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":"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":"ActivityRail.ActivityRail (cyclomatic 290): ActivityRail.ActivityRail has cyclomatic complexity 290 (threshold 15). Of this number, 117 points are the body\u0027s own statements and 173 belong to 72 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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"040019577c795058e87048424532fb2975a79092964a0d985315508857231368"}},{"ruleId":"D1","level":"warning","message":{"text":"AppShell.ReadyAppShell (cyclomatic 164): AppShell.ReadyAppShell has cyclomatic complexity 164 (threshold 15). Of this number, 77 points are the body\u0027s own statements and 87 belong to 54 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":"desktop/src/components/layout/AppShell.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67399bc9373102adb9122f4a8cc7d21f4f908a3f142e271c44b053addde0276"}},{"ruleId":"D1","level":"warning","message":{"text":"Loop::run_streaming_inner (cyclomatic 163): Loop::run_streaming_inner has cyclomatic complexity 163 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/agent/run_loop.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"582bf06d5643a0c2672f2eff7af1d6524d9a6f2248f2915049583f2aec093c69"}},{"ruleId":"D1","level":"warning","message":{"text":"runCase (cyclomatic 149): runCase has cyclomatic complexity 149 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/run.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"324b62192c451987886ddd572ad784293e14794e7341637a749c75817747e3dd"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionsScreen.SessionsScreen (cyclomatic 147): SessionsScreen.SessionsScreen has cyclomatic complexity 147 (threshold 15). Of this number, 70 points are the body\u0027s own statements and 77 belong to 31 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":"mobile/src/screens/SessionsScreen.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"128f8a8ba7187044c3cadbdb737d327a8baf87f2ae04fa9f023d116701973932"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeStage.VibeStage (cyclomatic 143): VibeStage.VibeStage has cyclomatic complexity 143 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 100 belong to 40 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":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"151cee6a2b821376d6122c25b13f03adb69254aa6488f67d5a1070099f24768c"}},{"ruleId":"D1","level":"warning","message":{"text":"liveApply.createProjector.processEvent (cyclomatic 125): liveApply.createProjector.processEvent has cyclomatic complexity 125 (threshold 15). Of this number, 121 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ed81552fd2948df20a661d6e2e3e07630137064800970b658a1b8b37a9276c"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::rpc::commands::handle_command_internal (cyclomatic 124): future_agent::rpc::commands::handle_command_internal has cyclomatic complexity 124 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ce6ce7338ece915af4b88ae0b4084e87c9386228bc2faeaf65c6854d5af90f1"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::keys::matches_key (cyclomatic 123): future_tui::keys::matches_key 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":"tui/src/keys.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"c569cc0be676b0a0aad18edb4b9924adff87dbaea9cf5f2d5612adfee5eb4ee4"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatScreen.ChatScreen (cyclomatic 120): ChatScreen.ChatScreen has cyclomatic complexity 120 (threshold 15). Of this number, 63 points are the body\u0027s own statements and 57 belong to 30 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":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e320826475b829dcad6892b58590c1608c047a101ca58327d52d49fe0e5b56a7"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerSession::prompt_internal (cyclomatic 98): ServerSession::prompt_internal has cyclomatic complexity 98 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6817a31e4ed28e350b8aab26d1b278da60103988b074aa46d2febcaac93f28"}},{"ruleId":"D1","level":"warning","message":{"text":"Workbench::handle_overlay_key (cyclomatic 95): Workbench::handle_overlay_key has cyclomatic complexity 95 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/mod.rs"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf599f6c37d7debca168a70c523e9db756b6b924c3ec82996aea6f6a87ce7eb"}},{"ruleId":"D1","level":"warning","message":{"text":"useRemoteTimeline.useRemoteTimeline (cyclomatic 93): useRemoteTimeline.useRemoteTimeline has cyclomatic complexity 93 (threshold 15). Most of this is not in the body itself: 2 of the 93 points are its own statements and the rest belongs to 15 function literals inside it that branch (lines 648, 416, 362, \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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb499cdf162b16766f86446a63b5fbe16ec32c28ebb32006e6a04dea893e7cdc"}},{"ruleId":"D1","level":"warning","message":{"text":"TimelineCard.TimelineCardView (cyclomatic 90): TimelineCard.TimelineCardView has cyclomatic complexity 90 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 18 belong to 6 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":"mobile/src/features/chat/messages/TimelineCard.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"227172fec593817adcaa54b397a80b36d2f2e24d95bcd6d152f54ca0eeb45f71"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::dispatch (cyclomatic 89): future_cli::dispatch has cyclomatic complexity 89 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10792f96f5c650e8a1961dbf556a1011d571b819f47b3a8fefc73e21373d482"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageBlock.MessageBlockImpl (cyclomatic 89): MessageBlock.MessageBlockImpl has cyclomatic complexity 89 (threshold 15). Of this number, 79 points are the body\u0027s own statements and 10 belong to 5 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":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be163d27b25a109ded759c4e60276057199a472ec6b070c9eb1e529885aef63"}},{"ruleId":"D1","level":"warning","message":{"text":"runRemoteLiveCase (cyclomatic 87): runRemoteLiveCase has cyclomatic complexity 87 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 69 belong to 31 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":"harness/lib/remote-live.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6080e1ba95999fa34cd46634c737067a8488b240c1faaf15f9c968d508e2039"}},{"ruleId":"D1","level":"warning","message":{"text":"future_channel::feishu::prompt_loop::run_prompt_loop (cyclomatic 86): future_channel::feishu::prompt_loop::run_prompt_loop has cyclomatic complexity 86 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/prompt_loop.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d51eeaef1fffd284f54f86d43008af6e3914a8494fcc3aad0057494ae53c30"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentThread.AgentThread (cyclomatic 84): AgentThread.AgentThread has cyclomatic complexity 84 (threshold 15). Of this number, 57 points are the body\u0027s own statements and 27 belong to 14 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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"552faa1fbdf40a94e91245563b7ba716b9c0af097692ae0ac74d01da0a2365fd"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteContext.RemoteProvider (cyclomatic 84): RemoteContext.RemoteProvider has cyclomatic complexity 84 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 51 belong to 28 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":"mobile/shot/mock/RemoteContext.tsx"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"371c1a2c1a10c5b494a557fcf82e54e1bc82e75322ab2d2552cde49f6c584495"}},{"ruleId":"D1","level":"warning","message":{"text":"runCliCase (cyclomatic 84): runCliCase has cyclomatic complexity 84 (threshold 15). Of this number, 76 points are the body\u0027s own statements and 8 belong to 16 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":"harness/lib/cli-driver.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a2e9ba7db9a2a90800f7726c401f2a55127913935efedfaf5a7f020d2054a1"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::run::quit (cyclomatic 82): future_tui::workbench::run::quit has cyclomatic complexity 82 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/run.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c90e87146d0d77f539f4a286ad6e278c6a626bccec2a2728276a31461838f6f"}},{"ruleId":"D1","level":"warning","message":{"text":"runRemoteMobileCase (cyclomatic 82): runRemoteMobileCase has cyclomatic complexity 82 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 60 belong to 28 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":"harness/lib/remote-mobile-live.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a5ac8ea0e6d97a9e8c442a5a5995f50836fb8705d2e5859b7903303016bd18"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposerDock.ComposerDockView (cyclomatic 81): ComposerDock.ComposerDockView has cyclomatic complexity 81 (threshold 15). Of this number, 59 points are the body\u0027s own statements and 22 belong to 10 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":"mobile/src/features/chat/components/ComposerDock.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca47eb50889aa850f9658a6b6302bd18210476af5e3eec1f121abb082f9bdb8"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposerControls.ComposerControls (cyclomatic 73): ComposerControls.ComposerControls has cyclomatic complexity 73 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 30 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":"desktop/src/features/agent/composer/ComposerControls.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b077a1826fd373cbdf49afc9dccfb7320b287fd1ce982222cea8dbde01b2c3"}},{"ruleId":"D1","level":"warning","message":{"text":"replay.readRunReplay (cyclomatic 73): replay.readRunReplay has cyclomatic complexity 73 (threshold 15). Of this number, 71 points are the body\u0027s own statements and 2 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":"packages/thread-projection/src/replay.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b714a03646bd00e2a8b230dc9f83b10dbd2a8e6b74489d15f628cf86ff872b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Workbench::handle_key (cyclomatic 71): Workbench::handle_key has cyclomatic complexity 71 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/mod.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5332f1426c3998faff94d3acfe922974be1b425dcf7eac7f59fef4dfa8a92b2"}},{"ruleId":"D1","level":"warning","message":{"text":"FusionToolRow.FusionToolRow (cyclomatic 68): FusionToolRow.FusionToolRow has cyclomatic complexity 68 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 47 belong to 6 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":"mobile/src/features/chat/messages/FusionToolRow.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3466b38f2cf3409c0b49fe5bfd07c5d853cdbfb407584206885549e98fc3c9f"}},{"ruleId":"D1","level":"warning","message":{"text":"TasksSettingsPage.TaskForm (cyclomatic 68): TasksSettingsPage.TaskForm has cyclomatic complexity 68 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 30 belong to 13 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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d512ae6f138b18b28567f0ce52c366a4f50e494c7b04ad83880dd6328f295a"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdatePage.UpdatePage (cyclomatic 67): UpdatePage.UpdatePage has cyclomatic complexity 67 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 18 belong to 6 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":"desktop/src/features/settings/UpdatePage.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f70cd226c66e005d93092cb8057873ef591fbc889d09bc8ee13a76b9b37f6e2"}},{"ruleId":"D1","level":"warning","message":{"text":"analyzeRun (cyclomatic 67): analyzeRun has cyclomatic complexity 67 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 25 belong to 21 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":"harness/lib/analyze.mjs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6c694df9afc3aafcd4391e8842d1b2b7308602c1c2e2a4e1bd91d9b66ad527"}},{"ruleId":"D1","level":"warning","message":{"text":"ContextPanel.ContextPanel (cyclomatic 65): ContextPanel.ContextPanel has cyclomatic complexity 65 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 27 belong to 12 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":"desktop/src/components/layout/ContextPanel.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2165d6f23a57d8c44bc6a36332191c45901e8170aea953b0fa82475c908685ee"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalView.TerminalView (cyclomatic 63): TerminalView.TerminalView has cyclomatic complexity 63 (threshold 15). Most of this is not in the body itself: 1 of the 63 points is its own statement and the rest belongs to 23 function literals inside it that branch (lines 277, 79, 190, \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":"desktop/src/features/terminal/TerminalView.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7008ba27601fe1cd700f5973f3d7abb7487cc8e7c3980b328bc0e492a086357"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionList.SessionList::renderRow (cyclomatic 63): SessionList.SessionList::renderRow has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent 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: one other method here (SessionList.SessionList) 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6629e74c88ade6e782fc403ffa614a4282c8b1660a10b734108653d46d9acef"}},{"ruleId":"D1","level":"warning","message":{"text":"ArtifactDetailPanel.ArtifactDetailPanel (cyclomatic 62): ArtifactDetailPanel.ArtifactDetailPanel has cyclomatic complexity 62 (threshold 15). Of this number, 46 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":"desktop/src/features/artifacts/ArtifactDetailPanel.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6b69e7db38e4ff16bc694f1e913293dc0280f0d5cfd685643cfd2c7b68bcc7"}},{"ruleId":"D1","level":"warning","message":{"text":"OnboardingGate.OnboardingGate (cyclomatic 62): OnboardingGate.OnboardingGate has cyclomatic complexity 62 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 29 belong to 10 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":"desktop/src/components/layout/OnboardingGate.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b9e950569f4dbea811a41a9910522f8324b6acc5ddde63b3750d44ed362c99"}},{"ruleId":"D1","level":"warning","message":{"text":"FusionActivity.FusionActivity (cyclomatic 61): FusionActivity.FusionActivity has cyclomatic complexity 61 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 39 belong to 6 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":"desktop/src/features/agent/FusionActivity.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c4763b5d8825307889fd0ee2e6b8fe040e0e8131d633e108d63f91b9e65586"}},{"ruleId":"D1","level":"warning","message":{"text":"writeReport (cyclomatic 61): writeReport has cyclomatic complexity 61 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 8 belong to 17 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":"harness/lib/report.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b90b23688b0bbdb919b7afada0efaa65a0436383ac01165067cd6f8520f09c"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteView.RemoteHostSection (cyclomatic 60): RemoteView.RemoteHostSection has cyclomatic complexity 60 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 30 belong to 16 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":"desktop/src/features/remote/RemoteView.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26e594e900b3edf5b94d905b7c602f59a49355544ad468f4a18c603aae76923"}},{"ruleId":"D1","level":"warning","message":{"text":"main (cyclomatic 60): main has cyclomatic complexity 60 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 8 belong to 21 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":"harness/cli.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"557bbbd84bd3d9cd4cda312238272280dbc5142bc2b796025d316740fbb8c5f3"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalPanel.TerminalPanelShell (cyclomatic 59): TerminalPanel.TerminalPanelShell has cyclomatic complexity 59 (threshold 15). Of this number, 42 points are the body\u0027s own statements and 17 belong to 5 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":"desktop/src/features/terminal/TerminalPanel.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2765f9634df11e4ae80091da0163e7283fd452610c30bdb74809fac943c9de10"}},{"ruleId":"D1","level":"warning","message":{"text":"Input::handle_key (cyclomatic 58): Input::handle_key has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/input.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce79dbbde0fcf1773b5923c95b2b6f23169e80020ccfbcf651f6133d8be1be2"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::run::event_loop (cyclomatic 58): future_tui::workbench::run::event_loop has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/run.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"de82e791700f8b588ee5e0d71dc4b26e2d13308eb45a4c0da2e87923e73b5e80"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteContext.RemoteProvider (cyclomatic 57): RemoteContext.RemoteProvider has cyclomatic complexity 57 (threshold 15). Most of this is not in the body itself: 2 of the 57 points are its own statements and the rest belongs to 25 function literals inside it that branch (lines 1038, 863, 922, \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":"mobile/src/remote/RemoteContext.tsx"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5323e16a53a0606db7a4acf1362c9b3af2d0b6e8f95e4ab60d44aa83e7c790"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::remote_host::business::catalog::execute (cyclomatic 56): future_host::remote_host::business::catalog::execute has cyclomatic complexity 56 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/catalog.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"215b648e7b43d17084442f697f0a8b6adaf1f89a4be036123bba7e131d458a66"}},{"ruleId":"D1","level":"warning","message":{"text":"ApprovalPrompt.ApprovalPrompt (cyclomatic 55): ApprovalPrompt.ApprovalPrompt has cyclomatic complexity 55 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 32 belong to 8 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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b109bccab337269aae14bc0ac0effc9f3313a6a694956cd56aad41af135b14"}},{"ruleId":"D1","level":"warning","message":{"text":"Live::command (cyclomatic 54): Live::command 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":"tui/src/workbench/live.rs"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c9d302136dcd68733edd7b26a729533508c3085fd04d755135cb9e3b57d34f"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreadSearch.ThreadSearch (cyclomatic 54): ThreadSearch.ThreadSearch has cyclomatic complexity 54 (threshold 15). Most of this is not in the body itself: 12 of the 54 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 153, 124, 67, \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":"desktop/src/features/agent/search/ThreadSearch.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67b3eac7aeaf2047c1b34ecc919671605907eee4b94ea74dad996a4b6e310c5"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionList.SessionList (cyclomatic 54): SessionList.SessionList 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. This shape REPEATS in the file: one other method here (SessionList.SessionList::renderRow) 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c446058304f9c3a8b4416d2c959a6f054287de4113ebac8099c19f1865ac5e5"}},{"ruleId":"D1","level":"warning","message":{"text":"RunClient::run (cyclomatic 53): RunClient::run 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":"cli/src/rpc.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"a771e91486bf606e3055bc3b98e8f96add7b58e191d4d7cfb9625f20b539f871"}},{"ruleId":"D1","level":"warning","message":{"text":"driver.main (cyclomatic 53): driver.main 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":"harness/tui/driver.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf00758fd8a7d7f2346f6bfe5a2c8f3b3980195a310506183d52917d7ab45603"}},{"ruleId":"D1","level":"warning","message":{"text":"useDesktopConnection.useDesktopConnection.connect (cyclomatic 53): useDesktopConnection.useDesktopConnection.connect has cyclomatic complexity 53 (threshold 15). Most of this is not in the body itself: 5 of the 53 points are its own statements and the rest belongs to 15 function literals inside it that branch (lines 446, 583, 529, \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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f91ca1b65801539b8b23ab9a4381a3ae6262840a41f3c7c8de00e950183bba5"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::remote_host::business::history::execute (cyclomatic 52): future_host::remote_host::business::history::execute has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/history.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ed110944b5588fa5071a4d86c77782df98e58877b8642aba331afdd61e3ed5"}},{"ruleId":"D1","level":"warning","message":{"text":"Workbench::handle_surface_mouse (cyclomatic 52): Workbench::handle_surface_mouse has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/mod.rs"},"region":{"startLine":3541}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8bbdc99c3a8bb8127fe9593ee2559f719c9064ddecc4449694d4804af1358a"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::index::parse_args (cyclomatic 52): future_tui::index::parse_args has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/index.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"853dfb12a58c3eb2668a170c786df2478b03717695ee84941d0f71d75d3d331f"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteComposer.RemoteComposer (cyclomatic 52): RemoteComposer.RemoteComposer has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: 2 other methods here (RemoteComposer.RemoteComposer::pasteFiles, RemoteComposer.RemoteComposer::send) 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f312aa9ea0b25940aa569d97fc6e8c00446e5a6965793d4e1445d72f4b75a57"}},{"ruleId":"D1","level":"warning","message":{"text":"useTimelineController.useTimelineController (cyclomatic 52): useTimelineController.useTimelineController has cyclomatic complexity 52 (threshold 15). Most of this is not in the body itself: 6 of the 52 points are its own statements and the rest belongs to 23 function literals inside it that branch (lines 624, 881, 750, \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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af1892a60a035a96eefb9ca7770387a66324424b62f1822ca73d65a374a3c9c"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::fusion::progress (cyclomatic 50): future_tui::workbench::fusion::progress 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":"tui/src/workbench/fusion.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57872a185f1db457a5916c173b2b692eaacdfed3f51249ebba320731632e8e9"}},{"ruleId":"D1","level":"warning","message":{"text":"sendPipeline.runSendPipeline (cyclomatic 50): sendPipeline.runSendPipeline has cyclomatic complexity 50 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 7 belong to 6 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":"desktop/src/features/agent/sendPipeline.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39cdd3fe773802a292deaab684b88b734529340ec36e6926263ced86cd239ea"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session::set_session_command (cyclomatic 49): future_cli::commands::session::set_session_command has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdfebfe5bac12f22f93ba301de103de329b4aa1f30117ffa4b4a75e881967ff"}},{"ruleId":"D1","level":"warning","message":{"text":"ImagePreview.ImagePreview (cyclomatic 49): ImagePreview.ImagePreview has cyclomatic complexity 49 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 26 belong to 11 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":"desktop/src/features/filepreview/ImagePreview.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e971b646c66bae8cb5104930fc551d7e705864688859e6305c8afb7d91569122"}},{"ruleId":"D1","level":"warning","message":{"text":"SyncEngine.runReconcile (cyclomatic 49): SyncEngine.runReconcile has cyclomatic complexity 49 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 8 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a221af86f4e661db453703b11bc95c9a35781bf3fc85e6840a96ec0a30f637"}},{"ruleId":"D1","level":"warning","message":{"text":"PendingApprovalCard.PendingApprovalCard (cyclomatic 47): PendingApprovalCard.PendingApprovalCard has cyclomatic complexity 47 (threshold 15). Of this number, 44 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":"mobile/src/features/chat/messages/PendingApprovalCard.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5232e0fb3aa00a165e4005cf95d22b692c0d75934065a7213c481d34ed17f5"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::run::parse_run_args (cyclomatic 46): future_cli::commands::run::parse_run_args 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":"cli/src/commands/run.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41f1ce83bb849eb7fdcb026cbf43c36c7d3c883abcb314ab51825e975f2626f"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::remote_host::business::settings::execute (cyclomatic 46): future_host::remote_host::business::settings::execute has cyclomatic complexity 46 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/settings.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e09b6e6c524c13b81ca8548c83bea231d6ab85f0066fedee338b680b9ed7868"}},{"ruleId":"D1","level":"warning","message":{"text":"useRemotePeers.useRemotePeers (cyclomatic 46): useRemotePeers.useRemotePeers has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 1 of the 46 points is its own statement and the rest belongs to 24 function literals inside it that branch (lines 462, 218, 389, \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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"956d63cddd37f86ce05ec39716b05d438d3dc697b10283a696ea84720219c40e"}},{"ruleId":"D1","level":"warning","message":{"text":"useSendMessage.useSendMessage (cyclomatic 46): useSendMessage.useSendMessage has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 1 of the 46 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 120, 163, 174, \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":"mobile/src/features/chat/useSendMessage.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dce2488dfe52da27ccc90b57be3f6f414bc53e85247822d6a32b044485d2a79"}},{"ruleId":"D1","level":"warning","message":{"text":"MergedRows.MergedRows (cyclomatic 45): MergedRows.MergedRows has cyclomatic complexity 45 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 13 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":"desktop/src/components/layout/MergedRows.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"996ee2c08d27bedf85b95a85c2d20cd7b81e3dafa00eb42f576b1485ac214946"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteConversationView.RemoteConversationView (cyclomatic 44): RemoteConversationView.RemoteConversationView has cyclomatic complexity 44 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 20 belong to 5 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":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52b0c1ec5b5c77a97a87a497a704bf49fa18b4287835c385e1b67b432e3d5f6"}},{"ruleId":"D1","level":"warning","message":{"text":"useRemotePeers.handleCatalog (cyclomatic 44): useRemotePeers.handleCatalog has cyclomatic complexity 44 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 13 belong to 7 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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4e30ea9d42d6d02a53bf26b20a9189538253fea9d8f166298ed5d0798a1b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillsSettingsPage.SkillsSettingsPage (cyclomatic 44): SkillsSettingsPage.SkillsSettingsPage has cyclomatic complexity 44 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 28 belong to 7 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":"mobile/src/features/settings/SkillsSettingsPage.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca798f1e7a451ec5fd134cea72af0225f3aee200f5e5d4563785053fd0da4da8"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteStore::recover_segmented_run (cyclomatic 43): SqliteStore::recover_segmented_run 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":"agent/src/session/content/recovery.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cc514e9297696de6f754d1266ff59613f59dccbf87f92fc4484556f71ad6f8"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session_transcript::parse (cyclomatic 43): future_cli::commands::session_transcript::parse 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":"cli/src/commands/session_transcript.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a740462c4ca62352747e548133af0266f1fde7ed8f0bb5106e869249e77b587a"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::task::edit (cyclomatic 43): future_cli::commands::task::edit has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/task.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"267f3d1bc975cee08875de72aaada37f532895a195a9b573eed9816a988dd83c"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::tools::tools_call (cyclomatic 43): future_cli::commands::tools::tools_call 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":"cli/src/commands/tools.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"41485041864a266a4e92072d6bfa523eb7b9b19540902712831619bf4589a8b7"}},{"ruleId":"D1","level":"warning","message":{"text":"MdParser::parse_block_start (cyclomatic 43): MdParser::parse_block_start has cyclomatic complexity 43 (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":"tui/src/components/markdown.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf686d5e59a47878b4efa175caa4d9dada510fa7e887fd62b837429323a5fd1"}},{"ruleId":"D1","level":"warning","message":{"text":"FusionStepBody.StepResponse (cyclomatic 43): FusionStepBody.StepResponse has cyclomatic complexity 43 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 22 belong to 11 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":"desktop/src/features/fusion/FusionStepBody.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"719eb2e1e7ee9b48a7473ca458ddfd546ecb4dbaf0ee551cb7f8c1f36996995d"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteFilesPanel.RemoteFilesPanel (cyclomatic 43): RemoteFilesPanel.RemoteFilesPanel has cyclomatic complexity 43 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 16 belong to 7 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":"desktop/src/features/remote-peer/RemoteFilesPanel.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"41072247b548c65235f1dce5df6ae03cbf0eda298f4dafdc125e223821bc6b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"RemotePeerSettings.RemotePeerSettings (cyclomatic 43): RemotePeerSettings.RemotePeerSettings has cyclomatic complexity 43 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 19 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":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c238ab3515a8e8e6422caadc0584af4efffb53ce870ab01114ff6b23d5a774"}},{"ruleId":"D1","level":"warning","message":{"text":"ComposerToolbar.ComposerToolbar (cyclomatic 42): ComposerToolbar.ComposerToolbar has cyclomatic complexity 42 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 19 belong to 8 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":"mobile/src/features/chat/composer/ComposerToolbar.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dcedf9094248e44016abade7c0bc45dd6f71cad0f7c78fa34b574396ffcdcc"}},{"ruleId":"D1","level":"warning","message":{"text":"SyncEngine.applyOps (cyclomatic 42): SyncEngine.applyOps has cyclomatic complexity 42 (threshold 15). Of this number, 39 points are the body\u0027s own statements and 3 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5830cc4906f6d5bb84ecd141a61677b4b706a7b0fa1881c98001435c4f572d9"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteStore::reclaim_settled_journals (cyclomatic 41): SqliteStore::reclaim_settled_journals 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":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbd7dedc3d20bd446aa4c7f5230971cd891a3ffaf0691c0cd74266223fc75fb"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::sqlite_store::transcript::insert_transcript_entries (cyclomatic 41): future_agent::session::sqlite_store::transcript::insert_transcript_entries 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":"agent/src/session/sqlite_store/transcript.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3777181fc859b996c6dc41debb5e643833e091a4f7e44bba15e4e4dc9216312c"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::screen::compose (cyclomatic 41): future_tui::workbench::screen::compose 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":"tui/src/workbench/screen.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c95d9d2b84e88454f036ab9db2ccd7b90337f79d8a4142808009632b262b4b"}},{"ruleId":"D1","level":"warning","message":{"text":"MentionEditor.MentionEditor::handleKeyDown (cyclomatic 41): MentionEditor.MentionEditor::handleKeyDown 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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0167b35a3e73dcb9fee409299e6c490f839e5b2ef4518e33132548680d184ba"}},{"ruleId":"D1","level":"warning","message":{"text":"useTimelineController.useTimelineController.loadHistory (cyclomatic 41): useTimelineController.useTimelineController.loadHistory has cyclomatic complexity 41 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 4 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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d166056fb299acf18ae00de997d0ad3870e00b360fe2b6e0eb47e6703cbf838"}},{"ruleId":"D1","level":"warning","message":{"text":"SessionFilesPanel.SessionFilesPanel (cyclomatic 41): SessionFilesPanel.SessionFilesPanel has cyclomatic complexity 41 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 19 belong to 11 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":"mobile/src/features/chat/components/SessionFilesPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"300b53179470db8200f47aba95c7e189563fefd579bfb504276b352814db1514"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::legacy_import::parse_sources (cyclomatic 40): future_agent::session::legacy_import::parse_sources 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":"agent/src/session/legacy_import.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d221b2b4671caec3198e79150ee286635688fa6463da054fd687666dc4a2639"}},{"ruleId":"D1","level":"warning","message":{"text":"Supervisor::catalog_loop (cyclomatic 40): Supervisor::catalog_loop 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":"packages/remote-server/src/supervisor/publisher.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe3fcbcb207e9fe03ad4f5e31b47fc110d5b667a481d7c06b7c61443827de4b"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::picker::rows (cyclomatic 40): future_tui::workbench::picker::rows 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":"tui/src/workbench/picker.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbeedcd16c86fe4f0468cf5fb4b784c56f634bf39f0fd49b964df9b38303b2ae"}},{"ruleId":"D1","level":"warning","message":{"text":"PairingScreen.PairingScreen (cyclomatic 40): PairingScreen.PairingScreen has cyclomatic complexity 40 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 22 belong to 11 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":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33f5e4ee52fb7fa30cfc24d49ed9d6533217d1d8111e6c9afa0c864ea69abc4"}},{"ruleId":"D1","level":"warning","message":{"text":"deterministicFindings (cyclomatic 40): deterministicFindings has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 2 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":"harness/lib/analyze.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"38330a4adfdef3d3447d80a26ebc03556edd72fcb1259b958cdd9e3742d03729"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session_transcript::filter_entry (cyclomatic 39): future_cli::commands::session_transcript::filter_entry 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":"cli/src/commands/session_transcript.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c5c5199744b73db4f748256320cf153c0a37a0a57dd05a4d0578e19f1d9315"}},{"ruleId":"D1","level":"warning","message":{"text":"AnsiCodeTracker::feed (cyclomatic 39): AnsiCodeTracker::feed 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":"tui/src/utils.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd1b983ad28a9101a060e52085a20d761f6bd7436b4c8a7c09cbd9ccc196d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::keys::parse_key (cyclomatic 39): future_tui::keys::parse_key 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. This is NOT this file\u0027s highest cyclomatic complexity: future_tui::keys::legacy_sequence_key_id (cyclomatic 66) 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":"tui/src/keys.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d115f096afe5f4cc001fc974c1a4af8292a65f0c2fb8caadd3cf2c7025abb63f"}},{"ruleId":"D1","level":"warning","message":{"text":"usePromptOutbox.usePromptOutbox.sendMessage (cyclomatic 39): usePromptOutbox.usePromptOutbox.sendMessage has cyclomatic complexity 39 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 10 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"4997a9b58dc6415b82817fd625c554046629c299d3bba33f596550e4bc3b8889"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteStore::import_legacy_cancellable (cyclomatic 38): SqliteStore::import_legacy_cancellable 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":"agent/src/session/legacy_import.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd2efb415d9c25a0b7cde9ebbd3c4b151436193ff20b6b312d42637f41a53e9"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::remote_host::business::tasks::execute (cyclomatic 38): future_host::remote_host::business::tasks::execute has cyclomatic complexity 38 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"306ee0a60c82253a287b161bbd2346560242cc0977c6b3f9e2d0cd30004f5bdc"}},{"ruleId":"D1","level":"warning","message":{"text":"useSessionMessageEvents.useSessionMessageEvents (cyclomatic 38): useSessionMessageEvents.useSessionMessageEvents has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 38, 122, 68, \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":"desktop/src/features/agent/runtime/useSessionMessageEvents.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7001599b02eb968583cc47fe82c109689dd700f59aa09bd4ee792d549d677b9b"}},{"ruleId":"D1","level":"warning","message":{"text":"useChatFiles.useChatFiles.openOrShare (cyclomatic 38): useChatFiles.useChatFiles.openOrShare has cyclomatic complexity 38 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 4 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"8387a164fd132a2fb64e4ec1e35892ef59cbb2bf3a4c217896a3ab56f44cfd3f"}},{"ruleId":"D1","level":"warning","message":{"text":"FusionSettingsPage.Editor (cyclomatic 38): FusionSettingsPage.Editor has cyclomatic complexity 38 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 20 belong to 9 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":"mobile/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"02186b951b22d6e53ff1a686ee3cdce2121bf308011e58a7d5a89dbecff50e8a"}},{"ruleId":"D1","level":"warning","message":{"text":"future_remote_server::commands::command_loop_with_ready (cyclomatic 37): future_remote_server::commands::command_loop_with_ready 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":"packages/remote-server/src/commands.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"e433d064afb10586885f25d096a290e06a19a12de0a6a7ec4fce2dfa489a4286"}},{"ruleId":"D1","level":"warning","message":{"text":"Workbench::handle_workflow_key (cyclomatic 37): Workbench::handle_workflow_key has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/mod.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6575b029ae0ffc289e135529f893ea408d5a00ff525b9c8db68893919b975d42"}},{"ruleId":"D1","level":"warning","message":{"text":"TasksView.TasksView (cyclomatic 37): TasksView.TasksView has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 8 of the 37 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 302, 417, 374, \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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c10e580e957d62709a3540b655d07c0173b15b373cb051222ac7d604990a9bb"}},{"ruleId":"D1","level":"warning","message":{"text":"projection.applyEvent (cyclomatic 37): projection.applyEvent has cyclomatic complexity 37 (threshold 15). Of this number, 33 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"22639b4b178c7827453582ab5f16ff92a82234670473ec4016bb41571ceab86d"}},{"ruleId":"D1","level":"warning","message":{"text":"syncEngine.mergeLiveInto (cyclomatic 37): syncEngine.mergeLiveInto has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 2 of the 37 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 1294, 1356, 1344, \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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9b3b7690c4c4ee2a0530b9aa247fa108f41f7628d9b85c7b0eb29bc27a0b59"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::reset::plan_reset (cyclomatic 36): future_agent::session::reset::plan_reset 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":"agent/src/session/reset.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"967a4d9f4d4d15946cdfc1bc600d5e2922ddc30edc89a94fc22c88015c90a96c"}},{"ruleId":"D1","level":"warning","message":{"text":"ProvidersPage.ProvidersPage (cyclomatic 36): ProvidersPage.ProvidersPage has cyclomatic complexity 36 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 20 belong to 8 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":"desktop/src/features/settings/ProvidersPage.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"430ef3e2b4135be27880145ac4e17104c1014ef931e4ece31413384330f10624"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::rpc::commands::session_lifecycle::cmd_new_session (cyclomatic 35): future_agent::rpc::commands::session_lifecycle::cmd_new_session 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":"agent/src/rpc/commands/session_lifecycle.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"224b9cf463f010fc60b0349f0592e49836523b491ef4fcf7e03dee6395ebfa94"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::data::finish_restore_with (cyclomatic 35): future_cli::commands::data::finish_restore_with 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":"cli/src/commands/data.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ea26c83880341aa6bf2e12f8322f3c7c88e1974c4dfca1c3d45fc2d1c4f262"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::fusion::execute (cyclomatic 35): future_host::fusion::execute 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":"host/src/fusion.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"39418cab3f4d84fc31249c6271d33473afa65b9a44098d2b6eab5e891534e08b"}},{"ruleId":"D1","level":"warning","message":{"text":"useAppLifecycle.useAppLifecycle (cyclomatic 35): useAppLifecycle.useAppLifecycle has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 125, 80, 150, \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":"mobile/src/remote/useAppLifecycle.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7fdc624d19d5b6e6a9b1d162ef44b6f4b1bbfe2baa1a17d51067e94e5e9cc05"}},{"ruleId":"D1","level":"warning","message":{"text":"ShareIntakeMenu.ShareIntakeMenu (cyclomatic 35): ShareIntakeMenu.ShareIntakeMenu has cyclomatic complexity 35 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 17 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":"mobile/src/share/ShareIntakeMenu.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dbd9bbb025c4e837e041cef29218bf48febbb359f3df15c095724353d68a99"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiResponsesAdapter::decode_frame (cyclomatic 34): OpenAiResponsesAdapter::decode_frame 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":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea59030138efef0ea63415b668507df922ca62d0ab828f115938b7aa3e2cf816"}},{"ruleId":"D1","level":"warning","message":{"text":"Client::stream_model (cyclomatic 34): Client::stream_model 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":"agent/src/llm/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"78471e814afe2c2e958cbc1967fe7a8097356e47d5306dc9845ab550c39074c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Writer::encode (cyclomatic 34): Writer::encode 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":"agent/src/session/content/journal.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0428b7168242dff5705ba1013f6b1655f81e8ba32766a6f4e46e0385ccaa2713"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::configure::collect_custom_provider (cyclomatic 34): future_cli::commands::configure::collect_custom_provider 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":"cli/src/commands/configure.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4babe166f5d7e405604e0bc093e91c1f1b14bfd6357f359f6bbd75b98a0125"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session::session (cyclomatic 34): future_cli::commands::session::session has cyclomatic complexity 34 (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":"cli/src/commands/session.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0c4ed54629096d33d7446bd6eb8bdb79e98fd603deac2a719373cc58c7e26f"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session_history::parse (cyclomatic 34): future_cli::commands::session_history::parse has cyclomatic complexity 34 (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":"cli/src/commands/session_history.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc43a9c64a1c7e1ab4b2d990dd36a9e0dfadb2467f7f3b7d26721db10a795bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::task::add (cyclomatic 34): future_cli::commands::task::add 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":"cli/src/commands/task.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a26bd8406fc9ec32707b9dc1a5308e9c3fd8fb30c5e16c6b39d7a91a5335b5"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::agent_providers::validate::validate_custom_provider (cyclomatic 34): future_host::agent_providers::validate::validate_custom_provider 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":"host/src/agent_providers/validate.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2a1f3eeba5d1aab8dfee0672972b41a284e14a07bfe0ac0fea1aa92fbd190f"}},{"ruleId":"D1","level":"warning","message":{"text":"FileTreePanel.FileTreePanel (cyclomatic 34): FileTreePanel.FileTreePanel has cyclomatic complexity 34 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 9 belong to 8 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":"desktop/src/features/filetree/FileTreePanel.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10788b44c6f715145adf3901601c9477cc5097d9cf6057707355c81966e1d82"}},{"ruleId":"D1","level":"warning","message":{"text":"NewConversation.NewConversation (cyclomatic 34): NewConversation.NewConversation has cyclomatic complexity 34 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 6 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":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d7c48e99dacdcc1086bb3ae410b1a48231e486b6f03b975e7be4d9b8cd89b8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.onEvent (cyclomatic 34): index.html.onEvent has cyclomatic complexity 34 (threshold 15). Of this number, 33 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":"host/web/index.html"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2c327ac580f75c25da66ed83b4753f734adc3f47e6f3c6a1bc1c9f2e6b8bbe"}},{"ruleId":"D1","level":"warning","message":{"text":"useChatFiles.useChatFiles.openAttachment (cyclomatic 34): useChatFiles.useChatFiles.openAttachment has cyclomatic complexity 34 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 7 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"648af943dd9853414241a09e2a175d6c223d7e7b55a45140abd39e363b317ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteClient.watchStatus (cyclomatic 34): RemoteClient.watchStatus has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to one function literal inside it that branches (line 1260). 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31ba856545e4fb668828ac1dbd0b2f09beca170add9dde432b7efd77ca8ca12"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::content::entries::prepare_owned (cyclomatic 33): future_agent::session::content::entries::prepare_owned 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":"agent/src/session/content/entries.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"1292995b63756c7ef1268e0a92e154c843ac6d3feb1306c8a71358af2da81496"}},{"ruleId":"D1","level":"warning","message":{"text":"Bridge::handle_event (cyclomatic 33): Bridge::handle_event 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":"channels/src/feishu/bridge.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e0c6a99e242214cab71a712553c9701a22b56244d65dabfe18fb4067cbb26f"}},{"ruleId":"D1","level":"warning","message":{"text":"Bridge::handle_slash_command (cyclomatic 33): Bridge::handle_slash_command 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":"channels/src/feishu/bridge.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdf9df286bd5b72159ec29c99fb51870f29a79f5592fedaef474b439bde4392"}},{"ruleId":"D1","level":"warning","message":{"text":"Live::handle_event (cyclomatic 33): Live::handle_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. This is NOT this file\u0027s highest cyclomatic complexity: Live::apply (cyclomatic 46) 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":"tui/src/workbench/live.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"14daa1d12470f3c88c35e9f87eea054f2f7788965257f3163e91af876554308f"}},{"ruleId":"D1","level":"warning","message":{"text":"AccountPage.AccountPage (cyclomatic 33): AccountPage.AccountPage has cyclomatic complexity 33 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 5 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":"desktop/src/features/settings/AccountPage.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"97530082a90f23f94ff6cf158c45cba3bc6d5415a960c905d978a17b629c9403"}},{"ruleId":"D1","level":"warning","message":{"text":"useAgentStatus.useAgentStatus (cyclomatic 33): useAgentStatus.useAgentStatus has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to 9 function literals inside it that branch (lines 91, 86, 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":"desktop/src/components/layout/hooks/useAgentStatus.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a11562077ef152f200b5a62831f2cbe3e857a3370463662848e29edc6eb4324"}},{"ruleId":"D1","level":"warning","message":{"text":"ToolRow.StandardToolRow (cyclomatic 33): ToolRow.StandardToolRow has cyclomatic complexity 33 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 6 belong to 3 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":"mobile/src/features/chat/messages/ToolRow.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"511e6b965930af1315025c1e20ed75fa55c9c6acae51bf1732e09646a33beb1e"}},{"ruleId":"D1","level":"warning","message":{"text":"SendQueuePanel.SendQueuePanel (cyclomatic 33): SendQueuePanel.SendQueuePanel has cyclomatic complexity 33 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 9 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":"mobile/src/features/chat/components/SendQueuePanel.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd0c3da28495e1be469f0cceb2c33a4eb0d09eed77f4ea51bb59d6b84be995c"}},{"ruleId":"D1","level":"warning","message":{"text":"approval.parseAction (cyclomatic 33): approval.parseAction 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":"packages/thread-projection/src/approval.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcb40fce8c1be2b88d131b894e31a02f61d9ebd30804f0513cc8f1592b4cf85"}},{"ruleId":"D1","level":"warning","message":{"text":"projection.turnFromAcc (cyclomatic 33): projection.turnFromAcc 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":"packages/thread-projection/src/projection.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9480c4d410fa86db63e883a633933fae8e8d917a2f3dc5173777b0fb3aff3f"}},{"ruleId":"D1","level":"warning","message":{"text":"judgeCase (cyclomatic 33): judgeCase has cyclomatic complexity 33 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 4 belong to 13 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":"harness/lib/analyze.mjs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2379e616e8d9b0e828e8a3a329ccec0581c706d69f2afc74f6a7b6e194bfef"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerSession::enqueue_prompt_with_model_context (cyclomatic 32): ServerSession::enqueue_prompt_with_model_context 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":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"75beafb39a2bb303ccd89578679ca5957ead070900a9879dd6161f596b57da29"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteStore::compact_run_cancellable (cyclomatic 32): SqliteStore::compact_run_cancellable 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":"agent/src/session/journal_compaction.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b524b3083f00762f65ae0dc3249aa5b5d7ccc2d286ba5e2c3446a0b6935fae"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::rpc::prompt_helpers::run_event_to_sse (cyclomatic 32): future_agent::rpc::prompt_helpers::run_event_to_sse 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":"agent/src/rpc/prompt_helpers.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abe76b33dee348378c11c4f8f3009099dd42f7acf377beebca348775c5639b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Terminal::start (cyclomatic 32): Terminal::start 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":"tui/src/terminal.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac16b26faf19ede9524d40409619532ea17860b1007042bd5b320d6f9067f7f"}},{"ruleId":"D1","level":"warning","message":{"text":"Workbench::handle_git_key (cyclomatic 32): Workbench::handle_git_key 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":"tui/src/workbench/mod.rs"},"region":{"startLine":2949}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0ea241903cce3f3288e0e31c08c7d55d9653550da7a7909d3fa3f85d7520f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Workbench::click (cyclomatic 32): Workbench::click 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":"tui/src/workbench/mod.rs"},"region":{"startLine":3862}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e140615e17640c2f5dcf43fc58c08f986cb2e8b347d5984bf96f122639610c0"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::rpc::grpc_client::subscribe_stream (cyclomatic 32): future_tui::rpc::grpc_client::subscribe_stream 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":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"5981885fb0d0a953d70886d8f6174c756f95286069e18a65609f8b6070809a0e"}},{"ruleId":"D1","level":"warning","message":{"text":"Composer.ComposerImpl::submitValue (cyclomatic 32): Composer.ComposerImpl::submitValue has cyclomatic complexity 32 (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 shape REPEATS in the file: one other method here (Composer.ComposerImpl) 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9b83a048e7887231316096131d09724f429e7b8d159ceb0c08135109dd970a"}},{"ruleId":"D1","level":"warning","message":{"text":"TasksView.TaskForm (cyclomatic 32): TasksView.TaskForm has cyclomatic complexity 32 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 10 belong to 7 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc2e828413712fbcaf7ca04682dded43b5e6820937f1fae2cbf10a00f210865"}},{"ruleId":"D1","level":"warning","message":{"text":"SseBroadcaster::broadcast_stamped (cyclomatic 31): SseBroadcaster::broadcast_stamped 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":"agent/src/rpc/broadcaster/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"181fc7919cbede28d37969945013beede29fa3f0ea1e20f0d79496d6e4c9e872"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session_prune::run (cyclomatic 31): future_cli::commands::session_prune::run 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":"cli/src/commands/session_prune.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff510a61d6e3524de17ec3062c9598bb18bd035ace483f11a66ce62f88f05c3"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::agent_bridge::observer::handle_event_from (cyclomatic 31): future_host::agent_bridge::observer::handle_event_from 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":"host/src/agent_bridge/observer.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"d643c8f1d52b390ad609ca935998fe246368681efd3331b88623a08aa5dab481"}},{"ruleId":"D1","level":"warning","message":{"text":"Supervisor::spawn_credential_refresh (cyclomatic 31): Supervisor::spawn_credential_refresh 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":"packages/remote-server/src/supervisor/transport.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"072777b6ea2c8c5be0cc0c9614c0d60108f614b6d550da9e8ba7b3287fe3fc1b"}},{"ruleId":"D1","level":"warning","message":{"text":"CustomProviderDialog.CustomProviderDialog::handleSubmit (cyclomatic 31): CustomProviderDialog.CustomProviderDialog::handleSubmit 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed39e2779eec872b05a5e24280c380abcfd8ba3bd414fc67302be2ae4504439"}},{"ruleId":"D1","level":"warning","message":{"text":"FusionDiscussionPanel.FusionDiscussionPanel (cyclomatic 31): FusionDiscussionPanel.FusionDiscussionPanel has cyclomatic complexity 31 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 5 belong to 2 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":"desktop/src/features/fusion/FusionDiscussionPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99cb6788593335a192f5aa302ab5daae8705498db3d0eab78ff70a96cbb467b"}},{"ruleId":"D1","level":"warning","message":{"text":"useThreadStore.useThreadStore.refreshStore (cyclomatic 31): useThreadStore.useThreadStore.refreshStore has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d20fb555fd3cb39b50fbc10a86eabd13c4999281b744b5faa19e041bb538ef0"}},{"ruleId":"D1","level":"warning","message":{"text":"loadThreadHistory.loadThreadHistory (cyclomatic 31): loadThreadHistory.loadThreadHistory has cyclomatic complexity 31 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 6 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":"desktop/src/features/agent/history/loadThreadHistory.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"017fffb2e94098720b6d77e8e6e815923b1bea81cfc5b7b99d51288f9e20731e"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopPicker.DesktopPicker (cyclomatic 31): DesktopPicker.DesktopPicker has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 9 of the 31 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 238, take, 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":"mobile/src/screens/DesktopPicker.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b450923ad9983ed9c2b900d24e78517a53d3844fd16c20b03d79225c8a6a34"}},{"ruleId":"D1","level":"warning","message":{"text":"projection.applyStandaloneCompaction (cyclomatic 31): projection.applyStandaloneCompaction has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to 4 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"04da1ad4b0a0d3fa06fe9630c33a3236dd599661f71bfec7c48acb7572eb6b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"Snapshot::page_impl (cyclomatic 30): Snapshot::page_impl has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/reader.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5024ecc47d95dd7f0b66f776324dfc2ccfa08b12750c78a486f9c84ab8ab584"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::compaction::semantic::call_summary_request (cyclomatic 30): future_agent::compaction::semantic::call_summary_request 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":"agent/src/compaction/semantic.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8571dfc3469157347ff8f67aa750b9337b6e745f5bd7b37969ce2f92c640e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownRenderer::render_block (cyclomatic 30): MarkdownRenderer::render_block has cyclomatic complexity 30 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/markdown.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d20a2b71c6909275781cf29afe704718e416ffb88282721feb06e9bd168bb9"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::index::apply_cli_options (cyclomatic 30): future_tui::index::apply_cli_options 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":"tui/src/index.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb83b3c541b2f7bc0a2d8082f6643206295c30b682d50d0356d961493873dfc"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::screen::git_box (cyclomatic 30): future_tui::workbench::screen::git_box 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":"tui/src/workbench/screen.rs"},"region":{"startLine":2376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c62aa2a78c4af8712655d577a6e063ed494282caeab0aaa9ba69d6819b6d50"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopsScreen.DesktopsScreen (cyclomatic 30): DesktopsScreen.DesktopsScreen 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 8 function items inside it that branch (a function literal at line 162, a function literal at line 98, select, \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":"mobile/src/screens/DesktopsScreen.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9c365cb8e8e2ae0f0ebc078f6ea28f4b18eef507e7583a41669ff6f4f9f38b"}},{"ruleId":"D1","level":"warning","message":{"text":"index.formatJsonForPreview (cyclomatic 30): index.formatJsonForPreview has cyclomatic complexity 30 (threshold 15). Of this number, 29 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":"packages/json-preview/src/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"871c4de9e40adb1c40c86e90dd508403b4bc813a7f1cf4b027d926cee4767d49"}},{"ruleId":"D1","level":"warning","message":{"text":"projection.messageToItems (cyclomatic 30): projection.messageToItems has cyclomatic complexity 30 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 2 belong to 2 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c51e930db6953e0dad6de76bba5285767ac663ecc1a9c7d1f33064ed251635"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::entry_records::insert_entry_record (cyclomatic 29): future_agent::session::entry_records::insert_entry_record 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":"agent/src/session/entry_records.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05880167bbebad673ce4e2f5c1e2cccc015e0d124f08e7afbd8b1d8fe7f5865"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::step (cyclomatic 29): Session::step 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":"channels/src/providers/irc.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccf86d2844c134c0c910686b2dd3a6a0dfec6107878c206f7777b78cf6738c6"}},{"ruleId":"D1","level":"warning","message":{"text":"future_channel::dingtalk::bridge::run_prompt_loop (cyclomatic 29): future_channel::dingtalk::bridge::run_prompt_loop 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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb21c2e6809fac3c69cd55cfe713a5660bd4129f2b30301f15ac19500edcb5d"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session_transcript::run (cyclomatic 29): future_cli::commands::session_transcript::run 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":"cli/src/commands/session_transcript.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffe552f7a4a65cfbe39c134b8a29ad9144853f5e8055108ea17207b87b96f82"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::headless::session (cyclomatic 29): future_cli::headless::session 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":"cli/src/headless/mod.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfba0ba56ae97fe92b9f17ab38784c9e2e858d0e63b751c5fd85ec8363dd7883"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentStatusGate.AgentStatusGate (cyclomatic 29): AgentStatusGate.AgentStatusGate 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":"desktop/src/components/layout/AgentStatusGate.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc72da00450194cbc0c0fbaaaf7da61a46ec74e7f32ab3126cac244ee65ea056"}},{"ruleId":"D1","level":"warning","message":{"text":"useTimelineController.useTimelineController.handleEvent (cyclomatic 29): useTimelineController.useTimelineController.handleEvent has cyclomatic complexity 29 (threshold 15). Of this number, 27 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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d12d04062fd806c3742ee18d900c84c6cfc7752cf207a230c877413bc5db493"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.plainText (cyclomatic 29): utils.plainText 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":"mobile/src/features/chat/utils.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd256ccb3a0a99e86af802d6a9e54e3f541b021d84dd58ea6cc157e1b9bf7847"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsScreen.SettingsScreen (cyclomatic 29): SettingsScreen.SettingsScreen 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. This shape REPEATS in the file: one other method here (SettingsScreen.SettingsScreen::renderLevel) 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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c157735531d6efdbd0f8e6989ac66b0070b433deaf20ee8ed146c8457cc15e70"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteClient.connectSocket (cyclomatic 29): RemoteClient.connectSocket has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal 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":"packages/remote-client/src/client.ts"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fdcae6ab61d12f680843f5c1f94b1a078af03a0d6e268c548c5817dad55cb1"}},{"ruleId":"D1","level":"warning","message":{"text":"AnthropicMessagesAdapter::decode_frame (cyclomatic 28): AnthropicMessagesAdapter::decode_frame 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":"agent/src/llm/adapters/anthropic.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72fa4fdcc3a6a312157827d0177dfd1422659e3b829ae0056a769f699a0b2b6"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentHandle::drain (cyclomatic 28): AgentHandle::drain 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":"agent/src/service/shutdown.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adf1625ba35c0e3e682f25140ccb8f840c2648688df0e3c2d618a34b7bba9a7"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::agent_bridge::stream::collect_agent_response (cyclomatic 28): future_host::agent_bridge::stream::collect_agent_response 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":"host/src/agent_bridge/stream.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"316df674655e4064be98f5ba3902c776403c3ba0558c88325d4fe825c3058752"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::git_history::draw (cyclomatic 28): future_host::git_history::draw 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":"host/src/git_history.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd6b7d881bc174c735f2fbe041d687b44be3de2192ff4b47b0f0d8ca76044d4"}},{"ruleId":"D1","level":"warning","message":{"text":"Scan::hash (cyclomatic 28): Scan::hash 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":"tui/src/workbench/syntax.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71a378e21270bf303e70332648688ebaf398efe25f959557d552f6b818e7dde"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::git_panel::draw (cyclomatic 28): future_tui::workbench::git_panel::draw 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":"tui/src/workbench/git_panel.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"8132ab4927340c10e8bcc21186a4d7e380fc14ab3c310e271ab65b1a8c9caccd"}},{"ruleId":"D1","level":"warning","message":{"text":"mergeConversations.groupMergedRows (cyclomatic 28): mergeConversations.groupMergedRows has cyclomatic complexity 28 (threshold 15). Of this number, 24 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"617bba8174b7b1c16517b7bab9b43b2f6faad7ce0530e86b6120d53c4b501ab5"}},{"ruleId":"D1","level":"warning","message":{"text":"liveRunProjection.projectRunForLivePreview (cyclomatic 28): liveRunProjection.projectRunForLivePreview 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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6efbe17b7d68f300b5a8f9d689df6aede5a07796a9eb71d7e925577f3530e16"}},{"ruleId":"D1","level":"warning","message":{"text":"RailViewSwitch.RailViewSwitch (cyclomatic 28): RailViewSwitch.RailViewSwitch 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 9 function items inside it that branch (handlePointerMove, handleKeyDown, viewAt, \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":"desktop/src/components/layout/RailViewSwitch.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9b8008a412ab85de68cc199af04786069c2e734f1aec51d32767f4519c230c"}},{"ruleId":"D1","level":"warning","message":{"text":"useRemoteConversationSettings.useRemoteConversationSettings (cyclomatic 28): useRemoteConversationSettings.useRemoteConversationSettings has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 4 of the 28 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 323, 248, 301, \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":"desktop/src/features/remote-peer/useRemoteConversationSettings.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0af44b46880cf8cc89172511369adbbc34763573c20e4c6e0551c0575942888"}},{"ruleId":"D1","level":"warning","message":{"text":"useComposerSubmission.useComposerSubmission (cyclomatic 28): useComposerSubmission.useComposerSubmission 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 2 function literals inside it that branch (lines 46, 67). 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":"mobile/src/features/chat/composer/useComposerSubmission.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcfdcfbcd7524e363064ea14554bd5e14c859f3b0ef9661220e8d6281105af2"}},{"ruleId":"D1","level":"warning","message":{"text":"ConnectionStatus.useConnectionSummary (cyclomatic 28): ConnectionStatus.useConnectionSummary 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":"mobile/src/components/ConnectionStatus.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f5c70456555fc59abefdeefa5fb21cf391753196534a12a9bf8745c9f98406"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsScreen.SettingsScreen::renderLevel (cyclomatic 28): SettingsScreen.SettingsScreen::renderLevel 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. This shape REPEATS in the file: one other method here (SettingsScreen.SettingsScreen) 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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7272914e5a1fba177492f17ed2da7d6f20af436a100291ddb4961cd3f28a5115"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::compaction::semantic::plan (cyclomatic 27): future_agent::compaction::semantic::plan 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":"agent/src/compaction/semantic.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e86a825fe5263e82336f9a540d5d20910c3e6bc6423ba869dfc844b836eb9a"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::config::providers::validate_provider_upsert (cyclomatic 27): future_agent::config::providers::validate_provider_upsert 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":"agent/src/config/providers.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1253fab25b694fd9f834ae1618d81c011a44f22f1116c4c414b507b6daffffff"}},{"ruleId":"D1","level":"warning","message":{"text":"future_channel::providers::discord::run_gateway (cyclomatic 27): future_channel::providers::discord::run_gateway 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":"channels/src/providers/discord.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f409218fa443946efa517f3d9b3c967c1690d34c585614bca6f516f9f5a68e"}},{"ruleId":"D1","level":"warning","message":{"text":"future_channel::providers::qq::run_gateway (cyclomatic 27): future_channel::providers::qq::run_gateway 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":"channels/src/providers/qq.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3cb7e12bcf620cb484bc278b6284c7e5754d0c489feefdd0645c9d01fa3870"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session::parse_session_options (cyclomatic 27): future_cli::commands::session::parse_session_options 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":"cli/src/commands/session.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"445c352c331bed5277fcd182229158cba7f0194464c13e363a5314d8a5bd10d2"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::screen::workflow_box (cyclomatic 27): future_tui::workbench::screen::workflow_box 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":"tui/src/workbench/screen.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"853dc3eced38aaff87d9067ba3eb88f4ccc496d115e9abc4fd3af66be779ce1c"}},{"ruleId":"D1","level":"warning","message":{"text":"SendQueuePanel.SendQueuePanel (cyclomatic 27): SendQueuePanel.SendQueuePanel has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 10 of the 27 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 281, a function literal at line 425, toggleExpanded, \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":"desktop/src/features/agent/SendQueuePanel.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4108de5cde113e886dbb3a13b14ff4727a59a7cc7ca9a9831c4d3673290ac5a"}},{"ruleId":"D1","level":"warning","message":{"text":"agentStateCache.installAgentEventListener (cyclomatic 27): agentStateCache.installAgentEventListener has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 342, 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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d07ee034b09d9207727016dfe7d84b420c88f25f397125c3789c8a434f89e1"}},{"ruleId":"D1","level":"warning","message":{"text":"useSkillRecommendation.useSkillRecommendation (cyclomatic 27): useSkillRecommendation.useSkillRecommendation has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 2 of the 27 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 135, 152, 205, \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":"mobile/src/features/chat/useSkillRecommendation.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d65b54337567314e1261fb6964df8f75f10efcbcbef111b611ba16e209604d53"}},{"ruleId":"D1","level":"warning","message":{"text":"bodyFor (cyclomatic 27): bodyFor has cyclomatic complexity 27 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 7 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":"harness/lib/issues-en.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d607360c1eeae396a866aa889daa9582cadeeaf718e7f9187a1e7239fbfb50b7"}},{"ruleId":"D1","level":"warning","message":{"text":"runCase::perfValue (cyclomatic 27): runCase::perfValue 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":"harness/lib/run.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e988876bb378aed761c76efefadbd85257f3bbc578455cb57d600a00d38b27"}},{"ruleId":"D1","level":"warning","message":{"text":"ReasoningEffortVocabulary::parse (cyclomatic 26): ReasoningEffortVocabulary::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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/schema.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6d3efea1c0140d0154d8a3270d329d25bae8949572d48df16d8b294a6e6262"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::config::providers::apply_provider_upsert (cyclomatic 26): future_agent::config::providers::apply_provider_upsert 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":"agent/src/config/providers.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"e060b0c70f3bcf8928cbc47a20175466e914d53afce3ffd5610d902e70201c0b"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::repair::repair_dangling_tool_calls (cyclomatic 26): future_agent::session::repair::repair_dangling_tool_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":"agent/src/session/repair.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"782f809a1e6966b71565d8169aea41d12c33dbc2edf0f21b7c02eb5118642221"}},{"ruleId":"D1","level":"warning","message":{"text":"future_channel::bridge::turn::run_turn (cyclomatic 26): future_channel::bridge::turn::run_turn 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":"channels/src/bridge/turn.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"72861bd8fafe50fa898b0b387afdeff8f76140ccdd54a7db3478af6a5ccc9bc3"}},{"ruleId":"D1","level":"warning","message":{"text":"futureos::commands::update_linux::worker (cyclomatic 26): futureos::commands::update_linux::worker 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":"desktop/src-tauri/src/commands/update_linux.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cda6afb30d6c913e6beb342430e91e73b230396242ade4328da732dc17e88a"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsDialog.SettingsDialog (cyclomatic 26): SettingsDialog.SettingsDialog has cyclomatic complexity 26 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 11 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":"desktop/src/features/settings/SettingsDialog.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcc9c153ed0344f77e8881e1771ff2c06497dd0e14031a8a79cf92169c19245"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillsView.InstalledTab (cyclomatic 26): SkillsView.InstalledTab has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 8 of the 26 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 452, 400). 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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df2d76cf89b704bf6504e3bd57c8c631122c8da342ca48948e56ea304adbb55"}},{"ruleId":"D1","level":"warning","message":{"text":"ThinkingRow.ThinkingRow (cyclomatic 26): ThinkingRow.ThinkingRow has cyclomatic complexity 26 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 6 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":"mobile/src/features/chat/messages/ThinkingRow.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e517f2e814be222f9096720f629e5e5ddfb6051a2bcb3749bc4ff13368e1898e"}},{"ruleId":"D1","level":"warning","message":{"text":"TasksSettingsPage.TasksSettingsPage (cyclomatic 26): TasksSettingsPage.TasksSettingsPage has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 11 of the 26 points are its own statements and the rest belongs to 7 function items inside it that branch (mutate, a function literal at line 496, a function literal at line 625, \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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1eb836fdb1265bb1e3222df4d1dcaa5eabeac3ace71daf37f1ad70bdab10c5"}},{"ruleId":"D1","level":"warning","message":{"text":"streamingMarkdown.createStreamingMarkdownParser.\u003Creturned closure\u003E (cyclomatic 26): streamingMarkdown.createStreamingMarkdownParser.\u003Creturned closure\u003E 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":"packages/markdown/src/streamingMarkdown.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3422a3f2c5c0073af432f518d3fccdbea9aa430f7753cd5b64f7e7ac60a20d4b"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteClient.runRefreshToken (cyclomatic 26): RemoteClient.runRefreshToken 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":"packages/remote-client/src/client.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2496f1fce53eadb6526b7a030ee9112789deb87f246043489bec1792a35453"}},{"ruleId":"D1","level":"warning","message":{"text":"format.classifyAgentError (cyclomatic 26): format.classifyAgentError 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":"packages/thread-projection/src/format.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b21ba3e9125bacfce4e1bdf12c365dbe284a614305e774caca129110e28e274"}},{"ruleId":"D1","level":"warning","message":{"text":"runRemoteCnCase (cyclomatic 26): runRemoteCnCase 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":"harness/lib/remote-cn.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2557770c6ea9e86ffcab3dab9234fdef4c46c6f6319129d89b34cf4b63cf11"}},{"ruleId":"D1","level":"warning","message":{"text":"FutureAgentService::stream_events (cyclomatic 25): FutureAgentService::stream_events 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":"agent/src/grpc/mod.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa06607dcba5ac3b931bf814138570b5f76b4639bd76e8d819f64720380e875e"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerSession::compact_with_policy (cyclomatic 25): ServerSession::compact_with_policy 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":"agent/src/rpc/session.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"397cda03d9758e62dc4ee6fbe2900a0916ab10b9b32833a44f608e82b0450afd"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::content::extensions::fields (cyclomatic 25): future_agent::session::content::extensions::fields 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":"agent/src/session/content/extensions.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1c773c5d1036b30dd650bb5fdc24c47ba7521afa0d2e82b9b0b2388a880684"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::fork::build_fork_session_with_mapping (cyclomatic 25): future_agent::session::fork::build_fork_session_with_mapping 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":"agent/src/session/fork.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2b55228123b9ed7826f0592d766019223bcc25dccbbe602e49808fdc5246f2"}},{"ruleId":"D1","level":"warning","message":{"text":"DingtalkBridge::handle_slash_command (cyclomatic 25): DingtalkBridge::handle_slash_command 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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"f082882a3b1d01de5da097a770bc2a6b7ed5d29cf01ce4f80cbb28ccf519c9c1"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::agent_bridge::observer::run_observer (cyclomatic 25): future_host::agent_bridge::observer::run_observer 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":"host/src/agent_bridge/observer.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"59de26e459e369099f4f759d1b4968606b2191480d106f62536496c68a76d1de"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::rpc::grpc_client::spawn_stream_manager (cyclomatic 25): future_tui::rpc::grpc_client::spawn_stream_manager 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":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"1579f620d4c3f2ddfdc493ee3c005d442371444c2efeaabb163c9c063f450307"}},{"ruleId":"D1","level":"warning","message":{"text":"useMessagePaging.useMessagePaging (cyclomatic 25): useMessagePaging.useMessagePaging has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 4 of the 25 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 406, 255, 451, \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":"desktop/src/features/agent/useMessagePaging.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d268196448af6dff089a314b107447053ece211c0f14b2d4574f17a7fe53d02"}},{"ruleId":"D1","level":"warning","message":{"text":"RemotePeersView.RemoteClientSection (cyclomatic 25): RemotePeersView.RemoteClientSection has cyclomatic complexity 25 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 10 belong to 6 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":"desktop/src/features/remote-peer/RemotePeersView.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50cdb234e2f335f0effa334b8a8b4a1e6c3bdcdad322dcac3df8748574432cb"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillsView.AllTab (cyclomatic 25): SkillsView.AllTab has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 6 of the 25 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 560, 591, 603). 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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"925410a0486f4db142ed43c1235f0e4f6053aab946698e39fff0319669fc3749"}},{"ruleId":"D1","level":"warning","message":{"text":"remarkLatexMath.tokenizeMath.\u003Creturned closure\u003E (cyclomatic 25): remarkLatexMath.tokenizeMath.\u003Creturned closure\u003E has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 4 of the 25 points are its own statements and the rest belongs to 7 function items inside it that branch (between, tokenizeClose::after, escaped, \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":"packages/markdown/src/remarkLatexMath.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8afc32502a75dcd9ac699410b0e599089ce2925fa2b6f56e79b146219e2fb5"}},{"ruleId":"D1","level":"warning","message":{"text":"parseFutureMarkdown.blockToFutureNode (cyclomatic 25): parseFutureMarkdown.blockToFutureNode 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":"packages/markdown/src/parseFutureMarkdown.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dca5df9dd82aab82a2c495c08dca988af8cf9fd3f1968a1f93e232f688679d3"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteClient.restoreServingConnection (cyclomatic 25): RemoteClient.restoreServingConnection 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":"packages/remote-client/src/client.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b5d1d370e0dceee99e7170f6e15cc1417e0f6c9800d564b1ba0e84415c0a28"}},{"ruleId":"D1","level":"warning","message":{"text":"runRemoteCases (cyclomatic 25): runRemoteCases 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":"harness/lib/remote-driver.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c6d3595c47e23b51122fa2d705130d4da5f16052fdbae626cb6ea70d42f77c"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentSequence::stamp (cyclomatic 24): ContentSequence::stamp 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":"agent/src/rpc/broadcaster/content_sequence.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ef16de4414a0c78a059c73286213182c5b536493e1141cffc52fcfa587c02d"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::persistence::execute (cyclomatic 24): future_agent::session::persistence::execute 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":"agent/src/session/persistence.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"406619cbe32f33917b1b4172194852faa7214bc7c95e83763a3caebe97097352"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalServer::pump (cyclomatic 24): TerminalServer::pump 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":"desktop/src-tauri/src/terminal/server.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ebeed6781d6afe0c1264a048979662ac50628d9ce3c1dbf8af3023dfd5c120"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::fusion::with_retry (cyclomatic 24): future_host::fusion::with_retry 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":"host/src/fusion.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93440f857eb71276f4818baf7f2210b3fe51ff536fe8d6eefc70fbc3ac40dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"future_remote_server::commands::handle_command_inner (cyclomatic 24): future_remote_server::commands::handle_command_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":"packages/remote-server/src/commands.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"a903d8e824aa72fc2de1914cb9f5d9521b5ca8e8f9c1fa6254487f0d0410f7eb"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownRenderer::render_table (cyclomatic 24): MarkdownRenderer::render_table 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":"tui/src/components/markdown.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ca12d7d51620e3234e8975f6b144c4fb1c738782e5d2d2a2504f63532d72ff"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::keys::format_parsed_key (cyclomatic 24): future_tui::keys::format_parsed_key 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: future_tui::keys::legacy_sequence_key_id (cyclomatic 66) 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":"tui/src/keys.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2927a0f379bb0bbeb204ec0c907dfcac443bc2979afedb1ed4cb92a1150b42"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonPreview.JsonPreview (cyclomatic 24): JsonPreview.JsonPreview has cyclomatic complexity 24 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 11 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":"desktop/src/features/filepreview/JsonPreview.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"829f742d68cc50228f5851c2bec1123fc5494c5fe0ff6038489cdaa7ff669ded"}},{"ruleId":"D1","level":"warning","message":{"text":"AppShellDialogs.AppShellDialogs (cyclomatic 24): AppShellDialogs.AppShellDialogs has cyclomatic complexity 24 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 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":"desktop/src/components/layout/AppShellDialogs.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb664e66832dae29f40ed973f88e30c89e4dccf96f1c2e794ff7a0974393489d"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownText.renderBlock (cyclomatic 24): MarkdownText.renderBlock 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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ffe9b0baa48845e0b98b1697cc8ddbfb898c86373e5325fa4da00849302b7c"}},{"ruleId":"D1","level":"warning","message":{"text":"useOlderHistory.useOlderHistory.loadOlderTimeline (cyclomatic 24): useOlderHistory.useOlderHistory.loadOlderTimeline has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 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":"mobile/src/remote/timeline/useOlderHistory.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ee245ca6dea2f05718c01aef138045ccad4cb7e7d692140117fdb1a44daefb"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteClient.subscribe (cyclomatic 24): RemoteClient.subscribe has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 4 of the 24 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1062, 1082, 1079). 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba885f28ca8905e925d87b34a46a403bb4ca4013b6cefc5adaa758e660ec453"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 24): (anonymous) has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 belong to 5 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":"desktop/shot/terminal-server.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9878d3d9d2e06852dcfe39087733baaabc3c64aa910bc028b9b5c73b192328f0"}},{"ruleId":"D1","level":"warning","message":{"text":"draftIssues (cyclomatic 24): draftIssues has cyclomatic complexity 24 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 4 belong to 5 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":"harness/lib/issues.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd52f2f17029f964ae7b94f376361b752d1863fe9c03b7bc318cf203500143f"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::history::paging::materialize_display_page (cyclomatic 23): future_agent::session::history::paging::materialize_display_page 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":"agent/src/session/history/paging.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0ca0430909118d191a4b90ce3d7a01d6799f3f533dd21bdfaf30d6ffd6afc7"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::agent_bridge::prompt::agent_prompt_inner (cyclomatic 23): future_host::agent_bridge::prompt::agent_prompt_inner 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":"host/src/agent_bridge/prompt.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ba7c722e89c2cdb624f688bd6d8f101d7774535f93fbe008e3835c1f3e223a"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::screen::conversation (cyclomatic 23): future_tui::workbench::screen::conversation 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":"tui/src/workbench/screen.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a92fb3b76badb8e0d44dcb0be49b7443571f06921ca4e797f4caa346cb732c2"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::screen::preferences_box (cyclomatic 23): future_tui::workbench::screen::preferences_box 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":"tui/src/workbench/screen.rs"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e24a7b529c24e5e40dd79beb3888aa4a31e633edfbde10f990a3bf2fac4ca145"}},{"ruleId":"D1","level":"warning","message":{"text":"ShareViewController.didSelectPost (cyclomatic 23): ShareViewController.didSelectPost 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":"mobile/modules/future-share-intent/extension/ShareViewController.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2618be1feb9c94b1a012b7e96a5784762d870c15c86635999660c3f374e3b8"}},{"ruleId":"D1","level":"warning","message":{"text":"remotePeerClient.normalizeRemoteSessionRows (cyclomatic 23): remotePeerClient.normalizeRemoteSessionRows has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 296). 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db0caad5e58594230448d3f70ecf435b35136001e2217fe53741447122abe14"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteApprovalMenu.RemoteApprovalMenu (cyclomatic 23): RemoteApprovalMenu.RemoteApprovalMenu has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 141, choose, a function literal at line 77, \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":"desktop/src/features/remote-peer/RemoteApprovalMenu.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72730174dcac187da9002642505cf083a5d0afb3619837e7825a89ac9c98822"}},{"ruleId":"D1","level":"warning","message":{"text":"ReviewPanel.ReviewPanel (cyclomatic 23): ReviewPanel.ReviewPanel has cyclomatic complexity 23 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 8 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":"desktop/src/features/review/ReviewPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76d0f462dbae6d496d2e6a6ea5e3037db6ec3fb0bf3279f36fddd365af4d340"}},{"ruleId":"D1","level":"warning","message":{"text":"ThinkingBlock.ThinkingBlock (cyclomatic 23): ThinkingBlock.ThinkingBlock has cyclomatic complexity 23 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 6 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":"desktop/src/features/agent/ThinkingBlock.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"984b6d7d0f788431645c15dafb0e1c344f22f9ea1ab0a552096044243d37d492"}},{"ruleId":"D1","level":"warning","message":{"text":"PreviewModal.PreviewLayer (cyclomatic 23): PreviewModal.PreviewLayer has cyclomatic complexity 23 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 9 belong to 8 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":"mobile/src/features/chat/components/PreviewModal.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7682be5355cfe259ef6128d763e35e4c869a96edd2928d7e99585b81238ae8c3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.patchLines (cyclomatic 23): index.patchLines 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 one function literal inside it that branches (line 453). 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":"packages/git-graph/src/index.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe28f7a819f39212e6baa61ebb065d2117406d6e1f87ca856165f1b8bf3e409a"}},{"ruleId":"D1","level":"warning","message":{"text":"SyncEngine.replayInto (cyclomatic 23): SyncEngine.replayInto has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7750cc6ae74fa1918019cf7b81c613cdf143ad69e2bffebb19c1220954b014"}},{"ruleId":"D1","level":"warning","message":{"text":"contentRange.applyContentRange (cyclomatic 23): contentRange.applyContentRange 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":"packages/thread-projection/src/contentRange.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15ab1654d54a69a1c964c901aca55a1dd3c6a2a45f2134121cfa0f391143c45"}},{"ruleId":"D1","level":"warning","message":{"text":"Loop::execute_tools_sequential (cyclomatic 22): Loop::execute_tools_sequential 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":"agent/src/agent/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d0bf39e16d9b12644756a17ba512b4e6bd5b6884784e77fc10f8e76cda7f5f8"}},{"ruleId":"D1","level":"warning","message":{"text":"ApprovalGate::request (cyclomatic 22): ApprovalGate::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":"agent/src/rpc/approval.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a0927a6fe61810e17f99d6f5d5eb3ea4afdc27ea45b445b705eb5284587d58"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerSession::restore_session (cyclomatic 22): ServerSession::restore_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":"agent/src/rpc/session.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3ea0f104a711e7982a8c5818fbc2c2c1e66d4cc096c53eb002c49015ac9324"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::history::display_projection::project_entries (cyclomatic 22): future_agent::session::history::display_projection::project_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":"agent/src/session/history/display_projection.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaec05fb86ccd3e9bd51cb61cb07824caf3da8a69ee36e1dade45d11214093b"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::projection::entries_to_agent_messages (cyclomatic 22): future_agent::session::projection::entries_to_agent_messages 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":"agent/src/session/projection.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"75700fa9ae178de4dd7b150a59d0168a0231b67117c71e04dc3071e054402e5e"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::model_settings::provider_set (cyclomatic 22): future_cli::commands::model_settings::provider_set 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":"cli/src/commands/model_settings.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad76f19d2a7c7dece5edeca840a43a14ec7db5ab675abb5df7f9eab00d4fc4c"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::agent_bridge::queries::read_events_since (cyclomatic 22): future_host::agent_bridge::queries::read_events_since 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":"host/src/agent_bridge/queries.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff026bae3f88e5fe42e78d382eb032610648047c1aff9f346470d12eb3ae1bda"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::application::threads::read_thread_history (cyclomatic 22): future_host::application::threads::read_thread_history 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":"host/src/application/threads.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aeea0878d198d5946efaa79ac85cdb3783549030f5a068c43ecfd8bb6cdf9b5"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::fusion::review::validate (cyclomatic 22): future_host::fusion::review::validate 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":"host/src/fusion/review.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d5acece033c5ae4ad8cb1de4eeeade12330cda387919890606eb20f9d9c3c0"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::remote_host::business::prompt::execute (cyclomatic 22): future_host::remote_host::business::prompt::execute 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":"host/src/remote_host/business/prompt.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"1909950636d0db2c8181c1746b5ad3ea0bc7411b852e9770d0a4cd881fe74a83"}},{"ruleId":"D1","level":"warning","message":{"text":"Client::spawn_event_stream_capped::handle_push (cyclomatic 22): Client::spawn_event_stream_capped::handle_push 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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b92ce8166ad7ee0dec8a51ecbd11c672e980aceb2b1abeb14a969271db57e34"}},{"ruleId":"D1","level":"warning","message":{"text":"useThreadMessages.useThreadMessages (cyclomatic 22): useThreadMessages.useThreadMessages has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 7 of the 22 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 170, 383, 131, \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":"desktop/src/features/agent/useThreadMessages.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef1561865c177e8235cbb05ff1dd6c2d50650be64c688727d62adaa68878187"}},{"ruleId":"D1","level":"warning","message":{"text":"useSkillRecommendation.useSkillRecommendation.evaluate (cyclomatic 22): useSkillRecommendation.useSkillRecommendation.evaluate has cyclomatic complexity 22 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 8 belong to 2 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":"desktop/src/features/agent/useSkillRecommendation.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77a29d66d80201aab020942bedd4d35e58fe4e6163f95cf91e1edb73e8fb9ed"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillsView.SkillsView (cyclomatic 22): SkillsView.SkillsView has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 143, 81, 214, \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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"802f471cf354a9ce6c259b4779e276e0c72c7c20b1ded75074672453011919eb"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateRecoveryPanel.UpdateRecoveryPanel (cyclomatic 22): UpdateRecoveryPanel.UpdateRecoveryPanel has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 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":"desktop/src/features/settings/UpdateRecoveryPanel.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e031197bedcf1d6a10e068f00004ea325b23c61cf411afc4a7749e44b2fe2db9"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteFilesDialog.RemoteFilesDialog (cyclomatic 22): RemoteFilesDialog.RemoteFilesDialog has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 154, a function literal at line 71, download, \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":"desktop/src/features/remote-peer/RemoteFilesDialog.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ecef7376110c9fd6061eb883d36c602d39747ad03f5355ffdcd12807c44d85"}},{"ruleId":"D1","level":"warning","message":{"text":"storage.readRegistry (cyclomatic 22): storage.readRegistry has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 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":"mobile/src/remote/storage.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"538d8b34b01f3e24387c6c7ff3906315090b34081ec859a37f0aec3734695c7e"}},{"ruleId":"D1","level":"warning","message":{"text":"visual-regression.main (cyclomatic 22): visual-regression.main has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/scripts/visual-regression.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"277cfaf6fecc0060a421eddf23b84dc4c120bfe295ee276410494c85cadefb55"}},{"ruleId":"D1","level":"warning","message":{"text":"useDesktopRuntime.useDesktopRuntime (cyclomatic 22): useDesktopRuntime.useDesktopRuntime has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 226, 422, 145, \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":"mobile/src/remote/useDesktopRuntime.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc4a107d50d2983df26708e8c46aeac65e14091ef758631cc234f32f1e0a059"}},{"ruleId":"D1","level":"warning","message":{"text":"useCompactContext.useCompactContext.compact (cyclomatic 22): useCompactContext.useCompactContext.compact 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/useCompactContext.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d935e8fd89bb913826700d4981920fd0ad42308dcecaa7eda0e21daccb7324"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatTimeline.ChatTimeline (cyclomatic 22): ChatTimeline.ChatTimeline has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs 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":"mobile/src/features/chat/components/ChatTimeline.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff91a8250169b0c248c559d8b1172c2033d69d95c9b1dd407949b930b9b0fc2b"}},{"ruleId":"D1","level":"warning","message":{"text":"GitGraphPanel.GitGraphPanel (cyclomatic 22): GitGraphPanel.GitGraphPanel has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to 5 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":"mobile/src/features/chat/components/GitGraphPanel.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"55570682904741a49744d37044d6628e2f05e52c8baa5fe00ed9849ddae2223e"}},{"ruleId":"D1","level":"warning","message":{"text":"CustomProviderPage.CustomProviderPage::validate (cyclomatic 22): CustomProviderPage.CustomProviderPage::validate 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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9be4edaf66aa537529d86662b1f9b7cc61e726258a57b225fec259c435322ec"}},{"ruleId":"D1","level":"warning","message":{"text":"contentBody.readContentPages (cyclomatic 22): contentBody.readContentPages 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":"packages/thread-projection/src/contentBody.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"405b3d226c2d1ef3386a40700ef310cd6590cea8702bd7bc2e34a361c43f185d"}},{"ruleId":"D1","level":"warning","message":{"text":"judgeEvidence (cyclomatic 22): judgeEvidence has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 1 belongs 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":"harness/lib/analyze.mjs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa2dff276442cf5576e5c94e38b66e19d47369ddba6994fd1ddbaeba8ad5386"}},{"ruleId":"D1","level":"warning","message":{"text":"installEventHandlers (cyclomatic 22): installEventHandlers has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 298, 310, 334, \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":"harness/lib/cdp.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a817c3745b668c44e8926503008bcae9634256da017324909c189627054bba45"}},{"ruleId":"D1","level":"warning","message":{"text":"Loop::execute_one_tool_with_context (cyclomatic 21): Loop::execute_one_tool_with_context 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":"agent/src/agent/mod.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2dabcf77053b09be170acfce5856c00d8d343f4fb9e19e27df21a50b221881"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiChatAdapter::decode_frame (cyclomatic 21): OpenAiChatAdapter::decode_frame 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":"agent/src/llm/adapters/openai_chat.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"e566e145af758da828c2b125f675d768dd1c58b51dfef2e6bbca01f3b5432896"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::cli::run_from_args (cyclomatic 21): future_agent::cli::run_from_args 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":"agent/src/cli.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6b6e01dbeb61c57153782575a9918b8ff9fe3c7aaa3a672790331f728012b1"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::database::connection::initialize_connection (cyclomatic 21): future_agent::session::database::connection::initialize_connection 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":"agent/src/session/database/connection.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"782b1d206b2fe407cb60e8fdd008bb8c28f23e56d697cec0ff5840343a1a511f"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::browser_tools::browser_start (cyclomatic 21): future_cli::commands::browser_tools::browser_start 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":"cli/src/commands/browser_tools.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e0622a8bca713532dca863589b677dea3ad9a70ca2f68f3b4c69762e506ebd"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::model_settings::model_set (cyclomatic 21): future_cli::commands::model_settings::model_set 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":"cli/src/commands/model_settings.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"598222d012f86204912b38c8645964de42a9575b5fea68237ad6f030a95a2403"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session_control::parse (cyclomatic 21): future_cli::commands::session_control::parse 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":"cli/src/commands/session_control.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eaf35a51d2f55a85124630227dbbd66f7ba7905f01e2b34b88e1ad1a931a13"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session_journal::run (cyclomatic 21): future_cli::commands::session_journal::run 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":"cli/src/commands/session_journal.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3eb9c0677befc128c39ff08df7a302ec89006bd459684cb934341bebd8f0ca7"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session_reset::parse (cyclomatic 21): future_cli::commands::session_reset::parse 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":"cli/src/commands/session_reset.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"69008a9cd835e219a0e5b926ac4f4988d970d90a3d909e52c4892a353eea325b"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::tools::format_image_result (cyclomatic 21): future_cli::commands::tools::format_image_result 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":"cli/src/commands/tools.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dceab511c7dffa10c01411a59d21853ffac22d5e88726d3a7bb89612b0acc83"}},{"ruleId":"D1","level":"warning","message":{"text":"futureos::commands::update::install_app_update_inner (cyclomatic 21): futureos::commands::update::install_app_update_inner 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":"desktop/src-tauri/src/commands/update.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"867c74da546d7aa5c85a8ef938439adc17a3ff9c55b3e658503697d47ee8be96"}},{"ruleId":"D1","level":"warning","message":{"text":"future_rpc::history::read_page_with (cyclomatic 21): future_rpc::history::read_page_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":"packages/rpc/src/history.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b002332c8a9f5ee063bd6e0da4fb46e50e064b24b50bd7f21d84638dfb5188d"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::rpc::provider_types::validate_provider_input (cyclomatic 21): future_tui::rpc::provider_types::validate_provider_input 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":"tui/src/rpc/provider_types.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"050ba93d9a16b7e87e286566f462132382909a77f162fdfc68b4aaacd972b65c"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::utils::extract_ansi_code (cyclomatic 21): future_tui::utils::extract_ansi_code 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":"tui/src/utils.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ead1573ecfa2d7a9b0dbae5c3558ae24b3a778445547b8cf202698cf38863a"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::launchpad::render (cyclomatic 21): future_tui::workbench::launchpad::render 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":"tui/src/workbench/launchpad.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"9982a12eeb97d4c131c2036625551537a734b8e2a25a9022b6b8f461b331d712"}},{"ruleId":"D1","level":"warning","message":{"text":"mergeConversations.mergeConversations (cyclomatic 21): mergeConversations.mergeConversations has cyclomatic complexity 21 (threshold 15). Of this number, 19 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1801c2325a4d5f3f87b42a96fb847ac556b0a80f38b574fe6b64735ae41e09a"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseOrganization.DatabaseOrganization (cyclomatic 21): DatabaseOrganization.DatabaseOrganization has cyclomatic complexity 21 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 9 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":"desktop/src/features/settings/DatabaseOrganization.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3b2f5a3dfab8121ee11ceb72bb2671c1cb0b56492747df85522e31f80c376f"}},{"ruleId":"D1","level":"warning","message":{"text":"RunInspectPanel.ToolCallDetail (cyclomatic 21): RunInspectPanel.ToolCallDetail 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":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c276b64ab54fc6930400ddb9520c6ce6975a30df72b6c66500c40677b62221"}},{"ruleId":"D1","level":"warning","message":{"text":"RunsPanel.ToolRow (cyclomatic 21): RunsPanel.ToolRow has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 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":"desktop/src/features/runs/RunsPanel.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb85b775170094c46c80c7ebde2fd66c5005ba7d58e8922ee5d9bf41de5d7be"}},{"ruleId":"D1","level":"warning","message":{"text":"useThreadStore.useThreadStore (cyclomatic 21): useThreadStore.useThreadStore has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 861, 448, 890, \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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5cb6b58f9a99c61d773bd96fddd9bb4efcd534d3039b0d71cad97cc9d27556"}},{"ruleId":"D1","level":"warning","message":{"text":"ApprovalPrompt.ActionDetails (cyclomatic 21): ApprovalPrompt.ActionDetails 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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cf977fd4be8125dd43562047fd143d1b4b0aa4df2531ca09e7dab6a4a26b63"}},{"ruleId":"D1","level":"warning","message":{"text":"useThreadCompaction.useThreadCompaction (cyclomatic 21): useThreadCompaction.useThreadCompaction has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 29, 53, 70). 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":"desktop/src/features/agent/runtime/useThreadCompaction.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb76905c1c7adf1c7bd8f79d9297b11dd5ff52401a38d927c29fdc8f02756da"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteModelsPanel.RemoteModelsPanel (cyclomatic 21): RemoteModelsPanel.RemoteModelsPanel has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 142, a function literal at line 67, setVisibility, \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":"desktop/src/features/remote-peer/RemoteModelsPanel.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d60c05d3995b9f42894d7eb2f4dfbb3e78a4f89efee190d8059650a22a1baec"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteProvidersPanel.RemoteProvidersPanel (cyclomatic 21): RemoteProvidersPanel.RemoteProvidersPanel has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 157, a function literal at line 50, write, \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":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29dcfab4f4aae02231878c79b98a4150f8b4b09cb10cff37d12b595836b2352"}},{"ruleId":"D1","level":"warning","message":{"text":"TasksView.TaskDetail (cyclomatic 21): TasksView.TaskDetail has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb476fc9880b8b4b16450f6c5160671cafdae1cd415efafa5f63eb2c209d63a"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.mdToHtml (cyclomatic 21): index.html.mdToHtml 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":"host/web/index.html"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"368ef6f0069bc2714a2a2d0c5f7b04ddcbb3e18a45309655e82c8742e653575a"}},{"ruleId":"D1","level":"warning","message":{"text":"usePromptOutbox.usePromptOutbox.continueRun (cyclomatic 21): usePromptOutbox.usePromptOutbox.continueRun has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 594). 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd3e3fc515dab0365a1726deb44db967b93bde020522b51d3402895df1c3bb0"}},{"ruleId":"D1","level":"warning","message":{"text":"sessionTree.catalogRows (cyclomatic 21): sessionTree.catalogRows has cyclomatic complexity 21 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 9 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b7a574f33c2d3245766fa6420257dca78497277f8c9b38a250c7e68f754c16"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelsSettingsPage.ModelsSettingsPage (cyclomatic 21): ModelsSettingsPage.ModelsSettingsPage has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 6 function items inside it that branch (setVisibility, a function literal at line 103, a function literal at line 113, \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":"mobile/src/features/settings/ModelsSettingsPage.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5050f6142e91e7f9437c5f1ac9ba4e88c6204717d83340e6d2d54c58447f60de"}},{"ruleId":"D1","level":"warning","message":{"text":"index.laneDrawing (cyclomatic 21): index.laneDrawing has cyclomatic complexity 21 (threshold 15). Of this number, 16 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":"packages/git-graph/src/index.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc1d08a6b95cfe7ef7404b17df01647dc61f545dfd6b3202ec33e34f487ce99"}},{"ruleId":"D1","level":"warning","message":{"text":"transfer.runDownloadPrepared (cyclomatic 21): transfer.runDownloadPrepared 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":"packages/remote-client/src/transfer.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"03133830980dde2a0078066e4210581a94663994ff2adfa199d6c3d30420adcf"}},{"ruleId":"D1","level":"warning","message":{"text":"Composer.compose (cyclomatic 21): Composer.compose 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":"packages/thread-projection/src/cooperativeJson.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b5f0ca10489e980ab413b38507059fdf4974b75ee358d0af55737275c915ec"}},{"ruleId":"D1","level":"warning","message":{"text":"liveApply.buildSegments (cyclomatic 21): liveApply.buildSegments 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb492937fd1bffbfc4dc5e827d27785adb450e66c4ed362c3efe6f03f7df84f4"}},{"ruleId":"D1","level":"warning","message":{"text":"projection.entriesToTurns (cyclomatic 21): projection.entriesToTurns has cyclomatic complexity 21 (threshold 15). Of this number, 20 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":"packages/thread-projection/src/projection.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c77eeadbd60f1199fa00a4dafa51661996a6bcfd9f68ad4f95889df16ca2a5"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::model_settings::probe (cyclomatic 20): future_cli::commands::model_settings::probe 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":"cli/src/commands/model_settings.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc3ff5ff608e3a530167252da7376a05763b23e09388647ccf7c8e1403f55ac"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::remote::switch (cyclomatic 20): future_cli::commands::remote::switch 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":"cli/src/commands/remote.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0035f8c786dd2548abd4223bba34a442310c2aa620a72f1e0387e5257e263c"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::task::task (cyclomatic 20): future_cli::commands::task::task 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":"cli/src/commands/task.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5342039abda239917002b01088c335cd194ca4d995f7f9ff20191a0a3e1f2d"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentHost::start_agent (cyclomatic 20): AgentHost::start_agent 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":"host/src/agent_host.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d8f7e93ca692dc9c6281dd9db901b6f0e156280154ca4e62189cf7f4287a4e"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::agent_bridge::import::import_one (cyclomatic 20): future_host::agent_bridge::import::import_one 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":"host/src/agent_bridge/import.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"88472f59320c45b25223e13c2801f66136e08daf32605e947a341bf7e400595a"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::agent_bridge::reconciliation::settle_queued_runs (cyclomatic 20): future_host::agent_bridge::reconciliation::settle_queued_runs 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":"host/src/agent_bridge/reconciliation.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aab234d2d479adc57a0fd0145db725f358684bad31863e8ef8c75ef19ca0f80"}},{"ruleId":"D1","level":"warning","message":{"text":"Supervisor::start_generation (cyclomatic 20): Supervisor::start_generation 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":"packages/remote-server/src/supervisor/start.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12f8d5305b639f18f62b8e0b12240cbc0635a05d3646ec8862f788d68e9228b"}},{"ruleId":"D1","level":"warning","message":{"text":"Supervisor::stopped_status (cyclomatic 20): Supervisor::stopped_status 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":"packages/remote-server/src/supervisor/status.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4499e9fe04d406443613694e99265829df0e21995e841ebb6c6cee5c9e940f"}},{"ruleId":"D1","level":"warning","message":{"text":"TransferLoop::run (cyclomatic 20): TransferLoop::run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/transfer.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f239f890ce93bd8020b21d54bf9ab7fcfda40df47a1a991a4093136b44922670"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::session_rows::rows_to_messages (cyclomatic 20): future_tui::session_rows::rows_to_messages 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":"tui/src/session_rows.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3878ad258b2d86f954bfeee6f14125b3920ac22c90f69a41ab7e21a7a7d8e3"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::utils::extract_segments (cyclomatic 20): future_tui::utils::extract_segments 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":"tui/src/utils.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4d13e1c24e70df9aa4518de872836ae82307300dc530791b836d9212b95c00"}},{"ruleId":"D1","level":"warning","message":{"text":"useStreamingMarkdownBlocks.useStreamingMarkdownBlocks (cyclomatic 20): useStreamingMarkdownBlocks.useStreamingMarkdownBlocks 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 7 function literals inside it that branch (lines 157, 195, 141, \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":"desktop/src/features/markdown/useStreamingMarkdownBlocks.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3b50105703000772f8e1e14457f4f09deb3a144f7d9c38479b12e6e9e6f960"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownContent.renderBlock (cyclomatic 20): MarkdownContent.renderBlock 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":"desktop/src/features/markdown/MarkdownContent.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"070e862a5e87f388d017a4885dbb2a1444a080fd7ff5040e4e141f25dc83fe00"}},{"ruleId":"D1","level":"warning","message":{"text":"Composer.ComposerImpl (cyclomatic 20): Composer.ComposerImpl 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 shape REPEATS in the file: one other method here (Composer.ComposerImpl::submitValue) 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca98aa25486662d339089a72ed356e88f085621c2119a7f5d79dbe91a35536c"}},{"ruleId":"D1","level":"warning","message":{"text":"useRunReattach.useRunReattach (cyclomatic 20): useRunReattach.useRunReattach 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 9 function literals inside it that branch (lines 89, 140, 70, \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":"desktop/src/features/agent/useRunReattach.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"607e97a65198f4caba5c3c8067b9f46eea01a315f7bda25a13145aa029daeb9e"}},{"ruleId":"D1","level":"warning","message":{"text":"useRemoteDoneBell.useRemoteDoneBell (cyclomatic 20): useRemoteDoneBell.useRemoteDoneBell 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 2 function literals inside it that branch (lines 40, 31). 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":"desktop/src/components/layout/hooks/useRemoteDoneBell.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a945cf44da42d4081e267b1658f0d63f0b7657a03d17bccddc2251e57b066d4f"}},{"ruleId":"D1","level":"warning","message":{"text":"files.prepareFile (cyclomatic 20): files.prepareFile 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":"mobile/src/remote/files.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e3c084cd42cdce133b0f9087a7e6b838661f5499e594d77dc35c3dc7e342e7"}},{"ruleId":"D1","level":"warning","message":{"text":"remarkMathFence.tokenizeMathFence (cyclomatic 20): remarkMathFence.tokenizeMathFence has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 3 of the 20 points are its own statements and the rest belongs to 7 function items inside it that branch (contentStart, beforeContent, content, \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":"packages/markdown/src/remarkMathFence.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"679d85f27ca2b2e433aa0a9571bc17252a057372e27d9c453793cab4693a201b"}},{"ruleId":"D1","level":"warning","message":{"text":"readPages.requestReadPage (cyclomatic 20): readPages.requestReadPage has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (storeChunk, a function literal at line 83). 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":"packages/remote-client/src/readPages.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdf0599d30b1c9c5aa8477cc24d993603a18c1d7a87d0a30d03a10098163a16"}},{"ruleId":"D1","level":"warning","message":{"text":"replay.tailCoversRange (cyclomatic 20): replay.tailCoversRange has cyclomatic complexity 20 (threshold 15). Of this number, 17 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":"packages/thread-projection/src/replay.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"461765984d948c81c227889f2c2fd6bc8493aae740eb7e60baeec42edc758feb"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::agent::run_loop::assemble_assistant_parts (cyclomatic 19): future_agent::agent::run_loop::assemble_assistant_parts 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":"agent/src/agent/run_loop.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c821747646367dfae75cbb833d177f39bfce0bb5a566ed732397652ba2ad9264"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::compaction::semantic::evidence::build (cyclomatic 19): future_agent::compaction::semantic::evidence::build has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/compaction/semantic/evidence.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea47ab6b1dd2fe00845e05eb25f56edd915ffeae7b5eb966d2593b3e71fb2a6"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::llm::schema::parse_chat_config (cyclomatic 19): future_agent::llm::schema::parse_chat_config 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":"agent/src/llm/schema.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ff1b147a821aef69c0ac3744c6d0179517d4d944aad13ef7a64b6d8a0bf181"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::tools::shell::execution::spawn_shell_impl (cyclomatic 19): future_agent::tools::shell::execution::spawn_shell_impl 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":"agent/src/tools/shell/execution.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"5446542092c173d591e810c51510c4b4962e77d55fea6b1b58091fc17158f7c4"}},{"ruleId":"D1","level":"warning","message":{"text":"Snapshot::query (cyclomatic 19): Snapshot::query 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":"orchestration/fusion/src/files.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"652f82aa5d3bfe403b5749c2cb3de931b8c228077da0bf280374caf94e466793"}},{"ruleId":"D1","level":"warning","message":{"text":"Transport::handshake (cyclomatic 19): Transport::handshake 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":"packages/remote-server/src/secure.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9cadae9236a3a084b4897c493839b02c211bbace0088124cf239ab2561d080"}},{"ruleId":"D1","level":"warning","message":{"text":"MdParser::parse_inline_until (cyclomatic 19): MdParser::parse_inline_until 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":"tui/src/components/markdown.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc67b5d0f0e5acf6295dbf667f930ad32351bf07af06408aeb6a45088e218deb"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::run::paint_images (cyclomatic 19): future_tui::workbench::run::paint_images 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":"tui/src/workbench/run.rs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0b909ff16419dd093b811bf5cb4388c66372c5c86a230f7652535f16120d75"}},{"ruleId":"D1","level":"warning","message":{"text":"historyTransfer.read (cyclomatic 19): historyTransfer.read has cyclomatic complexity 19 (threshold 15). Of this number, 18 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":"desktop/src/integrations/storage/historyTransfer.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd707ea2c65b7226d2f04b55b8426458117e2df137b55d1253f874b75627b7a"}},{"ruleId":"D1","level":"warning","message":{"text":"agentStateCache.applySettingsEvent (cyclomatic 19): agentStateCache.applySettingsEvent 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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c0c8eb5bb6784948965cb2a0f7d6696152439e331003c8bad6b0afd868a43c"}},{"ruleId":"D1","level":"warning","message":{"text":"AttachmentChip.AttachmentChip (cyclomatic 19): AttachmentChip.AttachmentChip 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":"desktop/src/features/agent/messages/AttachmentChip.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b60f45aecbd46534578fc644a326a20b4bb6d7c83e4b6e65d1dd527072bee1"}},{"ruleId":"D1","level":"warning","message":{"text":"useThreadMessages.useThreadMessages.reloadThreadHistory (cyclomatic 19): useThreadMessages.useThreadMessages.reloadThreadHistory has cyclomatic complexity 19 (threshold 15). Of this number, 17 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":"desktop/src/features/agent/useThreadMessages.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f61b8aeb4e9dfd530e17a2ffc1ba281de4e8ded397cd6788f73d1d2fb39764a"}},{"ruleId":"D1","level":"warning","message":{"text":"dispatch.dispatchShortcut (cyclomatic 19): dispatch.dispatchShortcut 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":"desktop/src/features/keyboard/dispatch.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f81f233bf10a3373463b2e2216f549666ab682b3778995a9bf977f72a3603a5"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteRenameDialog.RemoteRenameDialog (cyclomatic 19): RemoteRenameDialog.RemoteRenameDialog has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (submit, generate, a function literal at line 101). 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":"desktop/src/features/remote-peer/RemoteRenameDialog.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3b741854bbcbb2f4da4cbbac4efd8fb848f3e9d73da088897310df17f78af9"}},{"ruleId":"D1","level":"warning","message":{"text":"terminal-server.server (cyclomatic 19): terminal-server.server has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 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":"desktop/shot/terminal-server.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e350bdd0a44c61f34b2cbfd20291c83705386f952a8d5d43e53c129cc54ddd"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownText.renderInline (cyclomatic 19): MarkdownText.renderInline has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 88). 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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16b06bb349085f09344ed06f4f500bb3451493edeac877d2d0bec534c49079e"}},{"ruleId":"D1","level":"warning","message":{"text":"useSessionCatalog.useSessionCatalog.observeRunEvent (cyclomatic 19): useSessionCatalog.useSessionCatalog.observeRunEvent 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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d80f30d7ae84bd037bed409f2e24186737b89af2c753277777b79bee903eb5e"}},{"ruleId":"D1","level":"warning","message":{"text":"useDesktopConnection.useDesktopConnection (cyclomatic 19): useDesktopConnection.useDesktopConnection has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 671, 814, 848, \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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"def4691139101e086e348ed79c3409a130b381f07f2a29543c6fcee5389e7c78"}},{"ruleId":"D1","level":"warning","message":{"text":"ActionMenu.ActionMenu (cyclomatic 19): ActionMenu.ActionMenu has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 140, 150, 128, \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":"mobile/src/components/ActionMenu.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a3dabc148eae38940f1b523c53f913d23ea86abdc6a4f7115ea549ac30c80c"}},{"ruleId":"D1","level":"warning","message":{"text":"PairingScreen.pairingErrorMessage (cyclomatic 19): PairingScreen.pairingErrorMessage 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":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef863df45387a0f52a9475441c535f2e055456668bf418376324d443d140d12b"}},{"ruleId":"D1","level":"warning","message":{"text":"RenameModal.RenameModal (cyclomatic 19): RenameModal.RenameModal has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to 3 function items inside it that branch (generate, save, generate::current). 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":"mobile/src/features/chat/components/RenameModal.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8369fe4abdae1be9bc318ee8ada6eccb247f12e00a0dc375669abcb76c5f857"}},{"ruleId":"D1","level":"warning","message":{"text":"useShareIntake.useShareIntake.chooseDestination (cyclomatic 19): useShareIntake.useShareIntake.chooseDestination 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":"mobile/src/share/useShareIntake.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d8015c81a00b4788b7ff774065192cb6d3302341e8e2c4953ee700d24ebd04"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionState.classifyError (cyclomatic 19): connectionState.classifyError 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: connectionState.transition (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/src/connectionState.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7170e084479c9239581e332d88899c14a0d45af645f1a896493efb68f2db1262"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteClient.openAttempt (cyclomatic 19): RemoteClient.openAttempt has cyclomatic complexity 19 (threshold 15). Of this number, 14 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":"packages/remote-client/src/client.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6a7e2511dfd2812988b2ead6f85b79059e40beb2b4888f374c0ef88ba140ae"}},{"ruleId":"D1","level":"warning","message":{"text":"projection.applyLiveEvent (cyclomatic 19): projection.applyLiveEvent 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67b3dc977331b4b3e776f7a339c07029d42024d423f19dc9822d5dbd798073f"}},{"ruleId":"D1","level":"warning","message":{"text":"readPages.chunkOf (cyclomatic 19): readPages.chunkOf 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":"packages/remote-client/src/readPages.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"930f6fe783152130b13f5d7fc43c7238f7a0b17132636bc10a270a452e3bc335"}},{"ruleId":"D1","level":"warning","message":{"text":"EvidenceContext::observe (cyclomatic 18): EvidenceContext::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":"agent/src/approval_review/evidence.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d80b6f01a6c052d70dd864a05ce995119719498ac135a4267fb107bfb466a6"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenAiResponsesAdapter::build_body (cyclomatic 18): OpenAiResponsesAdapter::build_body 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":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"218c615706db7c673de5a777f0fc9d13b3e226dfd6ecb18dfb93a41e3e259e12"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::models::enrich_user_models (cyclomatic 18): future_agent::models::enrich_user_models 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: future_agent::models::provider_display_name (cyclomatic 31) 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":"agent/src/models/mod.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd8c6d926c7ea65b982f36fa723d9fe711a04bf71f71fd5e94e9f7f38e2b828"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::prompt::lint_memory_index (cyclomatic 18): future_agent::prompt::lint_memory_index 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":"agent/src/prompt/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"19630d76f6bb2c2609d45aeb10d54190a48dcc19d016344bf570b76a6c4764bd"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::rpc::commands::session_reset::handle_reset_session_history (cyclomatic 18): future_agent::rpc::commands::session_reset::handle_reset_session_history 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":"agent/src/rpc/commands/session_reset.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37b61f03527723941e9f0b0365aba76372bf3670d0db0eea4619eb851c985ca"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::reset::drop_kind_from_entry (cyclomatic 18): future_agent::session::reset::drop_kind_from_entry 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":"agent/src/session/reset.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"809f712c79e210ce4abf8af97817c96e683e70cb05cef639877486e75712f76b"}},{"ruleId":"D1","level":"warning","message":{"text":"FeishuWsClient::connect_and_listen (cyclomatic 18): FeishuWsClient::connect_and_listen 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":"channels/src/feishu/feishu_ws.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d01b71c73ec8bfc2fd9f695bdb9f4647f52c36f642ced1e80ce00b7910c855"}},{"ruleId":"D1","level":"warning","message":{"text":"RunClient::stream_events_filtered (cyclomatic 18): RunClient::stream_events_filtered 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":"cli/src/rpc.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccd5d5655badc611e4e3b4107c1b5e978c5e230d15c835d242e619a7e32a150"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::remote::list (cyclomatic 18): future_cli::commands::remote::list 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":"cli/src/commands/remote.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56c551fa967044130f0acaadd2413112edae32c7cbebc47d7600a69c48c67d7"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::skills::read_skill_md_version (cyclomatic 18): future_cli::commands::skills::read_skill_md_version 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":"cli/src/commands/skills.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3c05cd5a452d5b2719a55cb8711aa109750ff4665e53a2f16505108f0e12ef"}},{"ruleId":"D1","level":"warning","message":{"text":"TerminalServer::handle (cyclomatic 18): TerminalServer::handle 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":"desktop/src-tauri/src/terminal/server.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd68b1cc7cf937bad2a8d2457795a735c11f74f0a83cf3509c69a7fe8849736"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::agent_bridge::delete_outbox::reconcile_delete_outbox (cyclomatic 18): future_host::agent_bridge::delete_outbox::reconcile_delete_outbox 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":"host/src/agent_bridge/delete_outbox.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"30200cf0b933b6e898efc8fa014802c9b4705dcd19c0e8395fc5d76984fd9855"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatArea::fold_reply_segment (cyclomatic 18): ChatArea::fold_reply_segment 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":"tui/src/components/chat_area.rs"},"region":{"startLine":2429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bff15dca342d0ee742be239b65cfebf417795d397906efc1f6bf14fefb6c39"}},{"ruleId":"D1","level":"warning","message":{"text":"Workbench::handle_mouse (cyclomatic 18): Workbench::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":"tui/src/workbench/mod.rs"},"region":{"startLine":3417}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6396707b966d9df6254dc337d747c942dc6ea400cf18e8400a74c6e7c5a27f"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::index::run_print_mode (cyclomatic 18): future_tui::index::run_print_mode 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":"tui/src/index.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe63546ecd4cdc110faa0bbe550e68fe40b15090a717ff61a5ecf71a5cdc914"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::panels::render_with (cyclomatic 18): future_tui::workbench::panels::render_with 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":"tui/src/workbench/panels.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"018132aee78966d4e43659685b9fe3ed577fd8445242ebc5c0fcb851e398b98d"}},{"ruleId":"D1","level":"warning","message":{"text":"useStreamingMarkdownBlocks.appendSuffixToNode (cyclomatic 18): useStreamingMarkdownBlocks.appendSuffixToNode 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":"desktop/src/features/markdown/useStreamingMarkdownBlocks.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae45415f6c4ff651127bf4cff8989c5e7f3185bbf3322b7e7bcddb71f9dbd2a9"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectMenu.SelectMenu (cyclomatic 18): SelectMenu.SelectMenu has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 54, 51, 68). 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":"desktop/src/components/ui/SelectMenu.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"65041b297e11e12ad3aca5c4b0a1bacde9f33176ce5579b2a300a4672a011c9c"}},{"ruleId":"D1","level":"warning","message":{"text":"GeneralPage.GeneralPage (cyclomatic 18): GeneralPage.GeneralPage 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, 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":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"e506eabe3dc3a7c68af65f96620c46e2d9c77109bb0fec82dc49ec9188b0326b"}},{"ruleId":"D1","level":"warning","message":{"text":"ModelsPage.ModelsPage (cyclomatic 18): ModelsPage.ModelsPage has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 4 of the 18 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 37, modelSubtitle, setVisibility, \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":"desktop/src/features/settings/ModelsPage.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d20a84596d6cda316b677be86c3501a1933869d4015065f8c40e2dd5bf9633f"}},{"ruleId":"D1","level":"warning","message":{"text":"ShortcutRecorder.ShortcutRecorder (cyclomatic 18): ShortcutRecorder.ShortcutRecorder has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to 4 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":"desktop/src/features/settings/ShortcutRecorder.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b0d131d5181bbdf0beea0f3115692a5d9b2678d0c13d334f6995ec3898a758"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentActivityList.labelForActivity (cyclomatic 18): AgentActivityList.labelForActivity 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":"desktop/src/features/agent/AgentActivityList.tsx"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"93da328553e8a0ffb646e6c42b98e10d4ef8e305dcc2a2c7d80d8d7a68f3660b"}},{"ruleId":"D1","level":"warning","message":{"text":"reconcileThreadHistory.reconcileThreadHistory (cyclomatic 18): reconcileThreadHistory.reconcileThreadHistory has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 25, 36). 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":"desktop/src/features/agent/reconcileThreadHistory.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6284f485e41e05bc789b235cc6c3dd4b7b0c61c9f6045a2b834eda1cb94b26e5"}},{"ruleId":"D1","level":"warning","message":{"text":"remoteClient.remoteConnectionPresentation (cyclomatic 18): remoteClient.remoteConnectionPresentation 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":"desktop/src/features/remote/remoteClient.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"4132f01cb5221efe232809961708c5600e16afce88dc45ae6d194f7680ea250a"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreadListItem.ThreadListItemImpl (cyclomatic 18): ThreadListItem.ThreadListItemImpl 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":"desktop/src/components/layout/ThreadListItem.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"752594901bdc41dbf1e60d82b1211c55498e7b1d7cee4e9aa145f10c577268d0"}},{"ruleId":"D1","level":"warning","message":{"text":"DeviceChoiceDialog.DeviceChoiceDialog (cyclomatic 18): DeviceChoiceDialog.DeviceChoiceDialog has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 3 function items inside it that branch (a function literal at line 101, heldNote, a function literal at line 152). 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":"desktop/src/features/remote-peer/DeviceChoiceDialog.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d9550b93c0574c271d589f92151c3cc6de130a29b42a34369173a64ac64c0c"}},{"ruleId":"D1","level":"warning","message":{"text":"useHasProviders.useHasProviders (cyclomatic 18): useHasProviders.useHasProviders has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 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":"desktop/src/components/layout/hooks/useHasProviders.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df3e4fd5f4ef0e28adc335299d7999c51a34edd23078489a1586482fc916a1b"}},{"ruleId":"D1","level":"warning","message":{"text":"useFutureLoginFlow.useFutureLoginFlow (cyclomatic 18): useFutureLoginFlow.useFutureLoginFlow has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 101). 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":"desktop/src/features/settings/useFutureLoginFlow.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cc0dcf666a3354b9bb555e2e5399291919d2d5825e8274101772000cecbaa9"}},{"ruleId":"D1","level":"warning","message":{"text":"draftStorage.loadSessionDraftDirect (cyclomatic 18): draftStorage.loadSessionDraftDirect has cyclomatic complexity 18 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 6 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":"mobile/src/remote/draftStorage.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b2db1e151c035c55f2781e96a41189425d817d8a6d38e27b9e75ffe54b0d59"}},{"ruleId":"D1","level":"warning","message":{"text":"historyPaging.retainOlderHistoryPrefix (cyclomatic 18): historyPaging.retainOlderHistoryPrefix has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 178, 173, 182, \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":"mobile/src/remote/timeline/historyPaging.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6ef424e957f307b49655cbcdefe524a5f2d17701a90ed2488c5820d7c552de"}},{"ruleId":"D1","level":"warning","message":{"text":"useComposerDraft.useComposerDraft (cyclomatic 18): useComposerDraft.useComposerDraft has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 60, 125, 58, \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":"mobile/src/features/chat/useComposerDraft.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a80d9f9fe90445863823039e7d1a9b5004108ea87aa30fd42ccfa1f20482c46"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillPicker.SkillPicker (cyclomatic 18): SkillPicker.SkillPicker 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 8 function literals inside it that branch (lines 112, 132, 56, \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":"mobile/src/features/chat/components/SkillPicker.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"560b0d6e72c88381156f6e40ae361bbd43679cc9ee8e164be3c883a2e319755d"}},{"ruleId":"D1","level":"warning","message":{"text":"sessionTree.mergedRows (cyclomatic 18): sessionTree.mergedRows has cyclomatic complexity 18 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 9 belong to 5 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d776e8380f00655585831da58a32e2488f59a30c66a394146ff89b6b26526d18"}},{"ruleId":"D1","level":"warning","message":{"text":"localPath.localFilePath (cyclomatic 18): localPath.localFilePath 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":"packages/markdown/src/localPath.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb3109a7dd246d500ad6e2c04c7cc7f46c2ce369beefd009991c2d1deb7ad41"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteClient.signal (cyclomatic 18): RemoteClient.signal 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":"packages/remote-client/src/client.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e7d8e65a97cdd92ae1b280bb8dad2f4245d51bcbebcf237032a4759b5e18ea"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteClient.runHandshake::run (cyclomatic 18): RemoteClient.runHandshake::run 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf4f2a0cbd91edc4e5cd0a03548ca25bc9828325a32fb41b49694269523d034"}},{"ruleId":"D1","level":"warning","message":{"text":"Snapshot::entry_impl (cyclomatic 17): Snapshot::entry_impl has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/reader.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9c45816ddda0aab5a7f1781bcf7698abc64ec5ef84ca30654011f7d0132e69"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteStore::publish_segmented_metadata (cyclomatic 17): SqliteStore::publish_segmented_metadata 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":"agent/src/session/content/metadata.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4bf6c891803e6b03ec9978b3d8f6b9829fced0299db942a5141b90d3a8555f"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteStore::append_stream_entry (cyclomatic 17): SqliteStore::append_stream_entry 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":"agent/src/session/content/stream_entry.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a402e54de6c44a71b5f0d91b80780790b12b6a93e42213cb9bea67dcbe7eea"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::compaction::semantic::evidence::prepare_with_handoff_summary (cyclomatic 17): future_agent::compaction::semantic::evidence::prepare_with_handoff_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":"agent/src/compaction/semantic/evidence.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"511fc4aee7f6f9c09659487f8be7ee1c6f09d58aa4875371c7d567c9a72febcf"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::rpc::broadcaster::journal_writer::flush_event_batch (cyclomatic 17): future_agent::rpc::broadcaster::journal_writer::flush_event_batch 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":"agent/src/rpc/broadcaster/journal_writer.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"84aabfd7e7579280399c632c196746ff7db08ad75759185e5542390f3f93a89f"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::content::entries::stage_named (cyclomatic 17): future_agent::session::content::entries::stage_named 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":"agent/src/session/content/entries.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a2dc1c15e61d7037b7603d0d89717c82ae814e87203cdf891e2842aa7bcb49"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::history::paging::read_display_page (cyclomatic 17): future_agent::session::history::paging::read_display_page 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":"agent/src/session/history/paging.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3e59b2e409061a718273bc7913e890ca8e10f8e52f4b99a10adb4dfe59b3b6"}},{"ruleId":"D1","level":"warning","message":{"text":"future_channel::feishu::feishu_ws::is_bot_mentioned (cyclomatic 17): future_channel::feishu::feishu_ws::is_bot_mentioned 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/feishu_ws.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e065324c642fe612876d820cadb6911036c5e4d4da64195c6d6105e942e6ad"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::mcp_servers::mcp_add (cyclomatic 17): future_cli::commands::mcp_servers::mcp_add 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":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06bc3378c1b433b71939c3fda2abccdc46fda651d45489818dc69f90ca798ce"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::models::models (cyclomatic 17): future_cli::commands::models::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":"cli/src/commands/models.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd14cf7bd6536e6f6f3a86ca769cbf32ac6132cd242a54b82b7cbd8451f10e8"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session::new_session_command (cyclomatic 17): future_cli::commands::session::new_session_command 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":"cli/src/commands/session.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b65d1ed56f467ecb3df56739ad31d8fbee0319e0b1915e73b139d7db9eb4df"}},{"ruleId":"D1","level":"warning","message":{"text":"NatsHealth::handle_event (cyclomatic 17): NatsHealth::handle_event has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/health.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"330512a7ffbac5d794854d8ec092a2b4dd511cf10d147dcb7480ad2074f77e80"}},{"ruleId":"D1","level":"warning","message":{"text":"Supervisor::start_slot (cyclomatic 17): Supervisor::start_slot 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":"packages/remote-server/src/supervisor/start.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"61df9fc42694cf71a81f412e1583b579b3d78f643dee126ecfb9885b9763eb3a"}},{"ruleId":"D1","level":"warning","message":{"text":"future_remote_server::wire_limits::truncated_event_data (cyclomatic 17): future_remote_server::wire_limits::truncated_event_data 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":"packages/remote-server/src/wire_limits.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a25920bc5a0fd6c71f254ee90bb663f099f135eaeff5bdcc5912c073e038557"}},{"ruleId":"D1","level":"warning","message":{"text":"ChatArea::render_assistant_message (cyclomatic 17): ChatArea::render_assistant_message 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":"tui/src/components/chat_area.rs"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb3f45b47131781454f0fba604d27da043497cf6f09c3b94a73b139d0077f1e"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownTheme::with_partial (cyclomatic 17): MarkdownTheme::with_partial 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":"tui/src/components/markdown.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b008b76cf401b5df5b27c3cb13181941c92e769da551bfe44b4db9512db6880"}},{"ruleId":"D1","level":"warning","message":{"text":"TuiSettings::to_json (cyclomatic 17): TuiSettings::to_json 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":"tui/src/settings.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca0e402787c4853ba534741fec78474ee373fa6ca87feabe958914869e4ddd4"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::components::diff::parse_unified_diff (cyclomatic 17): future_tui::components::diff::parse_unified_diff 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":"tui/src/components/diff.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c67fbf65093f198cccdc3ecec5efcf0380540b7bf4333a54d39b40730205ade"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::keys::parse_kitty_sequence (cyclomatic 17): future_tui::keys::parse_kitty_sequence has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: future_tui::keys::legacy_sequence_key_id (cyclomatic 66) 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":"tui/src/keys.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"d288faf617012a9148a0ce8a6d13555dd5644fc10b7c519b03c4cd4c5b6e0aa5"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::utils::wrap_text_with_ansi (cyclomatic 17): future_tui::utils::wrap_text_with_ansi 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":"tui/src/utils.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7071f4930cf84c5d723b8bbc366bd06a8326814266cc1c91f244470ad6ba80"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::git_panel::parse_worktrees (cyclomatic 17): future_tui::workbench::git_panel::parse_worktrees 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":"tui/src/workbench/git_panel.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23bb56bd26e3f56450e471f376946574daad75bc663d694e4263e575bc3a61a"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::panels::rows_with (cyclomatic 17): future_tui::workbench::panels::rows_with has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/panels.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"7099e45cdcd547b2359d349510f80b1a8718fc444b172d3a79e0e13f770a0221"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::screen::diff_review_box (cyclomatic 17): future_tui::workbench::screen::diff_review_box 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":"tui/src/workbench/screen.rs"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8711b35f7ace8567a82e836982a3982aea5b1a5d7459afe9db7118f516db583f"}},{"ruleId":"D1","level":"warning","message":{"text":"ChoiceCard.ChoiceOptionRow (cyclomatic 17): ChoiceCard.ChoiceOptionRow 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":"desktop/src/features/markdown/renderers/ChoiceCard.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66383f3639c3a7d9b8a0837d2863625ed90168f54ce2ec3a902ec56f7feaf02"}},{"ruleId":"D1","level":"warning","message":{"text":"remotePeerClient.promptRemoteConversation (cyclomatic 17): remotePeerClient.promptRemoteConversation 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f162d8bc0b346a1907c68bd0c5885c072c61a96b18bd9b24a7b3c3230ef78368"}},{"ruleId":"D1","level":"warning","message":{"text":"FusionSettingsPage.Form (cyclomatic 17): FusionSettingsPage.Form has cyclomatic complexity 17 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 6 belong to 3 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":"desktop/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58e96b0dd7f0187dde236390c7a4fc661415aa12d924c0ecdaee364e598484d"}},{"ruleId":"D1","level":"warning","message":{"text":"ShortcutsPage.ShortcutsPage (cyclomatic 17): ShortcutsPage.ShortcutsPage has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 171, a function literal at line 49, rowFor, \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":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05fe164abf9529deea468d2ee205419d3083e7098405128a85a835e1f25cc9d"}},{"ruleId":"D1","level":"warning","message":{"text":"PdfPreview.PdfPreview (cyclomatic 17): PdfPreview.PdfPreview has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 83, 34, 75, \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":"desktop/src/features/artifacts/PdfPreview.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"0672fb8346ff28d58197892bd66c6e07c96ca330b722e8b8c6f46ade66f65de9"}},{"ruleId":"D1","level":"warning","message":{"text":"RunInspectPanel.RunInspectPanel (cyclomatic 17): RunInspectPanel.RunInspectPanel 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":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f993602639f0abe99604406e8d0414e5006b1794ea97f6ff8f05ec2566256511"}},{"ruleId":"D1","level":"warning","message":{"text":"RunsPanel.RunsPanel (cyclomatic 17): RunsPanel.RunsPanel has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (archiveFinished, a function literal at line 87, a function literal at line 95, \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":"desktop/src/features/runs/RunsPanel.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6848a0dfa392548e52d68634903767c20b78bffacc57ac7842d65c4380bcca06"}},{"ruleId":"D1","level":"warning","message":{"text":"mentionDom.serialize (cyclomatic 17): mentionDom.serialize has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (visit). 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":"desktop/src/features/agent/composer/mentionDom.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20c58e49815b086b8639a6044fe7406edf9f0909d22d35ee31635a27293303a"}},{"ruleId":"D1","level":"warning","message":{"text":"remotePeerError.remotePeerErrorKind (cyclomatic 17): remotePeerError.remotePeerErrorKind 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":"desktop/src/features/remote-peer/remotePeerError.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11489845388cb6d446e9ded262ab014c83c68359f434c7a2fe6c9afa487522d"}},{"ruleId":"D1","level":"warning","message":{"text":"useAgentConnection.useAgentConnection.refreshAgentModels (cyclomatic 17): useAgentConnection.useAgentConnection.refreshAgentModels has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 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":"desktop/src/components/layout/hooks/useAgentConnection.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e55be397a590f1bed8b3f18a6517f9fe0f775f54e44b5344a24773287d070a"}},{"ruleId":"D1","level":"warning","message":{"text":"useRemotePeers.handlePresence (cyclomatic 17): useRemotePeers.handlePresence 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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc11db6ea8d57b8c779845070a029da08d23a15f0da5282d76c4d4522f39eaa"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.loadHistory (cyclomatic 17): index.html.loadHistory 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: index.html.performHandshake (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":"host/web/index.html"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b379e3010420cb78880b373e077ad7e30102a1607919bdbd8457b448ab0459"}},{"ruleId":"D1","level":"warning","message":{"text":"useChatFiles.useChatFiles.openLocalPath (cyclomatic 17): useChatFiles.useChatFiles.openLocalPath 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"20eabb5f86e665ea2286347c9f078138124341df7fc743faaaab547ae163401d"}},{"ruleId":"D1","level":"warning","message":{"text":"sessionTree.groupMergedRows (cyclomatic 17): sessionTree.groupMergedRows has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b353c0d28231ce927cfed22e254b762afd8cdd0f8a35c4050a618e69ae211e"}},{"ruleId":"D1","level":"warning","message":{"text":"htmlBlocks.htmlBlockToNodes (cyclomatic 17): htmlBlocks.htmlBlockToNodes has cyclomatic complexity 17 (threshold 15). Of this number, 16 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. This is NOT this file\u0027s highest cyclomatic complexity: htmlBlocks.inlineNode (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/markdown/src/htmlBlocks.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"44002ae930f2f3a5c1ed8658cfd6ea58b0d8a41a5fea12db88c39e32693e3535"}},{"ruleId":"D1","level":"warning","message":{"text":"projection.segmentToTimeline (cyclomatic 17): projection.segmentToTimeline 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"0519b7ffa79fb286cb5975e2661bb81bee1f86839b0168faf89ded653be761d5"}},{"ruleId":"D1","level":"warning","message":{"text":"contentBody.createContentEventLane.pump (cyclomatic 17): contentBody.createContentEventLane.pump has cyclomatic complexity 17 (threshold 15). Of this number, 16 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":"packages/thread-projection/src/contentBody.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4426762cd48fa037e938218f4ae3a1d2c7a85776eea4bdb02e7fd6f630e9f06"}},{"ruleId":"D1","level":"warning","message":{"text":"FutureAgentService::execute_command (cyclomatic 16): FutureAgentService::execute_command 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":"agent/src/grpc/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c7493f52db696588f9f915c4e679063028dac6690537e54f6089d8ee0be1bb"}},{"ruleId":"D1","level":"warning","message":{"text":"Manager::read_history_entry (cyclomatic 16): Manager::read_history_entry 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":"agent/src/session/history/recall.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05973e52a1f43c9cb2925476a98ef0ac2076a7c3da12827ef81f59b5ee492a2"}},{"ruleId":"D1","level":"warning","message":{"text":"SkillManager::install_locked (cyclomatic 16): SkillManager::install_locked has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/skills/manager.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc3a3962f0e345a19c06f7ac8c6ca2f75c00e423f2927a48de04b2564ca6fcc"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::approval_review::policy::decide (cyclomatic 16): future_agent::approval_review::policy::decide 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":"agent/src/approval_review/policy.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2916beed28d886658a0284315e90eaa366da60b3cd1782bf219a4c1ab6480d65"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::llm::adapters::openai_chat::lower_messages (cyclomatic 16): future_agent::llm::adapters::openai_chat::lower_messages 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":"agent/src/llm/adapters/openai_chat.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1cd471dd3834557803dedb030f9044c02a6082a1ecf1464f944dd41ab4fea8"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::rpc::broadcaster::journal_writer::run_event_batch_writer (cyclomatic 16): future_agent::rpc::broadcaster::journal_writer::run_event_batch_writer 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":"agent/src/rpc/broadcaster/journal_writer.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dc47db1058e0e4c4894038dff3e3aa1290f83f7f3e33685ed437d14b4c61c5"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::service::startup::initialize (cyclomatic 16): future_agent::service::startup::initialize 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":"agent/src/service/startup.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8a793fde877e3bf732ce197394380c5475fe8da2097c852bf71ee20a8fa7a8"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::session::title_preview::paged (cyclomatic 16): future_agent::session::title_preview::paged 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":"agent/src/session/title_preview.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"448f66417d1d349feb18a445979afa8b01e52852d550417c7756fd1d7a944b78"}},{"ruleId":"D1","level":"warning","message":{"text":"future_agent::tools::is_protected_rm_target (cyclomatic 16): future_agent::tools::is_protected_rm_target 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":"agent/src/tools/mod.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"299c16c0a95c78b9cafbc7227b630f0b7cb1a1feadae9be942033df45ef32ee9"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::mcp_servers::mcp_status (cyclomatic 16): future_cli::commands::mcp_servers::mcp_status 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":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ad00bce98b91f649f83e82269accf2ec971094f7e0cd3fd583aaf012ebf9ca"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::remote::remove (cyclomatic 16): future_cli::commands::remote::remove 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":"cli/src/commands/remote.rs"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"f831ff3d06ca579a41698166bface51011d4e48f1596b7e68cb5add979f43e71"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::session_status::format_status (cyclomatic 16): future_cli::commands::session_status::format_status 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":"cli/src/commands/session_status.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac6d8c1c215d19a2f560bbd4bfa2f04ec318dae60f2605bb574c0bc87d615ef"}},{"ruleId":"D1","level":"warning","message":{"text":"future_cli::commands::tools::format_search_paper (cyclomatic 16): future_cli::commands::tools::format_search_paper 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":"cli/src/commands/tools.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed62e665162aba8400217205eef063a2308a3118c40e5e4a9be2b19928806b6"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::remote_host::files::claim_uploads (cyclomatic 16): future_host::remote_host::files::claim_uploads 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: future_host::remote_host::files::mime_type_for_name (cyclomatic 63) 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":"host/src/remote_host/files.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"df853a843ff9550fef012c0399b52493384045a96afbb04b31fcd720b476fdbb"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::store::markdown_refs::resolve::resolve_markdown_reference (cyclomatic 16): future_host::store::markdown_refs::resolve::resolve_markdown_reference 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":"host/src/store/markdown_refs/resolve.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6aea07d4e8d70dd2bbd6439be09abcd14fefaf7433ddaca354154fc5f7536c"}},{"ruleId":"D1","level":"warning","message":{"text":"future_host::tasks::execute (cyclomatic 16): future_host::tasks::execute 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":"host/src/tasks.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"779721891406481761e37ca6628f768d44e43b60ffba0f9055719ee460fd673c"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::components::markdown::blockquote_raw_text (cyclomatic 16): future_tui::components::markdown::blockquote_raw_text has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (render_inline_text). 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":"tui/src/components/markdown.rs"},"region":{"startLine":2079}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e88b42e6868535a4ace24ca4b563697451efaa5ed664599ac558c97e3fc405"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::terminal_image::detect_capabilities (cyclomatic 16): future_tui::terminal_image::detect_capabilities 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":"tui/src/terminal_image.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"11024ad2137ff8b98ae0f539501eda20b945100fdde2aa93c495f43990e2cb77"}},{"ruleId":"D1","level":"warning","message":{"text":"future_tui::workbench::run::key_events (cyclomatic 16): future_tui::workbench::run::key_events 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":"tui/src/workbench/run.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7be900c7f9d3c9629a5e00df4738d0b838526303aac0ae4c474c81923c99cd"}},{"ruleId":"D1","level":"warning","message":{"text":"ShareInbox.take (cyclomatic 16): ShareInbox.take 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":"mobile/modules/future-share-intent/ios/ShareInbox.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0690e81178dd2c4b70892aa55d65b6a0de06566a185fcd0604bab88059e9aa4"}},{"ruleId":"D1","level":"warning","message":{"text":"storage-read-benchmark.run (cyclomatic 16): storage-read-benchmark.run has cyclomatic complexity 16 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 2 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":"desktop/scripts/storage-read-benchmark.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d499173737aa3480081f1ba12dc18c35949f13105ca4030230b031bf1395c8d"}},{"ruleId":"D1","level":"warning","message":{"text":"FutureEmbed.FutureEmbed (cyclomatic 16): FutureEmbed.FutureEmbed 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":"desktop/src/features/markdown/renderers/FutureEmbed.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93a5788aeea640ac5298d4aa40e01c43f4a45001e8d71f6f381bb1fde8097bc"}},{"ruleId":"D1","level":"warning","message":{"text":"choiceAnswer.parseChoiceAnswer (cyclomatic 16): choiceAnswer.parseChoiceAnswer 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":"desktop/src/features/agent/composer/choiceAnswer.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8172446259b7f8a0aad0f5f9bbf43bdabbad639f87df5c4f5464a999c2faef73"}},{"ruleId":"D1","level":"warning","message":{"text":"mergeConversations.mergeRemoteSessionDelta (cyclomatic 16): mergeConversations.mergeRemoteSessionDelta has cyclomatic complexity 16 (threshold 15). Of this number, 13 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0aaec8dc14c611603340df4057fc0c812e9d4975d67eea378f7c90352088127"}},{"ruleId":"D1","level":"warning","message":{"text":"remotePeerClient.hostWorkspaceRows (cyclomatic 16): remotePeerClient.hostWorkspaceRows 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 one function literal inside it that branches (line 1297). 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f0d2bbfc53253599e3c9ce4ea0d98fe81d35debd781e7e0170d5ebf909f766"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteComposer.RemoteComposer::pasteFiles (cyclomatic 16): RemoteComposer.RemoteComposer::pasteFiles 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 (RemoteComposer.RemoteComposer, RemoteComposer.RemoteComposer::send) 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c580ab5563eb4b0168b9a9756d10e547e86495d329bda64921d6d3f02c3ecf9"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteComposer.RemoteComposer::send (cyclomatic 16): RemoteComposer.RemoteComposer::send 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 shape REPEATS in the file: 2 other methods here (RemoteComposer.RemoteComposer, RemoteComposer.RemoteComposer::pasteFiles) 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9812580c2c51edd831bd33b6afbfb2b6e98cc8a89597f8963d2847adbf41fc"}},{"ruleId":"D1","level":"warning","message":{"text":"EnvironmentPage.EnvironmentPage (cyclomatic 16): EnvironmentPage.EnvironmentPage has cyclomatic complexity 16 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body: 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":"desktop/src/features/settings/EnvironmentPage.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1f3d19b0709a0e4be03223e94d3cd22e2ccac3d1cb1e083253bf5abe918698"}},{"ruleId":"D1","level":"warning","message":{"text":"BuiltinProviderKeyDialog.BuiltinProviderKeyDialog (cyclomatic 16): BuiltinProviderKeyDialog.BuiltinProviderKeyDialog has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to 3 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":"desktop/src/features/settings/BuiltinProviderKeyDialog.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56b8c1e019bc12e68260a402d284c4a42dbe9f76c2122eb201dd9859fb42014"}},{"ruleId":"D1","level":"warning","message":{"text":"useContextData.useContextData.refreshContext (cyclomatic 16): useContextData.useContextData.refreshContext 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":"desktop/src/components/layout/hooks/useContextData.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe5c1d65ebc34cbfc339d6bb804b0dadd65f0f1a83a873bf19a5ae63637e06c"}},{"ruleId":"D1","level":"warning","message":{"text":"GitHistoryPanel.GitHistoryPanel (cyclomatic 16): GitHistoryPanel.GitHistoryPanel has cyclomatic complexity 16 (threshold 15). Of this number, 14 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":"desktop/src/features/git-history/GitHistoryPanel.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5e430974788c6b6f2c294164b9df7d14cb9bc2c428bd2f0f0959c5b657a47a"}},{"ruleId":"D1","level":"warning","message":{"text":"agentStateCache.getAgentState (cyclomatic 16): agentStateCache.getAgentState has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 138). 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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"333054d8b7a1d60f7911a50425daa3574767a1fa53cd5149cb3ab6203af447cd"}},{"ruleId":"D1","level":"warning","message":{"text":"threadSearchRanges.findThreadTextRanges (cyclomatic 16): threadSearchRanges.findThreadTextRanges 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":"desktop/src/features/agent/threadSearchRanges.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf2f85d05193389e6e7caab083cdba87a0d4eb2be098a3a0b98863e05c718ef"}},{"ruleId":"D1","level":"warning","message":{"text":"runHistoryProjection.applyRunMetadata (cyclomatic 16): runHistoryProjection.applyRunMetadata has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 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":"desktop/src/features/agent/history/runHistoryProjection.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d1be15a3e2d871244caeec7b8cf62d02a3d1fa298c7247c1f43837db4f2989"}},{"ruleId":"D1","level":"warning","message":{"text":"AddToVibeDialog.AddToVibeDialog (cyclomatic 16): AddToVibeDialog.AddToVibeDialog 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 10 function literals inside it that branch (lines 61, 200, 189, \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":"desktop/src/features/vibe/AddToVibeDialog.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"882a58856c2d5c3f4e47061d0ead01230ff74c7222026e7d08f3f3aa8f3b2cdb"}},{"ruleId":"D1","level":"warning","message":{"text":"VibeMenu.VibeMenu (cyclomatic 16): VibeMenu.VibeMenu has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 57, 78, 131). 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":"desktop/src/features/vibe/VibeMenu.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6cb2974f28a91d4e7a68adb32fcf8546e75e1395d3f9cd93363e53941a2cd9"}},{"ruleId":"D1","level":"warning","message":{"text":"useRemoteApprovals.useRemoteApprovals (cyclomatic 16): useRemoteApprovals.useRemoteApprovals has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 57, 101, 50, \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":"desktop/src/features/remote-peer/useRemoteApprovals.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bed64e33b6219e3e198f7415181c22423742bce5498db4690926c04857a138"}},{"ruleId":"D1","level":"warning","message":{"text":"threadTree.buildTree (cyclomatic 16): threadTree.buildTree 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":"desktop/src/components/layout/threadTree.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b839f97276577c79f98b42f6be8a237e89e804e7386b722cd8f1c49d64daf5e"}},{"ruleId":"D1","level":"warning","message":{"text":"DeviceSelector.DeviceSelector (cyclomatic 16): DeviceSelector.DeviceSelector has cyclomatic complexity 16 (threshold 15). Of this number, 9 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":"desktop/src/components/layout/DeviceSelector.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5010abd51f79706b2ee0a50e3843f743eafda33a0323e83c5c8e25a6de0de4d"}},{"ruleId":"D1","level":"warning","message":{"text":"fusion.fusionProgress.models (cyclomatic 16): fusion.fusionProgress.models 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":"packages/thread-projection/src/fusion.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c838a4c74a1c14073c0e43834a63337b5006f19f4f3e9a50d0028326169485c4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.html.document.addEventListener(\u0022keydown\u0022) (cyclomatic 16): index.html.document.addEventListener(\u0022keydown\u0022) 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.html.performHandshake (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":"host/web/index.html"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9dee02b84ad128aeac642e80bc94aa5106bb43caeb646f91fcc95800f3b5fd"}},{"ruleId":"D1","level":"warning","message":{"text":"codeHighlight.highlightCode (cyclomatic 16): codeHighlight.highlightCode has cyclomatic complexity 16 (threshold 15). Of this number, 9 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":"mobile/src/components/codeHighlight.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a87eb912d87044df1549b790377fb6c2cd9b8b66bbff10c61e82df8255d198b1"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownImage.LocalImage (cyclomatic 16): MarkdownImage.LocalImage has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 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":"mobile/src/components/MarkdownImage.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"1397a5eaf76ed107143bf1112a506a3f6cc1e2207133ddcd817450a17e1c9528"}},{"ruleId":"D1","level":"warning","message":{"text":"mathSvg.renderMathSvg (cyclomatic 16): mathSvg.renderMathSvg 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":"mobile/src/components/mathSvg.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfcde4b942d74a43e471ad96c1c473496c2f839446fd183e7e69b9ab6be8296"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownText.CodeSource (cyclomatic 16): MarkdownText.CodeSource has cyclomatic complexity 16 (threshold 15). Of this number, 10 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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"30232b6d3e8bdb0d5c3b3049aaad9f7dbf6b921b66385b6e6819fc4541ecf9aa"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkdownText.MarkdownText (cyclomatic 16): MarkdownText.MarkdownText has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 541, 532, 580, \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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"da755743d1c230ac116e4adf6ca3b600b226187e5acab822b83792b23bd660d9"}},{"ruleId":"D1","level":"warning","message":{"text":"connectionPresentation.connectionPresentation (cyclomatic 16): connectionPresentation.connectionPresentation 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":"mobile/src/remote/connectionPresentation.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"054a0a9ccae5f5de4e3e093ba7ab1b31edef1353ebf0b0929370cc32dec8d849"}},{"ruleId":"D1","level":"warning","message":{"text":"usePromptOutbox.usePromptOutbox.recoverPendingContinuation (cyclomatic 16): usePromptOutbox.usePromptOutbox.recoverPendingContinuation has cyclomatic complexity 16 (threshold 15). Of this number, 8 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bfa1c0b940a5d2aa89c4710c68aeead77efd97093c173aeb1b9c7aa94841c3"}},{"ruleId":"D1","level":"warning","message":{"text":"useAttachmentPicker.useAttachmentPicker.chooseFromAlbum (cyclomatic 16): useAttachmentPicker.useAttachmentPicker.chooseFromAlbum 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":"mobile/src/features/chat/useAttachmentPicker.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"472f1969c6db21e53f005462481d83d9ebdc75ba84ade080071c91ed920eb746"}},{"ruleId":"D1","level":"warning","message":{"text":"sessionTree.buildSessionTree (cyclomatic 16): sessionTree.buildSessionTree 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0f3ce015bba5be348a8c38e85865f8e0ff6e43e89a9c3aafee8d66919c3529"}},{"ruleId":"D1","level":"warning","message":{"text":"recentRows.recentHierarchy (cyclomatic 16): recentRows.recentHierarchy 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":"mobile/src/screens/recentRows.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e74c1f16c63738141aa285db53dc032d163aaae52f25df4bcbb1853ba797650"}},{"ruleId":"D1","level":"warning","message":{"text":"disconnectedCopy.disconnectedCopy (cyclomatic 16): disconnectedCopy.disconnectedCopy 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":"mobile/src/remote/disconnectedCopy.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7992d99e9a2e5c8596730f0e989cccbc006be0a773d0989448d757e2b6a151ba"}},{"ruleId":"D1","level":"warning","message":{"text":"index.numberEnd (cyclomatic 16): index.numberEnd 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":"packages/json-preview/src/index.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e05fcd28b23cb8b45df998c5fb5dc3c85ef16998428f710146c28b9fa43985"}},{"ruleId":"D1","level":"warning","message":{"text":"RemoteClient.runRecovery (cyclomatic 16): RemoteClient.runRecovery 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":"packages/remote-client/src/client.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f12fce5c9291a6c32a2ce55c48c29cd9fffa6eb611b7ad7df374a1a5f6bcdd4"}},{"ruleId":"D1","level":"warning","message":{"text":"SyncEngine.runPrefixDecision (cyclomatic 16): SyncEngine.runPrefixDecision has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"9490c5732941d3fff21d38265ef8eb42f0809f16c8e69035c48486d2d0a4e3ee"}},{"ruleId":"D1","level":"warning","message":{"text":"runIssuesEn (cyclomatic 16): runIssuesEn has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs 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":"harness/lib/issues-en-run.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e2fc1ee720e0538c9e0536f98de7813ec723bcc1e6ed2255b5313606b970b6"}},{"ruleId":"D2","level":"warning","message":{"text":"ActivityRail.ActivityRail (cognitive 444): ActivityRail.ActivityRail has cognitive complexity 444 (threshold 15). Drivers by points: ternaries 106 (247 pts), if/else 63 (88 pts), boolean chains 81, loops 23 (28 pts) (nesting depth added 171). Of this number, 214 points are the body\u0027s own statements and 230 belong to 72 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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b141ae1820a810575d0390012e0ac41fdc923607332326bdc453ca1610d1308e"}},{"ruleId":"D2","level":"warning","message":{"text":"Loop::run_streaming_inner (cognitive 400): Loop::run_streaming_inner has cognitive complexity 400 (threshold 15). Drivers by points: if/else 124 (327 pts), loops 12 (29 pts), match/switch 8 (26 pts), boolean chains 18 (nesting depth added 238). 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":"agent/src/agent/run_loop.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"49276c80dd2a3147b095c1e355a911f8c34155647536950511b3fd134028febe"}},{"ruleId":"D2","level":"warning","message":{"text":"AppShell.ReadyAppShell (cognitive 242): AppShell.ReadyAppShell has cognitive complexity 242 (threshold 15). Drivers by points: ternaries 64 (144 pts), if/else 46 (52 pts), boolean chains 31, error handling 10 (12 pts), loops 3 (nesting depth added 88). Of this number, 136 points are the body\u0027s own statements and 106 belong to 54 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":"desktop/src/components/layout/AppShell.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7a7406daa2ba04ddf243841790fe2fb37227824d787cd9d5df6472ffe1565d"}},{"ruleId":"D2","level":"warning","message":{"text":"runCase (cognitive 235): runCase has cognitive complexity 235 (threshold 15). Drivers by points: if/else 82 (147 pts), ternaries 22 (50 pts), other 48, boolean chains 21, error handling 11 (18 pts), loops 1 (nesting depth added 100). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/run.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9569aa9ae6687226ce1947ba68f92626bea2ac93c3c29cdb05a0390b9071bb1"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::feishu::prompt_loop::run_prompt_loop (cognitive 214): future_channel::feishu::prompt_loop::run_prompt_loop has cognitive complexity 214 (threshold 15). Drivers by points: if/else 66 (182 pts), match/switch 9 (25 pts), boolean chains 5, loops 2 (nesting depth added 132). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/prompt_loop.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aafbc9a419c3ae84928022fb2ce558b17496cb73f646e8f180442b6127c091"}},{"ruleId":"D2","level":"warning","message":{"text":"liveApply.createProjector.processEvent (cognitive 211): liveApply.createProjector.processEvent has cognitive complexity 211 (threshold 15). Drivers by points: if/else 59 (118 pts), ternaries 21 (58 pts), boolean chains 31, loops 2 (4 pts) (nesting depth added 98). Of this number, 208 points are the body\u0027s own statements and 3 belong to 3 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a6ea09af242968a054e4680cbbd638e8a96a9bd5041f291a526fe46a0ad777"}},{"ruleId":"D2","level":"warning","message":{"text":"VibeStage.VibeStage (cognitive 187): VibeStage.VibeStage has cognitive complexity 187 (threshold 15). Drivers by points: ternaries 58 (99 pts), if/else 43 (52 pts), boolean chains 35, loops 1 (nesting depth added 50). Of this number, 75 points are the body\u0027s own statements and 112 belong to 40 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":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5013bada4fcf0fe2aa9b92433103694cb1fbbb96b5861be032d3ff9c744c89d9"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionsScreen.SessionsScreen (cognitive 183): SessionsScreen.SessionsScreen has cognitive complexity 183 (threshold 15). Drivers by points: ternaries 45 (78 pts), boolean chains 53, if/else 36 (47 pts), error handling 4, loops 1 (nesting depth added 44). Of this number, 86 points are the body\u0027s own statements and 97 belong to 31 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":"mobile/src/screens/SessionsScreen.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f11b626ba903a98772f253d2cb817ef757050dc877a28192861ce98bdcdd8a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::keys::matches_key (cognitive 171): future_tui::keys::matches_key has cognitive complexity 171 (threshold 15). Drivers by points: if/else 57 (122 pts), boolean chains 48, match/switch 1 (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":"tui/src/keys.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"190e3a0905c992e7be70b2e4f77f2eba4b675efa48f0a60d999466df5031532c"}},{"ruleId":"D2","level":"warning","message":{"text":"TimelineCard.TimelineCardView (cognitive 157): TimelineCard.TimelineCardView has cognitive complexity 157 (threshold 15). Drivers by points: ternaries 38 (122 pts), boolean chains 22, if/else 8 (12 pts), loops 1 (nesting depth added 88). Of this number, 133 points are the body\u0027s own statements and 24 belong to 6 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":"mobile/src/features/chat/messages/TimelineCard.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e70cca7d90ff356465e9bef4948a8c79a0bb46d38a1755a1358988599a48b53"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::run::quit (cognitive 155): future_tui::workbench::run::quit has cognitive complexity 155 (threshold 15). Drivers by points: if/else 42 (99 pts), match/switch 15 (49 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 94). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/run.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b507486f138d775022b60b697da7a182c77ef5ae8ce6de55dc17d0fe1472ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"future_remote_server::commands::command_loop_with_ready (cognitive 153): future_remote_server::commands::command_loop_with_ready has cognitive complexity 153 (threshold 15). Drivers by points: if/else 29 (123 pts), match/switch 5 (25 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 115). 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":"packages/remote-server/src/commands.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebd133232450918b65e65c9ed51fd297761e1f32ea3c8f9c2432aef8a9b050a"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::recover_segmented_run (cognitive 142): SqliteStore::recover_segmented_run has cognitive complexity 142 (threshold 15). Drivers by points: if/else 28 (117 pts), loops 4 (11 pts), match/switch 2 (10 pts), boolean chains 4 (nesting depth added 104). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/recovery.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"000ce6cf85964eedfce1fe89ae42ec8b2ff93349bc54b9033984a5199fa7b7d1"}},{"ruleId":"D2","level":"warning","message":{"text":"FusionToolRow.FusionToolRow (cognitive 139): FusionToolRow.FusionToolRow has cognitive complexity 139 (threshold 15). Drivers by points: ternaries 33 (105 pts), if/else 12 (17 pts), boolean chains 16, error handling 1 (nesting depth added 77). Of this number, 23 points are the body\u0027s own statements and 116 belong to 6 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":"mobile/src/features/chat/messages/FusionToolRow.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6140fd90ae646540e6d60e67f976137a9d43765f1ab718ac65db700a50cc73bc"}},{"ruleId":"D2","level":"warning","message":{"text":"runCliCase (cognitive 139): runCliCase has cognitive complexity 139 (threshold 15). Drivers by points: if/else 26 (53 pts), ternaries 16 (42 pts), other 28, error handling 3 (8 pts), boolean chains 7, loops 1 (nesting depth added 58). Of this number, 131 points are the body\u0027s own statements and 8 belong to 16 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":"harness/lib/cli-driver.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2369c07d09c72d8a6b0911a9e53099ea74ad99dcf69b4c28e0134b7b61dcf737"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSession::prompt_internal (cognitive 137): ServerSession::prompt_internal has cognitive complexity 137 (threshold 15). Drivers by points: if/else 85 (114 pts), boolean chains 12, match/switch 9 (11 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"207d38e8f54e27226e92e3ff4f29e367b879de311697bd94b37dc6d59e383f47"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::run::event_loop (cognitive 132): future_tui::workbench::run::event_loop has cognitive complexity 132 (threshold 15). Drivers by points: if/else 34 (104 pts), match/switch 4 (12 pts), boolean chains 9, loops 3 (7 pts) (nesting depth added 82). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/run.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e429479b68b111acf3a35b5a2fdec41831d3de9e5fbeca5ca7f153eb949eeeb"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor::catalog_loop (cognitive 127): Supervisor::catalog_loop has cognitive complexity 127 (threshold 15). Drivers by points: if/else 23 (91 pts), match/switch 4 (20 pts), loops 3 (9 pts), boolean chains 7 (nesting depth added 90). 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":"packages/remote-server/src/supervisor/publisher.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d038cb212558fd096a75796f4ee6c13c0bd056ff65aacc207db80bd584a47f"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatScreen.ChatScreen (cognitive 117): ChatScreen.ChatScreen has cognitive complexity 117 (threshold 15). Drivers by points: ternaries 36 (44 pts), boolean chains 40, if/else 24 (27 pts), error handling 5, loops 1 (nesting depth added 11). Of this number, 51 points are the body\u0027s own statements and 66 belong to 30 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":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fedadc0e7841754ff298adbe0417ef40b73223b4ecb1e3b47aa0023c0db875"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::dispatch (cognitive 115): future_cli::dispatch has cognitive complexity 115 (threshold 15). Drivers by points: if/else 56 (79 pts), boolean chains 26, match/switch 5 (10 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc8cb41e2aabd889e883abef17ec297520a568a8f783f4c3cf18d11858d2149"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposerControls.ComposerControls (cognitive 110): ComposerControls.ComposerControls has cognitive complexity 110 (threshold 15). Drivers by points: ternaries 28 (77 pts), boolean chains 25, if/else 8 (nesting depth added 49). Of this number, 50 points are the body\u0027s own statements and 60 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":"desktop/src/features/agent/composer/ComposerControls.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"9475377a2c160f7069ce594e47ff7015ef9a6772d3c6333f4d94ad3563bdc6c7"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteContext.RemoteProvider (cognitive 109): RemoteContext.RemoteProvider has cognitive complexity 109 (threshold 15). Drivers by points: ternaries 53 (81 pts), boolean chains 17, if/else 11 (nesting depth added 28). Of this number, 35 points are the body\u0027s own statements and 74 belong to 28 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":"mobile/shot/mock/RemoteContext.tsx"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"661c5f5849e1f17b482fa66cddfdfebde79a23eee172ffa00e2baa84eca9e3b4"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::legacy_import::parse_sources (cognitive 108): future_agent::session::legacy_import::parse_sources has cognitive complexity 108 (threshold 15). Drivers by points: if/else 27 (90 pts), boolean chains 11, loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/legacy_import.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d7f5673b66da9859ae438723eaeb2c3be3f387649f572cc72105f13b5fbae0"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageBlock.MessageBlockImpl (cognitive 108): MessageBlock.MessageBlockImpl has cognitive complexity 108 (threshold 15). Drivers by points: ternaries 43 (69 pts), boolean chains 29, if/else 4 (7 pts), loops 2 (3 pts) (nesting depth added 30). Of this number, 95 points are the body\u0027s own statements and 13 belong 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":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c43fb8ab06ed6473d221f0bef2dad6b161a9ca2aaa160e429a12662be59670"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::remote_host::business::history::execute (cognitive 105): future_host::remote_host::business::history::execute has cognitive complexity 105 (threshold 15). Drivers by points: if/else 29 (70 pts), match/switch 13 (28 pts), boolean chains 7 (nesting depth added 56). 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":"host/src/remote_host/business/history.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3534fcefb9cf90d58c189792c9340a16191811b3ecacd960b7f300757d3b551"}},{"ruleId":"D2","level":"warning","message":{"text":"writeReport (cognitive 104): writeReport has cognitive complexity 104 (threshold 15). Drivers by points: ternaries 16 (46 pts), if/else 13 (22 pts), other 17, loops 7 (15 pts), boolean chains 4 (nesting depth added 47). Of this number, 91 points are the body\u0027s own statements and 13 belong to 17 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":"harness/lib/report.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a386729228b25acd228c08d98611bcd7345a735039b3b7181a1e3bb9804b8c83"}},{"ruleId":"D2","level":"warning","message":{"text":"OnboardingGate.OnboardingGate (cognitive 101): OnboardingGate.OnboardingGate has cognitive complexity 101 (threshold 15). Drivers by points: ternaries 26 (65 pts), if/else 12 (13 pts), boolean chains 12, error handling 6 (9 pts), loops 2 (nesting depth added 43). Of this number, 67 points are the body\u0027s own statements and 34 belong to 10 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":"desktop/src/components/layout/OnboardingGate.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"514f1de3700e83759f1bc437b0c802471893d53bfab487382330007c818f05b9"}},{"ruleId":"D2","level":"warning","message":{"text":"main (cognitive 100): main has cognitive complexity 100 (threshold 15). Drivers by points: if/else 25 (40 pts), loops 11 (29 pts), other 12, ternaries 6 (11 pts), error handling 2 (5 pts), boolean chains 3 (nesting depth added 41). Of this number, 89 points are the body\u0027s own statements and 11 belong to 21 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":"harness/cli.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21b4fe67291bf5a6cf6411f05085080b98d5a65473142470281b4276cf483df"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::remote_host::business::catalog::execute (cognitive 99): future_host::remote_host::business::catalog::execute has cognitive complexity 99 (threshold 15). Drivers by points: match/switch 22 (55 pts), if/else 23 (43 pts), boolean chains 1 (nesting depth added 53). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/catalog.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d993ca5ce323184f6e377dca0cf446ca5275de4ae7f279ba556ab908b7256034"}},{"ruleId":"D2","level":"warning","message":{"text":"PendingApprovalCard.PendingApprovalCard (cognitive 99): PendingApprovalCard.PendingApprovalCard has cognitive complexity 99 (threshold 15). Drivers by points: ternaries 34 (88 pts), boolean chains 11 (nesting depth added 54). Of this number, 88 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. 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":"mobile/src/features/chat/messages/PendingApprovalCard.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd0cd9c88cdd185281bd4172fd09332367bc2fe8a3cac629e58a4092321d2a4"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksSettingsPage.TaskForm (cognitive 98): TasksSettingsPage.TaskForm has cognitive complexity 98 (threshold 15). Drivers by points: ternaries 38 (69 pts), boolean chains 18, if/else 10 (11 pts) (nesting depth added 32). Of this number, 59 points are the body\u0027s own statements and 39 belong to 13 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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"583b45e8e5c64e5693a7392232fe238d890ac3dab76b3a96238114938c03954d"}},{"ruleId":"D2","level":"warning","message":{"text":"useRemoteTimeline.useRemoteTimeline (cognitive 97): useRemoteTimeline.useRemoteTimeline has cognitive complexity 97 (threshold 15). Drivers by points: if/else 46 (55 pts), boolean chains 22, ternaries 12 (17 pts), error handling 3 (nesting depth added 14). Most of this is not in the body itself: 1 of the 97 points is its own statement and the rest belongs to 15 function literals inside it that branch (lines 416, 648, 362, \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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a52067c47f6e1c87ba23e11e137894fc08a8fdb4001217538c5fd6317f3045"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::sqlite_store::transcript::insert_transcript_entries (cognitive 95): future_agent::session::sqlite_store::transcript::insert_transcript_entries has cognitive complexity 95 (threshold 15). Drivers by points: if/else 35 (84 pts), match/switch 2 (6 pts), boolean chains 3, loops 2 (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":"agent/src/session/sqlite_store/transcript.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"274e28c748802fb7891144126b92da1d40a3d81491fc0a2bb296a005b797f52b"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::content::entries::prepare_owned (cognitive 94): future_agent::session::content::entries::prepare_owned has cognitive complexity 94 (threshold 15). Drivers by points: if/else 28 (76 pts), loops 6 (14 pts), boolean chains 4 (nesting depth added 56). 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":"agent/src/session/content/entries.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d4a820444135f500a32293061c75123b7b1a7de49ce94207aa3b97de8dccd0"}},{"ruleId":"D2","level":"warning","message":{"text":"Workbench::handle_overlay_key (cognitive 94): Workbench::handle_overlay_key has cognitive complexity 94 (threshold 15). Drivers by points: if/else 23 (56 pts), match/switch 14 (32 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/mod.rs"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"8657e65f432d69f3257d023b50a279d42c30cc628926d9260f9b8fbf87c348f0"}},{"ruleId":"D2","level":"warning","message":{"text":"runRemoteMobileCase (cognitive 93): runRemoteMobileCase has cognitive complexity 93 (threshold 15). Drivers by points: other 41, if/else 18 (30 pts), boolean chains 8, ternaries 7 (8 pts), loops 5, error handling 1 (nesting depth added 13). Of this number, 31 points are the body\u0027s own statements and 62 belong to 28 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":"harness/lib/remote-mobile-live.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34f0a69e949954a011d755257034d4dae5b092e22a3a85e1893a9905ffb0355"}},{"ruleId":"D2","level":"warning","message":{"text":"RunClient::run (cognitive 87): RunClient::run has cognitive complexity 87 (threshold 15). Drivers by points: if/else 54 (82 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/rpc.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d193b35f5b936432816ecb4d3f648a8be7f0f0084038af40e59e19166009a85d"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentThread.AgentThread (cognitive 87): AgentThread.AgentThread has cognitive complexity 87 (threshold 15). Drivers by points: ternaries 35 (40 pts), if/else 19 (24 pts), boolean chains 19, loops 3, error handling 1 (nesting depth added 10). Of this number, 57 points are the body\u0027s own statements and 30 belong to 14 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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"164599f80a628a9c5b6e7698d946dd32e02c6fda326e45222f5091c87c797368"}},{"ruleId":"D2","level":"warning","message":{"text":"runRemoteLiveCase (cognitive 87): runRemoteLiveCase has cognitive complexity 87 (threshold 15). Drivers by points: other 28, if/else 23 (26 pts), boolean chains 14, error handling 6 (8 pts), ternaries 7, loops 4 (nesting depth added 5). Of this number, 19 points are the body\u0027s own statements and 68 belong to 31 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":"harness/lib/remote-live.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"035da005af16d428d29a98956cd888192efa929038ddb6ff10daf90085bff57a"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::stream_model (cognitive 86): Client::stream_model has cognitive complexity 86 (threshold 15). Drivers by points: if/else 20 (53 pts), loops 9 (19 pts), match/switch 7 (14 pts) (nesting depth added 50). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"4330cece8101a8c2f6fe0e20b4c003b01a47a803875b3291d05f18e5f3a6ae4f"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session::set_session_command (cognitive 84): future_cli::commands::session::set_session_command has cognitive complexity 84 (threshold 15). Drivers by points: if/else 31 (45 pts), match/switch 15 (32 pts), loops 3 (5 pts), boolean chains 2 (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":"cli/src/commands/session.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba6a3f304846de08e9b7fe7d43b0ac42351697e77213ec849c14a79287da84e"}},{"ruleId":"D2","level":"warning","message":{"text":"Input::handle_key (cognitive 84): Input::handle_key has cognitive complexity 84 (threshold 15). Drivers by points: if/else 44 (63 pts), boolean chains 15, loops 2 (6 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/input.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2db10ae2eacbb5216fa4e8cad54e5d6340ca7af41f29ef17d739f5e5fa7614"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::picker::rows (cognitive 84): future_tui::workbench::picker::rows has cognitive complexity 84 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 10 (20 pts), boolean chains 5, match/switch 3 (4 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":"tui/src/workbench/picker.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4f47d3b258802b3f10f8ffb8efe635b42b0f52ed4f87461ec00e2e3b21bb7e"}},{"ruleId":"D2","level":"warning","message":{"text":"driver.main (cognitive 83): driver.main has cognitive complexity 83 (threshold 15). Drivers by points: if/else 21 (45 pts), ternaries 5 (16 pts), boolean chains 10, error handling 3 (6 pts), loops 4 (6 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":"harness/tui/driver.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88b3cabe996bd66c622ccb30dcb1ae5dcfef047beb49e460ea7f6376da98bbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Workbench::handle_surface_mouse (cognitive 82): Workbench::handle_surface_mouse has cognitive complexity 82 (threshold 15). Drivers by points: if/else 31 (73 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 46). 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":"tui/src/workbench/mod.rs"},"region":{"startLine":3541}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d0ca528301ca994c84caad3fc98bac691c1eab4dfbce47325f4193e8b1e09c"}},{"ruleId":"D2","level":"warning","message":{"text":"FusionStepBody.StepResponse (cognitive 82): FusionStepBody.StepResponse has cognitive complexity 82 (threshold 15). Drivers by points: ternaries 15 (45 pts), if/else 9 (25 pts), boolean chains 11, error handling 1 (nesting depth added 46). Of this number, 24 points are the body\u0027s own statements and 58 belong to 11 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":"desktop/src/features/fusion/FusionStepBody.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc4fa7b2c92490ce4836e14b3c414ab75aac439d3e367c79ab75eaa98f9dea6"}},{"ruleId":"D2","level":"warning","message":{"text":"analyzeRun (cognitive 82): analyzeRun has cognitive complexity 82 (threshold 15). Drivers by points: other 30, if/else 9 (19 pts), boolean chains 11, ternaries 7 (11 pts), error handling 3 (6 pts), loops 3 (5 pts) (nesting depth added 19). Of this number, 57 points are the body\u0027s own statements and 25 belong to 21 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":"harness/lib/analyze.mjs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd28cd09e63657c86338b84ce326d238f35f641508eda0c92f15699501825b8b"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::reclaim_settled_journals (cognitive 78): SqliteStore::reclaim_settled_journals has cognitive complexity 78 (threshold 15). Drivers by points: if/else 36 (54 pts), boolean chains 13, match/switch 2 (6 pts), loops 3 (5 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":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e9eb32a1c1c5c82a80ddce734dfc40391e2344b3d6a1c6b14efdb83becfef3"}},{"ruleId":"D2","level":"warning","message":{"text":"sendPipeline.runSendPipeline (cognitive 78): sendPipeline.runSendPipeline has cognitive complexity 78 (threshold 15). Drivers by points: if/else 29 (53 pts), ternaries 6 (14 pts), boolean chains 10, error handling 1 (nesting depth added 32). Of this number, 66 points are the body\u0027s own statements and 12 belong to 6 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":"desktop/src/features/agent/sendPipeline.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1934f68940c11603c89b7e63def5f1bc30372f81fb59d1b85ae4cd1ad187a6c"}},{"ruleId":"D2","level":"warning","message":{"text":"replay.readRunReplay (cognitive 77): replay.readRunReplay has cognitive complexity 77 (threshold 15). Drivers by points: if/else 19 (38 pts), ternaries 11 (21 pts), boolean chains 17, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/thread-projection/src/replay.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b59b7374d0e3360ff68a97999d87fea5a322340055815d63eeb9c42fa946f02"}},{"ruleId":"D2","level":"warning","message":{"text":"useSendMessage.useSendMessage (cognitive 76): useSendMessage.useSendMessage has cognitive complexity 76 (threshold 15). Drivers by points: if/else 22 (40 pts), ternaries 7 (20 pts), boolean chains 10, loops 3 (5 pts), error handling 1 (nesting depth added 33). None of this is in the body itself: all 76 points belong to 9 function literals inside it that branch (lines 120, 174, 248, \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":"mobile/src/features/chat/useSendMessage.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b48c5a346a21aea7c2aa13d65bac7915a5613239c91e169ec88f00239f8ae4"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionList.SessionList::renderRow (cognitive 76): SessionList.SessionList::renderRow has cognitive complexity 76 (threshold 15). Drivers by points: boolean chains 37, ternaries 18 (37 pts), if/else 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. This shape REPEATS in the file: one other method here (SessionList.SessionList) 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60174bbb8dd1061ec40dba8bb6830e5a3417bda1505b76a308a76c0a7e48975"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::index::parse_args (cognitive 75): future_tui::index::parse_args has cognitive complexity 75 (threshold 15). Drivers by points: if/else 24 (70 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 47). 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":"tui/src/index.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"da03129902c0aa1aad1cbca6c951e09d934fa1e177158b051cc85cb8d23dc735"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncEngine.applyOps (cognitive 75): SyncEngine.applyOps has cognitive complexity 75 (threshold 15). Drivers by points: if/else 27 (61 pts), boolean chains 10, error handling 1 (3 pts), loops 1 (nesting depth added 36). Of this number, 72 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b77737b074b9c45295845e7db114e1e27cfff26ca8c0b6768e0a20b2f962b6"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::run::parse_run_args (cognitive 74): future_cli::commands::run::parse_run_args has cognitive complexity 74 (threshold 15). Drivers by points: if/else 24 (70 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/run.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c883297a57978cb96d1fc508e6b3154bf60735175c71b01dc1e73c66293b53"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::tools::tools_call (cognitive 73): future_cli::commands::tools::tools_call has cognitive complexity 73 (threshold 15). Drivers by points: if/else 37 (58 pts), match/switch 5 (9 pts), boolean chains 5, loops 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/tools.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a98035cd35c82096be2c2858ef969922ec0092a05950735afae8d764d1cb0c"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionList.SessionList (cognitive 73): SessionList.SessionList has cognitive complexity 73 (threshold 15). Drivers by points: ternaries 68 (121 pts), boolean chains 84, if/else 49 (66 pts), loops 10 (21 pts), error handling 4 (8 pts) (nesting depth added 85). To reduce it, split the body into named stages: move each independent 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 (SessionList.SessionList::renderRow) 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3f40b9d0c78b02fe23461dab90faab5864f791a4ea250f25057ffcc256fd35"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::stream::collect_agent_response (cognitive 72): future_host::agent_bridge::stream::collect_agent_response has cognitive complexity 72 (threshold 15). Drivers by points: if/else 15 (45 pts), match/switch 6 (19 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/stream.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcae2edbfe413a71a632b83789ee8424792859ae7a32882db9c221741b78afe7"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteComposer.RemoteComposer (cognitive 72): RemoteComposer.RemoteComposer has cognitive complexity 72 (threshold 15). Drivers by points: ternaries 48 (85 pts), if/else 55 (75 pts), boolean chains 26, error handling 12 (14 pts), loops 2 (3 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RemoteComposer.RemoteComposer::pasteFiles) 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9659fb19cf0ee4451f2ee7bd55922f3fff08ed45d38c134f296f9914b304f4"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::data::finish_restore_with (cognitive 71): future_cli::commands::data::finish_restore_with has cognitive complexity 71 (threshold 15). Drivers by points: if/else 24 (53 pts), boolean chains 9, loops 6 (9 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":"cli/src/commands/data.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b4e7a1e9b1a4642c371252cbdb37311d475f0ba45656346d6bc3784c4721a3"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::index::apply_cli_options (cognitive 71): future_tui::index::apply_cli_options has cognitive complexity 71 (threshold 15). Drivers by points: if/else 38 (71 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":"tui/src/index.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"720dc09589a8f47df470db598968fb6a18a300d8341a2503bf4cbad14ae2eabe"}},{"ruleId":"D2","level":"warning","message":{"text":"Writer::encode (cognitive 70): Writer::encode has cognitive complexity 70 (threshold 15). Drivers by points: if/else 29 (51 pts), loops 5 (13 pts), boolean chains 5, match/switch 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":"agent/src/session/content/journal.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8c05122a5f8e2cd62a76116b88265e70a9135d653001a2f557a9f265ad098e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::reset::plan_reset (cognitive 70): future_agent::session::reset::plan_reset has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (52 pts), loops 7 (13 pts), boolean chains 5 (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":"agent/src/session/reset.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"889704da57a59869a530fdd8ea93d4a3fdbeaa4969b8eadf4ef53a48eef4a936"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor::spawn_credential_refresh (cognitive 70): Supervisor::spawn_credential_refresh has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (58 pts), match/switch 3 (6 pts), loops 3 (5 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":"packages/remote-server/src/supervisor/transport.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2fc8fe1b070837b1c73a76331e6cfc8e013816afc479a046d2f984d7c4ac9d"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdatePage.UpdatePage (cognitive 70): UpdatePage.UpdatePage has cognitive complexity 70 (threshold 15). Drivers by points: ternaries 27 (58 pts), if/else 11 (18 pts), boolean chains 13, error handling 6 (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. This shape REPEATS in the file: one other method here (UpdatePage.UpdatePage::handleInstall) 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":"desktop/src/features/settings/UpdatePage.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e601830d098c20633bcbf0b19393e2b6bd3473699a38427b214bfeb90b2a23"}},{"ruleId":"D2","level":"warning","message":{"text":"ContextPanel.ContextPanel (cognitive 70): ContextPanel.ContextPanel has cognitive complexity 70 (threshold 15). Drivers by points: ternaries 20 (32 pts), if/else 21 (24 pts), boolean chains 14 (nesting depth added 15). Of this number, 41 points are the body\u0027s own statements and 29 belong to 12 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":"desktop/src/components/layout/ContextPanel.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"994aba59535ff1aff2d72c60915eb1945b36be7bad0e22633c5bfd5469b836b6"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::commands::handle_command_internal (cognitive 68): future_agent::rpc::commands::handle_command_internal has cognitive complexity 68 (threshold 15). Drivers by points: if/else 35 (44 pts), match/switch 11 (17 pts), boolean chains 7 (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":"agent/src/rpc/commands/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"862644f8c5df165ee526f8277eff0d927301ab68c16e2484fe04867aca27f004"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::entry_records::insert_entry_record (cognitive 68): future_agent::session::entry_records::insert_entry_record has cognitive complexity 68 (threshold 15). Drivers by points: if/else 33 (64 pts), boolean chains 2, loops 1 (2 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":"agent/src/session/entry_records.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ed47684fe5940a37aff724abb93c78dbcd6f0e1f60d93d6561bfc4002b9863"}},{"ruleId":"D2","level":"warning","message":{"text":"ApprovalPrompt.ApprovalPrompt (cognitive 68): ApprovalPrompt.ApprovalPrompt has cognitive complexity 68 (threshold 15). Drivers by points: ternaries 19 (28 pts), if/else 15 (21 pts), boolean chains 16, error handling 3 (nesting depth added 15). Of this number, 27 points are the body\u0027s own statements and 41 belong to 8 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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b50dfba27750d2d45c7d91465e2e459a76e8ebe86178e8f029f8c6b3f51f9b5"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::import_legacy_cancellable (cognitive 67): SqliteStore::import_legacy_cancellable has cognitive complexity 67 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 8 (18 pts), match/switch 4 (7 pts), boolean chains 4 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/legacy_import.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e421f71df4f1fd26d12802bf960d0b37859702483ecefab90000288519cf9c51"}},{"ruleId":"D2","level":"warning","message":{"text":"MdParser::parse_block_start (cognitive 67): MdParser::parse_block_start has cognitive complexity 67 (threshold 15). Drivers by points: loops 10 (26 pts), match/switch 9 (25 pts), if/else 6 (14 pts), boolean chains 2 (nesting depth added 40). 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":"tui/src/components/markdown.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"2870eae1f73c14dc0dfd8bdd662ca344e571a3bebcae3f1410ef92aba511b7ba"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_transcript::filter_entry (cognitive 66): future_cli::commands::session_transcript::filter_entry has cognitive complexity 66 (threshold 15). Drivers by points: if/else 24 (48 pts), boolean chains 9, match/switch 3 (8 pts), loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session_transcript.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"487de9da8defa162662d1c4f894e814a9fa71ef980f3f1d922412d608a063dfe"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteView.RemoteHostSection (cognitive 66): RemoteView.RemoteHostSection has cognitive complexity 66 (threshold 15). Drivers by points: ternaries 21 (31 pts), boolean chains 13, if/else 11, error handling 10, loops 1 (nesting depth added 10). Of this number, 32 points are the body\u0027s own statements and 34 belong to 16 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":"desktop/src/features/remote/RemoteView.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a96563b12a702aa24caf320a364c0fcac4542e54cb702b3f47248f5811eec7a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::providers::discord::run_gateway (cognitive 64): future_channel::providers::discord::run_gateway has cognitive complexity 64 (threshold 15). Drivers by points: if/else 9 (39 pts), match/switch 6 (24 pts), loops 1 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/discord.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"93435109bae16f17be17d74ccf6e85e4c6aa77e6e583beb8b4b3da105e8ff982"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::observer::run_observer (cognitive 64): future_host::agent_bridge::observer::run_observer has cognitive complexity 64 (threshold 15). Drivers by points: if/else 13 (38 pts), match/switch 8 (23 pts), loops 2 (3 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":"host/src/agent_bridge/observer.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ea46d37fe8dda33969f5caac7c7c3864977de166e012e31674f46200b10d18"}},{"ruleId":"D2","level":"warning","message":{"text":"Live::command (cognitive 64): Live::command has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (41 pts), match/switch 8 (19 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 33). 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":"tui/src/workbench/live.rs"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"b666b04216b34a9cca82d08eb1d078644f400403fdab5286b85a573a748acb1d"}},{"ruleId":"D2","level":"warning","message":{"text":"Bridge::handle_slash_command (cognitive 63): Bridge::handle_slash_command has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (36 pts), match/switch 13 (27 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":"channels/src/feishu/bridge.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ef11658a2ffab0068e34088a1b9324b97f7416d5144a66f74e29575bf709bb"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::providers::qq::run_gateway (cognitive 63): future_channel::providers::qq::run_gateway has cognitive complexity 63 (threshold 15). Drivers by points: if/else 10 (38 pts), match/switch 6 (23 pts), boolean chains 1, loops 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/qq.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff71416352bb2f629b0154b455d9f956a5c2ba0f9907f45756d57d08f4ea9032"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::rpc::grpc_client::subscribe_stream (cognitive 63): future_tui::rpc::grpc_client::subscribe_stream has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (47 pts), match/switch 7 (14 pts), boolean chains 1, 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":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c392d3ea4e3fcbcfeb1c9d7a2f40fbb6a502ceb83cccd4233e1bb60ddc96ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::page_impl (cognitive 62): Snapshot::page_impl has cognitive complexity 62 (threshold 15). Drivers by points: if/else 26 (50 pts), loops 6 (11 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/reader.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d18228d9c388eed48bd804fca125a9466b310fd8a4b7de23b711af282c6d50f"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_transcript::parse (cognitive 62): future_cli::commands::session_transcript::parse has cognitive complexity 62 (threshold 15). Drivers by points: if/else 18 (42 pts), boolean chains 8, loops 3 (7 pts), match/switch 2 (5 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session_transcript.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"126101d6a91a8e6261d98f7710a138613195b5cd6a8d9d329fe76ea6c538c6a2"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::observer::handle_event_from (cognitive 62): future_host::agent_bridge::observer::handle_event_from has cognitive complexity 62 (threshold 15). Drivers by points: if/else 26 (56 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/observer.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb8034ee1014d7a950e700b65e0dfddf8472f17e84b673ac2bf0866510c9193"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::git_history::draw (cognitive 62): future_host::git_history::draw has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 7 (13 pts), boolean chains 6, match/switch 3 (6 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":"host/src/git_history.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce9099f351df71f9e369bf0338e222c918caa73684311f8e133f2b07cd8e4a5"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::git_panel::draw (cognitive 62): future_tui::workbench::git_panel::draw has cognitive complexity 62 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 7 (13 pts), boolean chains 6, match/switch 3 (6 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":"tui/src/workbench/git_panel.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad117e76a0f1f34d69c8085854fea5df3523accacd36520987cebda1aca2aa03"}},{"ruleId":"D2","level":"warning","message":{"text":"AccountPage.AccountPage (cognitive 62): AccountPage.AccountPage has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 23 (53 pts), boolean chains 5, if/else 3, error handling 1 (nesting depth added 30). Of this number, 57 points are the body\u0027s own statements and 5 belong to 4 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":"desktop/src/features/settings/AccountPage.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd69571ac2d825785b0a03d9fc4f7699d27e27daab63509d4353002b830f2965"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalPanel.TerminalPanelShell (cognitive 62): TerminalPanel.TerminalPanelShell has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 31 (40 pts), boolean chains 16, if/else 6 (nesting depth added 9). Of this number, 46 points are the body\u0027s own statements and 16 belong to 5 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":"desktop/src/features/terminal/TerminalPanel.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"044f5076e493563bda7a2d1b67cb0b48c7d03bdc9982ecbade9c2dcc65894c4a"}},{"ruleId":"D2","level":"warning","message":{"text":"useRemotePeers.handleCatalog (cognitive 62): useRemotePeers.handleCatalog has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (32 pts), ternaries 12 (22 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 23). Of this number, 39 points are the body\u0027s own statements and 23 belong to 7 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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"1318985094b95be5b3441ed998410a49a3194290b07ecd3847dcfd0f4fea5b2b"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::history::paging::materialize_display_page (cognitive 61): future_agent::session::history::paging::materialize_display_page has cognitive complexity 61 (threshold 15). Drivers by points: if/else 22 (51 pts), loops 4 (10 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":"agent/src/session/history/paging.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"6767d93f36a531d4728477de9161d2fe6e05fa1485615d33c5bd349d2d6c190a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::remote_host::business::settings::execute (cognitive 61): future_host::remote_host::business::settings::execute has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 15 (32 pts), if/else 13 (27 pts), boolean chains 2 (nesting depth added 31). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/settings.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b29924c531b4ee83f5f2ddba5a6d706abc614319d68b44090d0a8110fff4a3"}},{"ruleId":"D2","level":"warning","message":{"text":"Terminal::start (cognitive 60): Terminal::start has cognitive complexity 60 (threshold 15). Drivers by points: if/else 20 (43 pts), loops 3 (8 pts), match/switch 2 (5 pts), boolean chains 4 (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":"tui/src/terminal.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaa2dce9a6d137e07f066793ce8d66d73e8f9d2f69e77afb7dfa906b7084b84"}},{"ruleId":"D2","level":"warning","message":{"text":"ProvidersPage.ProvidersPage (cognitive 60): ProvidersPage.ProvidersPage has cognitive complexity 60 (threshold 15). Drivers by points: ternaries 23 (48 pts), boolean chains 6, error handling 3, if/else 3 (nesting depth added 25). Of this number, 22 points are the body\u0027s own statements and 38 belong to 8 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":"desktop/src/features/settings/ProvidersPage.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"352542fefa63c2d17d5de9b9f4cc77aec17eeaf1fb8afc9c225692822f41387f"}},{"ruleId":"D2","level":"warning","message":{"text":"ArtifactDetailPanel.ArtifactDetailPanel (cognitive 60): ArtifactDetailPanel.ArtifactDetailPanel has cognitive complexity 60 (threshold 15). Drivers by points: ternaries 27 (38 pts), boolean chains 15, if/else 5, error handling 2 (nesting depth added 11). Of this number, 45 points are the body\u0027s own statements and 15 belong to 9 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":"desktop/src/features/artifacts/ArtifactDetailPanel.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5e7498fca1e196f5b6c016e91efab3e4737f65bbc895a400ec88240ea9f6c7"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteContext.RemoteProvider (cognitive 60): RemoteContext.RemoteProvider has cognitive complexity 60 (threshold 15). Drivers by points: if/else 29 (35 pts), boolean chains 11, loops 7, ternaries 6 (7 pts) (nesting depth added 7). None of this is in the body itself: all 60 points belong to 25 function literals inside it that branch (lines 863, 922, 808, \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":"mobile/src/remote/RemoteContext.tsx"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d9e173492045533ef65ba87030793db6e639545799f2eeef34269898b2a96d"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.watchStatus (cognitive 60): RemoteClient.watchStatus has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (46 pts), boolean chains 9, error handling 2 (4 pts), loops 1 (nesting depth added 27). None of this is in the body itself: all 60 points belong to one function literal inside it that branches (line 1260). 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"33542028e669431541ac1032216dab8de189173e52a5fd7ef75034b8d2338dce"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::projection::entries_to_agent_messages (cognitive 58): future_agent::session::projection::entries_to_agent_messages has cognitive complexity 58 (threshold 15). Drivers by points: if/else 11 (38 pts), match/switch 4 (10 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/projection.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b17cd999e6edffdaffa5e88d2f295f5f39fa1de669fa75bbf9a55a28ab466a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::rpc::grpc_client::spawn_stream_manager (cognitive 58): future_tui::rpc::grpc_client::spawn_stream_manager has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (44 pts), match/switch 4 (11 pts), loops 2 (3 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":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e817445e7615039434b4b8409fa411a3e44c39089823d6b23dc03ad1a6a60f6"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::content::extensions::fields (cognitive 57): future_agent::session::content::extensions::fields has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 5 (15 pts), boolean chains 8 (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/extensions.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b5bb875feb653196f43625c3b588ce3839edf69e562deae4f673866f99c5af"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::fusion::progress (cognitive 57): future_tui::workbench::fusion::progress has cognitive complexity 57 (threshold 15). Drivers by points: if/else 25 (37 pts), boolean chains 12, match/switch 3 (5 pts), loops 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/fusion.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6b46539cbab07d3991373964d062cb5dcd1d993e98492e6f2c1f4a1a4373a5"}},{"ruleId":"D2","level":"warning","message":{"text":"MergedRows.MergedRows (cognitive 57): MergedRows.MergedRows has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 22 (34 pts), if/else 8 (12 pts), boolean chains 11 (nesting depth added 16). Of this number, 32 points are the body\u0027s own statements and 25 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":"desktop/src/components/layout/MergedRows.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c12a89de03a957ab2b657b720cbe84d1acba57dcccddec8515fce753adbddce"}},{"ruleId":"D2","level":"warning","message":{"text":"usePromptOutbox.usePromptOutbox.sendMessage (cognitive 57): usePromptOutbox.usePromptOutbox.sendMessage has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (36 pts), ternaries 6 (11 pts), boolean chains 9, error handling 1 (nesting depth added 19). Of this number, 45 points are the body\u0027s own statements and 12 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c442125236bf0cfdf9cf8bb384ae2a7ef640442cf2fad92ca654e231ccbdf5"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::commands::session_lifecycle::cmd_new_session (cognitive 56): future_agent::rpc::commands::session_lifecycle::cmd_new_session has cognitive complexity 56 (threshold 15). Drivers by points: if/else 34 (51 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/session_lifecycle.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dee9931ed5885ba41eec70263130eb2777ebfe0acbddf33b365334dd6ed2dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::fusion::with_retry (cognitive 56): future_host::fusion::with_retry has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (44 pts), match/switch 4 (10 pts), boolean chains 1, loops 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/fusion.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"a565e65c5996f9a7995ce332a4a58e8453149d5f6f939af044498c8d00875f68"}},{"ruleId":"D2","level":"warning","message":{"text":"SendQueuePanel.SendQueuePanel (cognitive 56): SendQueuePanel.SendQueuePanel has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 19 (47 pts), if/else 3 (5 pts), boolean chains 4 (nesting depth added 30). Most of this is not in the body itself: 12 of the 56 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 281, a function literal at line 425, toggleExpanded, \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":"desktop/src/features/agent/SendQueuePanel.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"55efe85432e6ef18fdd55120e6dcc604f7b428390a26a844fc30e5839a0967fc"}},{"ruleId":"D2","level":"warning","message":{"text":"RemotePeerSettings.RemotePeerSettings (cognitive 56): RemotePeerSettings.RemotePeerSettings has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 19 (30 pts), if/else 11 (14 pts), boolean chains 9, error handling 3 (nesting depth added 14). Of this number, 28 points are the body\u0027s own statements and 28 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":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02a1fa4f9e4cc463c198f61a8cecc908c8059eb743edd424d755667211d6490"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::remote_host::business::tasks::execute (cognitive 55): future_host::remote_host::business::tasks::execute has cognitive complexity 55 (threshold 15). Drivers by points: match/switch 21 (45 pts), if/else 3 (7 pts), loops 1 (3 pts) (nesting depth added 30). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fcaae158481393ec0735b8ee49df9b7e1bc0670b7a044711979705adbadfc0"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::screen::compose (cognitive 55): future_tui::workbench::screen::compose has cognitive complexity 55 (threshold 15). Drivers by points: if/else 28 (44 pts), loops 3 (5 pts), boolean chains 3, 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":"tui/src/workbench/screen.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"312d46a9ca5c10bbebe4bd55e03fe8b51105ef59a8e75e5d7a3b31f310d91488"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::screen::git_box (cognitive 55): future_tui::workbench::screen::git_box has cognitive complexity 55 (threshold 15). Drivers by points: if/else 28 (42 pts), loops 6 (10 pts), boolean chains 2, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/screen.rs"},"region":{"startLine":2376}}}],"partialFingerprints":{"codehealthFindingId/v1":"67aa85e88a32492b10f9c08630af7f04735b7e7f5db12a8be1b64121813ad291"}},{"ruleId":"D2","level":"warning","message":{"text":"useSessionMessageEvents.useSessionMessageEvents (cognitive 55): useSessionMessageEvents.useSessionMessageEvents has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 13 (27 pts), if/else 14 (20 pts), boolean chains 8 (nesting depth added 20). None of this is in the body itself: all 55 points belong to 5 function literals inside it that branch (lines 38, 122, 68, \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":"desktop/src/features/agent/runtime/useSessionMessageEvents.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d323d9816a774712fd3435a44e28249387b9b250527a68c111b2d02362dba9"}},{"ruleId":"D2","level":"warning","message":{"text":"useRemotePeers.useRemotePeers (cognitive 55): useRemotePeers.useRemotePeers has cognitive complexity 55 (threshold 15). Drivers by points: if/else 26 (31 pts), error handling 9 (10 pts), ternaries 4 (8 pts), boolean chains 3, loops 3 (nesting depth added 10). None of this is in the body itself: all 55 points belong to 24 function literals inside it that branch (lines 462, 218, 389, \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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0bcf90654a653144d0c7344cc3af6cae1936e4b6e4ba61bcc1f1fbd49df83a"}},{"ruleId":"D2","level":"warning","message":{"text":"PairingScreen.PairingScreen (cognitive 55): PairingScreen.PairingScreen has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 12 (28 pts), boolean chains 13, if/else 11, error handling 3 (nesting depth added 16). Of this number, 26 points are the body\u0027s own statements and 29 belong to 11 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":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aecac2efe974cf76bcc625bd5cf39207915bec8184042f849d367dadac0a457"}},{"ruleId":"D2","level":"warning","message":{"text":"useDesktopConnection.useDesktopConnection.connect (cognitive 54): useDesktopConnection.useDesktopConnection.connect has cognitive complexity 54 (threshold 15). Drivers by points: if/else 46 (48 pts), boolean chains 6 (nesting depth added 2). Most of this is not in the body itself: 4 of the 54 points are its own statements and the rest belongs to 15 function literals inside it that branch (lines 446, 583, 529, \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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ede2ddf5e4c8acb97b5717c7edd8e82b66234d694e17511fa0b768659554b7"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_transcript::run (cognitive 53): future_cli::commands::session_transcript::run has cognitive complexity 53 (threshold 15). Drivers by points: if/else 25 (43 pts), boolean chains 7, loops 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":"cli/src/commands/session_transcript.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a5962a4569146d3515cb008db4aa88e0303b29dc75a876a320f4456efc0bbe"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::fusion::execute (cognitive 53): future_host::fusion::execute has cognitive complexity 53 (threshold 15). Drivers by points: if/else 26 (37 pts), loops 4 (8 pts), boolean chains 5, match/switch 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":"host/src/fusion.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a90e0fa9bdde1761cf69dd172cd6caa8edb8b052cfa36927724551cb5db960"}},{"ruleId":"D2","level":"warning","message":{"text":"useChatFiles.useChatFiles.openAttachment (cognitive 52): useChatFiles.useChatFiles.openAttachment has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (34 pts), ternaries 6 (15 pts), boolean chains 2, error handling 1 (nesting depth added 21). Of this number, 49 points are the body\u0027s own statements and 3 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03fd1640aa92f78be006d11a4262524d3d28d00a5d1966afb0f5888d3f2db8e"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposerDock.ComposerDockView (cognitive 52): ComposerDock.ComposerDockView has cognitive complexity 52 (threshold 15). Drivers by points: boolean chains 31, if/else 11 (13 pts), ternaries 8 (nesting depth added 2). Of this number, 32 points are the body\u0027s own statements and 20 belong to 10 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":"mobile/src/features/chat/components/ComposerDock.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0924296cdbaf98c1300cc267d1b028325f9e729255afa658bbc7705ea859f6"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncEngine.runReconcile (cognitive 52): SyncEngine.runReconcile has cognitive complexity 52 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 14, ternaries 7 (10 pts), error handling 1 (nesting depth added 15). Of this number, 49 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"0759814d31620cd90818d0afa5673e3e5329b14f6bbc14d96e8a2d10e1c5edf7"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::repair::repair_dangling_tool_calls (cognitive 51): future_agent::session::repair::repair_dangling_tool_calls has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 7 (12 pts), boolean chains 6 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/repair.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6458f74a2ede6005a32094df1614821a858c2d18cb693546eed0bb6446426af"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::feishu::feishu_ws::is_bot_mentioned (cognitive 51): future_channel::feishu::feishu_ws::is_bot_mentioned has cognitive complexity 51 (threshold 15). Drivers by points: if/else 7 (30 pts), loops 2 (10 pts), match/switch 3 (10 pts), boolean chains 1 (nesting depth added 38). Of this number, 49 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"channels/src/feishu/feishu_ws.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f04272f25be69caac7ede698b0d0c999b3320515ecc1f9d77e4c7560dabe70b"}},{"ruleId":"D2","level":"warning","message":{"text":"future_remote_server::wire_limits::truncated_event_data (cognitive 51): future_remote_server::wire_limits::truncated_event_data has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (35 pts), loops 5 (14 pts), boolean chains 2 (nesting depth added 33). 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":"packages/remote-server/src/wire_limits.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"630484064891379919c4939b9f07d89953fe7e76f2397f06864f9cd9d4c4d341"}},{"ruleId":"D2","level":"warning","message":{"text":"MentionEditor.MentionEditor::handleKeyDown (cognitive 51): MentionEditor.MentionEditor::handleKeyDown has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (37 pts), boolean chains 12, ternaries 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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0e1ce19a5c664316400146cdccf0d591a9f9d5da0163a4ae84f8db58dcbdd8"}},{"ruleId":"D2","level":"warning","message":{"text":"liveApply.buildSegments (cognitive 51): liveApply.buildSegments has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (27 pts), ternaries 6 (18 pts), loops 3 (5 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"9365ddb0d256b530cc94d0e715afffe16c1342c695476ce6dc65533d2a373dfc"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::compaction::semantic::call_summary_request (cognitive 50): future_agent::compaction::semantic::call_summary_request has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (30 pts), match/switch 5 (14 pts), boolean chains 3, 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":"agent/src/compaction/semantic.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3e6933d4094ffdc0b212ea1e8725c89f1db02aab78455f2fb91c2eed31ca3c"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_providers::validate::validate_custom_provider (cognitive 50): future_host::agent_providers::validate::validate_custom_provider has cognitive complexity 50 (threshold 15). Drivers by points: if/else 29 (42 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_providers/validate.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"92375391d12c2eb0251b1c4b5a1b48709730d93da1e6c8819dd987258bd9de3b"}},{"ruleId":"D2","level":"warning","message":{"text":"ShareViewController.didSelectPost (cognitive 50): ShareViewController.didSelectPost has cognitive complexity 50 (threshold 15). Drivers by points: if/else 9 (29 pts), boolean chains 8, error handling 3 (6 pts), loops 2 (5 pts), ternaries 1 (2 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/modules/future-share-intent/extension/ShareViewController.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"931005672c26613665e8b9ca7c2684f7a1707c09aa3590f70a6de27211070db5"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteFilesPanel.RemoteFilesPanel (cognitive 50): RemoteFilesPanel.RemoteFilesPanel has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 20 (30 pts), boolean chains 13, if/else 7 (nesting depth added 10). Of this number, 29 points are the body\u0027s own statements and 21 belong to 7 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":"desktop/src/features/remote-peer/RemoteFilesPanel.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"261a4e69361b80f3812bedc7379283da2c04beee9b2d93631ef0ecc3ba36b681"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalView.TerminalView (cognitive 50): TerminalView.TerminalView has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (27 pts), boolean chains 15, loops 2 (3 pts), ternaries 3, error handling 2 (nesting depth added 3). None of this is in the body itself: all 50 points belong to 23 function literals inside it that branch (lines 277, 190, 79, \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":"desktop/src/features/terminal/TerminalView.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a4a3e5f59dfd17e03cb4e8c5bcbdb51188aecdb852b5b4370c6928be0b8e85"}},{"ruleId":"D2","level":"warning","message":{"text":"useChatFiles.useChatFiles.openOrShare (cognitive 50): useChatFiles.useChatFiles.openOrShare has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (30 pts), ternaries 7 (12 pts), boolean chains 7, error handling 1 (nesting depth added 13). Of this number, 44 points are the body\u0027s own statements and 6 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"521e8d5e215986d1896176ef5cf7de8bcae4bbf5e7d020867ad01705cd0d2be1"}},{"ruleId":"D2","level":"warning","message":{"text":"SseBroadcaster::broadcast_stamped (cognitive 49): SseBroadcaster::broadcast_stamped has cognitive complexity 49 (threshold 15). Drivers by points: if/else 28 (36 pts), match/switch 4 (9 pts), boolean chains 4 (nesting depth added 13). 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":"agent/src/rpc/broadcaster/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ebbb9e2b17b44f9275c623d0ce175e5aee54706ff5c3200436df0fb9135341"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSession::enqueue_prompt_with_model_context (cognitive 49): ServerSession::enqueue_prompt_with_model_context has cognitive complexity 49 (threshold 15). Drivers by points: if/else 25 (39 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce315bf79668c8bd2a8a65d25df65470b9de7d568a0b552431957eb899f9c7cd"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::headless::session (cognitive 49): future_cli::headless::session has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (32 pts), match/switch 4 (10 pts), boolean chains 6, 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":"cli/src/headless/mod.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f092c1318a2672daaaa509b44ebd86443543bd40b627cd8b0fbc9d4f77a45e"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadSearch.ThreadSearch (cognitive 49): ThreadSearch.ThreadSearch has cognitive complexity 49 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 15, ternaries 6 (8 pts), error handling 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 49 points are its own statements and the rest belongs to 13 function literals inside it that branch (lines 153, 124, 67, \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":"desktop/src/features/agent/search/ThreadSearch.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"85514b5450a6874975a07d7a8d0eea16b6f2417c78def422004b1ed4ff93147d"}},{"ruleId":"D2","level":"warning","message":{"text":"SessionFilesPanel.SessionFilesPanel (cognitive 49): SessionFilesPanel.SessionFilesPanel has cognitive complexity 49 (threshold 15). Drivers by points: boolean chains 20, ternaries 10 (19 pts), if/else 7 (10 pts) (nesting depth added 12). Of this number, 20 points are the body\u0027s own statements and 29 belong to 11 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":"mobile/src/features/chat/components/SessionFilesPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"86cb8e81b8bd70f1869b715c57372d72bd24be1c3eac08412daf26f74e7125d3"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::dingtalk::bridge::run_prompt_loop (cognitive 48): future_channel::dingtalk::bridge::run_prompt_loop has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (41 pts), match/switch 2 (4 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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f3972b7c6db1bd15824bdcad076e534f5902d4fec6a0c104b8be1b8aba5b30"}},{"ruleId":"D2","level":"warning","message":{"text":"index.formatJsonForPreview (cognitive 48): index.formatJsonForPreview has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (36 pts), boolean chains 8, ternaries 1 (3 pts), loops 1 (nesting depth added 20). Of this number, 47 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":"packages/json-preview/src/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c676c030469ae35da5a2311a9116b80a1e3f19a6dd504ea732f3bac82b8edb"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSession::compact_with_policy (cognitive 47): ServerSession::compact_with_policy has cognitive complexity 47 (threshold 15). Drivers by points: if/else 20 (41 pts), match/switch 4 (5 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/session.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bad708ccf4186005166c17774b14043a2aeb9747c9849ea0c3c87e07f1325d5"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::configure::collect_custom_provider (cognitive 47): future_cli::commands::configure::collect_custom_provider has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 7 (9 pts), match/switch 4 (8 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":"cli/src/commands/configure.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaf5fc89146a5ff39a43634209f0243116b9231b1db5c18cd871e3b447fe265"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_prune::run (cognitive 47): future_cli::commands::session_prune::run has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (29 pts), loops 5 (9 pts), boolean chains 6, 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":"cli/src/commands/session_prune.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5aafddd43016538f3a83f633a2c7b726303dffa27b34a3036a9383cdf607a33"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::query (cognitive 47): Snapshot::query has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 4 (10 pts), boolean chains 2, 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":"orchestration/fusion/src/files.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27322208656bf7dda4471f8249fbd52fc2e2539b8b434b63fb0a162e0febe9e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_rpc::history::read_page_with (cognitive 47): future_rpc::history::read_page_with has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (37 pts), boolean chains 6, loops 2 (4 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":"packages/rpc/src/history.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"0947ec359f6409d51d04a471aa1dbfe3859e821b84fc1bd2d09e68f6edee0f60"}},{"ruleId":"D2","level":"warning","message":{"text":"Workbench::handle_key (cognitive 47): Workbench::handle_key has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 4 (6 pts), boolean chains 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/mod.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a3844060eb9bbdcef905bf2949a25f3a6f15ecea38642bba51231bfe0a5d3c"}},{"ruleId":"D2","level":"warning","message":{"text":"ComposerToolbar.ComposerToolbar (cognitive 47): ComposerToolbar.ComposerToolbar has cognitive complexity 47 (threshold 15). Drivers by points: boolean chains 28, ternaries 8 (17 pts), if/else 1 (2 pts) (nesting depth added 10). Of this number, 27 points are the body\u0027s own statements and 20 belong to 8 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":"mobile/src/features/chat/composer/ComposerToolbar.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2af04b26c041761dd218665040a5a2fda986e1eb27201aac52afb042e3599a"}},{"ruleId":"D2","level":"warning","message":{"text":"deterministicFindings (cognitive 47): deterministicFindings has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (18 pts), other 14, loops 6, boolean chains 5, ternaries 2 (4 pts) (nesting depth added 10). Of this number, 46 points are the body\u0027s own statements and 1 belongs 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":"harness/lib/analyze.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4d9eb39e6d00b7bd2c44d667dc4b0881ef42ae33bbd6b8706bd24fafb3a87d"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::queries::read_events_since (cognitive 46): future_host::agent_bridge::queries::read_events_since has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (35 pts), loops 2 (4 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":"host/src/agent_bridge/queries.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a0062cc7fe4906f416eecf5d068f3f13c9c92ab44e5b0faa88caa0e9271fbf"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::utils::extract_segments (cognitive 46): future_tui::utils::extract_segments has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/utils.rs"},"region":{"startLine":1124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a61afe655aac0c09856ea0a29ba00d0541bf708dfe759a1911cf0b705f0a725"}},{"ruleId":"D2","level":"warning","message":{"text":"FileTreePanel.FileTreePanel (cognitive 46): FileTreePanel.FileTreePanel has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 18 (29 pts), if/else 9 (11 pts), boolean chains 5, error handling 1 (nesting depth added 13). Of this number, 34 points are the body\u0027s own statements and 12 belong to 8 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":"desktop/src/features/filetree/FileTreePanel.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3a076f4534607de2664d07965cf71689e5bf1ec6d3f757b04831a9ff72529c"}},{"ruleId":"D2","level":"warning","message":{"text":"ShareIntakeMenu.ShareIntakeMenu (cognitive 46): ShareIntakeMenu.ShareIntakeMenu has cognitive complexity 46 (threshold 15). Drivers by points: ternaries 16 (26 pts), boolean chains 11, if/else 7 (8 pts), error handling 1 (nesting depth added 11). Of this number, 25 points are the body\u0027s own statements and 21 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":"mobile/src/share/ShareIntakeMenu.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c313e11de2826b9f71d1620dbb9f324128164a15e69652e13879bddc001e655"}},{"ruleId":"D2","level":"warning","message":{"text":"Composer.compose (cognitive 46): Composer.compose has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (41 pts), boolean chains 4, 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":"packages/thread-projection/src/cooperativeJson.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b78feeaeed7bae6fe19380093a570c2699063d800bef3d8841274864e337308"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSession::restore_session (cognitive 45): ServerSession::restore_session has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (42 pts), match/switch 1 (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":"agent/src/rpc/session.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e154b852e80fd18a114cd2a111b54a26c6419832bf4a407162cd1500e2a56e"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::compact_run_cancellable (cognitive 45): SqliteStore::compact_run_cancellable has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 5, loops 3 (4 pts), match/switch 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":"agent/src/session/journal_compaction.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a751aa57485c23e0eec0b91517e54138c519d331a87d4afd3eec5697661564a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::tools::format_image_result (cognitive 45): future_cli::commands::tools::format_image_result has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25 (39 pts), loops 3 (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":"cli/src/commands/tools.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"571ebd982e119d0de13fbbbf7ca3f0941ea7f1ddde4d04f27febe2cf25028c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_remote_server::lean::lean_entries (cognitive 45): future_remote_server::lean::lean_entries has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (37 pts), loops 2 (4 pts), match/switch 1 (4 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":"packages/remote-server/src/lean.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"f001e83f66305404fe56ea2ffffd831896e9bc7c1369712095a6efbe21584c18"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::index::run_print_mode (cognitive 45): future_tui::index::run_print_mode has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (38 pts), match/switch 2 (6 pts), loops 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":"tui/src/index.rs"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97f205fc9e5ea514c29446925e57bf165ba865b7439e2b6648a9d8716eaf273"}},{"ruleId":"D2","level":"warning","message":{"text":"Loop::execute_tools_sequential (cognitive 44): Loop::execute_tools_sequential has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (36 pts), loops 2 (3 pts), match/switch 2 (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":"agent/src/agent/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e79c6f57c5c2002424dc7401b1c1b8e1648bb3ed55403681ae966d958bdc25a"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::hash (cognitive 44): Scan::hash has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (33 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/syntax.rs"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9f07171a78eaef5f5e7b617a3144fd691571abf42eb23452ff33d65aba0e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"ImagePreview.ImagePreview (cognitive 44): ImagePreview.ImagePreview has cognitive complexity 44 (threshold 15). Drivers by points: boolean chains 20, if/else 13, ternaries 10 (11 pts) (nesting depth added 1). Of this number, 20 points are the body\u0027s own statements and 24 belong to 11 function literals 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":"desktop/src/features/filepreview/ImagePreview.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37be3bbb3e40362c5b63126149e6e5698e3de9e4e778b22326543098802ab5a"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::append_stream_entry (cognitive 43): SqliteStore::append_stream_entry has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (2 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":"agent/src/session/content/stream_entry.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"53136d512150a09017aba8c8d75a1f0fbb9c7210d25a80bfe6834f1521f8703e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::fork::build_fork_session_with_mapping (cognitive 43): future_agent::session::fork::build_fork_session_with_mapping has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (37 pts), loops 4 (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":"agent/src/session/fork.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5e8084b4024bff79f802f6dacb9242f761341f0a8cce7714582692aaf942c9"}},{"ruleId":"D2","level":"warning","message":{"text":"DingtalkBridge::handle_slash_command (cognitive 43): DingtalkBridge::handle_slash_command has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (35 pts), match/switch 5 (8 pts) (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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d17f4c0c7642e73d067c268c0bbe2b17203e94747b2b84d2689abe2aff67a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"Bridge::handle_event (cognitive 43): Bridge::handle_event has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (29 pts), match/switch 8 (11 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":"channels/src/feishu/bridge.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f1f4b0f71182d92bca3a7fc4e09da7e9f7847fd4b4c0e7d394cf5feeae1397"}},{"ruleId":"D2","level":"warning","message":{"text":"Workbench::click (cognitive 43): Workbench::click has cognitive complexity 43 (threshold 15). Drivers by points: if/else 30 (40 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":"tui/src/workbench/mod.rs"},"region":{"startLine":3862}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b595a1278129d2735b3fcdc463a36c97021e6f6f4fe0dd9819c2cb48528282"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::keys::parse_key (cognitive 43): future_tui::keys::parse_key has cognitive complexity 43 (threshold 15). Drivers by points: if/else 30 (34 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":"tui/src/keys.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67568051edca9cc700d419cdd3169431a9572286a5b060f9874c0b48155556b"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomProviderDialog.CustomProviderDialog::handleSubmit (cognitive 43): CustomProviderDialog.CustomProviderDialog::handleSubmit has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (33 pts), boolean chains 5, ternaries 2 (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. This shape REPEATS in the file: one other method here (CustomProviderDialog.CustomProviderDialog::detectThinkingLevels) 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"df173952bd6b69f403975ca564f18b5bddc5a23658507e2894d6e08d3aed42ce"}},{"ruleId":"D2","level":"warning","message":{"text":"FusionActivity.FusionActivity (cognitive 43): FusionActivity.FusionActivity has cognitive complexity 43 (threshold 15). Drivers by points: boolean chains 21, ternaries 10 (12 pts), if/else 7 (10 pts) (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 23 belong to 6 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":"desktop/src/features/agent/FusionActivity.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"18316220ac850b4ca711d2b1df22cb79467b05568c19a89d6cc4c8db5f29cc82"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteConversationView.RemoteConversationView (cognitive 43): RemoteConversationView.RemoteConversationView has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 21 (30 pts), boolean chains 11, if/else 2 (nesting depth added 9). Of this number, 29 points are the body\u0027s own statements and 14 belong 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":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbf9a3daaeaecfe3361c709d3a997ea963884e6cd5a02b909437e6f092f1a78"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksView.TasksView (cognitive 43): TasksView.TasksView has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 17 (22 pts), if/else 12 (13 pts), boolean chains 6, error handling 2 (nesting depth added 6). Most of this is not in the body itself: 8 of the 43 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 302, 417, 374, \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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d7b3ea5143a5d0774662179b8d267d8f567d28e5b843971062090d0ef25754"}},{"ruleId":"D2","level":"warning","message":{"text":"streamingMarkdown.createStreamingMarkdownParser.\u003Creturned closure\u003E (cognitive 43): streamingMarkdown.createStreamingMarkdownParser.\u003Creturned closure\u003E has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 8 (19 pts), if/else 7 (14 pts), boolean chains 10 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/markdown/src/streamingMarkdown.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2816b21676709fe4b90285b61c30902ff51d7708558f78826e7c1d45512402"}},{"ruleId":"D2","level":"warning","message":{"text":"TerminalServer::pump (cognitive 42): TerminalServer::pump has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (31 pts), match/switch 4 (9 pts), loops 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src-tauri/src/terminal/server.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"5417817bd07f18e38d767e9cc156d69d5f95c51769d2163691bf8acebab669fd"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::application::threads::read_thread_history (cognitive 42): future_host::application::threads::read_thread_history has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (24 pts), match/switch 4 (12 pts), boolean chains 6 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/application/threads.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"884edf7b15115c5a5f384f996dd89cacb30108926f8ed178679d6e25645c26ab"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeConversations.mergeConversations (cognitive 42): mergeConversations.mergeConversations has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 5 (15 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 22). Of this number, 40 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"015378e40e6a843477e38c0effc8115656fc51186a82c838973fb04ef2a73386"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.plainText (cognitive 42): utils.plainText has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 12, ternaries 3 (9 pts), loops 2 (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":"mobile/src/features/chat/utils.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6bfea947958fa7272514f8c1f20b0527e84028bde32be4fb3fa881a52c6e827"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillsSettingsPage.SkillsSettingsPage (cognitive 42): SkillsSettingsPage.SkillsSettingsPage has cognitive complexity 42 (threshold 15). Drivers by points: boolean chains 16, ternaries 11 (13 pts), if/else 6 (11 pts), error handling 1, loops 1 (nesting depth added 7). Most of this is not in the body itself: 10 of the 42 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 91, mutate, a function literal at line 65, \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":"mobile/src/features/settings/SkillsSettingsPage.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61f48b20c8b291e0f7d54a34feef363ed28d266aaacdc4a5c80779082638fad"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::screen::workflow_box (cognitive 41): future_tui::workbench::screen::workflow_box has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20 (32 pts), match/switch 3 (5 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":"tui/src/workbench/screen.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"536a4980d47e24bed7c860dfe5935bc6feb5659eb1ee99459bf0dd88353a1d55"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeConversations.groupMergedRows (cognitive 41): mergeConversations.groupMergedRows has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (17 pts), ternaries 6 (14 pts), loops 5 (6 pts), boolean chains 4 (nesting depth added 16). Of this number, 36 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"954e53c015f61c1767e1b47d30f0f28c2580af04d1dce7b2162c4b15f2816ffb"}},{"ruleId":"D2","level":"warning","message":{"text":"useThreadStore.useThreadStore.refreshStore (cognitive 41): useThreadStore.useThreadStore.refreshStore has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 5 (9 pts), boolean chains 7, error handling 1 (nesting depth added 13). Of this number, 37 points are the body\u0027s own statements and 4 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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d57e1620ba736eb5187ff7fb90c55be2d3696a80ed18f273f839a3b26c2824"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::config::providers::apply_provider_upsert (cognitive 40): future_agent::config::providers::apply_provider_upsert has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 5, loops 1 (3 pts), 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":"agent/src/config/providers.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"9049c5f474604818420b737156f8f48135d127007026a1a54a0a46ad42253fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::title_preview::paged (cognitive 40): future_agent::session::title_preview::paged has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 2 (6 pts), boolean chains 4 (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":"agent/src/session/title_preview.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"432db200b1cd5e49125aba3809e06d3b3527054a98ed4ff688048a40cf64d6f1"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownRenderer::render_block (cognitive 40): MarkdownRenderer::render_block has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 6 (15 pts), boolean chains 5, 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":"tui/src/components/markdown.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0f77d3183bfb45c191b1f497f9a789e71cfaaf9c41b6b590c03be171ce58ff"}},{"ruleId":"D2","level":"warning","message":{"text":"useTimelineController.useTimelineController (cognitive 40): useTimelineController.useTimelineController has cognitive complexity 40 (threshold 15). Drivers by points: boolean chains 16, if/else 16, ternaries 6, loops 1 (2 pts) (nesting depth added 1). Most of this is not in the body itself: 5 of the 40 points are its own statements and the rest belongs to 23 function literals inside it that branch (lines 624, 881, 526, \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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"06def7912ac995923d5653186be11db00d14a0c076ff350ab2369a9e163da1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"useTimelineController.useTimelineController.handleEvent (cognitive 40): useTimelineController.useTimelineController.handleEvent has cognitive complexity 40 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 7, ternaries 2 (5 pts), error handling 2 (4 pts) (nesting depth added 12). Of this number, 36 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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"4584d33aa767f63a16b83731dc3128a843c960cd30c188d0b2217a882dc0dca0"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillPicker.SkillPicker (cognitive 40): SkillPicker.SkillPicker has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 9 (32 pts), boolean chains 5, if/else 3 (nesting depth added 23). Of this number, 21 points are the body\u0027s own statements and 19 belong to 8 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":"mobile/src/features/chat/components/SkillPicker.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bf2ebe984c57dd23ed978cf2a2e3461b5a8357587a60d1dbd2c7949202ec7f"}},{"ruleId":"D2","level":"warning","message":{"text":"Loop::execute_one_tool_with_context (cognitive 39): Loop::execute_one_tool_with_context has cognitive complexity 39 (threshold 15). Drivers by points: if/else 21 (33 pts), match/switch 3 (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":"agent/src/agent/mod.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda8eb780520a1df7f2756a7e3f8a5e65029eac166c9be700342137202c00552"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentHandle::drain (cognitive 39): AgentHandle::drain has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (29 pts), loops 6 (7 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":"agent/src/service/shutdown.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77ed8f892e4e842d97f10787365c9449e5609786d25d2cc6bda60cd3aac06a2"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::skills::read_skill_md_version (cognitive 39): future_cli::commands::skills::read_skill_md_version has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 2 (4 pts), boolean chains 2 (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":"cli/src/commands/skills.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4604d033ae4823f64cf0eaf801fbc393ec4cc962a027f83da720617a3496a1"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::fusion::serve (cognitive 39): future_host::fusion::serve has cognitive complexity 39 (threshold 15). Drivers by points: if/else 7 (25 pts), loops 5 (10 pts), match/switch 1 (4 pts) (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":"host/src/fusion.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccd4867f6e1d1e945b2379342e736095e3dfa76ac4b4aa8b952eb2675ea892b"}},{"ruleId":"D2","level":"warning","message":{"text":"useTimelineController.useTimelineController.loadHistory (cognitive 39): useTimelineController.useTimelineController.loadHistory has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 13, ternaries 3, loops 2 (nesting depth added 10). Of this number, 38 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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c62ed2e47c717310bec2b27455fc9ba4a848aaa0aa2471b96f9006a8d520fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiChatAdapter::decode_frame (cognitive 38): OpenAiChatAdapter::decode_frame has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/adapters/openai_chat.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee56d5603b4a248fd8f29c106bb647c478b3ba0654dbd99d44b211b0a265ade"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownRenderer::render_table (cognitive 38): MarkdownRenderer::render_table has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 11 (17 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":"tui/src/components/markdown.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"befa8dc3aa718aaf4dc3d536822e5b74f7d648e8dac0de2621a69fe7ed0fa308"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentStatusGate.AgentStatusGate (cognitive 38): AgentStatusGate.AgentStatusGate has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 17 (28 pts), boolean chains 7, if/else 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":"desktop/src/components/layout/AgentStatusGate.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5ed5d08abc7a3ec3180f214223f1a0c4f9472131c7c9ecd53db8019e6c7425"}},{"ruleId":"D2","level":"warning","message":{"text":"FusionSettingsPage.Editor (cognitive 38): FusionSettingsPage.Editor has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 21 (25 pts), boolean chains 9, if/else 3, error handling 1 (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 22 belong to 9 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":"mobile/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faef0e71409d1633a30b3449f64ec68c6fa4773724830d07a57955fdfdab8b0"}},{"ruleId":"D2","level":"warning","message":{"text":"projection.applyEvent (cognitive 38): projection.applyEvent has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 10, ternaries 5 (9 pts), match/switch 1 (nesting depth added 10). Of this number, 35 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0615015905e6b460d27c7c6e63c3ba04aa0bdd8ce321f508dab8610862522db"}},{"ruleId":"D2","level":"warning","message":{"text":"EvidenceContext::observe (cognitive 37): EvidenceContext::observe has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 4 (7 pts), match/switch 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":"agent/src/approval_review/evidence.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a32106a410da3398dd4ac42d562ccc461de321e73377166ab75d6e74410689"}},{"ruleId":"D2","level":"warning","message":{"text":"ReasoningEffortVocabulary::parse (cognitive 37): ReasoningEffortVocabulary::parse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 5, loops 3 (5 pts), match/switch 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/schema.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51e583979bf21f901e35d015ea18f535f213445ccc72810b6382fcd967cd493"}},{"ruleId":"D2","level":"warning","message":{"text":"FeishuWsClient::connect_and_listen (cognitive 37): FeishuWsClient::connect_and_listen has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 5 (20 pts), if/else 5 (16 pts), loops 1 (nesting depth added 26). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/feishu_ws.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f353db3b764248da08062763f20b1e48b8f57df923dbc234b55ff645ee2327"}},{"ruleId":"D2","level":"warning","message":{"text":"TransferLoop::run (cognitive 37): TransferLoop::run has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 3 (6 pts), loops 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":"packages/remote-server/src/transfer.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fcca148b0a0f6c8158d45376972787f5a06c5aa7aed80ca54e63708ba5c530"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::session_rows::rows_to_messages (cognitive 37): future_tui::session_rows::rows_to_messages has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 3 (7 pts), loops 3 (4 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":"tui/src/session_rows.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"511d743e042c6d844c39d229a91edde12978618afb6d30d1284e8f1c6d195bd0"}},{"ruleId":"D2","level":"warning","message":{"text":"index.laneDrawing (cognitive 37): index.laneDrawing has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 6 (10 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 17). Of this number, 28 points are the body\u0027s own statements and 9 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":"packages/git-graph/src/index.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e216a23f7310afb7ef54661002e31abb88e106ae186252b3b67a81ac928612"}},{"ruleId":"D2","level":"warning","message":{"text":"runRemoteCases (cognitive 37): runRemoteCases has cognitive complexity 37 (threshold 15). Drivers by points: other 13, if/else 4 (12 pts), error handling 2 (7 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":"harness/lib/remote-driver.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"619eb080ce4273c669ce5c7940aaf80fdb566aeb8a12eff1827c33d539adf84b"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_history::parse (cognitive 36): future_cli::commands::session_history::parse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 9, match/switch 2 (3 pts), 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":"cli/src/commands/session_history.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6092e26c7169a5e00a24edd10e8c310a95ab746321b29c71e02c8e094509a52c"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::screen::conversation (cognitive 36): future_tui::workbench::screen::conversation has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (5 pts), boolean chains 4, match/switch 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/screen.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d97abb97ba04a74ae01b6b1b4d3eeae0e7c93d40a0a90e7a1b3c15aa7386659"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.mdToHtml (cognitive 36): index.html.mdToHtml has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 4 (9 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":"host/web/index.html"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52bf84debe9ded79f0d60e9834d91f9bb9747092a19ff9c4e4b2e7488b8de69"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionStatus.useConnectionSummary (cognitive 36): ConnectionStatus.useConnectionSummary has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 18 (31 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/components/ConnectionStatus.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8475d6e0a1c6f1b4f72bdf5c3919978f3a18221165faa764543b58e094fdbb"}},{"ruleId":"D2","level":"warning","message":{"text":"Projection::push (cognitive 35): Projection::push has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (34 pts), boolean chains 1 (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":"agent/src/rpc/broadcaster/projection.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c42fa9742222a3476f562242983bdec603612bb3ba1a9c6482bd4d99c72a229"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::entry_impl (cognitive 35): Snapshot::entry_impl has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 2 (3 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":"agent/src/session/content/reader.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"a609d663569fabdeea354d2a3917be44334b1c718220b2f733c45656c6c308b4"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::broadcaster::journal_writer::run_event_batch_writer (cognitive 35): future_agent::rpc::broadcaster::journal_writer::run_event_batch_writer has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (28 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/broadcaster/journal_writer.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c4150771c839d8316ca2b5c540279640f2a6cdb338583d12e53ed264243a84"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::panels::rows_with (cognitive 35): future_tui::workbench::panels::rows_with has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/panels.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"186abc050682f59f007af075976216dd0cf4c591d63f7c0c1614988770c13cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"RunInspectPanel.ToolCallDetail (cognitive 35): RunInspectPanel.ToolCallDetail has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 15 (30 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":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0f66594f465fb87b9b38dff40a49eb6a5f91771587d231fb998bc73535c1e3"}},{"ruleId":"D2","level":"warning","message":{"text":"visual-regression.main (cognitive 35): visual-regression.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 4 (7 pts), ternaries 2 (4 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":"harness/scripts/visual-regression.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d46149de80606a9caf54d8a737fdda05a5e0904c7e6e9f3706ce0eb2942dc15"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageStatus.CompactionDivider (cognitive 35): MessageStatus.CompactionDivider has cognitive complexity 35 (threshold 15). Drivers by points: ternaries 10 (33 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":"mobile/src/features/chat/messages/MessageStatus.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"014067b0a40d5b58d186e95b4b476e213dea1ac01dabff46d519111db00e07c7"}},{"ruleId":"D2","level":"warning","message":{"text":"runCase::perfValue (cognitive 35): runCase::perfValue has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (27 pts), other 4, boolean chains 2, ternaries 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":"harness/lib/run.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6bd6479839e7698c731b757649a142fe25994e013f51f6aff065455c5641b5"}},{"ruleId":"D2","level":"warning","message":{"text":"FutureAgentService::stream_events (cognitive 34): FutureAgentService::stream_events has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 5, loops 2 (3 pts), match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/grpc/mod.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c35d9f45af6a0cead3e17e7adddbf864cac333b7c8e3b0cd041cef4b6f7cca"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::config::providers::validate_provider_upsert (cognitive 34): future_agent::config::providers::validate_provider_upsert has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 7, 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":"agent/src/config/providers.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0b6ecd10d10538514a45050a77ca2080a1d7a7c756624ece23f020d0491a99"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::broadcaster::journal_writer::flush_event_batch (cognitive 34): future_agent::rpc::broadcaster::journal_writer::flush_event_batch has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (8 pts), match/switch 3 (8 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":"agent/src/rpc/broadcaster/journal_writer.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e0e523b72530dcd4842a2d61988a80edb740f2fe83a7be7f30df6a84a240b6"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::persistence::execute (cognitive 34): future_agent::session::persistence::execute has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/persistence.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d193db294329f36800331cc250b9651988bc959de7d60ad7472947cdd84679d"}},{"ruleId":"D2","level":"warning","message":{"text":"RunClient::stream_events_filtered (cognitive 34): RunClient::stream_events_filtered has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 3 (8 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":"cli/src/rpc.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b758f0762d3a5fd6b3a4111022bc7e32efaaeb1f3b11a7a5a28ce6da12b239"}},{"ruleId":"D2","level":"warning","message":{"text":"Transport::handshake (cognitive 34): Transport::handshake has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 2, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/secure.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7a68a5274972314d5dc53ab7eac04c143a30545434b234e0036ba8eb419601"}},{"ruleId":"D2","level":"warning","message":{"text":"NewConversation.NewConversation (cognitive 34): NewConversation.NewConversation has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 11 (14 pts), boolean chains 11, if/else 7, error handling 2 (nesting depth added 3). Of this number, 16 points are the body\u0027s own statements and 18 belong to 6 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":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7347da40e749f88a9d7c65b1389e12a45e4636aa91a959072c937c42fa2d3781"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.onEvent (cognitive 34): index.html.onEvent has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 6, ternaries 2 (4 pts), error handling 1, match/switch 1 (nesting depth added 11). Of this number, 33 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":"host/web/index.html"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"661e83765633525993cfb727e708dedaf9fa1a1ed89bd95ddfedbdd70093dea1"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopsScreen.DesktopsScreen (cognitive 34): DesktopsScreen.DesktopsScreen has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 15 (20 pts), boolean chains 11, if/else 2, error handling 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 34 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 162, a function literal at line 98, select, \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":"mobile/src/screens/DesktopsScreen.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c177e8ce77d179d88a0abb232001a1e1800e206ccb0eccd4f40b775a05c52bd"}},{"ruleId":"D2","level":"warning","message":{"text":"projection.entriesToTurns (cognitive 34): projection.entriesToTurns has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 5, loops 1 (nesting depth added 15). Of this number, 33 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":"packages/thread-projection/src/projection.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3144ca21f41759a3dea4dc0bebbcd067548171d6d7f4ff7c68b44d0dd7c006a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager::create_segmented_fork (cognitive 33): Manager::create_segmented_fork has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 4 (9 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":"agent/src/session/manager/fork.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9161e263b086bba6b10ccb5c1c3ab90d3b26e2bb074977d86a8a4d8c568b3713"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::agent::run_loop::assemble_assistant_parts (cognitive 33): future_agent::agent::run_loop::assemble_assistant_parts has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (23 pts), boolean chains 4, loops 4, 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":"agent/src/agent/run_loop.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52db210ef6ac9a311e115becda0d1d69f26d6873710c78e62d432f9753a7c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::model_settings::probe (cognitive 33): future_cli::commands::model_settings::probe has cognitive complexity 33 (threshold 15). Drivers by points: if/else 18 (27 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":"cli/src/commands/model_settings.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"06688d960c7830d4b0fa924b50b1822901fd9030df17830b42ac2be8640483d0"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session::session (cognitive 33): future_cli::commands::session::session has cognitive complexity 33 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 3, match/switch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session.rs"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95445b9cd4069317946ec83099b2631a8d6701617c06c8cbc05f349c169f724"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::launchpad::render (cognitive 33): future_tui::workbench::launchpad::render has cognitive complexity 33 (threshold 15). Drivers by points: if/else 17 (26 pts), loops 5 (7 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":"tui/src/workbench/launchpad.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"90832f2a582bfd017330ae5dc8776b09d5f1a9358c9f7e0ac202d2a116935f3e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::run::paint_images (cognitive 33): future_tui::workbench::run::paint_images has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (9 pts), loops 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":"tui/src/workbench/run.rs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac52fd9ba3f4ae0ca72d8ba1ea4f9102d945612168641b1ab285b26a5d7d123"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksView.TaskForm (cognitive 33): TasksView.TaskForm has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 21 (23 pts), boolean chains 8, error handling 1, if/else 1 (nesting depth added 2). Of this number, 21 points are the body\u0027s own statements and 12 belong to 7 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"981554bb69995398687df23149cb4405ae8f5f1cf64c11e29c06dfad00c46a7a"}},{"ruleId":"D2","level":"warning","message":{"text":"ToolRow.StandardToolRow (cognitive 33): ToolRow.StandardToolRow has cognitive complexity 33 (threshold 15). Drivers by points: boolean chains 15, ternaries 10 (14 pts), if/else 4 (nesting depth added 4). Of this number, 26 points are the body\u0027s own statements and 7 belong to 3 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":"mobile/src/features/chat/messages/ToolRow.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48d9c7c4239a13780ca77e6eb237fb693971ce2c9780ed01ed1c49559b914f2"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.subscribe (cognitive 33): RemoteClient.subscribe has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 5, error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 11). Most of this is not in the body itself: 3 of the 33 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 1062, 1082, 1079). 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cbba19311aae69e22890499a86a70a8264c2e025596fb1c563945eb69011800"}},{"ruleId":"D2","level":"warning","message":{"text":"projection.applyStandaloneCompaction (cognitive 33): projection.applyStandaloneCompaction has cognitive complexity 33 (threshold 15). Drivers by points: ternaries 13 (18 pts), if/else 7 (8 pts), boolean chains 7 (nesting depth added 6). Of this number, 25 points are the body\u0027s own statements and 8 belong to 4 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1275ee03531b940e381d681918d322d047960468e6db49da0016df74f0d9e14"}},{"ruleId":"D2","level":"warning","message":{"text":"EvidenceContext::action_context (cognitive 32): EvidenceContext::action_context has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 3 (6 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":"agent/src/approval_review/evidence.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"78749dd702b5fd74b769c5579079ed2aa74068efab4857f3443a520667313eb5"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::readable_fields (cognitive 32): Snapshot::readable_fields has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (5 pts), match/switch 1 (4 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":"agent/src/session/content/reader_recall.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a81b06cf37df7f9be632c4a3b5e0f1652db9371613d2ac7a9d0f24cf57cf0da"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::models::enrich_user_models (cognitive 32): future_agent::models::enrich_user_models has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 3 (6 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":"agent/src/models/mod.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9d8d810846d7e3a95aa5a4f33cfddb8602e39a281f7a513b6ce43db0f82950"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_reset::parse (cognitive 32): future_cli::commands::session_reset::parse has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (5 pts), match/switch 2 (5 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":"cli/src/commands/session_reset.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d189d01eb574dd4d3b500e0d93adfa5c432ed654e893e12581cf49ac5517f731"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::task::edit (cognitive 32): future_cli::commands::task::edit has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 4 (11 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":"cli/src/commands/task.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"12adff1fdba5140d304b054db0f6d4056d5a084e0fd15cad866c64f980497d82"}},{"ruleId":"D2","level":"warning","message":{"text":"future_http::dns::query::lookup (cognitive 32): future_http::dns::query::lookup has cognitive complexity 32 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 4 (11 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/http/src/dns/query.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa68d5b6bfb19fff2b23157aabaad8c03bb95105008349911898ae51423cae5"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatArea::format_tool_call (cognitive 32): ChatArea::format_tool_call has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 3 (7 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":"tui/src/components/chat_area.rs"},"region":{"startLine":3827}}}],"partialFingerprints":{"codehealthFindingId/v1":"459c6002b0e7a52dcb0b4d0163acfcc311ca052e6d7ef2ab2f275e815c5c8589"}},{"ruleId":"D2","level":"warning","message":{"text":"ReviewPanel.ReviewPanel (cognitive 32): ReviewPanel.ReviewPanel has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 13 (22 pts), if/else 6 (7 pts), boolean chains 2, error handling 1 (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 11 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":"desktop/src/features/review/ReviewPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de3cea5319c55587e40dd2b9e198053d2eec8b9cc3d9529cb0575b1cd9e8e62"}},{"ruleId":"D2","level":"warning","message":{"text":"loadThreadHistory.loadThreadHistory (cognitive 32): loadThreadHistory.loadThreadHistory has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 14 (17 pts), boolean chains 10, if/else 4, error handling 1 (nesting depth added 3). Of this number, 26 points are the body\u0027s own statements and 6 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":"desktop/src/features/agent/history/loadThreadHistory.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"115b42f3adcaa7983187d5d93934141a36ea2879a36f3bd095259798e69a2c93"}},{"ruleId":"D2","level":"warning","message":{"text":"PreviewModal.PreviewLayer (cognitive 32): PreviewModal.PreviewLayer has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 11 (20 pts), boolean chains 8, if/else 4 (nesting depth added 9). Of this number, 19 points are the body\u0027s own statements and 13 belong to 8 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":"mobile/src/features/chat/components/PreviewModal.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfe162b4efc72f6b600d0e41ebf2396da558e58ba4619f2f1160042ddec2ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopPicker.DesktopPicker (cognitive 32): DesktopPicker.DesktopPicker has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 17, ternaries 10 (12 pts), if/else 2, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 8 of the 32 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 238, take, 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":"mobile/src/screens/DesktopPicker.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ade8ad9fb1f107ebd560babfd37174997e041e8f1e5ab72bcd5c6e2807d18e"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomProviderPage.CustomProviderPage::validate (cognitive 32): CustomProviderPage.CustomProviderPage::validate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (CustomProviderPage.CustomProviderPage::detectThinkingLevels) 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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b30103f3ff8feac62d3bfef3cd5c78929cf9bed75bc3405ca818fa9907a47e6"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.runRefreshToken (cognitive 32): RemoteClient.runRefreshToken has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 8, ternaries 3 (8 pts), error handling 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":"packages/remote-client/src/client.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"e024167f4f5a4a848ad95ec23b90e6642e78b8bc3380c5edf456b6810d3d531a"}},{"ruleId":"D2","level":"warning","message":{"text":"projection.messageToItems (cognitive 32): projection.messageToItems has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 13 (17 pts), if/else 6 (8 pts), boolean chains 7 (nesting depth added 6). Of this number, 29 points are the body\u0027s own statements and 3 belong to 2 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f38fa6d5b2c481237c909a54ff6708ea12f8b585c412c28133385ce2c55968"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::cli::run (cognitive 31): future_agent::cli::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), match/switch 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":"agent/src/cli.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"53075208a1a287cd085970818bf942f6291d0e0b8b1e1882a927581536a770c1"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::models::load_user_models_with_overrides (cognitive 31): future_agent::models::load_user_models_with_overrides has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (11 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":"agent/src/models/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff0f68547380d1e49d8ba590bddf51291301efa3c6b4a0b33707c5a78b1de63"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::remote::switch (cognitive 31): future_cli::commands::remote::switch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 3 (6 pts), boolean chains 2, 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":"cli/src/commands/remote.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"c435e3deff870086e0daa46e690a425191d7cfb894b6a84ea65ff49a3099553d"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::approval::reconcile_pending_approvals (cognitive 31): future_host::agent_bridge::approval::reconcile_pending_approvals has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (23 pts), loops 4 (6 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":"host/src/agent_bridge/approval.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"283dbcd69c2b0f73ab477ff27a132e6a43eaeef97e8095bf8216cdf00ae43ee2"}},{"ruleId":"D2","level":"warning","message":{"text":"Workbench::handle_workflow_key (cognitive 31): Workbench::handle_workflow_key has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 7, match/switch 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":"tui/src/workbench/mod.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c78d2456972a9e218ed8d883e8f2b9b5f6f80b00ca60481c81cc269730c196"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::screen::diff_review_box (cognitive 31): future_tui::workbench::screen::diff_review_box has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 3 (6 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":"tui/src/workbench/screen.rs"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"143c05e36aec8c3d19be8e8964fab009a676d805e152b593dcef5598cf575af5"}},{"ruleId":"D2","level":"warning","message":{"text":"RunInspectPanel.RunInspectPanel (cognitive 31): RunInspectPanel.RunInspectPanel has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 15 (30 pts), error handling 1 (nesting depth added 15). Of this number, 30 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":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"310b5592f7d898677e471b0684473cf2a70620872aac364deb048643c97726c2"}},{"ruleId":"D2","level":"warning","message":{"text":"useMessagePaging.useMessagePaging (cognitive 31): useMessagePaging.useMessagePaging has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (16 pts), ternaries 4 (9 pts), boolean chains 6 (nesting depth added 7). Most of this is not in the body itself: 3 of the 31 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 406, 255, 451, \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":"desktop/src/features/agent/useMessagePaging.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b317800ef77091f2c793d0aa539c154e5b02714b834911f653c99d3c9e1b1b5"}},{"ruleId":"D2","level":"warning","message":{"text":"RailViewSwitch.RailViewSwitch (cognitive 31): RailViewSwitch.RailViewSwitch has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 7, ternaries 3, error handling 2, loops 1 (nesting depth added 3). None of this is in the body itself: all 31 points belong to 9 function items inside it that branch (handlePointerMove, viewAt, handleKeyDown, \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":"desktop/src/components/layout/RailViewSwitch.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f5167a3110f8decb4cf58e089241e8428b1847d7280a3c6061fcbe4e77ad10"}},{"ruleId":"D2","level":"warning","message":{"text":"judgeEvidence (cognitive 31): judgeEvidence has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 9 (16 pts), if/else 5 (7 pts), loops 2 (3 pts), other 3, boolean chains 2 (nesting depth added 10). Of this number, 29 points are the body\u0027s own statements and 2 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":"harness/lib/analyze.mjs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd11218664694ff13ba7b9bdabec019d03d3f2257c6b6b4e2db6c49c23f7d25"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::compaction::semantic::plan (cognitive 30): future_agent::compaction::semantic::plan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (20 pts), boolean chains 10 (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":"agent/src/compaction/semantic.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ca882973e1a9d0de18329b3dbc29df4509cd291ac365345677854582a2add9"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::compaction::semantic::evidence::build (cognitive 30): future_agent::compaction::semantic::evidence::build has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 6 (8 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/compaction/semantic/evidence.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13ac950c4825b7becf789d1df76e0b18657fa33cb8caa63f545d50de4d969f5"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::history::paging::read_display_page (cognitive 30): future_agent::session::history::paging::read_display_page has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21 (26 pts), boolean chains 3, 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":"agent/src/session/history/paging.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"d943930602ba13292aa69f6880bf3b3bb521b4f496cc4b608050f4eadf54d8d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::step (cognitive 30): Session::step has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (8 pts), loops 2 (6 pts) (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":"channels/src/providers/irc.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"520344327f6ee27b1c82f8e8b5eee209ef3d027a27ccf086e19ddec74b2b5248"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::doctor::check_providers (cognitive 30): future_cli::commands::doctor::check_providers has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (6 pts), match/switch 1 (5 pts), boolean chains 2 (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":"cli/src/commands/doctor.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3129bcdff82f6a03b8d78fda106e8b65a1b2049488284fa591a50ab1c1d5d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::mcp_servers::mcp_status (cognitive 30): future_cli::commands::mcp_servers::mcp_status has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 4 (9 pts), loops 3 (8 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":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"405e4be877b8d2b911ea87eb7553beb1b20d80ad607b1d60f000618165d22e58"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session::parse_session_options (cognitive 30): future_cli::commands::session::parse_session_options has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (11 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"4765818c9b104c215c9622dc2b77e841842caa90d5e7adbc35962fdf96d0e42f"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::delete_outbox::reconcile_delete_outbox (cognitive 30): future_host::agent_bridge::delete_outbox::reconcile_delete_outbox has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 3 (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":"host/src/agent_bridge/delete_outbox.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d4a42bb33569e30eb4e1de673565d6399f7177c8ba6e09c4c10079a9ca2bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::utils::extract_ansi_code (cognitive 30): future_tui::utils::extract_ansi_code has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (24 pts), match/switch 2 (3 pts), loops 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":"tui/src/utils.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fed1319384cc8acf91e2fe4d062b46708186071e90832497c41d581687927b"}},{"ruleId":"D2","level":"warning","message":{"text":"agentStateCache.applySettingsEvent (cognitive 30): agentStateCache.applySettingsEvent has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (22 pts), ternaries 1 (3 pts), loops 2, match/switch 1 (2 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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"8783a6cb0456ee6396393ad52cf89d6f6e0c8d993713f0816ea87756f65781fb"}},{"ruleId":"D2","level":"warning","message":{"text":"liveRunProjection.projectRunForLivePreview (cognitive 30): liveRunProjection.projectRunForLivePreview has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 7, error handling 2 (3 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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b7b9cb1464c784ee8d06a437042c5573c311d17b328fd53598ea68c37f0acd"}},{"ruleId":"D2","level":"warning","message":{"text":"RemotePeersView.RemoteClientSection (cognitive 30): RemotePeersView.RemoteClientSection has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 12 (19 pts), boolean chains 6, error handling 3, if/else 2 (nesting depth added 7). Of this number, 18 points are the body\u0027s own statements and 12 belong to 6 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":"desktop/src/features/remote-peer/RemotePeersView.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ba271037e9ad48659aa8d8d472bcdaae64a6b95f6047c71dc21f1285579686"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksView.TaskDetail (cognitive 30): TasksView.TaskDetail has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 16 (27 pts), boolean chains 3 (nesting depth added 11). Of this number, 17 points are the body\u0027s own statements and 13 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aca66982dfa880d4ccbf2ab1856d5e31836456424ae7cc429d8d463677ec622"}},{"ruleId":"D2","level":"warning","message":{"text":"GitGraphPanel.GitGraphPanel (cognitive 30): GitGraphPanel.GitGraphPanel has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 6 (8 pts), boolean chains 6 (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 9 belong 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":"mobile/src/features/chat/components/GitGraphPanel.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"512cc02476890930fbd5e6499ef83d30602cd7ee624780f70e456ad97517e7aa"}},{"ruleId":"D2","level":"warning","message":{"text":"TasksSettingsPage.TasksSettingsPage (cognitive 30): TasksSettingsPage.TasksSettingsPage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (13 pts), ternaries 6 (10 pts), boolean chains 6, error handling 1 (nesting depth added 5). Most of this is not in the body itself: 10 of the 30 points are its own statements and the rest belongs to 7 function items inside it that branch (mutate, a function literal at line 625, a function literal at line 496, \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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"d029eef757fa39cf40de3a21737fc71e38334e6ff4a7eb8027f2530e05e874f1"}},{"ruleId":"D2","level":"warning","message":{"text":"judgeCase (cognitive 30): judgeCase has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 13, other 9, if/else 5, boolean chains 2, error handling 1. Of this number, 27 points are the body\u0027s own statements and 3 belong to 13 function literals 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":"harness/lib/analyze.mjs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"6222096d5b2019458f321f8baf7b9e2ecf1ad4fdc9dc1ccb661e5e208ff8eb9d"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiResponsesAdapter::decode_frame (cognitive 29): OpenAiResponsesAdapter::decode_frame has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 3 (6 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":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f823a1b92c4c7a07dad01dab61ef0c3d934765a2b9f788f9b2d39aa637f82cc"}},{"ruleId":"D2","level":"warning","message":{"text":"ApprovalGate::request (cognitive 29): ApprovalGate::request has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 6 (11 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":"agent/src/rpc/approval.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2866afd7f3aa48b96a70a8cd401483e5de8d8bb080f58897dd5c2377a20642fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::blocks (cognitive 29): Snapshot::blocks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (26 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":"agent/src/session/content/reader.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"baca0ecdbc15348950c50a98f7d4c03c969a498c77ba96c891f2ed28e3a18186"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::llm::adapters::anthropic::lower_messages (cognitive 29): future_agent::llm::adapters::anthropic::lower_messages has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (3 pts), match/switch 1 (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":"agent/src/llm/adapters/anthropic.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"568a69dd75ddd007ad45538e78547f34af29e0905280df295e8d6f94d4ea4030"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::llm::adapters::openai_responses::lower_message (cognitive 29): future_agent::llm::adapters::openai_responses::lower_message has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (26 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9e8517a716a3f9393511b02e7aa4eff9090823ddb7f04c894572d7fd53b90a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::bridge::turn::run_turn (cognitive 29): future_channel::bridge::turn::run_turn has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/bridge/turn.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"266f8d4b2f0cc196836aabf520d2ae1d2c733f3b9eee882bfec911b83abd629c"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::tools::format_search_paper (cognitive 29): future_cli::commands::tools::format_search_paper has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (25 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":"cli/src/commands/tools.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"3332fe439dc9fd202544c8e96b962c38f8c2febf4cf9605840f51ed3b991e785"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::prompt::agent_prompt_inner (cognitive 29): future_host::agent_bridge::prompt::agent_prompt_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 3, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/prompt.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c23fb776d288689c967538c8f12b5953e2bd68857dc156a0107cd3a1fc860b5"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::reconciliation::settle_queued_runs (cognitive 29): future_host::agent_bridge::reconciliation::settle_queued_runs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 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":"host/src/agent_bridge/reconciliation.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"814672e64431afc3932665e61fcace9b903dc8f0c68d9ff818ccfd2b7ab81f55"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::store::threads::delete_thread_trees (cognitive 29): future_host::store::threads::delete_thread_trees has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 4 (8 pts), match/switch 2 (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":"host/src/store/threads.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"38eeb4b3eb8d8b8e05c90502d20a13e7a856ec3267e216da062d636446c91535"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::panels::render_with (cognitive 29): future_tui::workbench::panels::render_with has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 7 (11 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":"tui/src/workbench/panels.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f83fe30a920a4230aa0d17c0fa399649e838e23b1257dfeabf2d3e803a7953"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeConversations.mergeRemoteSessionDelta (cognitive 29): mergeConversations.mergeRemoteSessionDelta has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 7 (17 pts), if/else 4 (6 pts), loops 4 (6 pts) (nesting depth added 14). Of this number, 25 points are the body\u0027s own statements and 4 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4e505fc147ef7891aa8172cc403fd74b63dabfdfeccf95c3a8c0cbecefc0e7"}},{"ruleId":"D2","level":"warning","message":{"text":"useComposerDraft.useComposerDraft (cognitive 29): useComposerDraft.useComposerDraft has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 2 (6 pts), ternaries 3 (6 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 12). Most of this is not in the body itself: 1 of the 29 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 60, 125, 58, \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":"mobile/src/features/chat/useComposerDraft.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bdcfe524eec819cd63c8d7e98851a9a4feb7907b7bdcc8a25960b32697b3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"approval.parseAction (cognitive 29): approval.parseAction has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 11, boolean chains 10, if/else 6, error handling 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":"packages/thread-projection/src/approval.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d80a583eef32b0f0cddc6afd0d2100dfd4089d36ce7a977030d7e165f170629"}},{"ruleId":"D2","level":"warning","message":{"text":"runRemoteCnCase (cognitive 29): runRemoteCnCase has cognitive complexity 29 (threshold 15). Drivers by points: other 12, if/else 9 (10 pts), boolean chains 4, ternaries 1 (2 pts), error handling 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":"harness/lib/remote-cn.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cb22321c55d41e3d549d997463307502cfcf6c2bee1b2854e4f818752b9c89"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::approval_review::provider::assess_at (cognitive 28): future_agent::approval_review::provider::assess_at has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/approval_review/provider.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa0ca58b0b4d672d61f0d6171240137c9ae9738be2c73917ea11401d1279efb"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::cli::run_from_args (cognitive 28): future_agent::cli::run_from_args has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (23 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":"agent/src/cli.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6cec901ad4d238812f756dd620dd2c9968ff15a95cb972d8c89921c57ab60a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::browser_tools::browser_start (cognitive 28): future_cli::commands::browser_tools::browser_start has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 3 (4 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":"cli/src/commands/browser_tools.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbda662ec26201d60a6eb8f5bab74b9dbd11a99be3755b55d561edcf93fb1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::models::models (cognitive 28): future_cli::commands::models::models has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (6 pts), match/switch 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/models.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b308cbbd58e5dd0a4d21d4f6d43f8773e35a82d8c6fd7098d185ee71e9749063"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_control::parse (cognitive 28): future_cli::commands::session_control::parse has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 3, match/switch 2 (3 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":"cli/src/commands/session_control.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bd834b233ff47c798f4211e55a346c7c406374a16bbbb4ad870dbfb80fa8276"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::import::import_one (cognitive 28): future_host::agent_bridge::import::import_one has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/import.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7da5edce763025caf74cdc9238101b45a1ff5961f2403d1242002380899ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::fusion::review::validate (cognitive 28): future_host::fusion::review::validate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, loops 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/fusion/review.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"18da9b7c0c772b6a0c2b3731230f9af7818e32278ca5e6d550b044ec7fab9c43"}},{"ruleId":"D2","level":"warning","message":{"text":"AnsiCodeTracker::feed (cognitive 28): AnsiCodeTracker::feed has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 5, 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":"tui/src/utils.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2bead8bea861659c7a24399aa700765777b831a2523519a99dce23b9a2d184"}},{"ruleId":"D2","level":"warning","message":{"text":"Live::handle_event (cognitive 28): Live::handle_event has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (22 pts), match/switch 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":"tui/src/workbench/live.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2407cb8c84af9da07c89fc5b7c663a733e557d57679da6363106bec5d7b4ef52"}},{"ruleId":"D2","level":"warning","message":{"text":"Live::new_session (cognitive 28): Live::new_session has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/live.rs"},"region":{"startLine":3586}}}],"partialFingerprints":{"codehealthFindingId/v1":"df310a91b8636810048b9d68839ca9595bd6c36d9fddc81ac736ea24dd9e5099"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::rpc::grpc_client::spawn_heartbeat (cognitive 28): future_tui::rpc::grpc_client::spawn_heartbeat has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (22 pts), match/switch 2 (5 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":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":1895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71244393dccaac63b30cc58c153ade16111b49c486c05aa44f978e370a6bceb"}},{"ruleId":"D2","level":"warning","message":{"text":"ShareInbox.take (cognitive 28): ShareInbox.take has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 8, loops 2 (4 pts), error handling 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":"mobile/modules/future-share-intent/ios/ShareInbox.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdc8a3ad955469d005099cbd4b8519c0df6b44750c7a38740e85d9e4c7d08c0"}},{"ruleId":"D2","level":"warning","message":{"text":"AppShellDialogs.AppShellDialogs (cognitive 28): AppShellDialogs.AppShellDialogs has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 19 (25 pts), boolean chains 3 (nesting depth added 6). Of this number, 24 points are the body\u0027s own statements and 4 belong to 2 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":"desktop/src/components/layout/AppShellDialogs.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07de4eba06df5910ac16f96ecc9d09626721ecb404f0fe6a89d5b8dda58d075"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillsView.AllTab (cognitive 28): SkillsView.AllTab has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 9 (14 pts), boolean chains 11, if/else 3 (nesting depth added 5). Most of this is not in the body itself: 5 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 560, 591, 603). 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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4eafcd9249c26638fd191d8672b34e981e9ee05510730af9c9f3a66848652e"}},{"ruleId":"D2","level":"warning","message":{"text":"useAgentStatus.useAgentStatus (cognitive 28): useAgentStatus.useAgentStatus has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 9, ternaries 5 (8 pts), error handling 1 (nesting depth added 4). None of this is in the body itself: all 28 points belong to 9 function literals inside it that branch (lines 63, 91, 86, \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":"desktop/src/components/layout/hooks/useAgentStatus.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9d63f21ec8cf92e5e9168e8b38fa48965de74b3656d70b880be03f1611fa7d"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.connectSocket (cognitive 28): RemoteClient.connectSocket has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 11, error handling 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":"packages/remote-client/src/client.ts"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"7095f50b54362ab290f811f30f09adfdb0d9fd40c710c4bd99e59ec70282c3c7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 28): (anonymous) has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, other 5, error handling 1 (2 pts) (nesting depth added 5). Of this number, 17 points are the body\u0027s own statements and 11 belong 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":"desktop/shot/terminal-server.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fa76fc4b3c529b04f279301f8831a6188a420571d47b0a81d8348c09ff95d4"}},{"ruleId":"D2","level":"warning","message":{"text":"bodyFor (cognitive 28): bodyFor has cognitive complexity 28 (threshold 15). Drivers by points: other 10, ternaries 10, if/else 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 3). Of this number, 22 points are the body\u0027s own statements and 6 belong to 5 function literals 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":"harness/lib/issues-en.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dac784eefc8317d45f66642f664b4fda63b662f280af5f418883dcf1885e68a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnthropicMessagesAdapter::decode_frame (cognitive 27): AnthropicMessagesAdapter::decode_frame has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 4 (8 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":"agent/src/llm/adapters/anthropic.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f10634a760e2fe3f9dbb0b4712e89fa04ad5111bca9324117e07ada18e41a4"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::compaction::durable::admit (cognitive 27): future_agent::compaction::durable::admit has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/compaction/durable.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28f5842e483bbbe87003ae5aad7048fa41985010929e7ba9499392838906dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::content::entries::stage_named (cognitive 27): future_agent::session::content::entries::stage_named has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 3 (4 pts), boolean chains 1, 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":"agent/src/session/content/entries.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"967a45930ad9355f3c4daab8f398a7149cfccf7b171878c30acbbeae858dce47"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::history::display_projection::project_entries (cognitive 27): future_agent::session::history::display_projection::project_entries has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/history/display_projection.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"36eac7bc0ec3ff19bf2262490be6b6daa8244d5654ae05b48f46d41de5ecb200"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::providers::slack::socket_mode_session (cognitive 27): future_channel::providers::slack::socket_mode_session has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 4 (10 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":"channels/src/providers/slack.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e2f60f5b3eeee9a672c79cc02ff66a5fd3e72126c7c99278a5dffddfd97f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::model_settings::provider_set (cognitive 27): future_cli::commands::model_settings::provider_set has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 5, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"cli/src/commands/model_settings.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"7295271f33468a6bb26308fc049eebb3429ecac220144a8de782340e6a979d41"}},{"ruleId":"D2","level":"warning","message":{"text":"futureos::agent_supervisor::spawn_agent_watchdog (cognitive 27): futureos::agent_supervisor::spawn_agent_watchdog has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src-tauri/src/agent_supervisor.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a464a7ecd968c1fce2c410cdbcd1bedaca4971baffa63a1d7445700af579a896"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::tasks::execute (cognitive 27): future_host::tasks::execute has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 6 (12 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":"host/src/tasks.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d61ee2bea454dcc69fb3651785f1fdf36970693ba4d552b1b6d526a1e6ea439"}},{"ruleId":"D2","level":"warning","message":{"text":"future_remote_server::commands::handle_command_inner (cognitive 27): future_remote_server::commands::handle_command_inner has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 3, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/commands.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd526b326fad2757f6f5f978b49e9f0339b7e9a1e2b339ed76e262360f35eb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Workbench::handle_mouse (cognitive 27): Workbench::handle_mouse has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 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":"tui/src/workbench/mod.rs"},"region":{"startLine":3417}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0af335d97f4acea37000f79d3aa9397ef06197640d1fad8297440a8057ff830"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::workflows::detail_lines (cognitive 27): future_tui::workbench::workflows::detail_lines has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (7 pts), match/switch 1 (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":"tui/src/workbench/workflows.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb286951dc3cb7027cc345af52d7eeac5817092876c13cc5e4058451cb3739ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Composer.ComposerImpl::submitValue (cognitive 27): Composer.ComposerImpl::submitValue has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 9 (nesting depth added 6). To reduce it, split the body into named stages: move each independent 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 (Composer.ComposerImpl) 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"2242631897d8991e17780078f53d62348334e4a215d03f7467ebd5fd67db10f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ApprovalPrompt.ActionDetails (cognitive 27): ApprovalPrompt.ActionDetails has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 8 (16 pts), boolean chains 6, if/else 5 (nesting depth added 8). Of this number, 25 points are the body\u0027s own statements and 2 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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b2dbdd03640458052f6a8ee916a8ccecfc6d860cc1357bc8e0213fd8d188b2f"}},{"ruleId":"D2","level":"warning","message":{"text":"ThinkingBlock.ThinkingBlock (cognitive 27): ThinkingBlock.ThinkingBlock has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 13 (18 pts), boolean chains 6, if/else 3 (nesting depth added 5). Of this number, 21 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/ThinkingBlock.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9180640b8b13909daf851ec6d6646f2bf8538b11fa52c64fae635db0df71420a"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageStatus.CompactionDivider (cognitive 27): MessageStatus.CompactionDivider has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 9 (25 pts), boolean chains 2 (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":"desktop/src/features/agent/messages/MessageStatus.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56074b1d87bdc6bba18ca6209a4fcd51f31ef7752ed417c8aaea6f3f60af304"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillsView.SkillsView (cognitive 27): SkillsView.SkillsView has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (20 pts), error handling 3, boolean chains 2, loops 1, ternaries 1 (nesting depth added 4). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 143, 81, 214, \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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"be09f0837b80a454e1c0d5db13159b7c740a377c58f8f005864cac1e879e0972"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteFilesDialog.RemoteFilesDialog (cognitive 27): RemoteFilesDialog.RemoteFilesDialog has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 9 (15 pts), if/else 4 (5 pts), boolean chains 4, error handling 3 (nesting depth added 7). Most of this is not in the body itself: 9 of the 27 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 154, a function literal at line 71, download, \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":"desktop/src/features/remote-peer/RemoteFilesDialog.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e35431c75c77a443f62253e7ad552b56abb3e461ed1b90f96715b2e3ecc696"}},{"ruleId":"D2","level":"warning","message":{"text":"htmlBlocks.htmlBlockToNodes (cognitive 27): htmlBlocks.htmlBlockToNodes has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 2, error handling 1, loops 1 (nesting depth added 12). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/markdown/src/htmlBlocks.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bc6e81198976757493bbe420137173fea104703456e5e9cc36125849047a32"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::reconcile_provider_references (cognitive 26): AppState::reconcile_provider_references has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 2 (5 pts), match/switch 1 (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":"agent/src/rpc/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"235c3250a0cd1ceb463a828b30c1b317edd9b58b68a4bd37cf6de4d933669a1a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_journal::run (cognitive 26): future_cli::commands::session_journal::run has cognitive complexity 26 (threshold 15). Drivers by points: if/else 18 (23 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"cli/src/commands/session_journal.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"696e9e93c0687ca3c2e72e1796da69256ce23547d7936e249eb21646e0209769"}},{"ruleId":"D2","level":"warning","message":{"text":"futureos::commands::update::install_app_update_inner (cognitive 26): futureos::commands::update::install_app_update_inner has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (19 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":"desktop/src-tauri/src/commands/update.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8b4273bef56e69578804dfb85a763a1eb1c204bba2c1b6606f3d515169d060"}},{"ruleId":"D2","level":"warning","message":{"text":"futureos::commands::update_linux::worker (cognitive 26): futureos::commands::update_linux::worker has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (18 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":"desktop/src-tauri/src/commands/update_linux.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c7099cc918c444d4fa4af594ba6b1250f5880791ffaa690889e33d03d6ea26"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::session::synthesize_run_events_from_entries (cognitive 26): future_host::agent_bridge::session::synthesize_run_events_from_entries has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (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":"host/src/agent_bridge/session.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"8912aebe70ae09eb0f40f8fb6299d67e2d61d322a6e09a38a36fb504fcdbb4e4"}},{"ruleId":"D2","level":"warning","message":{"text":"MdParser::parse_blocks (cognitive 26): MdParser::parse_blocks has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 1 (2 pts), loops 1 (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":"tui/src/components/markdown.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb8abadf74a47506fd4331b6cd859103777e42d92da3df8190aad0173c775f8"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::components::diff::parse_unified_diff (cognitive 26): future_tui::components::diff::parse_unified_diff has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 5, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/diff.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"57320302bfaf2e3dc99828e3379904d1d805562185d082b181537c13a4aa0830"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::links::scan_row (cognitive 26): future_tui::workbench::links::scan_row has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 1 (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":"tui/src/workbench/links.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"475f795c290498a505cf9831ff8a08bfa7a750c42f6638319406b536abc51a6f"}},{"ruleId":"D2","level":"warning","message":{"text":"useRemoteConversationSettings.useRemoteConversationSettings (cognitive 26): useRemoteConversationSettings.useRemoteConversationSettings has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 7, ternaries 2 (nesting depth added 1). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 323, 248, 301, \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":"desktop/src/features/remote-peer/useRemoteConversationSettings.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dce4d54f21ddda87b2832a9c46ed6b6cf205936cf88b7faf870be7bb69e44a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.loadHistory (cognitive 26): index.html.loadHistory has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, loops 2 (3 pts), error handling 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":"host/web/index.html"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3bbc02cfdae1974938e8813d6fa4f1310528088c243d2618ff28d3708e0f41"}},{"ruleId":"D2","level":"warning","message":{"text":"useComposerSubmission.useComposerSubmission (cognitive 26): useComposerSubmission.useComposerSubmission has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 7, ternaries 2 (nesting depth added 3). None of this is in the body itself: all 26 points belong to 2 function literals inside it that branch (lines 46, 67). 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":"mobile/src/features/chat/composer/useComposerSubmission.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"de54816de8d43584ac100a84d45cd3b789393f548ae8ea2920131b25e8853fed"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionTree.catalogRows (cognitive 26): sessionTree.catalogRows has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 6, loops 4, ternaries 1 (3 pts) (nesting depth added 8). Of this number, 14 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa2e220e92e1319a92550aea87f10f76910321087d80c38757ed794cb4ad397"}},{"ruleId":"D2","level":"warning","message":{"text":"syncEngine.mergeLiveInto (cognitive 26): syncEngine.mergeLiveInto has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 10, if/else 10, ternaries 5 (6 pts) (nesting depth added 1). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 1294, 1356, 1275, \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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46d7c9a376e2ef45fe45e15104f25b5e81b9f9f99fad0eb9db49e8b33207b46"}},{"ruleId":"D2","level":"warning","message":{"text":"contentBody.createContentEventLane.pump (cognitive 26): contentBody.createContentEventLane.pump has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, error handling 2 (4 pts), loops 1 (nesting depth added 10). Of this number, 25 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":"packages/thread-projection/src/contentBody.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e138ffaaf8dbd882cf5800452b5e988d13229a0355b608950c0d1064861eb9"}},{"ruleId":"D2","level":"warning","message":{"text":"draftIssues (cognitive 26): draftIssues has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (10 pts), other 8, loops 3, boolean chains 2, error handling 1 (2 pts), ternaries 1 (nesting depth added 4). Of this number, 22 points are the body\u0027s own statements and 4 belong 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":"harness/lib/issues.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5041e6e3ab13f6fa34310e5e3c7c2f4d22eceea7083a4de9289782a48046a059"}},{"ruleId":"D2","level":"warning","message":{"text":"RunApprovalReviewer::review_action (cognitive 25): RunApprovalReviewer::review_action has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (9 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/approval_review/context.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98543d219eeb688418397f8aba18739ab8a0e19b6f9aa30b32502ead27747c8"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::recover_queued_receipts_cancellable (cognitive 25): SqliteStore::recover_queued_receipts_cancellable has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (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":"agent/src/session/queued_receipts.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"211705a7327870c6a07f0926140e10db86899f6ff31f36a872f4e4cd4b81c597"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::prompt::lint_memory_index (cognitive 25): future_agent::prompt::lint_memory_index has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (5 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/prompt/mod.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"2021d05be6453bf905eea75e4fdd7213d374e97e1ebbda1b19f3aba8d691f210"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::commands::session_lifecycle::delete_sessions (cognitive 25): future_agent::rpc::commands::session_lifecycle::delete_sessions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (8 pts), match/switch 3 (6 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":"agent/src/rpc/commands/session_lifecycle.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ea13c6ef0ff55d9d44093854eedc4200355dd5530122d475cc876b65ebe11b"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::content::compact::encode (cognitive 25): future_agent::session::content::compact::encode has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (6 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/compact.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0262c1307fbc4c5e4dab7b4442ff68bf21420a3163c75e6607a35a12d0380c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::reset::drop_kind_from_entry (cognitive 25): future_agent::session::reset::drop_kind_from_entry has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 3, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/reset.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e31c4599eab1a3cda8429afd5b2a62fd2b07f5e9513c4fc70a4433d317fd36"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::tools::shell::execution::spawn_shell_impl (cognitive 25): future_agent::tools::shell::execution::spawn_shell_impl has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 4, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/tools/shell/execution.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce59adbde021a72f37e91289cd9179bb5699ab643fc589670e958385180199e"}},{"ruleId":"D2","level":"warning","message":{"text":"PolicyEngine::check_group (cognitive 25): PolicyEngine::check_group has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/policy.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"be14fa83bc8a2ea714814d2b6a7d4184fec83b63ab8a6237d15792d1433f911f"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::tools::tools_list (cognitive 25): future_cli::commands::tools::tools_list has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (5 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/tools.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41e4176939c0f4f7718246a4ce2a4563fa39388c0c113b9469b53f1f6938b2e"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor::start_generation (cognitive 25): Supervisor::start_generation has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 4, match/switch 3 (4 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":"packages/remote-server/src/supervisor/start.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1263aa84031c617a8b7ad2b47004d1424fd006ce689bb1a0d806f9d1a3a82f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::components::diff::parse_apply_patch (cognitive 25): future_tui::components::diff::parse_apply_patch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (24 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":"tui/src/components/diff.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"f634f6e2b4514beb9523a9a4a4930626647c939c4451e8b44719c644356a071e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::keys::format_parsed_key (cognitive 25): future_tui::keys::format_parsed_key has cognitive complexity 25 (threshold 15). Drivers by points: if/else 22, 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":"tui/src/keys.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2d7a7455807a7e49b43a164536ad069772834946ff019680f7c75eff83b521"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsDialog.SettingsDialog (cognitive 25): SettingsDialog.SettingsDialog has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 13, boolean chains 9, if/else 3. Of this number, 14 points are the body\u0027s own statements and 11 belong to 5 function literals 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":"desktop/src/features/settings/SettingsDialog.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54f6d257b7f6a79001b027c0011e75e8f1dda3c6509b038bca3a69344330ec2"}},{"ruleId":"D2","level":"warning","message":{"text":"FusionDiscussionPanel.StepCard (cognitive 25): FusionDiscussionPanel.StepCard has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 8 (19 pts), boolean chains 5, if/else 1 (nesting depth added 11). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"desktop/src/features/fusion/FusionDiscussionPanel.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe773ee313b2a4287a31ebe45a778fc146b1931048b2ac5345e164571e7db65"}},{"ruleId":"D2","level":"warning","message":{"text":"useThreadMessages.useThreadMessages (cognitive 25): useThreadMessages.useThreadMessages has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 5 (8 pts), boolean chains 5 (nesting depth added 5). Most of this is not in the body itself: 5 of the 25 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 170, 383, 131, \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":"desktop/src/features/agent/useThreadMessages.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"569b4978ec402f7420f01477ca575416e0daa49359a0f675f1bf15114961dbbd"}},{"ruleId":"D2","level":"warning","message":{"text":"useAppLifecycle.useAppLifecycle (cognitive 25): useAppLifecycle.useAppLifecycle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 7, ternaries 2 (3 pts) (nesting depth added 4). None of this is in the body itself: all 25 points belong to 8 function literals inside it that branch (lines 80, 125, 59, \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":"mobile/src/remote/useAppLifecycle.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79d9a619766f70f36e912bf826bc4d9925e742b8bc8efb3b7e5bc4f61b68fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsScreen.SettingsScreen (cognitive 25): SettingsScreen.SettingsScreen has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 27 (42 pts), boolean chains 31, if/else 13 (17 pts), error handling 4, match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (SettingsScreen.SettingsScreen::renderLevel) 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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"355633774faf1c9e925a6ccd869eb81ee6866e9e754f15360ccb97c07c027355"}},{"ruleId":"D2","level":"warning","message":{"text":"retainedSize.retainedSize (cognitive 25): retainedSize.retainedSize has cognitive complexity 25 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 7 (11 pts), boolean chains 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":"packages/remote-client/src/retainedSize.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc5cd6049d5c85160d616618e62083087663ca6910d3841e8455452056b1e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Composer.string (cognitive 25): Composer.string has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (21 pts), ternaries 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":"packages/thread-projection/src/cooperativeJson.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3128dc523a2d8b647999df367ffc135f275f6060b83c03aa7bc91306691444e"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentSequence::stamp (cognitive 24): ContentSequence::stamp has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (17 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":"agent/src/rpc/broadcaster/content_sequence.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d220032dc076659f92b8dcacf6fb46dc69c4dd3ce9ed4c80da595db20b352f5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::open_cancellable (cognitive 24): Database::open_cancellable has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 6 (11 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":"agent/src/session/database/mod.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8f628446b381c927839ebacf8482bef1a1c6a790063d37db3b164695e558dc"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::publish_segmented_metadata (cognitive 24): SqliteStore::publish_segmented_metadata has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 6 (9 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/metadata.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4e0893d69dac707b21f9d117b572c7a829da43cb023c2c9acd18daf6c895dd"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::agent::run_loop::merge_repeated_tool_input_start (cognitive 24): future_agent::agent::run_loop::merge_repeated_tool_input_start has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (24 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":"agent/src/agent/run_loop.rs"},"region":{"startLine":2054}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c9d42187507c46810c83bca3823d717a543bf3b7361dd4c4da1a69ce05c9de"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::commands::session_reset::handle_reset_session_history (cognitive 24): future_agent::rpc::commands::session_reset::handle_reset_session_history has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/session_reset.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e817739d41dc6120ac680aa8d1914090ccb8b3dd511ee1457835d0d841bb8e97"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::prompt_helpers::run_event_to_sse (cognitive 24): future_agent::rpc::prompt_helpers::run_event_to_sse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/prompt_helpers.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b5cf87ceabdab9fd7224ccaf6892ad8ad499668106a68354fd5ee6939bc8b9"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::database::connection::initialize_connection (cognitive 24): future_agent::session::database::connection::initialize_connection has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 5 (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":"agent/src/session/database/connection.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9c139edea2cb448bf2f7275f9e9e0e3d353606591ab4ae050c2122d3195032"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::history::display_index::entry_shape (cognitive 24): future_agent::session::history::display_index::entry_shape has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/history/display_index.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5d4a5bb502499172cf47a801e55ed1b47218659d114e10cc573a8104cd94b3"}},{"ruleId":"D2","level":"warning","message":{"text":"DingtalkChannel::run_with_data_dir (cognitive 24): DingtalkChannel::run_with_data_dir has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3 (9 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/dingtalk/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cb2719d49e75c4ef09fd7cd0d6f432f7363d55eb78a3352a67870e841fab69"}},{"ruleId":"D2","level":"warning","message":{"text":"FeishuChannel::run (cognitive 24): FeishuChannel::run has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 3 (9 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35053a70a017e5071abbb6ec22037a377572c9caafe0fb8e2716526a0ab279e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::doctor::check_sessions (cognitive 24): future_cli::commands::doctor::check_sessions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (5 pts), match/switch 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":"cli/src/commands/doctor.rs"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0c2b770cb9e5684f34d68640ed7d718bc2d170515f4d86114c389dedb3defc"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_transcript::format_text (cognitive 24): future_cli::commands::session_transcript::format_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (18 pts), 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":"cli/src/commands/session_transcript.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0667f77b4e514ef0b1fffc40178161c180d27af48e050cbafe075b0c5e4cb0"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentHost::start_agent (cognitive 24): AgentHost::start_agent has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 6 (10 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_host.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d7553561fc49774c8a3ed37de835a8fbe6634f603e85a4a1a9b1483bdbd451"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::run_control::abort_run_on_agent (cognitive 24): future_host::agent_bridge::run_control::abort_run_on_agent has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (24 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/run_control.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0798dfc2cbb88663bc1229ab002a2b605ed19de9e2e6ec94f771cf0b4be0c27"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::remote_host::files::claim_uploads (cognitive 24): future_host::remote_host::files::claim_uploads has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 6 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/files.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b9565f1e7d222f552c81e191adedae7628ef0294dbf6699f4f9f8f6ecb86a27"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::store::migrations::admit (cognitive 24): future_host::store::migrations::admit has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (20 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":"host/src/store/migrations.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b88b76ba58154c2be0ca339b4b792360c283e44ed914f3333beca90f0e9359"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::spawn_supervisor (cognitive 24): Client::spawn_supervisor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/src/runtime.rs"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d316329220b2e5ebf601096f5d3aa65834e1e5c7bc011b2392fd5a9867362e"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::spawn_event_stream_capped::handle_push (cognitive 24): Client::spawn_event_stream_capped::handle_push has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 3, 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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":2595}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1612a13330fd7d84e5accb59a71f4f57e1a6e83da42af40cc2c1c4685256f0"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::utils::wrap_text_with_ansi (cognitive 24): future_tui::utils::wrap_text_with_ansi has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 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":"tui/src/utils.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c64d9b7d244f8cf119d68e72c6c34cf7a4426e1242d2920bc33c5e806833473"}},{"ruleId":"D2","level":"warning","message":{"text":"GitHistoryPanel.GitHistoryPanel (cognitive 24): GitHistoryPanel.GitHistoryPanel has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (20 pts), if/else 3, boolean chains 1 (nesting depth added 9). Of this number, 22 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":"desktop/src/features/git-history/GitHistoryPanel.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a278f256d3536f40da7401b00c9dcaa3b63d8fe6958d6b60b6fa30b827f8f7f"}},{"ruleId":"D2","level":"warning","message":{"text":"RunsPanel.ToolRow (cognitive 24): RunsPanel.ToolRow has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 12 (18 pts), boolean chains 3, if/else 3 (nesting depth added 6). Of this number, 20 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":"desktop/src/features/runs/RunsPanel.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"45783e8559c9890a120f7582f8dd248fe3a915394b20a9fd076f48e8ce6af174"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteWorkspaceMenu.RemoteWorkspaceMenu (cognitive 24): RemoteWorkspaceMenu.RemoteWorkspaceMenu has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (22 pts), boolean chains 1, error handling 1 (nesting depth added 11). Of this number, 21 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":"desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b1260f6aaf8e6bfc98f387848ae5b9cc320706d4775feccf1a2173f530f424"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteProvidersPanel.RemoteProvidersPanel (cognitive 24): RemoteProvidersPanel.RemoteProvidersPanel has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 13 (17 pts), boolean chains 5, error handling 2 (nesting depth added 4). Most of this is not in the body itself: 8 of the 24 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 157, a function literal at line 50, write, \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":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c298e68ca8e661116cb987fe9e2aff69ea2e7fc06cd2d978665b8ecbd07698"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillsView.InstalledTab (cognitive 24): SkillsView.InstalledTab has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 13, if/else 4 (5 pts), ternaries 5, loops 1 (nesting depth added 1). Most of this is not in the body itself: 7 of the 24 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 452, 400). 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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6ca18c4873e850dbaafc3bbc087a71962d5c8b1fda5ec74884f2b83d17c528"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownText.renderBlock (cognitive 24): MarkdownText.renderBlock has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 12 (21 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e03052737710cbcdb9954f73e7881bd4b4bf0fbc99aee3d88d754c3ea65b592"}},{"ruleId":"D2","level":"warning","message":{"text":"useChatFiles.useChatFiles.fetchDownload (cognitive 24): useChatFiles.useChatFiles.fetchDownload has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (20 pts), ternaries 2 (4 pts) (nesting depth added 7). Most of this is not in the body itself: 11 of the 24 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 320, 334). 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32dd7f3327b218737d5a773859e7b12ae21351daabd4202d5631cabf44a9f42"}},{"ruleId":"D2","level":"warning","message":{"text":"SendQueuePanel.SendQueuePanel (cognitive 24): SendQueuePanel.SendQueuePanel has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 20, ternaries 3, if/else 1. Of this number, 23 points are the body\u0027s own statements and 1 belongs 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":"mobile/src/features/chat/components/SendQueuePanel.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cd361cf458ff5a5428dd38ae61c3834d5ba865a3c5b706b6de99494fb1bc17"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionTree.filterArchivedRows (cognitive 24): sessionTree.filterArchivedRows has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (4 pts), ternaries 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8543b25f3bed2b870c6938efd58c5ade0b69db8e2cff3d76a8827527fbfa4b"}},{"ruleId":"D2","level":"warning","message":{"text":"recentRows.recentHierarchy (cognitive 24): recentRows.recentHierarchy has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 6 (8 pts), boolean chains 4 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/recentRows.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6958c2192529747128e2c61f1c44bf8ba1081c6dcf9707c730ac55c2b477454"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelsSettingsPage.ModelsSettingsPage (cognitive 24): ModelsSettingsPage.ModelsSettingsPage has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, ternaries 3, loops 2 (nesting depth added 3). Most of this is not in the body itself: 7 of the 24 points are its own statements and the rest belongs to 6 function items inside it that branch (setVisibility, a function literal at line 103, a function literal at line 113, \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":"mobile/src/features/settings/ModelsSettingsPage.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4218092a09bc61c48fbb6c3fbb44cb81dc775b70d9bc992f008623065ffbac0"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsScreen.SettingsScreen::renderLevel (cognitive 24): SettingsScreen.SettingsScreen::renderLevel has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 8 (16 pts), boolean chains 6, if/else 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. This shape REPEATS in the file: one other method here (SettingsScreen.SettingsScreen) 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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28854890ad7649b16c6a9b85ab66820408f8480f830e4fbf470bcf27e952c8f"}},{"ruleId":"D2","level":"warning","message":{"text":"remarkLatexMath.tokenizeMath.\u003Creturned closure\u003E (cognitive 24): remarkLatexMath.tokenizeMath.\u003Creturned closure\u003E has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, ternaries 5 (6 pts) (nesting depth added 2). Most of this is not in the body itself: 3 of the 24 points are its own statements and the rest belongs to 7 function items inside it that branch (between, escaped, tokenizeClose::after, \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":"packages/markdown/src/remarkLatexMath.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"60a5f4ba9e4a076bad5425aa4279a48c2d2dd81761944fa7929c06e5cd7eca6f"}},{"ruleId":"D2","level":"warning","message":{"text":"transfer.runDownloadPrepared (cognitive 24): transfer.runDownloadPrepared has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), error handling 2 (3 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":"packages/remote-client/src/transfer.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"81eedcbe4a19428e0d3329ec289b00a289d1875fcba583a80c8e34e9a850af37"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.runHandshake (cognitive 24): RemoteClient.runHandshake has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 8, error handling 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 7 of the 24 points are its own statements and the rest belongs to 2 function items inside it that branch (run, exchange). 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ee910f9336ef951bfe4b1d14c5cfda3cb35946c7c9fe7357ff228ee753ed34"}},{"ruleId":"D2","level":"warning","message":{"text":"projection.segmentToTimeline (cognitive 24): projection.segmentToTimeline has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 11 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/src/projection.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"853325dba413b51cc239d93895b2dcb3f8492691d23c0c0d36e88f31e93371df"}},{"ruleId":"D2","level":"warning","message":{"text":"FutureAgentService::execute_command (cognitive 23): FutureAgentService::execute_command has cognitive complexity 23 (threshold 15). Drivers by points: if/else 16 (19 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":"agent/src/grpc/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e64f841883509b0794d3364d2fc2e9127cde8c95871d2c0ab8cc323b8acdb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::batch_summaries (cognitive 23): Snapshot::batch_summaries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 3, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/reader_summary.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baafb39c6a828e70ec8ae2d2f358776426968ee4c812e35328a14a261506fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"Checkpointer::open (cognitive 23): Checkpointer::open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (5 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":"agent/src/session/database/wal.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d079daec716dfb2612444463b1af1a2f332712d483c7ddd10e19d2b10270e69"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::persistence::run_worker (cognitive 23): future_agent::session::persistence::run_worker has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 4 (11 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":"agent/src/session/persistence.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"e927501aaa828b1da63ceea064875956fd4b96ae07fa748706fa6f67ae52a037"}},{"ruleId":"D2","level":"warning","message":{"text":"ChannelSink::push (cognitive 23): ChannelSink::push has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 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":"channels/src/bridge/sink.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"6953bad56274545e6535764f69c4ae8e46d6528549b3639a0ef6c0b1d3221f0d"}},{"ruleId":"D2","level":"warning","message":{"text":"Email::poll (cognitive 23): Email::poll has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/email.rs"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4bf0d5c63d869e8601bba4a347ad713a8eaa060de88102531b0dd1449ae436"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::doctor::check_skills (cognitive 23): future_cli::commands::doctor::check_skills has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (6 pts), match/switch 2 (6 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":"cli/src/commands/doctor.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9720cda1a0ec4f8f1ece755912f57e4ab03c9edf7dfc50a9123b4a9cad4dd8"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::store::runs::apply_tool_event (cognitive 23): future_host::store::runs::apply_tool_event has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (3 pts) (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/store/runs.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"8feebf4cbfba90b1fd6e73be3a0c59cc7bb5a2d536b925761e34f6fe9b99b8e6"}},{"ruleId":"D2","level":"warning","message":{"text":"future_remote_server::lean::lean_replay_page (cognitive 23): future_remote_server::lean::lean_replay_page has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (5 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":"packages/remote-server/src/lean.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e50eea0ad5ed2aa2b853518053972cd22ef06a00fea039fd1745559a2f946c"}},{"ruleId":"D2","level":"warning","message":{"text":"Input::move_word_backwards (cognitive 23): Input::move_word_backwards has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Input::move_word_forwards) 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":"tui/src/components/input.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0da93cb66906fd1cc0f1c955abb8801f6e2203dbf6dacb3cf77dbeafe029e9"}},{"ruleId":"D2","level":"warning","message":{"text":"Input::move_word_forwards (cognitive 23): Input::move_word_forwards has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (Input::move_word_backwards) 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":"tui/src/components/input.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb527346dfba7de0af6e6ca4dbbe933ef5962e8064da4abb334708ac62cecca"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::rpc::provider_types::validate_provider_input (cognitive 23): future_tui::rpc::provider_types::validate_provider_input has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 6, 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":"tui/src/rpc/provider_types.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e179d4d5addad62587411c6ed27b4c96326888a4f31b5e9a59dda6b5121e57b"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::git_panel::parse_worktrees (cognitive 23): future_tui::workbench::git_panel::parse_worktrees has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/git_panel.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"3521c203712834d546fb7731f40af6f4883ddfc8cb5695ef7fa99cb18c9f2ea6"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonPreview.JsonPreview (cognitive 23): JsonPreview.JsonPreview has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 6 (10 pts), boolean chains 6, if/else 5, error handling 1 (2 pts) (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 10 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":"desktop/src/features/filepreview/JsonPreview.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73fd2dd68e4263aef8035031087bafde874ebdd2337fc7643993959d2baef98"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseOrganization.DatabaseOrganization (cognitive 23): DatabaseOrganization.DatabaseOrganization has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (7 pts), boolean chains 6, loops 3 (4 pts), error handling 2 (3 pts), if/else 2 (3 pts) (nesting depth added 6). Most of this is not in the body itself: 8 of the 23 points are its own statements and the rest belongs to one function item inside it that branches (organize). 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":"desktop/src/features/settings/DatabaseOrganization.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"262d01fe6aa2f6a53de035aa86870f3f7e31784d21c45915ac6f5c651d5479ee"}},{"ruleId":"D2","level":"warning","message":{"text":"FileTreeNode.FileTreeNode (cognitive 23): FileTreeNode.FileTreeNode has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 9 (19 pts), boolean chains 2, if/else 2 (nesting depth added 10). Of this number, 21 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":"desktop/src/features/filetree/FileTreeNode.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f585a67aa9616e8e2efe8f55335de6af3e0b022e9cba6df4a735a97f274114"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteModelsPanel.RemoteModelsPanel (cognitive 23): RemoteModelsPanel.RemoteModelsPanel has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 7, if/else 5 (7 pts), ternaries 6, loops 2, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 67, setVisibility, a function literal at line 142, \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":"desktop/src/features/remote-peer/RemoteModelsPanel.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"356cb9de5c06032382c9c0535bafa72f0a2f3df600b41e22d43fb8f3e1ad259d"}},{"ruleId":"D2","level":"warning","message":{"text":"terminal-server.server (cognitive 23): terminal-server.server has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 7, error handling 1 (2 pts) (nesting depth added 5). Of this number, 15 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":"desktop/shot/terminal-server.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5824c5022836770f8ab7912bbcff072732f9ef83a7ba4910966e7ca4864aa560"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownText.CodeSource (cognitive 23): MarkdownText.CodeSource has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 13 (21 pts), boolean chains 2 (nesting depth added 8). Of this number, 13 points are the body\u0027s own statements and 10 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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c73927efc49b9472a2941eb76ff34b715b4f4df94afec51f489bb388b85f139"}},{"ruleId":"D2","level":"warning","message":{"text":"ThinkingRow.ThinkingRow (cognitive 23): ThinkingRow.ThinkingRow has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, ternaries 8 (9 pts), if/else 4 (nesting depth added 1). Of this number, 17 points are the body\u0027s own statements and 6 belong to 2 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":"mobile/src/features/chat/messages/ThinkingRow.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5258de1850a66673e19d6e1b33324cac7d7c417d9490c6b78bbde84d38cbfe85"}},{"ruleId":"D2","level":"warning","message":{"text":"useAttachmentPicker.useAttachmentPicker.pick (cognitive 23): useAttachmentPicker.useAttachmentPicker.pick has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 2 (5 pts), loops 2 (3 pts), ternaries 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":"mobile/src/features/chat/useAttachmentPicker.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da58f39616047329ddc4ecaf0269cdef096991d964ee6a9ba5dfd055e4ab93b"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionTree.archivedRows (cognitive 23): sessionTree.archivedRows has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 5 (8 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 8). Of this number, 21 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bf90f4553aba560a867043d26bd2e1394d437804d38a8ca7ed282b0a3bb2ef"}},{"ruleId":"D2","level":"warning","message":{"text":"localPath.localFilePath (cognitive 23): localPath.localFilePath has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 2 (5 pts), boolean chains 2, 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":"packages/markdown/src/localPath.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e65bf01fe501453097be2f6ca0df66a67e396f37450d186f9f2cda877dc613"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.subscribeState (cognitive 23): RemoteClient.subscribeState has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 2 (6 pts), boolean chains 3 (nesting depth added 8). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 1194). 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca00250f1c77801023a1f650c22491cd7fe096add7dc8bd6b1be882e04ab345b"}},{"ruleId":"D2","level":"warning","message":{"text":"replay.tailCoversRange (cognitive 23): replay.tailCoversRange has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 8, loops 1 (2 pts), ternaries 1 (nesting depth added 7). Of this number, 20 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":"packages/thread-projection/src/replay.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"520c9cea8a1d8d898ec5c0b102cf3293f880d9c2ec694c50d404c7c3e75385db"}},{"ruleId":"D2","level":"warning","message":{"text":"SseBroadcaster::broadcast_with_ack (cognitive 22): SseBroadcaster::broadcast_with_ack has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 1 (4 pts), boolean chains 2 (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":"agent/src/rpc/broadcaster/mod.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8842d342ea3cf91106d2c589319367aa0c6c9cf1165c735d788f192fc0be67e"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSession::replay_cost_split (cognitive 22): ServerSession::replay_cost_split has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (4 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":"agent/src/rpc/session.rs"},"region":{"startLine":1964}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bd43a63e338de061879a763a7e1c99819d522ef6b671e117d9e0ec0b97087b"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::broadcaster::replay::trim_projection (cognitive 22): future_agent::rpc::broadcaster::replay::trim_projection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (19 pts), 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":"agent/src/rpc/broadcaster/replay.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b184734a20a1c3415a91009f17ea1591bc33b084abc8a01eff1140d43da329"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::content::compress::apply_ids (cognitive 22): future_agent::session::content::compress::apply_ids has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 3 (8 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/compress.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad8a611af69414fd9f6340cc6d218b200c6c3aa6e166e7c7589f380e231d9fe"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::skills::discover_skills_in (cognitive 22): future_agent::skills::discover_skills_in has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (14 pts), match/switch 1 (5 pts), 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":"agent/src/skills/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"180061a834aa95cf04fe51d07e82ea3adaddbe3fccc8eb01f3d4bed76ac9b9c1"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::tools::reject_dangerous_command (cognitive 22): future_agent::tools::reject_dangerous_command has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (4 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":"agent/src/tools/mod.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c532eb408d986688e1db773eb2dc644e4baba713fc4a3fea5f5313bd6b91093"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::providers::imessage::macos::run_polling (cognitive 22): future_channel::providers::imessage::macos::run_polling has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (12 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/imessage.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41c6ba6cf6361cfe163603907ba7b19de3853d5a8b752b2322cd27e543d9a09"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::mcp_servers::mcp_call (cognitive 22): future_cli::commands::mcp_servers::mcp_call has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 3 (4 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":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe707cc08defd0879ffa39bab205bfd1f6db71838dfaad739480e85fc426635"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::remote::list (cognitive 22): future_cli::commands::remote::list has cognitive complexity 22 (threshold 15). Drivers by points: if/else 18 (21 pts), 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":"cli/src/commands/remote.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5f13c97dfa5e54057c29fe213194eaa981eef69a2cc38018819c5260e9e8e7"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::task::wait_for_run (cognitive 22): future_cli::commands::task::wait_for_run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, loops 1 (nesting depth added 11). 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":"cli/src/commands/task.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca4f283ec58e871c39f074d9a7e6e58afa2675918be5ea77447ff0b8749b557"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::flags::parse_flags (cognitive 22): future_cli::flags::parse_flags has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 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":"cli/src/flags.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6117a1903ac84023c68bc4dc8523480efcf8e9b9c368fd60bd0fba6ac145b692"}},{"ruleId":"D2","level":"warning","message":{"text":"futureos::gui::set_windows_taskbar_icon (cognitive 22): futureos::gui::set_windows_taskbar_icon has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 1, match/switch 1 (nesting depth added 6). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 2 function items inside it that branch (find_best_entry, hicon_from_ico_entry). 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":"desktop/src-tauri/src/lib.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ce60eac35ffc18fd2ff619f918bd3669323f834a9d9394d3e0740add9eef12"}},{"ruleId":"D2","level":"warning","message":{"text":"ChildSession::wait_for_output (cognitive 22): ChildSession::wait_for_output has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 1 (3 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":"host/src/fusion.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"84960dc07fe9af1578a8124aa2eb94bca346af4ed7d3217b0fe056a4b19737b4"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::store::db::apply_schema (cognitive 22): future_host::store::db::apply_schema has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/store/db.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b3297b48d08d117d29471139c9ff4b69ea88a52c309b2ac16fbd9579b7b401"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::capture (cognitive 22): Snapshot::capture has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 7 (10 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":"orchestration/fusion/src/files.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"815012e98785e844642fba1c5c6d76cc9f8cc60930a893142727089c35b53aa0"}},{"ruleId":"D2","level":"warning","message":{"text":"future_fusion::config::settings_patch_from_args (cognitive 22): future_fusion::config::settings_patch_from_args has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (3 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":"orchestration/fusion/src/config.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a50794e0e25daba06dca153a371868326352483c544be0839c067a730f93b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Scan::number (cognitive 22): Scan::number has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, loops 1 (nesting depth added 11). 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":"tui/src/workbench/syntax.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f527ecc85533dfce29b836b76a648269f2c7d04900c831d219badc76acf942ea"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::index::run (cognitive 22): future_tui::index::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 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":"tui/src/index.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69272155331f547f148d9bdeab1b7e5c407df8d9ef3ad943f09db74a703605f"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::local::skill_description (cognitive 22): future_tui::workbench::local::skill_description has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/local.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72e02410ad6e571f8935cb7e0ea0b0967d05b60f3ca70d9c74d9cf26f5552f6"}},{"ruleId":"D2","level":"warning","message":{"text":"remotePeerClient.normalizeRemoteSessionRows (cognitive 22): remotePeerClient.normalizeRemoteSessionRows has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 13, boolean chains 6, if/else 3. Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to one function literal inside it that branches (line 296). 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc3d0de72462cb10d433d4e4865c696267b7bedf6fd2d745639960acb2e3ddc"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteApprovalMenu.RemoteApprovalMenu (cognitive 22): RemoteApprovalMenu.RemoteApprovalMenu has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, if/else 7, ternaries 3 (4 pts), error handling 1 (nesting depth added 1). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 6 function items inside it that branch (a function literal at line 141, choose, a function literal at line 77, \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":"desktop/src/features/remote-peer/RemoteApprovalMenu.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8ad889bb7afa4526ab386006c59f03834021d051958dbc5b03e7ab9db9d97f"}},{"ruleId":"D2","level":"warning","message":{"text":"PdfPreview.PdfPreview (cognitive 22): PdfPreview.PdfPreview has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 2 (6 pts), boolean chains 2, error handling 2 (nesting depth added 6). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 83, 34, 75, \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":"desktop/src/features/artifacts/PdfPreview.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"402251443c6f93b22d23108be1bc9529837105de17ec43b8c2f5812bf0e35a73"}},{"ruleId":"D2","level":"warning","message":{"text":"useThreadStore.useThreadStore (cognitive 22): useThreadStore.useThreadStore has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3, loops 2 (3 pts), ternaries 2, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 10 function literals inside it that branch (lines 861, 448, 890, \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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d895a5574f423a6ec10eb7c42b786847b2f97fd4cab9087514f123b8cf39ad81"}},{"ruleId":"D2","level":"warning","message":{"text":"threadTree.buildTree (cognitive 22): threadTree.buildTree has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 4 (8 pts), boolean chains 3, 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":"desktop/src/components/layout/threadTree.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cedde6a696a8333b39f54b0b281811557ba6ad698d1f0e5e67406917b3ca659"}},{"ruleId":"D2","level":"warning","message":{"text":"files.prepareFile (cognitive 22): files.prepareFile has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 6, if/else 5 (6 pts), ternaries 4 (6 pts), error handling 3 (4 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":"mobile/src/remote/files.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55ea801fedbe75539eabf8e74e95128dd406428b34210933136c69dc325d762"}},{"ruleId":"D2","level":"warning","message":{"text":"usePromptOutbox.usePromptOutbox.continueRun (cognitive 22): usePromptOutbox.usePromptOutbox.continueRun has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6, error handling 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 594). 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa517feeb0367c3d6e0124673507652e8120d284e5459498c0ef5cf1c797d587"}},{"ruleId":"D2","level":"warning","message":{"text":"useSkillRecommendation.useSkillRecommendation (cognitive 22): useSkillRecommendation.useSkillRecommendation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15, boolean chains 3, error handling 2, ternaries 2. Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 152, 205, 135, \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":"mobile/src/features/chat/useSkillRecommendation.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0d1215b9633ac783b6ccbcdbb8d976822bbb170b536bd6ae5996eb78031a69"}},{"ruleId":"D2","level":"warning","message":{"text":"useCompactContext.useCompactContext.compact (cognitive 22): useCompactContext.useCompactContext.compact has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 5, ternaries 2 (5 pts), error handling 1 (nesting depth added 4). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/useCompactContext.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"79798c5cfb422fbe828ee421fd35338cec9227c368d35d8ed2ed809aba82d2e0"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionTree.buildSessionTree (cognitive 22): sessionTree.buildSessionTree has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 4 (8 pts), boolean chains 3, 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caf0e876d4df9fd935bb8656f7e1ac5a3c4f09957fe857e6c88c4e671b9347c"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.openAttempt (cognitive 22): RemoteClient.openAttempt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, error handling 1 (nesting depth added 6). Of this number, 17 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":"packages/remote-client/src/client.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f61bb13719c8842eb73ab1040e79df8946b43ccce8b7edf547a65d72dac807"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.signal (cognitive 22): RemoteClient.signal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 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":"packages/remote-client/src/client.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46e5c79dc34bc52d185f544872d2315ff211ba3bd795d2351ab72283da9916e"}},{"ruleId":"D2","level":"warning","message":{"text":"perfDigest (cognitive 22): perfDigest has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (11 pts), if/else 3, loops 2 (3 pts), other 3, boolean chains 2 (nesting depth added 8). Of this number, 21 points are the body\u0027s own statements and 1 belongs 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":"harness/lib/analyze.mjs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b45f06c8d8c2084c689113b1b83d346d6a3bf753ad76ad689893d697e2452c"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSession::execute_shell_at (cognitive 21): ServerSession::execute_shell_at has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, loops 2 (nesting depth added 10). Of this number, 18 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":"agent/src/rpc/session.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"be935e6ea46930b5d5c2fb65872de7d8f63a3b78d91392aaf8ba8960d07fde23"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::verify_existing_intent (cognitive 21): Snapshot::verify_existing_intent has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (15 pts), 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":"agent/src/session/content/reader_intent.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a629d695b6fe11d7feda38e3ee0505e983f9a53addd4f13f8dd86e94401e98"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager::fork_source_entries (cognitive 21): Manager::fork_source_entries has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/manager/fork.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4517c359a2c3d0ee41daf0eda8538b96f7dd06390c0f42532d5e9b5de84067b"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager::summary_from_session (cognitive 21): Manager::summary_from_session has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 1 (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":"agent/src/session/summary.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb8aa0b8682a1a56e52c6e86d6150464ece12a6117b3134a12005e2494fcd26"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::discard_hidden_fork_cancellable (cognitive 21): SqliteStore::discard_hidden_fork_cancellable has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 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":"agent/src/session/content/fork.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2727c4810da7ee234faa6ce81d7480f9c6b206251a5274e1547be7e511749b97"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillManager::install_locked (cognitive 21): SkillManager::install_locked has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 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":"agent/src/skills/manager.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"40afe100bcccc866b1b6c34ec1adaa6c72e3ffd542f119ac28947d71ac494432"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::compaction::semantic::evidence::prepare_with_handoff_summary (cognitive 21): future_agent::compaction::semantic::evidence::prepare_with_handoff_summary has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 5 (7 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":"agent/src/compaction/semantic/evidence.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3299a2dc09e9ef68bbae68269d3dc2e3712ced29e708b1974008fc8b04d338a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::history::display_index::update_display_index_from (cognitive 21): future_agent::session::history::display_index::update_display_index_from has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 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":"agent/src/session/history/display_index.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdda16b29ddfb62f20e5a3f5d349055e1005265f4058eca2f79ba38bd58687be"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::types::convert_from_llm (cognitive 21): future_agent::types::convert_from_llm has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (14 pts), if/else 5, loops 1 (2 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":"agent/src/types/mod.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"599ca83248569bee4e5cc6e601db89d477259223105315db519e8194dfcfd635"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::providers::irc::parse_line (cognitive 21): future_channel::providers::irc::parse_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (9 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":"channels/src/providers/irc.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"03abc82748cd8f5e08f8749feb20da0f493acbe7e01dfbb352eddc6881d3bcdc"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::providers::mattermost::websocket_session (cognitive 21): future_channel::providers::mattermost::websocket_session has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 4 (10 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":"channels/src/providers/mattermost.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34e41ba482d2a66cf6708f06f296e6ba9afe059cc4dfb2e29a9786f45cf82dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Observed::device_lines (cognitive 21): Observed::device_lines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 5 (9 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":"cli/src/commands/remote.rs"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"705afa81ed1d79945b3c0a6110af658d5f237b69f6ae7ac7f72248f84afa0e5d"}},{"ruleId":"D2","level":"warning","message":{"text":"Agent::supervise (cognitive 21): Agent::supervise has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 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":"cli/src/headless/agent.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e844b05bc970cd1550fc9d91561f3c04d8377f779a60f365758dca7361525a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::mcp_servers::mcp_add (cognitive 21): future_cli::commands::mcp_servers::mcp_add has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, loops 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":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7169104f3517412cfbcc61634bee1beec406cfebb2f619c25a3b54367abf840"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::model_settings::model_set (cognitive 21): future_cli::commands::model_settings::model_set has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 3, 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":"cli/src/commands/model_settings.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cc4f28efb19d295ae1b2c9f4abb55eb75717316a0d86ad15bfa7148e7279de"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::remote::remove (cognitive 21): future_cli::commands::remote::remove has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), match/switch 1 (2 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":"cli/src/commands/remote.rs"},"region":{"startLine":2172}}}],"partialFingerprints":{"codehealthFindingId/v1":"74348ab5df35a9bf447c298eedf08d9e0154dc14182a9e9af76ae9a1789a0c66"}},{"ruleId":"D2","level":"warning","message":{"text":"future_remote_server::wire_limits::cap_remote_item (cognitive 21): future_remote_server::wire_limits::cap_remote_item has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/wire_limits.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"212594090a11ebcd37b50608fa1dbff4a61fca8d6ab0feb5a77cb5f5598acb33"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::screen::controls_row (cognitive 21): future_tui::workbench::screen::controls_row has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 1 (nesting depth added 5). Of this number, 18 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":"tui/src/workbench/screen.rs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"9849f19cd9264d9b5d27a47e4ae187c9b6436343229a84c6a5c22e5965be1bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"ShareViewController.loadFile (cognitive 21): ShareViewController.loadFile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 6, ternaries 1 (2 pts), 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":"mobile/modules/future-share-intent/extension/ShareViewController.swift"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f60686bf51d079046358d9a3130dcebda9a06b6c59b944020b06076e8e330a3"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownContent.renderBlock (cognitive 21): MarkdownContent.renderBlock has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/markdown/MarkdownContent.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1d04dc4cb85473937854aa21cd6d14063258f7f82c2b75fd1faa2b098bab39"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentActivityList.labelForActivity (cognitive 21): AgentActivityList.labelForActivity has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 5 (10 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":"desktop/src/features/agent/AgentActivityList.tsx"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f227a77590dd7d65a6589292621021005318d83f534025ade0514455e69dc282"}},{"ruleId":"D2","level":"warning","message":{"text":"remoteClient.remoteConnectionPresentation (cognitive 21): remoteClient.remoteConnectionPresentation has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (12 pts), if/else 7, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote/remoteClient.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d875f16bed77c9cbaac06c5e81099fc8afe7a423eef578c30ec339622021f00"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadListItem.ThreadListItemImpl (cognitive 21): ThreadListItem.ThreadListItemImpl has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 11 (16 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":"desktop/src/components/layout/ThreadListItem.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd0ef653c76baa05258c77afa31ae068c1805fbb8ffce3bd7d4001d8ef0b3f9"}},{"ruleId":"D2","level":"warning","message":{"text":"useDesktopConnection.useDesktopConnection (cognitive 21): useDesktopConnection.useDesktopConnection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1 (nesting depth added 3). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 671, 862, 814, \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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e091bfe43f8a801fa0ade5a3fd442caba39ce51038b951026136002bdc0c4aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ActionMenu.ActionMenu (cognitive 21): ActionMenu.ActionMenu has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 4 (7 pts), ternaries 3 (nesting depth added 3). Most of this is not in the body itself: 8 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 140, 150, 128, \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":"mobile/src/components/ActionMenu.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58a4ec88f02a974bcd98e8533e1f74988dfaefb3a64d8da823bac47409b4e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionTree.mergedRows (cognitive 21): sessionTree.mergedRows has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (7 pts), loops 4 (6 pts), boolean chains 5, if/else 2 (3 pts) (nesting depth added 5). Of this number, 13 points are the body\u0027s own statements and 8 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f53d809d4d05a51f83c3efe6e883c78d2fd5bef8081bdd8ae93c88796b2e2b7"}},{"ruleId":"D2","level":"warning","message":{"text":"useShareIntake.useShareIntake.chooseDestination (cognitive 21): useShareIntake.useShareIntake.chooseDestination has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9, ternaries 4 (7 pts), boolean chains 4, 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, 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":"mobile/src/share/useShareIntake.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8da87b7118d8de395c572b47b74605a2d59052cc8565bd7b7b05f5568a5f23"}},{"ruleId":"D2","level":"warning","message":{"text":"transfer.runPrepareDownload (cognitive 21): transfer.runPrepareDownload has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 3 (5 pts), loops 1, ternaries 1 (nesting depth added 9). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/src/transfer.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"28842b2c4ced2c3c76bbb64e1fa1bbbe126bb809a5889b32cc7e9c0c13b8b912"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.handleFailure (cognitive 21): RemoteClient.handleFailure has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 5 (9 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":"packages/remote-client/src/client.ts"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0de9e1e311917700a2938622ab14dd637b8510e70ce36afd5e4e1f061dec9d2"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncEngine.replayInto (cognitive 21): SyncEngine.replayInto has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, ternaries 2 (nesting depth added 2). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54edd49117dc183e04ef5b1938e48f7ce71a54d3aaa374a987aba5ed2101f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"contentRange.applyContentRange (cognitive 21): contentRange.applyContentRange has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 4, ternaries 2 (4 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":"packages/thread-projection/src/contentRange.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb2ace5e6a3cb27cd77e830a5188456928a6dceba048eda64ebe60a467f4c68"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillManager::reconcile (cognitive 20): SkillManager::reconcile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (3 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":"agent/src/skills/manager.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda9c9b159db0bcee4224feeb2239ede512555f71d09bf0c78c2663050d23e98"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::llm::adapters::openai_chat::lower_messages (cognitive 20): future_agent::llm::adapters::openai_chat::lower_messages has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), match/switch 1 (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":"agent/src/llm/adapters/openai_chat.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8821eebecb3c0ecce4df1b18a7ea2410810d467356926ae1b2b8bae430235533"}},{"ruleId":"D2","level":"warning","message":{"text":"DingtalkWsClient::connect_and_listen (cognitive 20): DingtalkWsClient::connect_and_listen has cognitive complexity 20 (threshold 15). Drivers by points: if/else 2 (10 pts), match/switch 3 (9 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":"channels/src/dingtalk/dingtalk_ws.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"588a3e197c2b098bfd795378332e0ac9c5512c29edbdb254d3aa1c71fb97ed83"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session::new_session_command (cognitive 20): future_cli::commands::session::new_session_command has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f19d1f27632a4731304fb903c4bffd62d2b745261a56be0b03c827f195371f"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_status::format_status (cognitive 20): future_cli::commands::session_status::format_status has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (15 pts), loops 2 (4 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":"cli/src/commands/session_status.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6474e26b1e30f4c4bdcb55b1f0ea4888b63c748d32c1ba6a234ed18f6222d445"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::remote_host::business::prompt::execute (cognitive 20): future_host::remote_host::business::prompt::execute has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 8 (14 pts), if/else 3 (6 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":"host/src/remote_host/business/prompt.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c871e9a7a17ade90fbc4516034b665b3b6c72b44f483badd5cb96e59283deb"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::remote_host::session_files::describe (cognitive 20): future_host::remote_host::session_files::describe has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 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":"host/src/remote_host/session_files.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"2703a85171793954a66236d1bd18f8ec00108c3b6ab16054153f88b0f7f88cb9"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor::publish_event (cognitive 20): Supervisor::publish_event has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 1 (2 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":"packages/remote-server/src/supervisor/publisher.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"078de0a3f958e861047cc4b1b7f488d0b824b5974f59ab4348b10040a863a372"}},{"ruleId":"D2","level":"warning","message":{"text":"future_rpc::connection::select_from (cognitive 20): future_rpc::connection::select_from has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 2 (3 pts) (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rpc/src/connection.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a3a6d070327ce5a8c72a3fee345f7fe953fe9943b836c939164e9fd0dcbf0c"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatArea::render_assistant_message (cognitive 20): ChatArea::render_assistant_message 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":"tui/src/components/chat_area.rs"},"region":{"startLine":3333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80d3f93be45d927f82b1c0d48611039a225ee4e3933b1942226832da71f9c04"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatArea::render_system_message (cognitive 20): ChatArea::render_system_message has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (9 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":"tui/src/components/chat_area.rs"},"region":{"startLine":3975}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c94d7572d3363711fabe9dcb42368f2a05a02fa79d57f2ee23fb1e1dcf3d53b"}},{"ruleId":"D2","level":"warning","message":{"text":"MdParser::parse_inline_until (cognitive 20): MdParser::parse_inline_until has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/markdown.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a6e7f8a8b384bc950d4e1110f8aae08e826596147641225cf5c5b00d49038c"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownRenderer::render_impl (cognitive 20): MarkdownRenderer::render_impl has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 6 (9 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":"tui/src/components/markdown.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"178aca7ed3bf8084808fa70935f8f2a56a849ed7d429cba7edf01aed6bfe4a88"}},{"ruleId":"D2","level":"warning","message":{"text":"StdinBuffer::process (cognitive 20): StdinBuffer::process has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/stdin_buffer.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1803f0d2f57371af58900a4861346849d06103f39d9a00442590cecb68384896"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::layout::layout_with_position (cognitive 20): future_tui::workbench::layout::layout_with_position has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 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":"tui/src/workbench/layout.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e15872369578eead5e8577df9a2934fb14925b301ce9d1ca007e659847f102"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::screen::preferences_box (cognitive 20): future_tui::workbench::screen::preferences_box has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (6 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":"tui/src/workbench/screen.rs"},"region":{"startLine":3260}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2e83082e4ef273b005c7a2c7de379f23db30288f5967cb9a717bd8eea736e0"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::screen::keybindings_box (cognitive 20): future_tui::workbench::screen::keybindings_box has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 1 (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":"tui/src/workbench/screen.rs"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e722ecccdc6ac266896c9d26b62ab5d3f9fd274f6cbdfc4c22a077e9973a58e"}},{"ruleId":"D2","level":"warning","message":{"text":"ShareInbox.copyFile (cognitive 20): ShareInbox.copyFile has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, 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":"mobile/modules/future-share-intent/ios/ShareInbox.swift"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4903c6701bab3c65cea552561dd59f206fd20720b9a03a46eaecafa6c9d469"}},{"ruleId":"D2","level":"warning","message":{"text":"storage-read-benchmark.run (cognitive 20): storage-read-benchmark.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 3 (5 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 7). Of this number, 15 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":"desktop/scripts/storage-read-benchmark.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ceeee12f3ab0b4251ce091371527ac3572d8eaa714e24ac22cfd7d357043ef"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteComposer.RemoteComposer::pasteFiles (cognitive 20): RemoteComposer.RemoteComposer::pasteFiles has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, error handling 1 (3 pts), ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (RemoteComposer.RemoteComposer) 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7685a3bb2a277efc9459ac3a56d1db236e42bcfb173d41d67b16f22c10ed583"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomProviderDialog.CustomProviderDialog::detectThinkingLevels (cognitive 20): CustomProviderDialog.CustomProviderDialog::detectThinkingLevels has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (3 pts), boolean chains 1, loops 1, ternaries 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. This shape REPEATS in the file: one other method here (CustomProviderDialog.CustomProviderDialog::handleSubmit) 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f727ead449fe0414b71756a9c6e6f8c4cb9bc69e6d48f4750a79e28c0ddaad1"}},{"ruleId":"D2","level":"warning","message":{"text":"FusionDiscussionPanel.FusionDiscussionPanel (cognitive 20): FusionDiscussionPanel.FusionDiscussionPanel has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 14, ternaries 5 (6 pts) (nesting depth added 1). Of this number, 19 points are the body\u0027s own statements and 1 belongs to 2 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":"desktop/src/features/fusion/FusionDiscussionPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7518c10337551a20b9f989d46250ba72095de61924a01bcca5b778c738a53c8"}},{"ruleId":"D2","level":"warning","message":{"text":"recentOrder.recentTree (cognitive 20): recentOrder.recentTree has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 5 (7 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":"desktop/src/components/layout/recentOrder.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c621b80966b91d32d3da541f3a256cfc962f52e7b50b5c0e874967d44fc296d"}},{"ruleId":"D2","level":"warning","message":{"text":"AddToVibeDialog.AddToVibeDialog (cognitive 20): AddToVibeDialog.AddToVibeDialog has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 7 (10 pts), if/else 5 (7 pts), boolean chains 2, loops 1 (nesting depth added 5). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 10 function literals inside it that branch (lines 61, 200, 189, \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":"desktop/src/features/vibe/AddToVibeDialog.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5addbd8d33cb30fd2cdf3e0c06409ae2269e32b9094cfc35d8d30a8b583795da"}},{"ruleId":"D2","level":"warning","message":{"text":"remotePeerError.remotePeerErrorKind (cognitive 20): remotePeerError.remotePeerErrorKind has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (20 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":"desktop/src/features/remote-peer/remotePeerError.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e618fc4f2c74e0d495452b7f35053bb9457ebf2ea5ab90dcc0e6d075aae2aa81"}},{"ruleId":"D2","level":"warning","message":{"text":"DeviceSelector.DeviceSelector (cognitive 20): DeviceSelector.DeviceSelector has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (14 pts), boolean chains 4, error handling 1, if/else 1 (nesting depth added 5). Of this number, 10 points are the body\u0027s own statements and 10 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":"desktop/src/components/layout/DeviceSelector.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae06846657bcc379857590d5efd6652edda1f3e3611bf7aea258307724447eb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.inlineToHtml (cognitive 20): index.html.inlineToHtml 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":"host/web/index.html"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"d504b8f22638e06b4cb95a11bbe1e8a4094cf81697ccc5d2bbdd3fb95522dae4"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownImage.LocalImage (cognitive 20): MarkdownImage.LocalImage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 5 (8 pts), boolean chains 2, error handling 1 (nesting depth added 5). Of this number, 12 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":"mobile/src/components/MarkdownImage.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"df88ccc256aee7c4afbffa7c61dd1a14534fdfe22f98cf52a93a2dd40a047d24"}},{"ruleId":"D2","level":"warning","message":{"text":"useChatFiles.useChatFiles.openLocalPath (cognitive 20): useChatFiles.useChatFiles.openLocalPath has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 4 (7 pts), boolean chains 1, error handling 1 (nesting depth added 5). Of this number, 18 points are the body\u0027s own statements and 2 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0bdb7aa92465dd09538e00702921d6738c41517b0bca08e9247fd4e4b5efeab"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatTimeline.ChatTimeline (cognitive 20): ChatTimeline.ChatTimeline has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 15, ternaries 4 (5 pts) (nesting depth added 1). 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, 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":"mobile/src/features/chat/components/ChatTimeline.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0029cebae2eb1e5f249082daac8d51d6c006906a4504e132ed269119d65d96"}},{"ruleId":"D2","level":"warning","message":{"text":"parseFutureMarkdown.collectBlockReferences (cognitive 20): parseFutureMarkdown.collectBlockReferences has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 5, boolean chains 1 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/markdown/src/parseFutureMarkdown.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f746eb34f482ab58545e26775932ef6f47c616e71727671447844cce322ef9b"}},{"ruleId":"D2","level":"warning","message":{"text":"connectionState.classifyError (cognitive 20): connectionState.classifyError has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 7, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/src/connectionState.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a30ae5846e9aa8589e1172f3e5eba56e9c31fa50bccf73a287ebcc3cab2a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"format.classifyAgentError (cognitive 20): format.classifyAgentError has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16, 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":"packages/thread-projection/src/format.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c308a518859ce78b7e09d48f81b54112d02c7e318d719dca35edeee1b259b8"}},{"ruleId":"D2","level":"warning","message":{"text":"replyDuplicates.collapseReplyDuplicates (cognitive 20): replyDuplicates.collapseReplyDuplicates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (4 pts), boolean chains 3, ternaries 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":"packages/thread-projection/src/replyDuplicates.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e28938fbdfe8a9954f4985685c09cae693ab3c1ba22140ea8e7887a28639e3"}},{"ruleId":"D2","level":"warning","message":{"text":"EvidenceContext::select_evidence (cognitive 19): EvidenceContext::select_evidence has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 6, 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":"agent/src/approval_review/evidence.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1afa2e66c356df16f611df81436aab23e2015fcea3d9664bb4f418a61753659"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaFolder::push (cognitive 19): DeltaFolder::push has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 3 (nesting depth added 9). 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":"agent/src/rpc/run_snapshot.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"59386d29969a7c4e8b12409d9a2aff3cf5cd2925b4bc6c80f050c7694b6ebe17"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSession::on_scheduled_run_finished (cognitive 19): ServerSession::on_scheduled_run_finished has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (4 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":"agent/src/rpc/session.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0c82859233bcbf1f3a39554017bd8f89fc28f1cbd1c85b5681d0c70a7fc20c"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerSession::start_next_scheduled_at (cognitive 19): ServerSession::start_next_scheduled_at has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4fd9f143f90e04b9aad84af999a1c71953bf5959fd08ceaadd457ac4a53338"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::summary (cognitive 19): Snapshot::summary has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (19 pts) (nesting depth added 11). 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":"agent/src/session/content/reader_summary.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fa9be80b329ff7fda024426c38e35eaa54d02e0863e9e21cb4bf8540e3a06c"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager::read_history_entry (cognitive 19): Manager::read_history_entry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, 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":"agent/src/session/history/recall.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8a5f3ff31a1bfdc380c70857baddcc6af23f39ae3c9ce80e4ccb944cad3698"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::pin_reset_fields (cognitive 19): SqliteStore::pin_reset_fields has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 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":"agent/src/session/content/reset.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f523e7e14672eeb24edea6598e49e281c8662eeb60c1270015b325b07909cc"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::models::glob_match (cognitive 19): future_agent::models::glob_match 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":"agent/src/models/mod.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ab7359f1128b45bb7eee3ef285e3d7e0ddb50ccaff7da5bf2e0447b5297961"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::service::startup::initialize (cognitive 19): future_agent::service::startup::initialize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, boolean chains 5, 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":"agent/src/service/startup.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f4c5adf0d649d81af64ffd96f9e61b38f88e022731780a5a386e09a2289f8a"}},{"ruleId":"D2","level":"warning","message":{"text":"Signal::run (cognitive 19): Signal::run has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/signal.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68e57c32606b86a7bd41b3e5efd474f1657c9168798acba5a6b6152eebd9bbd"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::transport::text::chunk (cognitive 19): future_channel::transport::text::chunk 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":"channels/src/transport/text.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4bfefbb6f8cf587ffd78d78a9e56f8c3919346f07f75e647dd93b40d795b4c"}},{"ruleId":"D2","level":"warning","message":{"text":"EventStreamDecoder::feed (cognitive 19): EventStreamDecoder::feed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/mcp_http.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35324aeba8101c1e108af52135ab4af4e49b9fe7a560a1798e914f9c08c9a1e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_transcript::collect_paths_from_json (cognitive 19): future_cli::commands::session_transcript::collect_paths_from_json has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 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":"cli/src/commands/session_transcript.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e372ce2278f8a4552a1ca63c9442070e7ddca72e54583c4182315e6335f6c15"}},{"ruleId":"D2","level":"warning","message":{"text":"futureos::skills_bootstrap::drain_skill_events (cognitive 19): futureos::skills_bootstrap::drain_skill_events has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"desktop/src-tauri/src/skills_bootstrap.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9beec6efd1d361352ad047289eeaa5169e19be18abb781d160fe80200c32b0"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentClient::execute_command (cognitive 19): AgentClient::execute_command has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (19 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_client.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4050338888a9050f7bf085e4b82fbfaace012df9430351229003e642cabe30"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::application::threads::get_thread_agent_state (cognitive 19): future_host::application::threads::get_thread_agent_state has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 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":"host/src/application/threads.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ac12907adf2a59911724ab0546ee0279d05aa5a43dd2a2f2946578da636e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::fusion::panel (cognitive 19): future_host::fusion::panel has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 2 (5 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":"host/src/fusion.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf5bf0f47e2a10f7b0f6abac0768dfaa2fa00efa9e8578028838fc0bcd4ee1b"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::remote_host::files::prepare_preview (cognitive 19): future_host::remote_host::files::prepare_preview has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (16 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":"host/src/remote_host/files.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"945c2dbd2e907139b582bd1f429867c4d80338dd3385a9167fd6c46b3bdf9cc1"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::shadow_review::snapshot::capture (cognitive 19): future_host::shadow_review::snapshot::capture has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 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":"host/src/shadow_review/snapshot.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c855551dbb57c05afaad647def34ab6e8967729de4827ad42c8371293b25fa30"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::connect_attempt (cognitive 19): Client::connect_attempt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"16efe0addd71ec5a873f99a44933951a0ec7f788355453b8d14c4e5b850dd2fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor::start_slot (cognitive 19): Supervisor::start_slot has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 3 (4 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":"packages/remote-server/src/supervisor/start.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d17a39e9ea6bf90a2161220765d5a1755110614563218c3a42dd4ca1e87b41e"}},{"ruleId":"D2","level":"warning","message":{"text":"Supervisor::watch_generation (cognitive 19): Supervisor::watch_generation has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 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":"packages/remote-server/src/supervisor/start.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c210d5276b50cc5faee5d4ccf2d318ecd4ed66b7924627c894eaad5c658e4c"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownRenderer::render_list (cognitive 19): MarkdownRenderer::render_list has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/markdown.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd153dbacd6ded028729fd2b8b8f2dd87c06127794802f8683b86213069d156"}},{"ruleId":"D2","level":"warning","message":{"text":"Workbench::handle_git_key (cognitive 19): Workbench::handle_git_key has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 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":"tui/src/workbench/mod.rs"},"region":{"startLine":2949}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd85f1612d938790755aa7eb049882f4e2f6d0b6db4ea552fff873d81019012"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::components::chat_area::json_string_chunks (cognitive 19): future_tui::components::chat_area::json_string_chunks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (5 pts), match/switch 1 (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":"tui/src/components/chat_area.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feb1dc93ef5548e63048eac79b5599101836a013229e3a0b8554de189a96aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::components::diff::changed_file_paths (cognitive 19): future_tui::components::diff::changed_file_paths has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (3 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":"tui/src/components/diff.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2a3c08418774657df815a237f6c0e29bc73b648a850470f8318112ffc79774"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::utils::wrap_ascii_fast (cognitive 19): future_tui::utils::wrap_ascii_fast has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/utils.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d22375b1e33a7924794e46fe969a5c38c63959f9cf949b6636757563a6d683"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::screen::header (cognitive 19): future_tui::workbench::screen::header has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"tui/src/workbench/screen.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1e1925a2cb6651b22bcd1532e3e2240784c47f3a66f0e91b26a504419ecaa3"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::screen::preview_box (cognitive 19): future_tui::workbench::screen::preview_box has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 pts), 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":"tui/src/workbench/screen.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"0070a6269238b5a4fb31087e8ff737a4040c657aa6cb0ef64077ec62dd3af8f4"}},{"ruleId":"D2","level":"warning","message":{"text":"historyTransfer.read (cognitive 19): historyTransfer.read has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/integrations/storage/historyTransfer.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"17577ffa0cce1af502ae52e8d423e7ade4897d547592ce93ff889059f0d3044e"}},{"ruleId":"D2","level":"warning","message":{"text":"FutureEmbed.FutureEmbed (cognitive 19): FutureEmbed.FutureEmbed 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":"desktop/src/features/markdown/renderers/FutureEmbed.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71674e1c67abc34892bf6be15ead655105fe15a63dacfcd32d05ea09160072c"}},{"ruleId":"D2","level":"warning","message":{"text":"ShortcutsPage.ShortcutsPage (cognitive 19): ShortcutsPage.ShortcutsPage has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 10 (12 pts), if/else 5, boolean chains 2 (nesting depth added 2). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 8 function items inside it that branch (a function literal at line 171, a function literal at line 49, a function literal at line 69, \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":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba540e70bbad8450633c0ab5e6ca6bad11708fb6b3fb18aaf1e3fffd8cb0f50"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdatePage.UpdatePage::handleInstall (cognitive 19): UpdatePage.UpdatePage::handleInstall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 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: one other method here (UpdatePage.UpdatePage) 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":"desktop/src/features/settings/UpdatePage.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a7598581094f1156cfc7534bf627c97996d2964ea05e33b5f07196be4d59df"}},{"ruleId":"D2","level":"warning","message":{"text":"AttachmentChip.AttachmentChip (cognitive 19): AttachmentChip.AttachmentChip has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 6, boolean chains 4, error handling 1 (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 9 belong to 2 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":"desktop/src/features/agent/messages/AttachmentChip.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf066d87fb09cf4e375eb3f86a78178e1a3d216c76a10185c6c1e1aad16c688"}},{"ruleId":"D2","level":"warning","message":{"text":"useThreadCompaction.useThreadCompaction (cognitive 19): useThreadCompaction.useThreadCompaction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (nesting depth added 3). None of this is in the body itself: all 19 points belong to 3 function literals inside it that branch (lines 29, 53, 70). 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":"desktop/src/features/agent/runtime/useThreadCompaction.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6c314b03b7dd7cf35dcc90747f86e458519e8f06988b70d0db73e1b296187d"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteDraftTargetChooser.RemoteDraftTargetChooser (cognitive 19): RemoteDraftTargetChooser.RemoteDraftTargetChooser has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11 (17 pts), boolean chains 2 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 4 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":"desktop/src/features/remote-peer/RemoteDraftTargetChooser.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9c4cea53d1b2e34aef73e77d18f01f843f757d218b5bb307a8f00291ce00b9"}},{"ruleId":"D2","level":"warning","message":{"text":"storage.readRegistry (cognitive 19): storage.readRegistry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, error handling 1 (2 pts), ternaries 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":"mobile/src/remote/storage.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69305c411442ea6c359bbc03cce6d95c82bfb609cc8103bc2b37ae3f7e1bdda"}},{"ruleId":"D2","level":"warning","message":{"text":"video-judge.buildCorpus (cognitive 19): video-judge.buildCorpus has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (5 pts), loops 2, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). Most of this is not in the body itself: 5 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (walk, walk::collect). 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":"harness/scripts/video-judge.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9e2a4bf6e0a01492e29f96335fdf307d90075470057c3c450c0cef6def6706"}},{"ruleId":"D2","level":"warning","message":{"text":"useOlderHistory.useOlderHistory.loadOlderTimeline (cognitive 19): useOlderHistory.useOlderHistory.loadOlderTimeline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, error handling 2 (nesting depth added 2). Of this number, 18 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"mobile/src/remote/timeline/useOlderHistory.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"09930376d300dc62fe98f27de00528613ac55abebef687c1a0d581ad5aac78f4"}},{"ruleId":"D2","level":"warning","message":{"text":"PairingScreen.pairingErrorMessage (cognitive 19): PairingScreen.pairingErrorMessage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae25fa890ee4cf5884f70eafdd78602fd323b7a7040fc9a031c2575ab4054cb"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionTree.groupMergedRows (cognitive 19): sessionTree.groupMergedRows has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 6). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 191). 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9bea5f247140ae70b409c744230ca2f254320c42b73018fc935a5fc8bb80e7"}},{"ruleId":"D2","level":"warning","message":{"text":"CustomProviderPage.CustomProviderPage::detectThinkingLevels (cognitive 19): CustomProviderPage.CustomProviderPage::detectThinkingLevels has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 2 (3 pts), loops 1, ternaries 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. This shape REPEATS in the file: one other method here (CustomProviderPage.CustomProviderPage::validate) 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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"461be38f9405ac6cc0d6a6567cc047a9b5311c9a0523fdf649a52dd37535396f"}},{"ruleId":"D2","level":"warning","message":{"text":"remarkMathFence.tokenizeMathFence (cognitive 19): remarkMathFence.tokenizeMathFence has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14, boolean chains 4, ternaries 1. Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 7 function items inside it that branch (contentStart, beforeContent, content, \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":"packages/markdown/src/remarkMathFence.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af339956558cca765c904a973f2cddae24ab5d29d1c9574b68f2895884098cc"}},{"ruleId":"D2","level":"warning","message":{"text":"readPages.requestReadPage (cognitive 19): readPages.requestReadPage has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 5). Most of this is not in the body itself: 6 of the 19 points are its own statements and the rest belongs to 2 function items inside it that branch (storeChunk, a function literal at line 83). 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":"packages/remote-client/src/readPages.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c3704be8f4ad09870211fd11e5fcfd4bd3168d0890d45910dde713119d0d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenAiResponsesAdapter::build_body (cognitive 18): OpenAiResponsesAdapter::build_body has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"508fe2d0aed137ada2816ad2915840e189b618bcf10af0142fa3756e608ae1cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Manager::claim_compaction (cognitive 18): Manager::claim_compaction has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (18 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/compaction_ops.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ecf31eb17c5be8bbd008095fb02d9ed59045675a1ae612a979390bdb8ccf67"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::segmented_replay (cognitive 18): SqliteStore::segmented_replay has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 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":"agent/src/session/content/journal.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a1ab794283f849b4906e48d56a93a05b4bfa0f19f1585a9c8b3aba11481b35"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillManager::sync_inner (cognitive 18): SkillManager::sync_inner has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 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":"agent/src/skills/manager.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0365522fa185954db09706b0c2f604461db1dbed8a68b1d4b5f490bcdb19507"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::approval_review::policy::decide (cognitive 18): future_agent::approval_review::policy::decide has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (3 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":"agent/src/approval_review/policy.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2b0de371be5ddb6ba61e33afaae9def33836a09e417eaa9b20f46c7b6098da"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::config::providers::upsert_provider_files (cognitive 18): future_agent::config::providers::upsert_provider_files has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (17 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":"agent/src/config/providers.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"720670d5899474130c465b3d655859e041c7647b97f792ab23ae999ce4f9c27e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::fusion::invoke (cognitive 18): future_agent::fusion::invoke has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/fusion.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35424c276ab9e73b0005a2f35075b950d6b718d908ad1bf61fa94164ef6b313"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::get_state_internal (cognitive 18): future_agent::rpc::get_state_internal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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":"agent/src/rpc/mod.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54b106a8c93e600f250046a6455c7bbe7a78726105177fd71fef7f528b2fb74"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::commands::session_title::first_exchanges (cognitive 18): future_agent::rpc::commands::session_title::first_exchanges has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/session_title.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"858ebe390705ddee872d7c40c6d0c2cbf963c3cab307beda41b637f32f449588"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::rpc::prompt_helpers::build_user_message_with_model_context (cognitive 18): future_agent::rpc::prompt_helpers::build_user_message_with_model_context has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 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":"agent/src/rpc/prompt_helpers.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbae877e35e5d6f8426c9b4f2ecc490c880ad5accc6a28523a65eea86f6d872"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::skills::extract_metadata_version (cognitive 18): future_agent::skills::extract_metadata_version has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 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":"agent/src/skills/mod.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"8119300f0f9db89ca4c0b1cf323e9b304ec6a119e0779b9d309200a9fe12d116"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::tools::is_protected_rm_target (cognitive 18): future_agent::tools::is_protected_rm_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 4, match/switch 1 (2 pts), 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":"agent/src/tools/mod.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"230013c75e3026d64a9e4f83abc0c05b9b100fa82ccb51f52ad780d3552139fc"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::feishu::feishu_ws::extract_text_content (cognitive 18): future_channel::feishu::feishu_ws::extract_text_content has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (8 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":"channels/src/feishu/feishu_ws.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d0c87884d020ec57c80bf66066a93c73fe606091a3c24812129e588a6e6cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"future_channel::providers::linq::parts_of (cognitive 18): future_channel::providers::linq::parts_of has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/linq.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe386b59d14731311bb3a1bd0670149485813cbabd919378effef25d9a030ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"ChromiumSession::press (cognitive 18): ChromiumSession::press has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/browser/chromium/chromium_session.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"59e7b3cdd365c18d6ca39b523d0f3baf8c0a215e75263ad8541ffabdeab3e353"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::configure::collect_model (cognitive 18): future_cli::commands::configure::collect_model has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/configure.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4a92bf1951bbb6af0afa905f38b1a23509624aca7ceab6f87369122f3483b4"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::remote::remove_all (cognitive 18): future_cli::commands::remote::remove_all has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (5 pts), match/switch 1 (3 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":"cli/src/commands/remote.rs"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b82e316b17652ce5c655af4214e030f7f06ea0472ef359bbd156d58094f02d69"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_wait::parse (cognitive 18): future_cli::commands::session_wait::parse has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 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":"cli/src/commands/session_wait.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efb2b78d67407009e56d94ed00cde60ff8b5249d9e76f84029668ef942bf754"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::tools::tools_describe (cognitive 18): future_cli::commands::tools::tools_describe has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (5 pts), boolean chains 1, 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":"cli/src/commands/tools.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"656f588661ff7118e727bb6e44fc5fe98cbf24c479af76dd91d1cb44b296b107"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::utils::platform::get_platform_url (cognitive 18): future_cli::utils::platform::get_platform_url has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (18 pts) (nesting depth added 11). 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":"cli/src/utils/platform.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"f301dd59578d2f53a6b15c5892904d2b5355b8a7f0171df86138c4c769c9d303"}},{"ruleId":"D2","level":"warning","message":{"text":"Tracker::arm (cognitive 18): Tracker::arm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/startup.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8dc380093580c00d3208bedcf99aab8148727f033c04368d219400eb40e47c"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::request_scope::stop_owned_runs (cognitive 18): future_host::request_scope::stop_owned_runs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/request_scope.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68cfdc06fc64bc7e8a28afd0249d12da1001eefdedff30ccc3104ab3e63af0e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::store::legacy_history::preserve_legacy_history (cognitive 18): future_host::store::legacy_history::preserve_legacy_history has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (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":"host/src/store/legacy_history.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddad7fbd366a706c17cd5c06c2bbc23e0df75dd22c879ae824381599bb39ca53"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::store::reconcile::reconcile_orphan_sessions (cognitive 18): future_host::store::reconcile::reconcile_orphan_sessions has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (7 pts), if/else 3 (6 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":"host/src/store/reconcile.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d1fa634048fd4cdd8bb5c11a38884ed340331cfbae138cbf1d7577149ca495"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatArea::fold_reply_segment (cognitive 18): ChatArea::fold_reply_segment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 6, loops 2, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/chat_area.rs"},"region":{"startLine":2429}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1cd6091b563a7417eefb886c89c81065e003640289761637bbe4ed01be1885"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatArea::layout (cognitive 18): ChatArea::layout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 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":"tui/src/components/chat_area.rs"},"region":{"startLine":2568}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdec555f00edad7db15c75a2b70bc46e1110cc17b06747b41400812332211907"}},{"ruleId":"D2","level":"warning","message":{"text":"Input::build_visual_layout (cognitive 18): Input::build_visual_layout has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (6 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":"tui/src/components/input.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac13a3b66aeb765469fe4a9707887190af051999498c311423128532ceb0370"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownRenderer::render_list_item (cognitive 18): MarkdownRenderer::render_list_item has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/markdown.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfa2f3217de3a7b5dd9ec327d5b4d3e8f2763b38896b6867e7027ccd9465746"}},{"ruleId":"D2","level":"warning","message":{"text":"Live::flush_submit (cognitive 18): Live::flush_submit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/live.rs"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73200963776400cae73819a68a2ceccec94e58e20587724578a3f0dc2c83305"}},{"ruleId":"D2","level":"warning","message":{"text":"Workbench::submit_draft (cognitive 18): Workbench::submit_draft has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 1 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/mod.rs"},"region":{"startLine":4299}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bf435158ea79833486ce8cd8849ca8b822d9aef86d6fecb3e6498a417cbd99"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::stdin_buffer::extract_complete_sequences (cognitive 18): future_tui::stdin_buffer::extract_complete_sequences has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/stdin_buffer.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"441585afd4567e41ec1fbc4ee70bef757f7bd38b5b2885d38f2692e77d68ebb6"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::panels::session_rows (cognitive 18): future_tui::workbench::panels::session_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 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":"tui/src/workbench/panels.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"612b49670daa7c4f50f61112be86eaddea321be650e761f53d23661d2bc40ad1"}},{"ruleId":"D2","level":"warning","message":{"text":"generate.generate (cognitive 18): generate.generate has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 3 (6 pts), ternaries 1 (2 pts), boolean chains 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":"packages/remote-protocol/scripts/generate.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1ce4bbcb823dc101a3a5591bf01c8344a15483895ea2d8299830286b7351ab"}},{"ruleId":"D2","level":"warning","message":{"text":"GeneralPage.GeneralPage (cognitive 18): GeneralPage.GeneralPage has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 10 (13 pts), boolean chains 5 (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: 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":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"7477baf47e5cac0bb35ed3439f5977bd565a25949fbfa54bee6be1ffbbc042e1"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltinProviderKeyDialog.BuiltinProviderKeyDialog (cognitive 18): BuiltinProviderKeyDialog.BuiltinProviderKeyDialog has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 7, boolean chains 1, error handling 1 (nesting depth added 3). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (save, a function literal at line 40, run). 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":"desktop/src/features/settings/BuiltinProviderKeyDialog.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1cbf64bdf556a8111788c07e2f3bac88c51d5d4d642273f8b29fd9d7bee05a"}},{"ruleId":"D2","level":"warning","message":{"text":"ResetPage.ResetPage (cognitive 18): ResetPage.ResetPage has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 8 (13 pts), boolean chains 3, error handling 2 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 4 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":"desktop/src/features/settings/ResetPage.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"05028a26b17ddf4edd32ee5291f97e5536f2e6b3a87b38f46f646140beb6af4e"}},{"ruleId":"D2","level":"warning","message":{"text":"ShortcutRecorder.ShortcutRecorder (cognitive 18): ShortcutRecorder.ShortcutRecorder has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 7 (8 pts), if/else 7, boolean chains 3 (nesting depth added 1). Of this number, 9 points are the body\u0027s own statements and 9 belong to 4 function literals 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":"desktop/src/features/settings/ShortcutRecorder.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e98f7ddc07b02218b983dc927423f95e0c93dd6944a8de17f167895977f260"}},{"ruleId":"D2","level":"warning","message":{"text":"threadSearchRanges.findThreadTextRanges (cognitive 18): threadSearchRanges.findThreadTextRanges has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 6, if/else 4 (6 pts), loops 4 (6 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":"desktop/src/features/agent/threadSearchRanges.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"272f7ee6cf8923833d86c62b9195f917599ff1ceeb3f7e7040c9f7e7cdf1422a"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteConversationRow.RemoteConversationRow (cognitive 18): RemoteConversationRow.RemoteConversationRow has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 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":"desktop/src/components/layout/RemoteConversationRow.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"033f61ac273110dbfb3acd2402b890464804fd61caece5f9071f57de0f4bb939"}},{"ruleId":"D2","level":"warning","message":{"text":"useTerminalPanel.loadPrefs (cognitive 18): useTerminalPanel.loadPrefs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 4 (5 pts), boolean chains 4, loops 1 (2 pts), error handling 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":"desktop/src/features/terminal/useTerminalPanel.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2121084658e3675ac624b99a4b9b4f8ec6dbd6d4fbee2ec4685ab1f36ce942f7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.onSessionsUpdate (cognitive 18): index.html.onSessionsUpdate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 4 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 2 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":"host/web/index.html"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c15f15a3047dcf1d265416db61e01e965a339ad1483ec492af451a5517d25d8"}},{"ruleId":"D2","level":"warning","message":{"text":"usePromptOutbox.usePromptOutbox.recoverPendingContinuation (cognitive 18): usePromptOutbox.usePromptOutbox.recoverPendingContinuation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, error handling 1 (nesting depth added 4). 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 665). 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50c04e6410ccab03d891b0691ad2032dcf9dc287a33bb9df7ee7ba2a98f8d47"}},{"ruleId":"D2","level":"warning","message":{"text":"useDesktopRuntime.useDesktopRuntime (cognitive 18): useDesktopRuntime.useDesktopRuntime has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, boolean chains 7, ternaries 1. Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 226, 422, 145, \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":"mobile/src/remote/useDesktopRuntime.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8032b3baf6f8a3ad57299892382206f51b578c7c5b785f9460f433c1555024"}},{"ruleId":"D2","level":"warning","message":{"text":"RenameModal.RenameModal (cognitive 18): RenameModal.RenameModal has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 3 (4 pts), error handling 1 (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 3 function items inside it that branch (generate, save, generate::current). 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":"mobile/src/features/chat/components/RenameModal.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba9aea4f77d7c88e8487d9290ca7b8e7ea6324307d297027354ae032beb7ccf"}},{"ruleId":"D2","level":"warning","message":{"text":"leanRender.leanTargetForToolCall (cognitive 18): leanRender.leanTargetForToolCall has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), error handling 1 (2 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":"mobile/shot/mock/leanRender.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d757e7d252710b61b01adb8397a4e3cc9e369032692d5558e2d0cc42ac8828fb"}},{"ruleId":"D2","level":"warning","message":{"text":"index.numberEnd (cognitive 18): index.numberEnd has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7, loops 3 (6 pts), boolean chains 4, 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":"packages/json-preview/src/index.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1831e475c3ae88a9b5575df370d045fe802b1f304c0f7a2d05e573a7764c47"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.subscribeLiveness (cognitive 18): RemoteClient.subscribeLiveness has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, error handling 1 (nesting depth added 5). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 1162). 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96c20e32f7ebd1b329092eb384986bb0ace1a615e5e219b1c5daf2cfc35149c"}},{"ruleId":"D2","level":"warning","message":{"text":"projection.foldAssistantEntry (cognitive 18): projection.foldAssistantEntry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), ternaries 2 (6 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":"packages/thread-projection/src/projection.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2d21e1a74aca8a6f5438af7240774502d67f142f105511e0d16676aa5d1f5a"}},{"ruleId":"D2","level":"warning","message":{"text":"installEventHandlers (cognitive 18): installEventHandlers has cognitive complexity 18 (threshold 15). Drivers by points: other 10, if/else 6, boolean chains 1, error handling 1. None of this is in the body itself: all 18 points belong to 10 function literals inside it that branch (lines 298, 310, 334, \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":"harness/lib/cdp.mjs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c75adcdc6d0435185c928164767a5328a17929c22df1af478ed20b7b1840b3b"}},{"ruleId":"D2","level":"warning","message":{"text":"EvidenceContext::from_history (cognitive 17): EvidenceContext::from_history has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (6 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":"agent/src/approval_review/evidence.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4624938aac26ccf97d486dd0a49d0d82b577739658ea0c51f558bb2bdfbedd"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::search (cognitive 17): Snapshot::search has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 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":"agent/src/session/content/reader_recall.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adeda1837e07da3abc2399c00b49df7e983bcdfda33b381f04ba78bbb6318c6"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::pricing_event_payloads (cognitive 17): SqliteStore::pricing_event_payloads has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (8 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":"agent/src/session/sqlite_store/events.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a90a3031fc00442541ebfa9f1649128c5d14e03046134a7b69b75486b5abb8"}},{"ruleId":"D2","level":"warning","message":{"text":"Text::parse_target (cognitive 17): Text::parse_target has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 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":"agent/src/session/title_preview.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e058b8d7c9b671d89838ab73eb21f7e46606d2e8e35269ad4f9184b1022d7db"}},{"ruleId":"D2","level":"warning","message":{"text":"SkillManager::recover (cognitive 17): SkillManager::recover has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/skills/manager.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f07e7a32a98706eb30de198823181b7d5b6894bdb20a0926d240a17193db962"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentMessage::new_user (cognitive 17): AgentMessage::new_user has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 3 (6 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/types/mod.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab594a7139c2e99297308256a8f6ae5b6c58c24ca8bf65ae6fa4141d5500d2a"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::llm::schema::normalize_thinking_levels (cognitive 17): future_agent::llm::schema::normalize_thinking_levels has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 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":"agent/src/llm/schema.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d248fd3d1508df744bcf5f1542d1c4a468942e14500a5ba49a848875b86852"}},{"ruleId":"D2","level":"warning","message":{"text":"Irc::session (cognitive 17): Irc::session has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (6 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":"channels/src/providers/irc.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2131ea4ab8ddda90b9bd2ea68891fb7c60bfde4e46751cfce51b85a49477ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"Counts::tally (cognitive 17): Counts::tally has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"cli/src/commands/session_transcript.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d14658c6b67c95927e670f79483df25e8089f5c7e4922d4502fe1462918a2e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::tools::translate_error (cognitive 17): future_cli::commands::tools::translate_error has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"cli/src/commands/tools.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb2121809e2d677cbae67ffcbca91f34c2dd5f291a10b73a43c89caf87443a4"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::reconciliation::reconcile_active_run_once (cognitive 17): future_host::agent_bridge::reconciliation::reconcile_active_run_once has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 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":"host/src/agent_bridge/reconciliation.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0093bfa5a8d45b0cbb81fb0807cb5f9abcca5e925fa98bac1dc472d6a97d920"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::reconciliation::active_run_watchdog_pass (cognitive 17): future_host::agent_bridge::reconciliation::active_run_watchdog_pass has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/reconciliation.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"858ead95e716cbe98f05a61c889d07127629a8e50f0c7df9bac1e1f010173450"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::store::migrations::validate_core (cognitive 17): future_host::store::migrations::validate_core has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 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":"host/src/store/migrations.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"49261581b8862f157478d7fb4338b9677f6ce9f9891e8167c4e09193838a9422"}},{"ruleId":"D2","level":"warning","message":{"text":"future_remote_server::wire_limits::truncate_message_content (cognitive 17): future_remote_server::wire_limits::truncate_message_content has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/wire_limits.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"941f33837549017ac3f40e8f38a690292976eda5403d91e0adc811c659b2dd96"}},{"ruleId":"D2","level":"warning","message":{"text":"TuiSettings::to_json (cognitive 17): TuiSettings::to_json has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16 (17 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":"tui/src/settings.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a6cef2b9107affaa76ca815658311398225b5d8502c91560300b06ddf619f0"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::stdin_buffer::is_complete_sequence (cognitive 17): future_tui::stdin_buffer::is_complete_sequence has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (17 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":"tui/src/stdin_buffer.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b689b9b668d185e4b0becfe0c497d9e3e0d10aa663f64bb2b83806bbb9605596"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::terminal_image::encode_sixel_rgb (cognitive 17): future_tui::terminal_image::encode_sixel_rgb has cognitive complexity 17 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/terminal_image.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14a7aa4d83120282a1662bb05196a521232c0bafe15a3982dac69401f3c408e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::links::highlight (cognitive 17): future_tui::workbench::links::highlight has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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":"tui/src/workbench/links.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3b10864363d5c538782801703e6c86b8aa32d55e599dbcd55c81db9a9e8dec"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::run::key_events (cognitive 17): future_tui::workbench::run::key_events has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/run.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce25bcc3a9baeaafae5c153e03a13236a62b824bade4e48086a3fa189d78e713"}},{"ruleId":"D2","level":"warning","message":{"text":"FileHandlerModule.scanAlbumDirectories (cognitive 17): FileHandlerModule.scanAlbumDirectories has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/modules/future-file-handler/android/src/main/java/cn/future_os/filehandler/FileHandlerModule.kt"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"237e592e7851dd0952badb63e9fae3cd37cc6dc232506904bc44f82550051584"}},{"ruleId":"D2","level":"warning","message":{"text":"ChoiceCard.ChoiceOptionRow (cognitive 17): ChoiceCard.ChoiceOptionRow has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 14 (15 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/markdown/renderers/ChoiceCard.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ef7d1978f27775f16b1cf5efda12c086032f01f1b5c55e56ccc0264c78c491"}},{"ruleId":"D2","level":"warning","message":{"text":"useStreamingMarkdownBlocks.appendSuffixToNode (cognitive 17): useStreamingMarkdownBlocks.appendSuffixToNode 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":"desktop/src/features/markdown/useStreamingMarkdownBlocks.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4aabf209df640ef675b253ae10d24dc6e9a4bee19705905fe566249d5516ba"}},{"ruleId":"D2","level":"warning","message":{"text":"useStreamingMarkdownBlocks.useStreamingMarkdownBlocks (cognitive 17): useStreamingMarkdownBlocks.useStreamingMarkdownBlocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 3, error handling 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 3). None of this is in the body itself: all 17 points belong to 7 function literals inside it that branch (lines 157, 141, 174, \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":"desktop/src/features/markdown/useStreamingMarkdownBlocks.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6906f8acf839849995adebae77721a3f49e16bf747f6d6f88aec8d7dc8cc2922"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectMenu.SelectMenu (cognitive 17): SelectMenu.SelectMenu has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, ternaries 6 (7 pts), if/else 3 (nesting depth added 1). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 54, 51, 68). 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":"desktop/src/components/ui/SelectMenu.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a798588a05a3e18d4a2420a8fa4913920166d9c1e0e6f6755a5ee115b05de0cd"}},{"ruleId":"D2","level":"warning","message":{"text":"remotePeerClient.promptRemoteConversation (cognitive 17): remotePeerClient.promptRemoteConversation has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 6, if/else 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec077d9c55a0e8c8ff515b4ff8b9c3487eb606800c757ce8b2c49b3fd294920"}},{"ruleId":"D2","level":"warning","message":{"text":"remotePeerClient.hostWorkspaceRows (cognitive 17): remotePeerClient.hostWorkspaceRows has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (10 pts), boolean chains 4, if/else 3 (nesting depth added 2). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 1297). 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"f779f774dee9e795dfcee9a54b911a8f22414e88b997ad440765c9fcc7bbd188"}},{"ruleId":"D2","level":"warning","message":{"text":"EnvironmentPage.EnvironmentPage (cognitive 17): EnvironmentPage.EnvironmentPage has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 8 (10 pts), boolean chains 5, error handling 1, if/else 1 (nesting depth added 2). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. 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":"desktop/src/features/settings/EnvironmentPage.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c4990fb19ece96e08a30ad39e778bf3568a20c7321543331e6f6cb0b56a120"}},{"ruleId":"D2","level":"warning","message":{"text":"ModelsPage.ModelsPage (cognitive 17): ModelsPage.ModelsPage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 6, boolean chains 2, loops 1 (nesting depth added 2). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 5 function items inside it that branch (a function literal at line 37, setProviderVisibility, modelSubtitle, \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":"desktop/src/features/settings/ModelsPage.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d2cb203ca09407075ebb517e5c664b151595f5c86b7ac856bc82df373ddc94"}},{"ruleId":"D2","level":"warning","message":{"text":"useContextData.useContextData.refreshContext (cognitive 17): useContextData.useContextData.refreshContext has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, error handling 2 (3 pts), ternaries 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":"desktop/src/components/layout/hooks/useContextData.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26b3e1f83654278d135f2e26f1f225b1e9bc20403dfbc016f0acaaacf773eed"}},{"ruleId":"D2","level":"warning","message":{"text":"RunsPanel.RunsPanel (cognitive 17): RunsPanel.RunsPanel has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, ternaries 4 (5 pts), boolean chains 4, error handling 2 (nesting depth added 1). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 4 function items inside it that branch (archiveFinished, a function literal at line 87, a function literal at line 95, \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":"desktop/src/features/runs/RunsPanel.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbc136b0b83fb6d1018f9d72ece433630efd7653eab4d72bf59374359c36294"}},{"ruleId":"D2","level":"warning","message":{"text":"useComposerAttachments.useComposerAttachments.attachPastedFiles (cognitive 17): useComposerAttachments.useComposerAttachments.attachPastedFiles has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), error handling 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/composer/useComposerAttachments.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ddb78c78c45dc0e316264d12b6fb79a818007baecdef3394691e42c349dc20"}},{"ruleId":"D2","level":"warning","message":{"text":"liveRunProjection.upsertStreamingPreview (cognitive 17): liveRunProjection.upsertStreamingPreview has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (4 pts), boolean chains 2, error handling 1 (nesting depth added 5). Of this number, 11 points are the body\u0027s own statements and 6 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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47046009bddfb08602ec4d4ea353fa4294e7e0f4af8d5ffcb6e824c5209713c"}},{"ruleId":"D2","level":"warning","message":{"text":"vibeCells.vibeCellsOf (cognitive 17): vibeCells.vibeCellsOf 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":"desktop/src/features/vibe/vibeCells.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e955172ae1f8ffc367403c3606cda720ee4b3ec20ed3c1cd0e10d028a0b1f4c5"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatch.dispatchShortcut (cognitive 17): dispatch.dispatchShortcut has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, 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":"desktop/src/features/keyboard/dispatch.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c468b799a54c755cf2a9b5ac1d23dd4ffc3b24eaa08f03ebdafa7bc1f9029122"}},{"ruleId":"D2","level":"warning","message":{"text":"useRemoteDoneBell.useRemoteDoneBell (cognitive 17): useRemoteDoneBell.useRemoteDoneBell has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 6, ternaries 3. None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 40, 31). 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":"desktop/src/components/layout/hooks/useRemoteDoneBell.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"9202f6e28e0149dacad7eda8d8c3ef2654cf661d99d2bd07b769117db4f020a3"}},{"ruleId":"D2","level":"warning","message":{"text":"errorPresentation.remoteErrorPresentation (cognitive 17): errorPresentation.remoteErrorPresentation 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":"mobile/src/remote/errorPresentation.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"134155bcf5bd26c5b14ea524d026cf3d93e8e037a8222b958668026523b1e9d0"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplyBlocks.buildReplyBlocks (cognitive 17): ReplyBlocks.buildReplyBlocks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), boolean chains 3, ternaries 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":"mobile/src/features/chat/messages/ReplyBlocks.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"56df1470f6b4ad624755e735c1c11b33bbe0c287a562ea08dad9fbb9468ea1eb"}},{"ruleId":"D2","level":"warning","message":{"text":"usePromptOutbox.usePromptOutbox.recoverPendingPrompt (cognitive 17): usePromptOutbox.usePromptOutbox.recoverPendingPrompt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, error handling 1 (nesting depth added 4). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 531, assertCurrentPairing). 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b4547eb9b2bcd692f445bafb98c0ba6c521cb8fb655b18b371a156e1775252"}},{"ruleId":"D2","level":"warning","message":{"text":"AlbumPickerModal.AlbumPickerModal (cognitive 17): AlbumPickerModal.AlbumPickerModal has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (13 pts), boolean chains 4 (nesting depth added 6). Of this number, 10 points are the body\u0027s own statements and 7 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":"mobile/src/features/chat/components/AlbumPickerModal.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b66bdf8b0ef7c1a90703c87a51a9fd03a48148a9e6a2588725639428e6074f"}},{"ruleId":"D2","level":"warning","message":{"text":"useAttachmentPicker.useAttachmentPicker.chooseFromAlbum (cognitive 17): useAttachmentPicker.useAttachmentPicker.chooseFromAlbum has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, error handling 2, ternaries 1 (2 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":"mobile/src/features/chat/useAttachmentPicker.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7550cb3d1b871cc1d889ada70083ed7e0353bf234e68ab1a3a2b98089fca05"}},{"ruleId":"D2","level":"warning","message":{"text":"useMarkdownImageLoader.useMarkdownImageLoader (cognitive 17): useMarkdownImageLoader.useMarkdownImageLoader has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, error handling 1 (nesting depth added 3). None of this is in the body itself: all 17 points belong to 4 function literals inside it that branch (lines 45, 46, 79, \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":"mobile/src/features/chat/useMarkdownImageLoader.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a683032c7e5eccc87820db422cfaf3ad900f62e14808cc7374bdf2d56ac3a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"sessionTree.pageArchivedRows (cognitive 17): sessionTree.pageArchivedRows has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 3, loops 2 (3 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bd4454b1859cef5ccafc88d4139f1908dad724d7c03910d7a9a5f765b9026b"}},{"ruleId":"D2","level":"warning","message":{"text":"index.graphGeometry (cognitive 17): index.graphGeometry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, ternaries 2, boolean chains 1 (nesting depth added 5). None of this is in the body itself: all 17 points belong to 2 function literals inside it that branch (lines 97, 89). 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":"packages/git-graph/src/index.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"592c80437e5484fc99874a2fa80dd9705ff6225f6773a361c3b0e9e720c9b6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.tokenizeJsonLine (cognitive 17): index.tokenizeJsonLine has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (10 pts), if/else 3 (5 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":"packages/json-preview/src/index.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba0bd4185da27a2e1c0c01e283e0efb7df8234d6e5a1bb4f302e4e988c03b7a"}},{"ruleId":"D2","level":"warning","message":{"text":"projection.turnFromAcc (cognitive 17): projection.turnFromAcc has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (8 pts), boolean chains 5, if/else 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/thread-projection/src/projection.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b252999c4980e35e7bb24b5997f2a0a5c160b87287f529bdd773252361f8491"}},{"ruleId":"D2","level":"warning","message":{"text":"navigate (cognitive 17): navigate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 2 (6 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":"harness/lib/cdp.mjs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13e76479e0d76a5cd43922ed4ae6d279d9bfca33eb04aa2acbca24d0abc1e5b"}},{"ruleId":"D2","level":"warning","message":{"text":"groupFindings (cognitive 17): groupFindings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), other 4, boolean chains 2, loops 1 (nesting depth added 6). Of this number, 10 points are the body\u0027s own statements and 7 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":"harness/lib/issues-en.mjs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b0895eb6b88a60fafe97c6be4e5e9af08b052298f86dc5168c67654eff0c9e"}},{"ruleId":"D2","level":"warning","message":{"text":"SseBroadcaster::uncaptured_run_snapshot (cognitive 16): SseBroadcaster::uncaptured_run_snapshot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (16 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":"agent/src/rpc/broadcaster/replay.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"896cbb06f150bf7027972cf5264ef78b46c5f4245c02335754a1d02ef73b7fc7"}},{"ruleId":"D2","level":"warning","message":{"text":"Snapshot::column (cognitive 16): Snapshot::column has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/reader.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b07db2f89c273107e75408030b9efc6d7862ec650a14bb6cf41e145d470805"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteStore::cleanup_operation_cancellable (cognitive 16): SqliteStore::cleanup_operation_cancellable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/reset.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce477677e16803e1105ad326ad83a5dcd6143a22a74e066edf097c10b4f4704"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::llm::adapters::openai_chat::apply_reasoning (cognitive 16): future_agent::llm::adapters::openai_chat::apply_reasoning has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/adapters/openai_chat.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cffb1875da6a67f9714163bf46ace277b121ded481049fa92ce8d18323dab1"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::prompt::build_prompt (cognitive 16): future_agent::prompt::build_prompt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (15 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":"agent/src/prompt/mod.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e886fd5bf69d80cc053f5658ad1ff3fc113e5a9a52ab87cf19a3c8655b0caa"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::content::entries::fields (cognitive 16): future_agent::session::content::entries::fields has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/entries.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"332246e379f32a6e712e55441cf3f486174bc7dd96151a20930057a11d97a178"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::session::journal_reclaim::compress_block_bodies (cognitive 16): future_agent::session::journal_reclaim::compress_block_bodies 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":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"c250a0a9d529bdf49c2f978fd98b3384f62dc0e4d2cd80573e5f437b14f3a7ff"}},{"ruleId":"D2","level":"warning","message":{"text":"future_agent::tools::run_edit (cognitive 16): future_agent::tools::run_edit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts) (nesting depth added 5). Of this number, 14 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":"agent/src/tools/mod.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00eecfabed2f4197c57f0ab5ce7b00dc14d26ccb0fc9da48a180db025b4c04e"}},{"ruleId":"D2","level":"warning","message":{"text":"DingtalkBridge::handle_event (cognitive 16): DingtalkBridge::handle_event has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2, 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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"89734da696a87ffba9eb8dd06ec0e17ba4834655b5ee000e7c4738a6925bfb2f"}},{"ruleId":"D2","level":"warning","message":{"text":"Bridge::handle_card_action (cognitive 16): Bridge::handle_card_action has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 3 (4 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":"channels/src/feishu/bridge.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"38281e1efdef32abf12838533b79c13a7bf305baf8e86434cbd5696cd0a5c746"}},{"ruleId":"D2","level":"warning","message":{"text":"DiscordSender::request (cognitive 16): DiscordSender::request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/discord.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"23601e993d7720b1717d330ec46b60f632e5bb1574ba515631e5e2a7be8bf657"}},{"ruleId":"D2","level":"warning","message":{"text":"ChromiumPageManager::initialize (cognitive 16): ChromiumPageManager::initialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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":"cli/src/browser/chromium/chromium_page.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9982601b98b9f040ffa51431bc19ccad7f1e892fcbbf6023ff827b1a91d9809"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::browser_tools::browser_snapshot (cognitive 16): future_cli::commands::browser_tools::browser_snapshot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/browser_tools.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd61867bc70426a97d69ccd576bd58fe0c5f6f8838092336cd1a10b4a4bfd96b"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::session_compact::parse (cognitive 16): future_cli::commands::session_compact::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session_compact.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8506ba8cba5ba02eb0827a674dfd05cba9a3d8aff8c33efcb256bc87b31ccce8"}},{"ruleId":"D2","level":"warning","message":{"text":"future_cli::commands::tools::parse_cmd_value (cognitive 16): future_cli::commands::tools::parse_cmd_value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 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":"cli/src/commands/tools.rs"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"94bbb2a6c28bd6bfcee77cc947bc8c4fd70a18f3bbbcd3923a7fdf1e327a2be3"}},{"ruleId":"D2","level":"warning","message":{"text":"futureos::commands::update_journal::confirm_startup (cognitive 16): futureos::commands::update_journal::confirm_startup has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, 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":"desktop/src-tauri/src/commands/update_journal.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fb6672262e688a364968a6d54c00de73570d3461e5856ec13b24e30df518cf"}},{"ruleId":"D2","level":"warning","message":{"text":"futureos::gui::gui_builder (cognitive 16): futureos::gui::gui_builder has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 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":"desktop/src-tauri/src/lib.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a31826d8794b51f56ccccf609db44a1f7319da9415013cc69c494ef5f1f0739"}},{"ruleId":"D2","level":"warning","message":{"text":"futureos::linux_power::listen (cognitive 16): futureos::linux_power::listen has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src-tauri/src/linux_power.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"75730dbfb740ca83627b4aa3b38b8a55611f15081a9d6fea32c5f4a272b0671a"}},{"ruleId":"D2","level":"warning","message":{"text":"Budget::fit_material (cognitive 16): Budget::fit_material has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 4 (7 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":"host/src/fusion/budget.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3723a4622d861cea6711c50866b71c8b25b4f3fff81580ce1150a1bf4b757d9e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::agent_bridge::run_control::wait_for_agent_idle_with_wait (cognitive 16): future_host::agent_bridge::run_control::wait_for_agent_idle_with_wait 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":"host/src/agent_bridge/run_control.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"061a879e8fdf03c58cdb0f755621a672fbab632a16a38c414f1f64b3c0fd95a3"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::cli_tool::probe (cognitive 16): future_host::cli_tool::probe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/cli_tool.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2db28865db82c4c43bdfb4011c3ec2ba424b671f0f09b357984498714a260b1"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::fusion::mapping::validate_sources (cognitive 16): future_host::fusion::mapping::validate_sources has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 3 (7 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":"host/src/fusion/mapping.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab9add0daba7ec73ee34a91afd2abf3d3038f8953938d74b796e08515af10a4"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::remote_host::catalog::read_sessions (cognitive 16): future_host::remote_host::catalog::read_sessions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 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":"host/src/remote_host/catalog.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57598499a7f0b0f1850b35fe4f32543671772fb33bdda21aa218ac51c77618e"}},{"ruleId":"D2","level":"warning","message":{"text":"future_host::shadow_review::policy::evaluate_volume (cognitive 16): future_host::shadow_review::policy::evaluate_volume has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 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":"host/src/shadow_review/policy.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"679bd46cae970f2bbd0925f98c81fb5f8cf89f191baaced4f7c02f7daf99db71"}},{"ruleId":"D2","level":"warning","message":{"text":"ChatArea::render_pictures (cognitive 16): ChatArea::render_pictures has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 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, 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":"tui/src/components/chat_area.rs"},"region":{"startLine":3277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9638c873e0ce01388a688e95cc8b0666187ce11d1d81c40123e8877323eacaf1"}},{"ruleId":"D2","level":"warning","message":{"text":"Input::render_cursor_in_line (cognitive 16): Input::render_cursor_in_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, loops 2, 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":"tui/src/components/input.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8aca582f6165a970240ddf045535754a8ad01bcdcaf2cd169ce346cf2502df8"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownTheme::with_partial (cognitive 16): MarkdownTheme::with_partial has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/markdown.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f7f738bf075dd88a5f305e140f4841ffa5ca0793a331e6c9c974de7af06c08"}},{"ruleId":"D2","level":"warning","message":{"text":"InputSink::plan (cognitive 16): InputSink::plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (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":"tui/src/terminal.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f513dae042becfd852731b96c6016483f184b9fb356ce70bfb6e6dd8bd4f4a9"}},{"ruleId":"D2","level":"warning","message":{"text":"future_tui::workbench::picker::row_line (cognitive 16): future_tui::workbench::picker::row_line 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":"tui/src/workbench/picker.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c96ad12c55f7df74368d4a8a5a63ed0792cd9df07ff11aad1cabe62c5f9c18"}},{"ruleId":"D2","level":"warning","message":{"text":"streamingMarkdownBlocks.createStreamingMarkdownProjector (cognitive 16): streamingMarkdownBlocks.createStreamingMarkdownProjector has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 5). None of this is in the body itself: all 16 points belong to 3 function items inside it that branch (project, a function literal at line 122, a function literal at line 117). 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":"desktop/src/features/markdown/streamingMarkdownBlocks.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1433b5e19aebd9698bd05a64bc3b9bd9e1ff1fb082a72b2adf9d0414fbccba0d"}},{"ruleId":"D2","level":"warning","message":{"text":"updatePresentation.updatePresentation (cognitive 16): updatePresentation.updatePresentation has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (10 pts), boolean chains 6 (nesting depth added 6). 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":"desktop/src/features/settings/updatePresentation.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0806772c2b67aef70bb43e03b2c65d352ca087797aa56d8973b8f677711492a7"}},{"ruleId":"D2","level":"warning","message":{"text":"mentionDom.serialize::visit (cognitive 16): mentionDom.serialize::visit 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/composer/mentionDom.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"941782ff8999b34ea07d643aeb055cedc15f69bb151538883214c7bf428cd4c4"}},{"ruleId":"D2","level":"warning","message":{"text":"useComposerAttachments.useComposerAttachments.addAttachmentPaths (cognitive 16): useComposerAttachments.useComposerAttachments.addAttachmentPaths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (3 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":"desktop/src/features/agent/composer/useComposerAttachments.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"934e8280585a40802341140bebe5cf52eb48e29ad2da573ed8996259cf185d59"}},{"ruleId":"D2","level":"warning","message":{"text":"Composer.ComposerImpl (cognitive 16): Composer.ComposerImpl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 47 (61 pts), boolean chains 34, ternaries 22 (29 pts) (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. This shape REPEATS in the file: one other method here (Composer.ComposerImpl::submitValue) 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06324fa5fe0abad01e7284042619644ee70a1d7f5daef671b50f53c54e20f69"}},{"ruleId":"D2","level":"warning","message":{"text":"replyBlocks.buildReplyBlocks (cognitive 16): replyBlocks.buildReplyBlocks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 2 (4 pts), boolean chains 2, ternaries 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":"desktop/src/features/agent/replyBlocks.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5231752e1a066aefba3120976d7a01fa776f8649730b56d280d49ed3f7840f30"}},{"ruleId":"D2","level":"warning","message":{"text":"ReplySteps.ReplySteps (cognitive 16): ReplySteps.ReplySteps has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 11 (14 pts), boolean chains 2 (nesting depth added 3). Of this number, 9 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":"desktop/src/features/agent/ReplySteps.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5e5fdb1a173262aa6de2dbfc212bc96f77bb59303d08314c21a1829aab9b13"}},{"ruleId":"D2","level":"warning","message":{"text":"runHistoryProjection.applyRunMetadata (cognitive 16): runHistoryProjection.applyRunMetadata has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 2, ternaries 2 (nesting depth added 3). Of this number, 12 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":"desktop/src/features/agent/history/runHistoryProjection.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce729edb5f5836efe8d7ccccd168bf16ff8a1a72835f84313f7046739db3a7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"liveRunProjection.updatePendingMessageFromRunEvents (cognitive 16): liveRunProjection.updatePendingMessageFromRunEvents has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (4 pts), boolean chains 1, error handling 1 (nesting depth added 5). Of this number, 11 points are the body\u0027s own statements and 5 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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb494405b410074de56311734142b12850f4df547db748b599e3b1dce5d7db8"}},{"ruleId":"D2","level":"warning","message":{"text":"useRunReattach.useRunReattach (cognitive 16): useRunReattach.useRunReattach has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 7. None of this is in the body itself: all 16 points belong to 9 function literals inside it that branch (lines 89, 70, 107, \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":"desktop/src/features/agent/useRunReattach.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28e73756a5acbc46d25ddb7dbc27443e4e44155ff071350f05cc259600535be"}},{"ruleId":"D2","level":"warning","message":{"text":"useRemoteApprovals.useRemoteApprovals (cognitive 16): useRemoteApprovals.useRemoteApprovals has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 3, ternaries 2 (3 pts), error handling 1 (nesting depth added 1). None of this is in the body itself: all 16 points belong to 5 function literals inside it that branch (lines 57, 101, 50, \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":"desktop/src/features/remote-peer/useRemoteApprovals.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5727c177901695f750292ff0e0b014cecdc226b0551419b677f4ad8b0ee031ec"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteConversationMenu.RemoteConversationMenu (cognitive 16): RemoteConversationMenu.RemoteConversationMenu has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 3, error handling 1, if/else 1 (nesting depth added 4). Of this number, 13 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationMenu.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96730f08b7b5c85089998a2f695f196e02e9ade1a76ca377e598eb15e2060ce"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteRenameDialog.RemoteRenameDialog (cognitive 16): RemoteRenameDialog.RemoteRenameDialog has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 5 (7 pts), boolean chains 4, if/else 3, error handling 2 (nesting depth added 2). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (submit, generate, a function literal at line 101). 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":"desktop/src/features/remote-peer/RemoteRenameDialog.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f50d8f3ff5a38d5f6a188459af59073413cd86b02fde9a57c8f463303efece6"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteWorkspacesPanel.RemoteWorkspacesPanel (cognitive 16): RemoteWorkspacesPanel.RemoteWorkspacesPanel has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (11 pts), boolean chains 3, error handling 2 (nesting depth added 4). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 44, run, a function literal at line 94). 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":"desktop/src/features/remote-peer/RemoteWorkspacesPanel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"771aa167d9e39946e01b0f0586dd995c2b305124c6b767435e296ad7baa4378f"}},{"ruleId":"D2","level":"warning","message":{"text":"useHasProviders.useHasProviders (cognitive 16): useHasProviders.useHasProviders has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 12, if/else 3 (4 pts) (nesting depth added 1). Of this number, 10 points are the body\u0027s own statements and 6 belong to 2 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":"desktop/src/components/layout/hooks/useHasProviders.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b22ac204fb89e2b9ebcaabce2d43ed71f9027524c196d5a180e72064eedaf7f"}},{"ruleId":"D2","level":"warning","message":{"text":"useRemotePeers.handlePresence (cognitive 16): useRemotePeers.handlePresence has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, ternaries 1. Of this number, 14 points are the body\u0027s own statements and 2 belong 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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2153a8d3eae17fc522de48b1ed838846dd4a05c48e7284101c8b460ed75113"}},{"ruleId":"D2","level":"warning","message":{"text":"useUnreadThreads.useUnreadThreads (cognitive 16): useUnreadThreads.useUnreadThreads has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4, boolean chains 1 (nesting depth added 4). None of this is in the body itself: all 16 points belong to 4 function literals inside it that branch (lines 58, 94, 77, \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":"desktop/src/components/layout/hooks/useUnreadThreads.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22014645e068c125125c376be3c812897372e4805ea1b729000aaac3ec6d017"}},{"ruleId":"D2","level":"warning","message":{"text":"fusion.modelStatus (cognitive 16): fusion.modelStatus has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 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":"packages/thread-projection/src/fusion.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a43567bd8b36b4c9a1e3ae0b6072aee1fbe0d09c281b9eb2fe612e7b821b514"}},{"ruleId":"D2","level":"warning","message":{"text":"index.html.mdListHtml (cognitive 16): index.html.mdListHtml has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (5 pts), ternaries 2 (4 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":"host/web/index.html"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b3c9ea26943e5b74b8c039f5c745eebfc7d3d066f3556f3172ccdac041c2e4"}},{"ruleId":"D2","level":"warning","message":{"text":"codeHighlight.highlightCode (cognitive 16): codeHighlight.highlightCode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 3, error handling 1, ternaries 1 (nesting depth added 2). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (append, a function literal at line 328). 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":"mobile/src/components/codeHighlight.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd1d9d659b0f37fb66f4e884c066c96faf3ef4a3427303d99fe021e9449c111"}},{"ruleId":"D2","level":"warning","message":{"text":"codePreviewRows.codePreviewRows (cognitive 16): codePreviewRows.codePreviewRows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, 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":"mobile/src/components/codePreviewRows.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d7bf56d5bbffc29f8b6184bdaa945e695df5cbd11ea53b6eaffab05064c31a"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkdownText.MarkdownText (cognitive 16): MarkdownText.MarkdownText has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, ternaries 2 (3 pts), loops 1 (nesting depth added 3). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 541, 532, 510, \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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e9d4e8436c2ff8bd47f6222784e0d084795baee899eb133bfc49a3d1564d8b"}},{"ruleId":"D2","level":"warning","message":{"text":"useSessionCatalog.useSessionCatalog.observeRunEvent (cognitive 16): useSessionCatalog.useSessionCatalog.observeRunEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7, boolean chains 5, ternaries 2 (3 pts), error handling 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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf844b96e2941d8ac497dab6e9936a8bb30b3d5244b6efdecb6338700f38f25"}},{"ruleId":"D2","level":"warning","message":{"text":"withIosShareExtension.configureProject (cognitive 16): withIosShareExtension.configureProject has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 5). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/plugins/withIosShareExtension.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee7bb89e3c6615d14c56654bf8ee30ac9fa257983180b6c554f4617e7d89467"}},{"ruleId":"D2","level":"warning","message":{"text":"index.patchLines (cognitive 16): index.patchLines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 2). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 453). 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":"packages/git-graph/src/index.ts"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc63659b1fb198a41ed057566d78d3707fdf542da34c3260ef41bd62550421af"}},{"ruleId":"D2","level":"warning","message":{"text":"RemoteClient.runRecovery (cognitive 16): RemoteClient.runRecovery has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, error handling 1 (2 pts), ternaries 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":"packages/remote-client/src/client.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1155b6e6007ad3804c394084fc2f036882233259650c576ad02d237d139b792"}},{"ruleId":"D2","level":"warning","message":{"text":"projection.applyLiveEvent (cognitive 16): projection.applyLiveEvent has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, ternaries 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f663635f3ecb1c89394cd4544b1326def309ad9ffa4d52396f3aee8a09f730"}},{"ruleId":"D2","level":"warning","message":{"text":"SyncEngine.step (cognitive 16): SyncEngine.step has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"4579b1771ea8e552612799a890006b5f8c6d7e65d904919c286072ac468df648"}},{"ruleId":"D2","level":"warning","message":{"text":"Composer.value (cognitive 16): Composer.value has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, loops 1 (2 pts), ternaries 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":"packages/thread-projection/src/cooperativeJson.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f0a6abd40e30b54117e6d88de6c69eedf216c88dca56c5c42aec690c670f9a"}},{"ruleId":"D2","level":"warning","message":{"text":"runIssuesEn (cognitive 16): runIssuesEn has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (5 pts), if/else 4, error handling 1 (2 pts), loops 2, other 2, boolean chains 1 (nesting depth added 2). Of this number, 15 points are the body\u0027s own statements and 1 belongs to 5 function literals 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":"harness/lib/issues-en-run.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfaed5dc28735f7655960e2ee3454efd2a5ba2a182ba6fb0820fdc69e261ded4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Loop.run_streaming_inner: MethodTooLong \u2014 run_streaming_inner runs 975 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 875 over it, 9.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":"agent/src/agent/run_loop.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb255382fa5b5f01faf93b6092ec8ca2756abdda61bd11d966a6d1e015b4522"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SessionList.SessionList: FunctionTooLong \u2014 SessionList runs 906 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 806 over it, 9.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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b789c9bd93f9180e27b52f2ef8cabf8a8772c7acba89a2c3d417c9d866bfac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServerSession.prompt_internal: MethodTooLong \u2014 prompt_internal runs 862 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 762 over it, 8.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":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5903e0eb91fc50ef81a317fac5bcda86287d650c73c1de4d7c4c52e08d17d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useTimelineController.useTimelineController: FunctionTooLong \u2014 useTimelineController runs 622 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 522 over it, 6.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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ee6dc0d2c3df0df1e1dde25427231c0342ce6ad381381b575d6a13be1bec2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AgentThread.AgentThread: FunctionTooLong \u2014 AgentThread runs 594 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 494 over it, 5.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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0628d8a63401553e955769710c28db2d3a6baeaabf9a2cee5f6452620afcaf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workbench/live.rs: FileTooLong \u2014 2854 significant 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: Live (3 blocks, 166-5645), declaring 42 free functions. The bar is 500 significant lines; this is 2354 over it, 5.71\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":"tui/src/workbench/live.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60a059b4ff2e87d0d741586ce89af44a507051c7acd17cb9605d4fcb05f9271"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workbench/screen.rs: FileTooLong \u2014 2785 significant 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 2285 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":"tui/src/workbench/screen.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ff6b198699616612fe9af1e2bbc4f34bc9d7eb0b69524660a6084f85e4b7ad"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Live: ClassTooLong \u2014 2222 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 156 methods, 3 blocks, lines 166-5645. The bar is 400 significant lines; this is 1822 over it, 5.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":"tui/src/workbench/live.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5273689b68ea7b37c7da9c3545828e051bc32dc639e625b376240ea44a022de0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSessionCatalog.useSessionCatalog: FunctionTooLong \u2014 useSessionCatalog runs 552 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 452 over it, 5.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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38a59913fda8ea394a578e2e92f640aec7c3fe7409ec87d4d41844dceac2742"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Live: TooManyMethods \u2014 156 methods. The bar is 30 methods; this is 126 over it, 5.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/live.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fd3ab2919af431203602aa07c6974367d04249c0c65b9a6d65b2b042aeec6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CustomProviderDialog.CustomProviderDialog: FunctionTooLong \u2014 CustomProviderDialog runs 519 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 419 over it, 5.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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cd212c861559effafb44461be1881ac415dfe5dc8a253a53c8014ec2b837b2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Workbench: ClassTooLong \u2014 2043 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 104 methods, 3 blocks, lines 647-4372. The bar is 400 significant lines; this is 1643 over it, 5.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":"tui/src/workbench/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3aec47fadd104e0582888972bf5947e6bffe1d5f36d090042f6e3048d8023bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workbench/mod.rs: FileTooLong \u2014 2468 significant 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: Workbench (3 blocks, 647-4372). The bar is 500 significant lines; this is 1968 over it, 4.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":"tui/src/workbench/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2faddc7e097a9987dcc255c49deaa3a613ba6e25d66b1a8202cd3827d439f2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ComposerDock.ComposerDockView: FunctionTooLong \u2014 ComposerDockView runs 490 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 390 over it, 4.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":"mobile/src/features/chat/components/ComposerDock.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6827f093ea13d1ed78f4773a3804fe3d2535664a5efed0c7d9b11b0be356f34"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Composer.ComposerImpl: FunctionTooLong \u2014 ComposerImpl runs 476 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"df16a65646b02b2598f042cfdf9156e27d49c3a5fed64b06a43b6d589a2a1031"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteView.RemoteHostSection: FunctionTooLong \u2014 RemoteHostSection runs 464 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 364 over it, 4.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":"desktop/src/features/remote/RemoteView.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b6ff7af7427fddbbaad259fae499e761d93a8e934f49dc76fbbecb9cdb691f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: run.runCase: FunctionTooLong \u2014 runCase runs 446 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 346 over it, 4.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":"harness/lib/run.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"47310eb2b724703fdeb4f72103e4006ef5005eab8d19427d5be97f7ed7668293"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDesktopConnection.useDesktopConnection: FunctionTooLong \u2014 useDesktopConnection runs 433 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 333 over it, 4.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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8110ba54e205643ddd792f7bdd19b85595847883318bd3ea8fa26b0394167c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/chat_area.rs: FileTooLong \u2014 2138 significant 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 73% of them inside a single declaration: ChatArea (3 blocks, 1098-4037), declaring 31 free functions. The bar is 500 significant lines; this is 1638 over it, 4.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":"tui/src/components/chat_area.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c563ae897d37009671b4abed37f9f07d7b6cf766cd1f410e906929d7214b9291"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useChatFiles.useChatFiles: FunctionTooLong \u2014 useChatFiles runs 421 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 321 over it, 4.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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a4c88a30617df535c54c0b1ed30e6f1c71ffa4bb9de180825205276551bc91"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteContext.RemoteProvider: FunctionTooLong \u2014 RemoteProvider runs 403 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 303 over it, 4.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":"mobile/src/remote/RemoteContext.tsx"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ab66f459481d4108d27ffd3142a68b5d250e0ddf00a39daf69cda99246b08a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useConversationController.useConversationController: FunctionTooLong \u2014 useConversationController runs 399 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 299 over it, 3.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":"mobile/src/remote/useConversationController.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c379a23694d12d26c85821632c02574fa5678b9ccbbc914d8e5524112875cd96"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Supervisor: TooManyMethods \u2014 118 methods, declared across 8 files: src/supervisor.rs (46), supervisor/start.rs (22), supervisor/shutdown.rs (21), supervisor/runtime.rs (11), \u002B4 more file(s). The bar is 30 methods; this is 88 over it, 3.93\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/supervisor.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f855a3ffa9ce757c44f44cc46ed6668536fc5b4e9baf381708c7f247115371a9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ChatArea: ClassTooLong \u2014 1556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 115 methods, 3 blocks, lines 1098-4037. The bar is 400 significant lines; this is 1156 over it, 3.89\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/chat_area.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eebe2c10842dec699334bd8b7d59da55d24c46e72ecf89115b923f437485fa1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChatArea: TooManyMethods \u2014 115 methods. The bar is 30 methods; this is 85 over it, 3.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":"tui/src/components/chat_area.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a447d5474afdf9ebb8a4ad4ab4aebfa100f8002081dd88c813d90277e8b809c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CustomProviderPage.CustomProviderPage: FunctionTooLong \u2014 CustomProviderPage runs 380 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12977ecece65c81797e99b475d740cef3c6f6ed7e26b1373da77b51f712009e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useThreadStore.useThreadStore: FunctionTooLong \u2014 useThreadStore runs 378 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 278 over it, 3.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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bb13081aa253eecc05083004438230e225cf4121e2eb442a4aa6ba7695cc9b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteStore.reclaim_settled_journals: MethodTooLong \u2014 reclaim_settled_journals runs 376 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 276 over it, 3.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":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"593ed5b489c3b97994506c3a2b9edcbe31e5497367218d80ff4b6f858e4c9c6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/runtime.rs: FileTooLong \u2014 1860 significant 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: Client (2 blocks, 1028-3505). The bar is 500 significant lines; this is 1360 over it, 3.72\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/src/runtime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ce44cad2f9f184cbb6521b6642d762f87ff8937a4765a81a5ee74d1b1ade75"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/ActivityRail.tsx: FileTooLong \u2014 1858 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1358 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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96a66610cf48f0e8e68dfef30ce2f8920bd735b6568098e0ec031bcf0654eb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_channel::feishu::prompt_loop::run_prompt_loop: FunctionTooLong \u2014 future_channel::feishu::prompt_loop::run_prompt_loop runs 369 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 269 over it, 3.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/prompt_loop.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baa970d43e8d1ebce74700b0f9a23dfbad9cb2f15c917f9410af2d870068271"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteContext.RemoteProvider: FunctionTooLong \u2014 RemoteProvider runs 365 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 265 over it, 3.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/shot/mock/RemoteContext.tsx"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ccc5bb20919f34f56f60a6ccbff9fb3f7766e5fa6116bc2572afd35a1a19fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usePromptOutbox.usePromptOutbox: FunctionTooLong \u2014 usePromptOutbox runs 358 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 258 over it, 3.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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed207d551710f146e30cf65fa63312083dca39312ad2794d6f4ab9aa2dc6a706"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::run::quit: FunctionTooLong \u2014 future_tui::workbench::run::quit runs 357 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 257 over it, 3.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":"tui/src/workbench/run.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e222edbcc031258b32c8f555299359b815e4b07a17f6d631a6141f90888cf7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ServerSession: ClassTooLong \u2014 1423 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 83 methods, 2 blocks, lines 93-2387. The bar is 400 significant lines; this is 1023 over it, 3.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":"agent/src/rpc/session.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"68aba8d47730bf69d6be5bdcbd32e0846a40c07af7250e5db3ce75ba18ee21bc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Client: ClassTooLong \u2014 1422 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 64 methods, 2 blocks, lines 1028-3505. The bar is 400 significant lines; this is 1022 over it, 3.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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"3155c7ceb5a34d733362d300fe36f125f3991b3bd8c839f78f53e59a2efaf9c7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Workbench: TooManyMethods \u2014 104 methods. The bar is 30 methods; this is 74 over it, 3.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":"tui/src/workbench/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70708f70943058c5811abf1a004a1564c31d4c396c87b8f7e20b988d18b6230"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liveApply.createProjector: FunctionTooLong \u2014 createProjector runs 346 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 246 over it, 3.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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba0cb7cf30b37a10b357c9d9d1230d03fa6bf7e42b464cfbfacc4c69da7389d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::rpc::commands::handle_command_internal: FunctionTooLong \u2014 future_agent::rpc::commands::handle_command_internal runs 343 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 243 over it, 3.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":"agent/src/rpc/commands/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d070d8482326c131b4586b5ae1f79cc4109968cecb99f39e33c93eb4fb268d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/email.rs: FileTooLong \u2014 1670 significant 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 1170 over it, 3.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":"channels/src/providers/email.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0637a723630b7b79ddb4ccbe3247597ae7a2133a69f105d31682c19972756182"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rpc/session_prompt.rs: FileTooLong \u2014 1631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: ServerSession (206-2479). The bar is 500 significant lines; this is 1131 over it, 3.26\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"165cf1f3a3e1285e6e91c933cfb9cec58af71c85d855535f4f481697e1bdde5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::fusion::execute: FunctionTooLong \u2014 future_host::fusion::execute runs 321 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 221 over it, 3.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":"host/src/fusion.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7837990409aff9aed15e8efcb8722f2867b58bde7b41679d26b4f194bfa418"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/remote.rs: FileTooLong \u2014 1603 significant 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 1103 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":"cli/src/commands/remote.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79cd5f59553fa0cace33f86ee4891b4a44a2dc8c8ecc0d32722824b2440181c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::remote_host::business::history::execute: FunctionTooLong \u2014 future_host::remote_host::business::history::execute 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":"host/src/remote_host/business/history.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6fe489f6eb307d413f1dec9e83ef0a9b38f786d605fbfdfb110b6a47d9c1c60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRemoteTimeline.useRemoteTimeline: FunctionTooLong \u2014 useRemoteTimeline runs 310 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 210 over it, 3.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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ee8d2d0c00449ffa4e9eb6aee5056c6247cbec51be742d44b606d962bcd240"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layout/AppShell.tsx: FileTooLong \u2014 1534 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1034 over it, 3.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/AppShell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36613f7c7655228c36ee3b790ae52b43b159ae769a23599e9fbd99faaf129e74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TerminalPanel.TerminalPanelShell: FunctionTooLong \u2014 TerminalPanelShell runs 301 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 201 over it, 3.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":"desktop/src/features/terminal/TerminalPanel.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc067c6c0d844b711509761cbaae2c2f47c69fdae5a4b4317c3d6907242e5a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: NewConversation.NewConversation: FunctionTooLong \u2014 NewConversation runs 295 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 195 over it, 2.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":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1af8996e1b7c3016558cb9c528ba1863c7855462d5b9d723f93b1a8b197f6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useMessagePaging.useMessagePaging: FunctionTooLong \u2014 useMessagePaging runs 293 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 193 over it, 2.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":"desktop/src/features/agent/useMessagePaging.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf05ca0d3d964431e1e17a79c20f3adb7eef4c1098c0c78a8f0c9aa840d90a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rpc/session.rs: FileTooLong \u2014 1463 significant 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 97% of them inside a single declaration: ServerSession (2 blocks, 93-2387). The bar is 500 significant lines; this is 963 over it, 2.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":"agent/src/rpc/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27488e39bfe32c4f27ba98e3aac8ed687afcb2ec6afcfef6dd3e63c688f36cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Workbench.handle_overlay_key: MethodTooLong \u2014 handle_overlay_key runs 292 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 192 over it, 2.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/mod.rs"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5f2f687c5da09891dc62bc7c871f0fbaa4af4ab549d4d7500578962498652a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RemoteClient: ClassTooLong \u2014 1167 significant lines (blank, comment-only and punctuation-only lines excluded), 72 methods. The bar is 400 significant lines; this is 767 over it, 2.92\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/src/client.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1177c5b092c91b5c4a3a8a0cf696a46c57bd2bd41681943fe75e69dffd196cab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDesktopRuntime.useDesktopRuntime: FunctionTooLong \u2014 useDesktopRuntime runs 290 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 190 over it, 2.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":"mobile/src/remote/useDesktopRuntime.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2644ce33e571ce0f188982a6bd5bee483be832bcde86a34236df942b08debb15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mock/data.ts: FileTooLong \u2014 1444 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 944 over it, 2.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":"desktop/shot/mock/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"210a0f7a3e7d390d176eaef7c4ea36cfb8300b11bea44603e8839187b515c23f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ProvidersPage.ProvidersPage: FunctionTooLong \u2014 ProvidersPage runs 285 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 185 over it, 2.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":"desktop/src/features/settings/ProvidersPage.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea528ef7d037fa18511591c380b5c44809580a6314755e94da4dbf81c15a82dd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqliteStore: TooManyMethods \u2014 85 methods, declared across 18 files: sqlite_store/events.rs (13), sqlite_store/mod.rs (13), content/recovery.rs (7), sqlite_store/transcript.rs (7), \u002B14 more file(s). The bar is 30 methods; this is 55 over it, 2.83\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/sqlite_store/mod.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2293114f4701bcace8a2e75d633909f512e5de264c4945720f846957212dc0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Manager: TooManyMethods \u2014 84 methods, declared across 16 files: manager/mod.rs (31), manager/loading.rs (9), session/queued_receipts.rs (7), session/summary.rs (5), \u002B12 more file(s). The bar is 30 methods; this is 54 over it, 2.80\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":"agent/src/session/manager/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffdb7e7f43d50184b349bf351a0e15b788ace570d152fc58244ca4d67fcc39c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/markdown.rs: FileTooLong \u2014 1387 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 887 over it, 2.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/markdown.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3502dd470b09658e1976ddf9f56934f653b50b796f4e4956adf61629f3c53337"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ServerSession: TooManyMethods \u2014 83 methods, declared across 2 files: rpc/session.rs (67), rpc/session_prompt.rs (16). The bar is 30 methods; this is 53 over it, 2.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":"agent/src/rpc/session.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1ab1be922c68e16d9133b84279c4a5649e2b031bf804f5877110b27006387e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TimelineCard.TimelineCardView: FunctionTooLong \u2014 TimelineCardView runs 274 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 174 over it, 2.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/messages/TimelineCard.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"c634562a06ecc0672c372eceb0017563fb8749c0647b2952f4edd8e476d93799"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemotePeerSettings.RemotePeerSettings: FunctionTooLong \u2014 RemotePeerSettings runs 273 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f45e0b49632c11f57b9ab9a550be99096966d63ece173ac80e983b803975f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workbench/run.rs: FileTooLong \u2014 1350 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 41 free functions. The bar is 500 significant lines; this is 850 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dcb7be1eba19f40c7541070cc986a96c6004d2d89cc97d005555e605e2ce8b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FutureAgentService.execute_command: MethodTooLong \u2014 execute_command runs 270 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 170 over it, 2.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/grpc/mod.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22debbf7d9b97de10e54b77f8b8566cbd747c561e4ac63b475e45759bad6c45"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/run_loop.rs: FileTooLong \u2014 1349 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: Loop (223-1963). The bar is 500 significant lines; this is 849 over it, 2.70\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":"agent/src/agent/run_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c1870a678a1b3682290067b8f466cdb51c7c93a19bb9303f0fcf32e55a2490"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Writer.encode: MethodTooLong \u2014 encode runs 269 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 169 over it, 2.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/journal.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b76cebf2f15d45bfd76ad2bca07d8f0012f3529d559bf66ee39e09cdbfd157"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GrpcClient: TooManyMethods \u2014 80 methods. The bar is 30 methods; this is 50 over it, 2.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":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a93b76edf7f3edb57700992c9a9539d6ab3cac19779a2a79c646b3637109fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServerSession.compact_with_policy: MethodTooLong \u2014 compact_with_policy 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":"agent/src/rpc/session.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"70345e3dc1a0a77a053126e8f0851d27efa5e5b3a4ec751490e94abe73262dba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ArtifactDetailPanel.ArtifactDetailPanel: FunctionTooLong \u2014 ArtifactDetailPanel runs 258 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/artifacts/ArtifactDetailPanel.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4921cfa721e64e48824029d08992a936bbd0e4308e1a72ddfde0308d28b1ca7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/client.ts: FileTooLong \u2014 1279 significant lines (blank, comment-only and punctuation-only lines excluded), about 91% of them inside a single declaration: RemoteClient (130-1895). The bar is 500 significant lines; this is 779 over it, 2.56\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":"packages/remote-client/src/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efe2fe5ce66ba1f7ba9a4b9ac638dacbf37472815d3208225935f33baaca8d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MessageBlock.MessageBlockImpl: FunctionTooLong \u2014 MessageBlockImpl runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.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":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1369901d74115e82083d21d00edd4ece2e7875695fed5c9f11ae3e3a2c81093d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ThreadSearch.ThreadSearch: FunctionTooLong \u2014 ThreadSearch runs 254 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 154 over it, 2.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":"desktop/src/features/agent/search/ThreadSearch.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ba179f21686353636085f3eaba7d7051fe240785408b10e4ccb7352c7ec60a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: remote-live.runRemoteLiveCase: FunctionTooLong \u2014 runRemoteLiveCase runs 251 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"harness/lib/remote-live.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f977a438bfea4dc2fc2ebe5b19de6b7866d1daadb67fd39e5cdac2ce58cf7a44"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpenAiResponsesAdapter.decode_frame: MethodTooLong \u2014 decode_frame 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":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32df4f0958e4ea5a18a594e8c7e6758495d28310fe7acf4a24734282914f2e4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PairingScreen.PairingScreen: FunctionTooLong \u2014 PairingScreen runs 246 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d54c83406e79e3652874fad1aacbc17c7c6f34515131bebefdb8fe5a50623d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: liveApply.createProjector.processEvent: FunctionTooLong \u2014 createProjector.processEvent runs 246 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec4262b45c99ca8f26cee0fbdb5eb889b74bb6fd50bdfc83f1579f705537a86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/task.rs: FileTooLong \u2014 1215 significant 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 715 over it, 2.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/task.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7109d741ffde59739faf60e2811b5b640c70231294385b437b77ba1cf2573ede"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: futureos::gui::run_with: FunctionTooLong \u2014 futureos::gui::run_with 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":"desktop/src-tauri/src/lib.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8835e4d9842fb08bf563c0cd449814b2958d125372650eebfa05ff5e6ae718e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TerminalView.TerminalView: FunctionTooLong \u2014 TerminalView runs 243 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/terminal/TerminalView.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9da57441655798c232735c279c09b7233888878830794dc0d38f028029e1dfd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RunClient: ClassTooLong \u2014 968 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 70 methods, 2 blocks, lines 75-1616. The bar is 400 significant lines; this is 568 over it, 2.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":"cli/src/rpc.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce0dd45b83feccb1fd7c79ca92cc4b0a35ef6675034a2b55eeb87fcf632b8ba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RemoteClient: 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":"packages/remote-client/src/client.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"accf581e2f0ffc087c7c1f135a86a163de00fb9d173942da4d75fe00f48ce025"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/SessionList.tsx: FileTooLong \u2014 1195 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: SessionList (182-1671). The bar is 500 significant lines; this is 695 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"815662e4dcf0d424a0f340776dc69114bc8e2950bf0b0d8b2c751b411d2f4ce3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/session.rs: FileTooLong \u2014 1190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 690 over it, 2.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":"cli/src/commands/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8d4ffd84a665d73510187593db4271ee4d6accba2c658c55d1aa3ff0019d16"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bridge.handle_slash_command: MethodTooLong \u2014 handle_slash_command 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":"channels/src/feishu/bridge.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a924f3d595c292a1917fb41d8cf045958836735729ab7b3ab92038b52ae074"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::task::add: FunctionTooLong \u2014 future_cli::commands::task::add 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":"cli/src/commands/task.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bcf7eabdb8330d1c1f3d2be15d63576f9fb34ccf1b7e10dc004078a5699867"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRemotePeers.useRemotePeers: FunctionTooLong \u2014 useRemotePeers runs 234 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 134 over it, 2.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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd4b6e6a349d383fc36f518d00e93f19c9153095094b04bbcf770fd01743ccf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RunClient: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.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":"cli/src/rpc.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8342d628461b643a5aa4580828d715748d6186c541b4a9c75f554f6ae298c2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::tools::shell::execution::spawn_shell_impl: FunctionTooLong \u2014 future_agent::tools::shell::execution::spawn_shell_impl runs 233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/tools/shell/execution.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d112ba9b2dd1d2296d6aba94934c0c43e0da2b12c397cb5dc2292461e65027a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SendQueuePanel.SendQueuePanel: FunctionTooLong \u2014 SendQueuePanel runs 232 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/chat/components/SendQueuePanel.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39a179a8e260857fee3220c238fac8e692a711319bea58e13788e0df4018c90"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::screen::compose: FunctionTooLong \u2014 future_tui::workbench::screen::compose 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":"tui/src/workbench/screen.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93121de75ea036691f4b31f719ef5e084998bce7dc7b49e4f4b4c83d3a72eda"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Workbench: TooManyFields \u2014 69 stored fields beside 104 methods. The bar is 30 stored fields; this is 39 over it, 2.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":"tui/src/workbench/mod.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9880f283278d85ce1bcbdac20725314a7b031ad0d5eadd020391c9f637e5691"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DesktopsScreen.DesktopsScreen: FunctionTooLong \u2014 DesktopsScreen runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/screens/DesktopsScreen.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0097638b502a7d73b039c8a270831551f26c9421aa9b6b3817b55dddcbc6ad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteStore.recover_segmented_run: MethodTooLong \u2014 recover_segmented_run 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":"agent/src/session/content/recovery.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaf4a0a7ac41886940e497f0ea5bfc32c265013f4b436e407113aada7642d03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rpc.rs: FileTooLong \u2014 1138 significant 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: RunClient (2 blocks, 75-1616). The bar is 500 significant lines; this is 638 over it, 2.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":"cli/src/rpc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28f03daafa647509b9b5807a0f3f3714b1cd288e292f126394ddc5a25e8d975"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useThreadDialogs.useThreadDialogs: FunctionTooLong \u2014 useThreadDialogs runs 227 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 127 over it, 2.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":"desktop/src/components/layout/hooks/useThreadDialogs.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d68f40adc9de7aac414031764579985715156ae3ddcde15a9be257c00ba6b7e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SessionList: ClassTooLong \u2014 906 significant lines (blank, comment-only and punctuation-only lines excluded), 7 methods. The bar is 400 significant lines; this is 506 over it, 2.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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25def74e0064cfeb6177f9a69255d08453da1dcc2ebc86b6e1c9f178bf747bd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: UpdatePage.UpdatePage: FunctionTooLong \u2014 UpdatePage runs 224 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/settings/UpdatePage.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a378051e6f172c98ded1648dbe9742931e1aa498b91fca315b88f3bb17335df"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Live: TooManyFields \u2014 67 stored fields beside 156 methods. The bar is 30 stored fields; this is 37 over it, 2.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":"tui/src/workbench/live.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bc5fc4df8ad29efd8e8b7d00092a14ec9a46119f5c570e2e64738a722a7c6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ApprovalPrompt.ApprovalPrompt: FunctionTooLong \u2014 ApprovalPrompt runs 223 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"70df2374561713f1a8dec911ea7ebfda620aa3b0f3150effe50559731b411253"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::dispatch: FunctionTooLong \u2014 future_cli::dispatch 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":"cli/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"57037d7ed1b72e3d0986937501f57baec18faa6b4d92219d3319c8ec9a37f7f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SkillsView.SkillsView: FunctionTooLong \u2014 SkillsView runs 220 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36dd4bc6e14f1b2dcf709dd36df476609815e7990ad36d114b3671972c9a45b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::picker::rows: FunctionTooLong \u2014 future_tui::workbench::picker::rows runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/picker.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdae3a5aac33aa03d34862c535b49f22542285d5b94087cc195b5a94fdbb450"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/tools.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), declaring 34 free functions. 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":"cli/src/commands/tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d745b5e185a7b1122fc69d9b23374cfe5f64416719840733d8920115fcfed0cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FutureAgentService.stream_events: MethodTooLong \u2014 stream_events 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":"agent/src/grpc/mod.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"437dc8c4ab13eceb6cfab0c99fec7db848a90fe294480f48b8d4d5602f9a1cd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mock/backend.ts: FileTooLong \u2014 1073 significant lines (blank, comment-only and punctuation-only lines excluded), about 61% of them inside a single declaration: handlers (795-1745). The bar is 500 significant lines; this is 573 over it, 2.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":"desktop/shot/mock/backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57038737143d243baede1e757e1540e6870854933c4396b7cc9103630a40472"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Client: TooManyMethods \u2014 64 methods, declared across 2 files: src/runtime.rs (61), src/transfer.rs (3). The bar is 30 methods; this is 34 over it, 2.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/src/runtime.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c03907e029f67001fe11ccee7669aa6b4dc49970a4a61adf617da5c3d159da5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli.main: FunctionTooLong \u2014 main runs 213 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"harness/cli.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d79a099312cc2f7c0036a6caf156f0cd3c1b57259ddcbff1df8ad859dfdcf23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DesktopPicker.DesktopPicker: FunctionTooLong \u2014 DesktopPicker runs 212 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/screens/DesktopPicker.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7977c3154517a8c1651d94d7c65b84b8f3d54e3d7d2c07f7c61bd4987b2865"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RunClient.run: MethodTooLong \u2014 run 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":"cli/src/rpc.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3462a4b3ada8832789d897bee841529bce3610722e20a8bf31f7e88f3b4b1c0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: composerStyles.useStyles: FunctionTooLong \u2014 useStyles 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":"mobile/src/features/chat/composer/composerStyles.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c3488117055fca7246611ac144363100087a2f93d1f9ba43bbf0e84a7cf424"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::content::entries::prepare_owned: FunctionTooLong \u2014 future_agent::session::content::entries::prepare_owned runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.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":"agent/src/session/content/entries.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6456b94c059f50c0706488e4686c72e651b54b631500b661b8e959ed5925614"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::remote_host::business::catalog::execute: FunctionTooLong \u2014 future_host::remote_host::business::catalog::execute runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.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":"host/src/remote_host/business/catalog.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"748eefbce5151295a261aa2fe80ca79ce6ba110af627a955ad5ab309602e93bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::screen::git_box: FunctionTooLong \u2014 future_tui::workbench::screen::git_box runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.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":"tui/src/workbench/screen.rs"},"region":{"startLine":2376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29353487d33d2d5fc550de675a184dffc583c7077eabcbbbd03bcdbd294087f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Bridge: ClassTooLong \u2014 837 significant 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, 2 blocks, lines 26-1214. The bar is 400 significant lines; this is 437 over it, 2.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/bridge.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef0cdddb617678147018fa8ed638a97a43a3d92c7c43595dbf2616035967659"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Client.stream_model: MethodTooLong \u2014 stream_model 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":"agent/src/llm/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"2934eba6a40e4bd244dbed8a61a3a92b76411ed731a01c0a66ff0999d0e3cbc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: screens/SessionsScreen.tsx: FileTooLong \u2014 1026 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 526 over it, 2.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/SessionsScreen.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2baea0955e6b398e60373562d28afc7fb3feafa0671f00da7d6e74f89df07fa0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Bridge.handle_event: MethodTooLong \u2014 handle_event runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/bridge.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a710ac88ee6e1566a39aa5071617231915462f6f03e78612be7678ebf3c4abc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::session_prune::run: FunctionTooLong \u2014 future_cli::commands::session_prune::run 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":"cli/src/commands/session_prune.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"843819badb05e778ce479bd97d3da7d68a9b1e2f1fb6374612d5f1815dd148d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vibe/VibeStage.tsx: FileTooLong \u2014 1013 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 513 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":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a460745ac65f83b6bc648cdafb601ed007d3231ae03d9cf5b2cfe16411420300"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::service::startup::initialize: FunctionTooLong \u2014 future_agent::service::startup::initialize runs 202 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 102 over it, 2.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/service/startup.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"003924534006b0abc9ad69b532563d0544f4ca57442d89a38a9d920b19ee9dac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::rpc::get_state_internal: FunctionTooLong \u2014 future_agent::rpc::get_state_internal 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":"agent/src/rpc/mod.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"d075af512b66cf813fdbc9bc88a30abc8a23d7c6be8231fa28e5ace08d3bf788"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: remote-mobile-live.runRemoteMobileCase: FunctionTooLong \u2014 runRemoteMobileCase runs 201 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"harness/lib/remote-mobile-live.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"023badf60d3d23ad658130f1d47377b1d7b74f8022b7d604d7a31be3467f4146"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::agent_bridge::prompt::agent_prompt_inner: FunctionTooLong \u2014 future_host::agent_bridge::prompt::agent_prompt_inner 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":"host/src/agent_bridge/prompt.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e7958976564b5be5a73112f77c6497df77a3fb7068666b6994dd43451aee26"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServerSession.enqueue_prompt_with_model_context: MethodTooLong \u2014 enqueue_prompt_with_model_context 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":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a60ea3029c4b49d318adc3a6f60d4f01da60a5dd232a8906178714986995f3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Snapshot.page_impl: MethodTooLong \u2014 page_impl 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":"agent/src/session/content/reader.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"31511c77253fbc8329321d035e9333c40e3652b8639b19f5b248362ad478fe21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::tools::tools_call: FunctionTooLong \u2014 future_cli::commands::tools::tools_call 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":"cli/src/commands/tools.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb156ad6ac27662a21037ff43028c55a1985212933fe759a2b66d4365d4d3cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::keys::matches_key: FunctionTooLong \u2014 future_tui::keys::matches_key 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":"tui/src/keys.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"38307e38d7c2b7b782dbef0baa473cb8ae8dd907db1c03a6bc0a1719576f5e1d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteStore.compact_run_cancellable: MethodTooLong \u2014 compact_run_cancellable 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":"agent/src/session/journal_compaction.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d9e95ed8a4a00532d4cbda74b0fcadff370e15a3c51c65da74da023c52e033"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::rpc::prompt_helpers::run_event_to_sse: FunctionTooLong \u2014 future_agent::rpc::prompt_helpers::run_event_to_sse runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.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":"agent/src/rpc/prompt_helpers.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"263fcad5ea4b06c84ad30ed9a3809994faf01f9f7b4d0ef2672d840324e2040a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cli-driver.runCliCase: FunctionTooLong \u2014 runCliCase runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.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":"harness/lib/cli-driver.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03576deada2f766a63d5def64e9634a386fd8c5bc4d681154ff904a8cd29a21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Supervisor.spawn_credential_refresh: MethodTooLong \u2014 spawn_credential_refresh runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.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":"packages/remote-server/src/supervisor/transport.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0728fb875e61348bb467a5f381599aa41e55d82d377e5e6ae221aed1179aa2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQuestionNav.useQuestionNav: FunctionTooLong \u2014 useQuestionNav runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/chat/useQuestionNav.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"14aac51822eb6be41af7acc4eda3977fdb6f7d3c3d9e34f13c11481bc2f4ccb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rpc/grpc_client.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). The bar is 500 significant lines; this is 460 over it, 1.92\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baf492148143a81d3eb03aeb2f4a775007d4f984079b658aa9c0fa50d5c1eea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::sqlite_store::transcript::insert_transcript_entries: FunctionTooLong \u2014 future_agent::session::sqlite_store::transcript::insert_transcript_entries runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/sqlite_store/transcript.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09e13ec46ba03bb18ea40d0726d1ca1e3a6f370ad3fecfec256b5450cf77e62"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ImagePreview.ImagePreview: FunctionTooLong \u2014 ImagePreview runs 192 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filepreview/ImagePreview.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d32fe1d4399169d1a977280c5110944a421e123526e93c30448b8fb9b41d60"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fusion.rs: FileTooLong \u2014 953 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 453 over it, 1.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":"host/src/fusion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f7726e7e651d20d9f9a4cc05686840abba2945433e16e2c2cace9a58ff663e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Input: ClassTooLong \u2014 749 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 52 methods, 7 blocks, lines 187-1447. The bar is 400 significant lines; this is 349 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":"tui/src/components/input.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e855a8d4306abc404aa54d9aa45ba0e1f87a93925ec95aee0a20f67034eeaf0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::legacy_import::parse_sources: FunctionTooLong \u2014 future_agent::session::legacy_import::parse_sources 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":"agent/src/session/legacy_import.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e94798344cb8b8740116ff086bc91ca0fcb60d011fa47458e18ad9e1cb38a8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workbench/syntax.rs: FileTooLong \u2014 930 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 430 over it, 1.86\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/syntax.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72790dce448e4491a905cd2cdeff49d58c5c3871f368d182b600874aa9b0c2c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Supervisor.catalog_loop: MethodTooLong \u2014 catalog_loop runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/supervisor/publisher.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bee98dd2d90cf2366469b5a754f550bf3ea0bab0ddce233ac219d8ad5796794"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote-peer/RemoteComposer.tsx: FileTooLong \u2014 927 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 427 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb4943e333ae7d80a20d98c2f17e64cf88d584837abaa30ab651e53d2d8f88b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RunInspectPanel.RunInspectPanel: FunctionTooLong \u2014 RunInspectPanel runs 185 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"edddbfbaec3156577e103b0de3d03f3f311d383b529e99f56932357fdf7d9340"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::rpc::commands::session_lifecycle::cmd_new_session: FunctionTooLong \u2014 future_agent::rpc::commands::session_lifecycle::cmd_new_session runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.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":"agent/src/rpc/commands/session_lifecycle.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"17495fb037590456a7c23eae109494302555eab1d9f973920fb38cf67199516c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::agent_bridge::stream::collect_agent_response: FunctionTooLong \u2014 future_host::agent_bridge::stream::collect_agent_response runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.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":"host/src/agent_bridge/stream.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccef3ece7f2383425030c7ae95363b07fccc8d70e7e1ee5e6db66d3e77cd6b6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRemoteConversationSettings.useRemoteConversationSettings: FunctionTooLong \u2014 useRemoteConversationSettings 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":"desktop/src/features/remote-peer/useRemoteConversationSettings.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"669d69984add9dacee54968bd3aff313b5859f8840cc3173e06c7218a3c9276f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/commands.rs: FileTooLong \u2014 914 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 414 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":"packages/remote-server/src/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3a59c099649279b02abe116af85ba105c03818c7452ff052adc700217eb6fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::remote_host::business::tasks::execute: FunctionTooLong \u2014 future_host::remote_host::business::tasks::execute 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":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6660e78b2c7cfbe1cab13b73bffdc53e3a8b1a05fb23282cf0f22af40a944468"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useQuestionNav.useQuestionNav: FunctionTooLong \u2014 useQuestionNav runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/agent/useQuestionNav.ts"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ed0305cfa4e4dd5a3e7356e78c510b3192b9e09de29931d8d6c85dab40feb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AppShellDialogs.AppShellDialogs: FunctionTooLong \u2014 AppShellDialogs runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/components/layout/AppShellDialogs.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"65260269c08d77dca8d537c2ed6287f597a79ca3a52d1cbdfc7a7e07d0b91d6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SendQueuePanel.useStyles: FunctionTooLong \u2014 useStyles runs 180 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/chat/components/SendQueuePanel.tsx"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f813461d8f304f81d9b7f1d85fbb2adecb8a42d841b3e09d1f3799937c2e0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::run::event_loop: FunctionTooLong \u2014 future_tui::workbench::run::event_loop 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":"tui/src/workbench/run.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f852a37f938c2cb0c67ab49b8bf8c8c40b009abb6a70b69ae4078d93a4cd54f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 894 significant 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 394 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":"desktop/src-tauri/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cf0e243cc85e97071d88c3718ac1caf9f3d765bdd5291b0ae699fcdeb3d098"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/session_transcript.rs: FileTooLong \u2014 886 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 386 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session_transcript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0fc872f3fbd1a232ef7a4390a72b485902ea4bf993ad4b1d914b206276d3ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote_host/files.rs: FileTooLong \u2014 884 significant 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 384 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/files.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6c899a547e0a510c1a9f9b985caf772a8e6caa74f78e4a4614b8d9b4ced920"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ServerSession: TooManyFields \u2014 53 stored fields beside 83 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":"agent/src/rpc/session.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c20dbf6ebf761a0233fc1b936633749b151e1cb5ac0037ef4b7710b78439a54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: feishu/bridge.rs: FileTooLong \u2014 880 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: Bridge (2 blocks, 26-1214). The bar is 500 significant lines; this is 380 over it, 1.76\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef26e230bf0f8b36dc453ea60254bf5a4f4334a17f22aa289b6adf8538e7f962"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AnthropicMessagesAdapter.decode_frame: MethodTooLong \u2014 decode_frame 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":"agent/src/llm/adapters/anthropic.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e8dc81bc8946484b9eb714d569a23751e60a4d8dc1280c804893b334703938"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: content/journal.rs: FileTooLong \u2014 877 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 377 over it, 1.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/journal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb9882059220638e610e070ee446ac77ef6d831d3790dca759469682f75e273"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::agent_bridge::observer::handle_event_from: FunctionTooLong \u2014 future_host::agent_bridge::observer::handle_event_from 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":"host/src/agent_bridge/observer.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed54a94627612709a7efbc0a07895962b2cfd2aedbfa9f809917d3b408ddfb09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/TasksSettingsPage.tsx: FileTooLong \u2014 871 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 371 over it, 1.74\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb41ccab65ba9657655e61a536b637918085354d0802aa9cff756b6c5a62d59"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::content::acceptance_realistic::run_sized: FunctionTooLong \u2014 future_agent::session::content::acceptance_realistic::run_sized 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":"agent/src/session/content/acceptance_realistic.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"88186818c076c700756082fa5c58a654ea84b3a5efa78761054a5b1e565da185"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: GeneralPage.GeneralPage: FunctionTooLong \u2014 GeneralPage runs 174 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d758df0ea4863cbbc3330ed45ea92e299ef54902787c0ad34eee488f55ac25"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Live.command: MethodTooLong \u2014 command 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":"tui/src/workbench/live.rs"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f572ba0e756faec7b266584410727e6dd4926e28b8703f5e3b042db4e482cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Input: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/input.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"82513d0bd6c975ffb46f0e46df37c60868430ffa1ea011ffee4d147af3f4dfd0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RpcCommand: TooManyFields \u2014 52 stored fields. 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":"agent/src/rpc/protocol.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d452e7a8b3b603fa70c1df8d96e9b450a3e009384220aaabe7ddcb67495fb16"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useArchiveView.useArchiveView: FunctionTooLong \u2014 useArchiveView runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/components/layout/hooks/useArchiveView.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"273bb53b4fadbbe009d40cbbf64871af155e10194500f893529cf09d92f1ed9c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useDesktopConnection.useDesktopConnection.connect: FunctionTooLong \u2014 useDesktopConnection.connect runs 173 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"e870ccceda162a7a1f9bb3be3a89751373e73444cd8ffaea653b7c5aaf36b0e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_bridge/observer.rs: FileTooLong \u2014 864 significant 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 364 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":"host/src/agent_bridge/observer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82137684a6f904ec0b41e214b7f1e7788a28d94f7620cf6015c17f3bd4e48aea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteStore.import_legacy_cancellable: MethodTooLong \u2014 import_legacy_cancellable 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":"agent/src/session/legacy_import.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2be972173323bc782675ffa2ccdaa98ad209259f155a7df090b772ea870f5b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Workbench.handle_surface_mouse: MethodTooLong \u2014 handle_surface_mouse 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":"tui/src/workbench/mod.rs"},"region":{"startLine":3541}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c11585bc4f62282a548e13e9daec4ff6b1838e5e07d72fe3343f7a9b07a44c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/browser_tools.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 39 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":"cli/src/commands/browser_tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ec541140fe6969ac6468709e94d6eb46e3e94075c5864c478bc173f8bdc8ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MarkdownRenderer.render_table: MethodTooLong \u2014 render_table 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":"tui/src/components/markdown.rs"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"406ec021b965ffcc0c5db38ba2fcd4ceb35c2698db36baba986422221746f261"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote/RemoteContext.tsx: FileTooLong \u2014 853 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 353 over it, 1.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":"mobile/src/remote/RemoteContext.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec89aa9632477ab98c8802aa7b2fa6cc5c4703b3f6185b166b6a670f1792e320"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useComposerAttachments.useComposerAttachments: FunctionTooLong \u2014 useComposerAttachments runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/composer/useComposerAttachments.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd769d4ce809f1a43f387153837b240f2b0a2bd4b7adbb54cdad236d2688582"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::fork::build_fork_session_with_mapping: FunctionTooLong \u2014 future_agent::session::fork::build_fork_session_with_mapping 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":"agent/src/session/fork.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a0d4c845f9aff4a65e5b7ee217610909bd63758ab7f51293bee1794138e5cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AccountPage.AccountPage: FunctionTooLong \u2014 AccountPage runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/settings/AccountPage.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a24893cccdebc8a2b3a74ca5780cbf51c5779065bb354b309d21f9114d0d06d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SettingsDialog.SettingsDialog: FunctionTooLong \u2014 SettingsDialog runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/settings/SettingsDialog.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"092f9b8d71cac639b7aa4a8bfb008b0a0a0f152502ed160d3fd604f56855a7e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::fusion::with_retry: FunctionTooLong \u2014 future_host::fusion::with_retry 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":"host/src/fusion.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb76321a1cdbc2bc2854e856ea66c8e8f7b13604b9d208f2920f4ac8dd8ca405"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PreviewModal.PreviewLayer: FunctionTooLong \u2014 PreviewLayer runs 169 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/chat/components/PreviewModal.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff0efa8f31716225d379a6ba0aa0a2695b2fc5d17592214cd654d1447b1f83b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adapters/openai_responses.rs: FileTooLong \u2014 835 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 335 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38b768fc3ab4ef1625d598f809d000e3b564f3e1552afc62e83efe67a4b1330"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tasks/TasksView.tsx: FileTooLong \u2014 833 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 333 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb7763e85806dad82c2bfe841433534b96c84256883ce4bb857a7c668488194"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/input.rs: FileTooLong \u2014 833 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: Input (7 blocks, 187-1447). The bar is 500 significant lines; this is 333 over it, 1.67\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":"tui/src/components/input.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2867fa4777e2e2ba0a050b08f0d61b14924f580569757f1050dab45f6d14d44"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Snapshot: ClassTooLong \u2014 665 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 35 methods, 2 blocks, lines 14-993. The bar is 400 significant lines; this is 265 over it, 1.66\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":"agent/src/session/content/reader.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"17694ff15ec4980db9551ec6ce457b200b57d775817de1f8e767f5cfb2b65996"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chat/ChatScreen.tsx: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 325 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":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2759f0dcdd6b3365eb6ea980247d585a9fe19e287fc5e39156dee11e0c849622"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/keys.rs: FileTooLong \u2014 825 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 325 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":"tui/src/keys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a3bfe7d94797c1a334cac64a7800a80ca7494636fd23fc6899c9ef42e73fc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::entry_records::insert_entry_record: FunctionTooLong \u2014 future_agent::session::entry_records::insert_entry_record 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":"agent/src/session/entry_records.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b32954e770518b773aa45a3ace6d7deef8899bf576af83337a1a0207cf4c371"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useAgentThreadState.useAgentThreadState: FunctionTooLong \u2014 useAgentThreadState runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/agent/useAgentThreadState.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae609352aa165bc11ebc2e756f8adad080542ae0561095b25a7a42c5d835c28"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AddToVibeDialog.AddToVibeDialog: FunctionTooLong \u2014 AddToVibeDialog runs 165 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/vibe/AddToVibeDialog.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5b697fb3cdf2fb028d72a85bea722f70f5dacd9ae825fc220e83334b6c2596"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MdParser.parse_block_start: MethodTooLong \u2014 parse_block_start 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":"tui/src/components/markdown.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab15fd91f2b7f11b631a17bb4a8015297ce8eb0dbf6e4268a10ac04ea5a7f87"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: types/mod.rs: FileTooLong \u2014 817 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 317 over it, 1.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/types/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e94709a9ee2303faccb922316a47b019c5f25034f86a809fad3a7560644667a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SseBroadcaster: TooManyMethods \u2014 49 methods, declared across 3 files: broadcaster/journal.rs (22), broadcaster/mod.rs (18), broadcaster/replay.rs (9). 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":"agent/src/rpc/broadcaster/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"556cf35f5d6a0e84ac8d67ea92356e56787161a33465265f1e5a70bb0013d428"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ComposerToolbar.ComposerToolbar: FunctionTooLong \u2014 ComposerToolbar runs 163 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/chat/composer/ComposerToolbar.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9aad7f2d9c73c43867d6ab5e47e4248a1f5837e10ef3fbb3c2ff8c39b3e61a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChromiumPageManager.initialize: MethodTooLong \u2014 initialize 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":"cli/src/browser/chromium/chromium_page.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f65a547d7b828268d304dc90afcd1677a4144347164574961deb8926cbfcd8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::task::edit: FunctionTooLong \u2014 future_cli::commands::task::edit 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":"cli/src/commands/task.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"844234e8064a060bc57fa815505f5447e3d83ba80558f8fc312c448843e1f1b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_remote_server::commands::command_loop_with_ready: FunctionTooLong \u2014 future_remote_server::commands::command_loop_with_ready 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":"packages/remote-server/src/commands.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a79b675755ebb8a6af43c1cb094af64e77e1f687dd53295728ab566c300288"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web/index.html: FileTooLong \u2014 808 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 308 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":"host/web/index.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbd5a52be845a089d627d1366a3c7281a1755832a54ea1a8fce3efeed83a98d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: models/mod.rs: FileTooLong \u2014 806 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 306 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":"agent/src/models/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fb675c3a62e6da8862f6e9035e6da497e6eca562a313076ebd13780c777cf5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Client.spawn_event_stream_capped: MethodTooLong \u2014 spawn_event_stream_capped 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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":2520}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3fa39102d23165fe23bffb4483504de498b0874f42e51684ba08f9c9268087"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Workbench.handle_key: MethodTooLong \u2014 handle_key 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":"tui/src/workbench/mod.rs"},"region":{"startLine":1404}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b77b31601d24c53c58d3289efa7a8eadf982a0a91d6e5fd56ddc5179c5f9a01"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteStore.append_stream_entry: MethodTooLong \u2014 append_stream_entry 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":"agent/src/session/content/stream_entry.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"234c5bd011c4a18f61313e97f78e21b61774a6a8788f943288b43751708f2dda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useTerminalTabs.useTerminalTabs: FunctionTooLong \u2014 useTerminalTabs 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":"desktop/src/features/terminal/useTerminalTabs.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b59d316964e33b68011e5d9409279f4a2db4f91087fdcff21e098c2a2eed7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lib/analyze.mjs: FileTooLong \u2014 790 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 290 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/analyze.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa30c5b5415e61f640a2a8faaaf7a2cc9bf35e8ea4a3b8fc493c61ed92f8d3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ShortcutsPage.ShortcutsPage: FunctionTooLong \u2014 ShortcutsPage runs 158 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7074bc9fc3e84c03ae4a367ab04de15789d96bcdc90caa15eebbed43f2491f3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/projection.ts: FileTooLong \u2014 786 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 286 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ad8e73706be099de607a5fce4d3008f550d4a6ab38d6fa630fceac33cf230e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: content/reader.rs: FileTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: Snapshot (2 blocks, 14-993). The bar is 500 significant lines; this is 285 over it, 1.57\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":"agent/src/session/content/reader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cc7acbceb37a7e69ab27124b43d480fbdec3a86a9e34ef27d07e0c1ee80796"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PendingApprovalCard.PendingApprovalCard: FunctionTooLong \u2014 PendingApprovalCard runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/chat/messages/PendingApprovalCard.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a16c63c440719341ad3ee595e523fc09ae188edb6ad89dad953b4a63877b84"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::fusion::progress: FunctionTooLong \u2014 future_tui::workbench::fusion::progress 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":"tui/src/workbench/fusion.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b5ee829d03aafdcaa530d52989e3692355c479a2c7a711222699088092e6773"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/AgentThread.tsx: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: AgentThread (188-1033). The bar is 500 significant lines; this is 284 over it, 1.57\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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34347e63c21759e45bdd75418ce97b1c22d02790a2c5c05aaa81ef840f0130e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: analyze.analyzeRun: FunctionTooLong \u2014 analyzeRun runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"harness/lib/analyze.mjs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41860a4f0d21452e35617aa49ed3948c9459f6148961da64a791e46e091e5ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/decode.rs: FileTooLong \u2014 779 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 279 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rpc/src/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c28c940052c243e494d3e64d127cf70cbf5f9c249a629bae268ad41a543d1f9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useTimelineController: ClassTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 222 over it, 1.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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7803de41a7397cb66849ee5f953d46089a24e6cc7f7ba249c3f5a1e721ff6bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/mcp_servers.rs: FileTooLong \u2014 777 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 277 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de611f896a717b510fc529f8d624f9f7d11f6e77be4146cef8a02a7aba34c40e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/themes.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":"tui/src/themes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dedb047fbbd435d47624ad77ceb060c14119be48ee95f12da63c4b4084cbb8a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/session_lifecycle.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":"agent/src/rpc/commands/session_lifecycle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebac3f4bc59adc334be61e48945a232bd4d1cc076e2f423b98c8c225f3400ea0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::session::set_session_command: FunctionTooLong \u2014 future_cli::commands::session::set_session_command 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":"cli/src/commands/session.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7495953bd04cf475cf90b19c585c1d09b712c83e03d29ed20e29663a856c16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/session.rs: FileTooLong \u2014 760 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 260 over it, 1.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":"packages/remote-client/src/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1502b79d852589ce9de507de4ab08d701f29b741a19ff67fe9e852994b885f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/syncEngine.ts: FileTooLong \u2014 759 significant lines (blank, comment-only and punctuation-only lines excluded), about 72% of them inside a single declaration: MAX_REPLAY_QUEUE (189-1095). The bar is 500 significant lines; this is 259 over it, 1.52\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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b096e940964c7ad0094accee90fea8429f8fa41228e6543633e9d51dea6fae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ThreadListItem.ThreadListItemImpl: FunctionTooLong \u2014 ThreadListItemImpl runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/ThreadListItem.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f99170e6b21ddcd2dc7d9e47c83dd293d6a7a72b05375a07ccc6127817824a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MarkdownRenderer: ClassTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 4 blocks, lines 1097-2014. The bar is 400 significant lines; this is 203 over it, 1.51\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":"tui/src/components/markdown.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11e6fbff47b34a61b30467f1b25a4a9336fc4d045eff032b044763748737a5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/runs.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), declaring 41 free functions. 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":"host/src/store/runs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2509987d358be52d5fe91adc645215925617795175a301f4237ffc27b305a94"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::headless::session: FunctionTooLong \u2014 future_cli::headless::session 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":"cli/src/headless/mod.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f756792069c63fe3fe7f6272591d8c00267597fc5ff490f6f3935dd4e32a96a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteProvidersPanel.RemoteProvidersPanel: FunctionTooLong \u2014 RemoteProvidersPanel 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":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43db4018843bb68c78b766192ffff9af33650a08a117ae72f1d328e80002806"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::remote_host::business::settings::execute: FunctionTooLong \u2014 future_host::remote_host::business::settings::execute 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":"host/src/remote_host/business/settings.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9284aabfe040bd274781d26ee7617a71010ba2fb9dacd5a9e5bdaa6e5f78d876"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: chromium/chromium_session.rs: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 246 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":"cli/src/browser/chromium/chromium_session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c8764250780a0c1f99b4db2bf50d638fc23791ecf9becd8510440b0caa383a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AgentThread: ClassTooLong \u2014 594 significant lines (blank, comment-only and punctuation-only lines excluded), 4 methods. The bar is 400 significant lines; this is 194 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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a3bf77a57a67ecbcb1e0adf8a45b24ac7f28658e2d0c6f65fc21bb299e1196"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: usePairedDesktops.usePairedDesktops: FunctionTooLong \u2014 usePairedDesktops 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":"mobile/src/remote/usePairedDesktops.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f716c2f89733909db1cc066939c7f4e56c39ea68f927edafae7417166fb6a553"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Terminal.start: MethodTooLong \u2014 start 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":"tui/src/terminal.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7972226c12fa9a74978aaac35c2c714e8d3ceffd25c203c47dc8859321558c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::screen::workflow_box: FunctionTooLong \u2014 future_tui::workbench::screen::workflow_box 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":"tui/src/workbench/screen.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"36775f92eb0b5058775bc374fba69086ff441c32980041fccebcd3fe4538db3e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/remote_peers.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":"cli/src/commands/remote_peers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a281176f0633e0ea42a4d86a12b9db43259fcc7ecfe8ad14a87eda8171b9f576"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteModelsPanel.RemoteModelsPanel: FunctionTooLong \u2014 RemoteModelsPanel 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":"desktop/src/features/remote-peer/RemoteModelsPanel.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"904de0aad78a5ceff802baf8727123c5802395e4f7bd17e4bc952cf49f17f587"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::agent_bridge::session::fork_agent_session: FunctionTooLong \u2014 future_host::agent_bridge::session::fork_agent_session 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":"host/src/agent_bridge/session.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c258017480e1e5756fb71ae3cb932c5215e8beb8d1180f94498e964c1ee70f8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SessionFilesPanel.SessionFilesPanel: FunctionTooLong \u2014 SessionFilesPanel 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":"mobile/src/features/chat/components/SessionFilesPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45ad62591c5bfce23777e5c3875b33b56129d75ea158ae9937ba59f7f5b2741"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote/files.ts: FileTooLong \u2014 727 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"mobile/src/remote/files.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53a8228b7bbef72c105508bdd3e590f418426776938b97c10d9937564f22a74e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::session_status::format_status: FunctionTooLong \u2014 future_cli::commands::session_status::format_status 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":"cli/src/commands/session_status.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed673ffba36834df873c00616851a8bfcd18d616c2ecd93b15d6e0d7a2642f22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteDraftTargetChooser.RemoteDraftTargetChooser: FunctionTooLong \u2014 RemoteDraftTargetChooser runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/remote-peer/RemoteDraftTargetChooser.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"412eb2b47fece552fd6035e06425630774cdf509aab9607c30fa33bc36adfd0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useTimelinePaging.useTimelinePaging: FunctionTooLong \u2014 useTimelinePaging runs 145 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/chat/useTimelinePaging.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"60412586a38c78b363e1201be2eed39f588e09bb5930ac63f92e0f76decc4d30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runtime/scheduler_queue.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), about 65% of them inside a single declaration: InMemoryRunQueue (2 blocks, 310-1065). The bar is 500 significant lines; this is 224 over it, 1.45\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":"agent/src/runtime/scheduler_queue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c56455ee7780307d5bba2f2ceb7b71a03bfc3ea8ae770875edfca08eaa76a24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/MentionEditor.tsx: FileTooLong \u2014 724 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb07c891f0c26a1dc00cd5165b92ac114ba7b8cb2b12f8a7f77c523599e87f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: llm/schema.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":"agent/src/llm/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54ffaeceb0c409296aab381046fae32714e39b1ea9140cd9a243b8e37bf00516"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/data.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":"cli/src/commands/data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0467fd6df871a0a3ae3bc7c6233f30e6b89ae1a4182276d0cf450e42844166a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_remote_server::commands::handle_command_inner: FunctionTooLong \u2014 future_remote_server::commands::handle_command_inner 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":"packages/remote-server/src/commands.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a65b321d7e98b67d2a21f148a9f8754e1c134b694af93c7510bdf6286ce3b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/threads.rs: FileTooLong \u2014 719 significant 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 219 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":"host/src/store/threads.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b634c6300e1f3266e22314bddf94fe239b789f91d7a24edc9cc16c76147812d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/irc.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 215 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":"channels/src/providers/irc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b794351a3b235322a1e799d8457cb0edb11cfaf4c278be5634ee13070fb642"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::run::parse_run_args: FunctionTooLong \u2014 future_cli::commands::run::parse_run_args 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":"cli/src/commands/run.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"40571138409d97ab73fd5964ad040402263c0782a4ef36a67ecc932c3ec9306f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rpc/export_html.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). 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":"agent/src/rpc/export_html.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16f8176a3fc221b534aeff716f3749d7eaca8c1ca58e7697ae7c669992455c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/journal_reclaim.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). 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":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6f2c53cbec83d901348c35a1267da31289dc775e85c25811b3313a3eb51db8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AssistantRunProjection: ClassTooLong \u2014 568 significant lines (blank, comment-only and punctuation-only lines excluded), 0 methods. The bar is 400 significant lines; this is 168 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a9329548863453ebe4e9419b61af28b16ea33933f73b7f9bba6ebef71b5a81"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Manager.create_segmented_fork: MethodTooLong \u2014 create_segmented_fork 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":"agent/src/session/manager/fork.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0ff0a6eb393f214ed8c3330e0ebce9f57ecd70e3ca7fc314270a7d7e71b996"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::content::entries::stage_named: FunctionTooLong \u2014 future_agent::session::content::entries::stage_named 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":"agent/src/session/content/entries.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddfdfc30069a15327f9352e13e01116b48fb91bac2f5ae132460f3068c58260"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRailSelection.useRailSelection: FunctionTooLong \u2014 useRailSelection runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/components/layout/hooks/useRailSelection.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a88cb00366e41a56b8dacee0aa52f0a40a75c32ef01c73d6b123079e3d05ae4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::session_transcript::parse: FunctionTooLong \u2014 future_cli::commands::session_transcript::parse 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":"cli/src/commands/session_transcript.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"91537ab3e3f18255b3e187a9ea15d86c3ed7b88ff51560dcb1030e466e2adde0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::session_transcript::run: FunctionTooLong \u2014 future_cli::commands::session_transcript::run 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":"cli/src/commands/session_transcript.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ecae88f28ece80d7ccb658704bca6dff9f8a14f4e8332d632271f5ac2e661c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ReviewPanel.ReviewPanel: FunctionTooLong \u2014 ReviewPanel 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":"desktop/src/features/review/ReviewPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ada65306981c67577597a97a3c5080933209d035fc96aff938e669adfbe12e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ChatTimeline.ChatTimeline: FunctionTooLong \u2014 ChatTimeline 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":"mobile/src/features/chat/components/ChatTimeline.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e9cec395663ae03a7d15d90ce72ac891699870c0074a51f5f5dc8c28d3e2f2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AgentHandle.drain: MethodTooLong \u2014 drain 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":"agent/src/service/shutdown.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"af76ab173102051451d2ca316745f5886fc03db835323abc58e2bf4aa691b5a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useTransferOperation.useTransferOperation: FunctionTooLong \u2014 useTransferOperation 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":"mobile/src/features/chat/files/useTransferOperation.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3349cafef7205f33da2de6a0c634033ad0db5566d71a1fa87f8f44351714989e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Transport.handshake: MethodTooLong \u2014 handshake 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":"packages/remote-server/src/secure.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72982fc1f35760b13b82dcce2a5ab247d7b6b16654ed15f8e54a2e8e952e2fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_rpc::command_policy::command_policy: FunctionTooLong \u2014 future_rpc::command_policy::command_policy 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":"packages/rpc/src/command_policy.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"505dcb2a47c9eb0fc9a90d23ccf60438addf36a8ee2b7151e7cefa586c927382"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_rpc::encode::event_payload: FunctionTooLong \u2014 future_rpc::encode::event_payload 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":"packages/rpc/src/encode.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"711d323d4f87966b43254871d2821990ab07587677dce59c23c605fee6bad7f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: compaction/semantic.rs: FileTooLong \u2014 692 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 192 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":"agent/src/compaction/semantic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8528fc6e043f8eeac63599ded0c9f24c42f2a983c80e72fceecd448c366c4dcf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useSessionCatalog: ClassTooLong \u2014 552 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods. The bar is 400 significant lines; this is 152 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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca1cb1b4a15d81d7f9aa7e1e5f8848c70997e5b56d9fdd8e027dd6098af5572"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_channel::bridge::turn::run_turn: FunctionTooLong \u2014 future_channel::bridge::turn::run_turn 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":"channels/src/bridge/turn.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"eecdc5746f3938b9d120bae9139fe8a7c6afe5c755c9834f2b56bc3e327defc2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::data::finish_restore_with: FunctionTooLong \u2014 future_cli::commands::data::finish_restore_with runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/data.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9ab26c855255292f5b93266963f90ef634bbbafe8eb1c0a73461dde78436d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.rs: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 181 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":"orchestration/tasks/src/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7789c6a4ee27dd83094da0d798fb69f54d96e985e537f87a81376d4663ac8ea0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::prompt::build_sessions_section: FunctionTooLong \u2014 future_agent::prompt::build_sessions_section 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":"agent/src/prompt/mod.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1a6019fe85e39b2a5538697382cb4d0e4a8cdde5861085cb5396a70108878f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: report.writeReport: FunctionTooLong \u2014 writeReport runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"harness/lib/report.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f64a09a9759cdd83f1a4f85557dfe452b5ade325b8dca28e6cb08c6ba09ea5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useChatFiles.useChatFiles.openAttachment: FunctionTooLong \u2014 useChatFiles.openAttachment runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c659760948f29ed4350c585f653d173f0f07bb97052bed46a6fc7e021e2738"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Snapshot.capture: MethodTooLong \u2014 capture 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":"orchestration/fusion/src/files.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e0288726071fd0aa19b7ce80dc0e24a68ab1883a8a2f212e6934ef651ccae0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote-peer/remotePeerClient.ts: FileTooLong \u2014 676 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 176 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"809c51289a6f5244cb58291b65cdcbba61d06dbb571ce3ffaa5433640cf1ad65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::configure::collect_custom_provider: FunctionTooLong \u2014 future_cli::commands::configure::collect_custom_provider 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":"cli/src/commands/configure.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"7969eeb61a1e406941642db69cb0f202feb05eb16e78a0ea63befca74d0abe69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/telegram.rs: FileTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 174 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/telegram.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32aa2c1cb83587cf23c0f0cfb8946c9d1192b651420c42cb3e5f14129ba07ab7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RunInspectPanel.ToolCallDetail: FunctionTooLong \u2014 ToolCallDetail runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abca2a1be55c1ead01a2064d4ec95ad2081b133192c51b3d759a3d20bc827f2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ShareIntakeMenu.ShareIntakeMenu: FunctionTooLong \u2014 ShareIntakeMenu runs 134 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/share/ShareIntakeMenu.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e8070f3c0df802d2ac345b13e79a3b17ff274b70b05127ae2045383bbcdc80"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::syntax::spec: FunctionTooLong \u2014 future_tui::workbench::syntax::spec 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":"tui/src/workbench/syntax.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d8878ba505c33e0646b9af1fa5aa422312da01000e3effd02f4219e3ef45e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: supervisor/start.rs: FileTooLong \u2014 669 significant 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: Supervisor (116-1168). The bar is 500 significant lines; this is 169 over it, 1.34\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":"packages/remote-server/src/supervisor/start.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f22fdb24f4741773c0d7d966c9cacb72b7c7e85c0b2804f3010192fb518c99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/index.rs: FileTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 168 over it, 1.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b7e80eee9ba1b2a8bed96066dc509df0342558b78ddff9896397ede80bdb8e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: future_tui::paste: TooManyFunctions \u2014 40 free functions. The bar is 30 free functions; 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":"tui/src/paste.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b9c648ce9efd231643d6dac42979a93949bf3309b093245377f2176e4d6310"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::screen::conversation: FunctionTooLong \u2014 future_tui::workbench::screen::conversation 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":"tui/src/workbench/screen.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d16b4db4e3165d72ddebcb0e234037406c0af33f4429580cde3bf71ba1ba6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tools/mod.rs: FileTooLong \u2014 662 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 162 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/tools/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9436a7aa74d9962f22c1ae442ea28f06fa658486e425d6a70e7729a1f73d8fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::history::display_projection::project_entries: FunctionTooLong \u2014 future_agent::session::history::display_projection::project_entries 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":"agent/src/session/history/display_projection.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8847b9e50bcaa6c90f98a8d4d5b578e6eb7bb06201c7ee197009086869edeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::session_transcript::filter_entry: FunctionTooLong \u2014 future_cli::commands::session_transcript::filter_entry 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":"cli/src/commands/session_transcript.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d49ecaf40e179d305b0b1939ce7747fdc3184f9767876102fc6a01bfaeabb66"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteWorkspacesPanel.RemoteWorkspacesPanel: FunctionTooLong \u2014 RemoteWorkspacesPanel runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/remote-peer/RemoteWorkspacesPanel.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8212e7b2e5190b8d22510fbd5e30fd53a92d845c1f8d06cd3bd4dad927bd123a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Supervisor.start_slot: MethodTooLong \u2014 start_slot 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":"packages/remote-server/src/supervisor/start.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b83ed7bf35af9c1fb3edb6edc89fb8974562a0d84e573b0d99fdfa5eff4f03d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Live.handle_event: MethodTooLong \u2014 handle_event 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":"tui/src/workbench/live.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"462245a6d48e43aaa2235bfe459298f6dce499deb333fc5eb12f85c16ac72640"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skills/SkillsView.tsx: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 159 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbb90d558f06073d4264a184b89fb2bf4181cdb9ee7652858abecf18963f0f1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ApprovalGate: ClassTooLong \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), 16 methods, 2 blocks, lines 28-808. The bar is 400 significant lines; this is 125 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":"agent/src/rpc/approval.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52f01f33dda49861dd9962bac4b20e9fd5e916928b54f1e0c26c7fb071367fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/configure.rs: FileTooLong \u2014 655 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 155 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":"cli/src/commands/configure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e33ebe6146af0eb0cd29deb9f3b02e218d312b81179c0c4fb59ffc83ec5bcd2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ApprovalGate.request: MethodTooLong \u2014 request 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":"agent/src/rpc/approval.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"834415a019e88ae43a47d6a45671feba63113f4170393ee0ff1f198ef8134293"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/discord.rs: FileTooLong \u2014 654 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 154 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":"channels/src/providers/discord.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"307b5bc63a519c9c9af6ca11e998f78c04b4936ab429f61b3370165bb93c0e0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mock/data.ts: FileTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 151 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":"mobile/shot/mock/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"993e7f0279c151efac37d66396738a9e5d6aded096a436ee987809b7de6c98b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: future_host::application::threads: TooManyFunctions \u2014 39 free functions. The bar is 30 free functions; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/application/threads.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fc96c35b4759015497be4fe103737e4c6c2dd0dfcc59c6cb3cdb8334b010ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote/useTimelineController.ts: FileTooLong \u2014 650 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: useTimelineController (75-990). The bar is 500 significant lines; this is 150 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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e057577f3b3016cf32372fb43f1619530785d919f7dd10c1102cd4dbb0f1c1c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::reset::plan_reset: FunctionTooLong \u2014 future_agent::session::reset::plan_reset 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":"agent/src/session/reset.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"427bca906fd250e6bc3af55d1a6f795bf60c273185f00ccb4b3e0bbbf3049f65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteWorkspaceMenu.RemoteWorkspaceMenu: FunctionTooLong \u2014 RemoteWorkspaceMenu 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":"desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d8b434c8126ba0cce17d7d4c9e6de3461538b846c2df8a366b5c8809dbcf99"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CustomProviderDialog: ClassTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded), 3 methods. The bar is 400 significant lines; this is 119 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"307da922e593ea8909743d2cd9fae7bb82fd44012e5dd0d0e3ca91423763f75d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_bridge/queries.rs: FileTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 148 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":"host/src/agent_bridge/queries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df05e428df97e789346bb41a1478e79c62ec62b772619738b92ff16cb724d78a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::screen::preview_box: FunctionTooLong \u2014 future_tui::workbench::screen::preview_box 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":"tui/src/workbench/screen.rs"},"region":{"startLine":3463}}}],"partialFingerprints":{"codehealthFindingId/v1":"12be658f69fcfa987d0751b8cc5f9403a85016345b6bea5f8a83ba04afd2b110"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: skills/manager.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 79% of them inside a single declaration: SkillManager (2 blocks, 107-832). 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":"agent/src/skills/manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faf38e8df8b7669f6709515938b2ad602474d2413c21c32c73f74445a37843d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: grpc/mod.rs: FileTooLong \u2014 642 significant 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: FutureAgentService (2 blocks, 144-885). The bar is 500 significant lines; this is 142 over it, 1.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":"agent/src/grpc/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be35f8346b81060d553aa0fe7f076e63c8cd5214ddce27aabbdf712664ab259"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: CommandPalette.CommandPalette: FunctionTooLong \u2014 CommandPalette runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/palette/CommandPalette.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02dad190e2a96e1e94eb3954af017c46c57a9d4d833db789de14ad89119de34"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SkillManager: ClassTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 2 blocks, lines 107-832. The bar is 400 significant lines; this is 110 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/skills/manager.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc4546efbd7aacc545b36635514683e67d8001f1a22c575e45d885c9f8ce4925"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/liveApply.ts: FileTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded), about 89% of them inside a single declaration: AssistantRunProjection (16-940). The bar is 500 significant lines; this is 136 over it, 1.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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcadaefa1e11b7dd6941508b7fdc9f580c05d3dc866bd1eff0ff99c05b7b70ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/supervisor.rs: FileTooLong \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), about 64% of them inside a single declaration: Supervisor (4 blocks, 189-1216). The bar is 500 significant lines; this is 135 over it, 1.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":"packages/remote-server/src/supervisor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4089f16685644877ae5871742e14bba39176d70cc37e51d267078b91f549a6d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Snapshot.batch_summaries: MethodTooLong \u2014 batch_summaries 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":"agent/src/session/content/reader_summary.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"67edbca6d650241790b301b2b2b5586752053c6f274d2a2720fdf2a86790acc3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/encode.rs: FileTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 134 over it, 1.27\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rpc/src/encode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db5e3fa965b394aba69e6be9f3fad4f26dc5f929c597523e8f9c459c0f3ede0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Supervisor: TooManyFields \u2014 38 stored fields beside 118 methods. The bar is 30 stored fields; this is 8 over it, 1.27\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":"packages/remote-server/src/supervisor.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdb26d88891f9b446d67c6e348fc4ec829eacb7215c3603ccbe2272c6d40407"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workbench/git_panel.rs: FileTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 131 over it, 1.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/git_panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e3fb2f1b8a0b0f6020e4963609dfeb752397361676b77d461560cc27250ec0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Input.handle_key: MethodTooLong \u2014 handle_key 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":"tui/src/components/input.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d22bfe722c73fe8758fac124e7e041bc6ed36350a88d2a087ca695ca8e9b60"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::agent_providers::validate::validate_custom_provider: FunctionTooLong \u2014 future_host::agent_providers::validate::validate_custom_provider 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":"host/src/agent_providers/validate.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82526bf35a8dbfd9306ab14b262dc324222f45f2fb506a79759953798919f43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::demo::base: FunctionTooLong \u2014 future_tui::workbench::demo::base 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":"tui/src/workbench/demo.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea61528febedf91e7d49654db92089461422d887419f0f8ceebb6b330ade3af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::launchpad::render: FunctionTooLong \u2014 future_tui::workbench::launchpad::render 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":"tui/src/workbench/launchpad.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5190848276fdc006e57ca52289e6c1d2754c72f6729428b32c846cada03fd69e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent_bridge/reconciliation.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":"host/src/agent_bridge/reconciliation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7509c8b384e3c808fcb73ca25790a5e1e1217c4dfa960e8455af45930577de47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::rpc::commands::providers::provider_view: FunctionTooLong \u2014 future_agent::rpc::commands::providers::provider_view 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":"agent/src/rpc/commands/providers.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ccaeb90a800597c1d74a1c52abf52c2280b424f5d7c1e03ffb81a0d32a82d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::content::stream::commit_batch: FunctionTooLong \u2014 future_agent::session::content::stream::commit_batch 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":"agent/src/session/content/stream.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad8755aa555e147909db246ce601bec3146f9691af8019513e4a8fbcfbcb71d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteFilesDialog.RemoteFilesDialog: FunctionTooLong \u2014 RemoteFilesDialog runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/remote-peer/RemoteFilesDialog.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef336aaed871a9822fb64433a3cfcfe487db3025cfa70e1639bac74857f56d41"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: analyze.deterministicFindings: FunctionTooLong \u2014 deterministicFindings runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"harness/lib/analyze.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f22f01afa227f380f1e1af583bbfb5fea02fa8a8ad80754c5504633b405bf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: terminal/server.rs: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 119 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":"desktop/src-tauri/src/terminal/server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4489c111f0f49fb19e604ac42f5f4a0f5883496f098e01c691bf75738bc7da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/model_settings.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). The bar is 500 significant lines; this is 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/model_settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e446299512911e89a5380df8f5787d425a0e95539c645d8adc6391854425441"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: future_tui::skills_cli: TooManyFunctions \u2014 37 free functions. The bar is 30 free functions; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/skills_cli.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"266cbf64f0703174212885f2088707217a934ea892fc4cfecc7b16639695f846"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: GetStatePayload: 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":"packages/rpc/src/payloads.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0e2f8e60a6e0d72be75b28ca8109915b6ac37dc49b1a33e58e82f2ebebf1d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runs/RunInspectPanel.tsx: FileTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 116 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c72396a9a79ec34b27254fd2b396acac72909662e2111059786f067e43568d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::session::info: FunctionTooLong \u2014 future_cli::commands::session::info 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":"cli/src/commands/session.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78bac7a5522e46f9a0eebba8023efeb6798d7731f3b1e9b7cbdd25a1a2a4905"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::session_journal::run: FunctionTooLong \u2014 future_cli::commands::session_journal::run 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":"cli/src/commands/session_journal.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"e780d8c20ca5cb63be3f9eeb75690f6ec6d77b35ed130a3b8178ec7c486c58e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::remote_host::business::prompt::execute: FunctionTooLong \u2014 future_host::remote_host::business::prompt::execute 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":"host/src/remote_host/business/prompt.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fb6aa011663f2896876153e729d1c442d74bc138b1ed7e9a9f90b7b01ae35d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: replay.readRunReplay: FunctionTooLong \u2014 readRunReplay runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/thread-projection/src/replay.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ded6805e846e5875ce4a70546b33e619b7440779592c0e9e70b44c2d15f15c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::screen::controls_row: FunctionTooLong \u2014 future_tui::workbench::screen::controls_row 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":"tui/src/workbench/screen.rs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"4600db8cb0df0174cef40dce2df501101098a915beeb7c58a9f8ae46303a5c62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/slack.rs: FileTooLong \u2014 614 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 114 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/slack.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"123a0490203dc8b776ff3964938f09088f0621ab2f0e49e279f309de1ed1c569"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FutureAgentService: ClassTooLong \u2014 491 significant 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 144-885. The bar is 400 significant lines; this is 91 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":"agent/src/grpc/mod.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"337a37f44569061360c138c657f827e280b42ef52e649f9c1bbc6af0ab879734"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::browser_tools::browser_start: FunctionTooLong \u2014 future_cli::commands::browser_tools::browser_start 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":"cli/src/commands/browser_tools.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ed4ade900c0ffef305a2ee4d9cb0f2fcd6d70c9d84ac4730f94006fbc6b24d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useFutureLoginFlow.useFutureLoginFlow: FunctionTooLong \u2014 useFutureLoginFlow 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":"desktop/src/features/settings/useFutureLoginFlow.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b54ce42c1aeec50a43ec63dae821cb892557437d74f3dbe3ea84ee2fad2add"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MdParser: ClassTooLong \u2014 485 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 2 blocks, lines 385-1093. The bar is 400 significant lines; this is 85 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":"tui/src/components/markdown.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7d07f86fc736573135c4494232f95d1d4bae01587363b6117f93d7f526fb35"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::remote::list: FunctionTooLong \u2014 future_cli::commands::remote::list 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":"cli/src/commands/remote.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3b1ec141b6642d467ff436369cc2d79f4699bc7886f9083aa7ee33b53f9932"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AlbumPickerModal.AlbumPickerModal: FunctionTooLong \u2014 AlbumPickerModal 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":"mobile/src/features/chat/components/AlbumPickerModal.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09275f1b5a04e9acfe3b7ee52b654fa593112e976b07543f2d135830b9408ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSendMessage.useSendMessage: FunctionTooLong \u2014 useSendMessage 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":"mobile/src/features/chat/useSendMessage.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a07b29638c78310f8368587b027be811b973792a5c9b5013d6f67261a59f29b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/doctor.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 101 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":"cli/src/commands/doctor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"feed2d7b2ad7cc0f536a04f892e40de2540a16a7b583baa44e656940eab7a73e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::rpc::commands::session_reset::handle_reset_session_history: FunctionTooLong \u2014 future_agent::rpc::commands::session_reset::handle_reset_session_history 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":"agent/src/rpc/commands/session_reset.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1115bab7f91929fe866b0702093ac653b711472215e2db8176aae7132dc6c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DeviceSelector.DeviceSelector: FunctionTooLong \u2014 DeviceSelector runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/components/layout/DeviceSelector.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e57439f0c0af83d93265427679af8737d7145c00499b2dba334ec3ba4a17d023"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useContextData.useContextData: FunctionTooLong \u2014 useContextData runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/components/layout/hooks/useContextData.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e153db8d68b779fb368c233e0d83acdddb14104d44f72c64bce27c3b31b870"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RailViewSwitch.RailViewSwitch: FunctionTooLong \u2014 RailViewSwitch 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":"desktop/src/components/layout/RailViewSwitch.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a108509c6a4b0e392cd849917d43bc08d68aaed9da8e288860ac688c6e3f15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useSessionMessageEvents.useSessionMessageEvents: FunctionTooLong \u2014 useSessionMessageEvents 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":"desktop/src/features/agent/runtime/useSessionMessageEvents.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"871221415524797954ad8af3f9042d1634cb9dae517010f7054a985a069394bb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SkillsView.InstalledTab: FunctionTooLong \u2014 InstalledTab 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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"465f6641a153bf0729b76beb15cf43fe2d45c84b6f3298ec5b271a13a445f616"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyncEngine.runReconcile: MethodTooLong \u2014 runReconcile 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b0e90b47fff313d8ffcc0cef61ec87b65160a1a1824c360703d054377bb43a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote/useSessionCatalog.ts: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: useSessionCatalog (64-954). The bar is 500 significant lines; this is 91 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98534c421838ef4b753eff338418a54ad60698dec667bc8cdd7a7ca0a552f740"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::model_settings::model_set: FunctionTooLong \u2014 future_cli::commands::model_settings::model_set 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":"cli/src/commands/model_settings.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dab03f78cf8684b8c3b886a42773ce544c055d554fbda0104bda8da0718066f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Workbench.click: MethodTooLong \u2014 click 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":"tui/src/workbench/mod.rs"},"region":{"startLine":3862}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1792a7b66476f0124662e5d206bf223c53893eb731081ced6f99270c7f10eed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Loop.execute_tools_sequential: MethodTooLong \u2014 execute_tools_sequential 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":"agent/src/agent/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1ecb113b9c315051817fb58edd04c3770bee0558e72be5aad78ce764c0bddd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::index::apply_cli_options: FunctionTooLong \u2014 future_tui::index::apply_cli_options 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":"tui/src/index.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"34123c6b66bd1802936c27b4d24cdd8f5aa972c0f0ae505392a9667e13768625"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Live.attach: MethodTooLong \u2014 attach 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":"tui/src/workbench/live.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"339d10b0eb7390a0d3b2c85ec2de74f38a5bbbbb6ad88fc4cbc2dd6cb082d604"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InMemoryRunQueue: ClassTooLong \u2014 467 significant 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, 2 blocks, lines 310-1065. The bar is 400 significant lines; this is 67 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":"agent/src/runtime/scheduler_queue.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2773701b04e345665291722c2c458cf014175343346694f56fc84478ff785a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Snapshot: TooManyMethods \u2014 35 methods, declared across 5 files: content/reader.rs (27), content/reader_recall.rs (3), content/reader_summary.rs (3), content/reader_derived.rs (1), \u002B1 more file(s). The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/reader.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d511a43d6238ed985cef797f893c2fdf1559d05ad2f60d1953bc9f9896acf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: workbench/picker.rs: FileTooLong \u2014 583 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 83 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/picker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a13576657ce6e66072b2a69c1ee36c7cc52bfb7ff453139fa9b33b2c5427aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/journal_compaction.rs: FileTooLong \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 80 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":"agent/src/session/journal_compaction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70a34c5aa47bf2772423800d6bdae92bc6d7b09ab52cbe5c610bcc82ad65977"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRemoteFiles.useRemoteFiles: FunctionTooLong \u2014 useRemoteFiles runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/remote-peer/useRemoteFiles.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69090afcaa7c90b14cfbe728bee53159203d70cd9efdc9d8795bb3994ab79a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MarkdownText.buildStyles: FunctionTooLong \u2014 buildStyles runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9a44ed46cd1ca45c73b893f5af4e2f6939b25727fd54d5514552096aa34463"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RenameModal.RenameModal: FunctionTooLong \u2014 RenameModal runs 116 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/chat/components/RenameModal.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"8def238fc79361980b43708645c161b29ecfb3fa229523c557413a20ff739b1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: settings/CustomProviderDialog.tsx: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: CustomProviderDialog (100-767). The bar is 500 significant lines; this is 76 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"889a8e21a4efa125272dc5857d07cb3a4f1f058936264eacadc8e8c1a7d80790"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::models::models: FunctionTooLong \u2014 future_cli::commands::models::models 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":"cli/src/commands/models.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"041e58f376835a087ca99a3fb75515f344264b24ecb1faf4c3838892518ca427"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Live.data: MethodTooLong \u2014 data 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":"tui/src/workbench/live.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d9dbf49dff81e2db8f51ed022d89b8d5014cf9ac53cfbbfa5ff2ab097ba046"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: content/entries.rs: FileTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 72 over it, 1.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":"agent/src/session/content/entries.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b468c49b1e89a15c21b1bddb999a65131935f46a5f00c9db7918f302f5d12895"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: llm/mod.rs: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: Client (3 blocks, 105-792). The bar is 500 significant lines; this is 71 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5310ebbe41f9ba57fa06ef659a1deaa3168ff017c88f05bb5302277c9912f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: rpc/approval.rs: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: ApprovalGate (2 blocks, 28-808). The bar is 500 significant lines; this is 71 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/approval.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"debd4373de6badba1b53ec66c752290048174d04b47419d763f8117e92b98046"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::history::paging::materialize_display_page: FunctionTooLong \u2014 future_agent::session::history::paging::materialize_display_page 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":"agent/src/session/history/paging.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3466548120510c7d18226642556aa747454b10f14e089e3795523f51d07c757"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Manager.read_history_page: MethodTooLong \u2014 read_history_page 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":"agent/src/session/history/paging.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"164a2073fc1ed34043d23c779d89b61a875c8c9c3e5869c06a9cc626524d5c03"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: futureos::commands::threads: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; 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":"desktop/src-tauri/src/commands/threads.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"784e7d5be43e315bf428761fac160a9fbb6d3c1dcba6828bce96592541b1dc69"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: future_host::agent_commands: TooManyFunctions \u2014 34 free functions. The bar is 30 free functions; 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":"host/src/agent_commands.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45f22ad7c398ba5aafc78495966ba04d3f3039146cd779b2269ed16da7cadcd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::compaction::semantic::evidence::prepare_with_handoff_summary: FunctionTooLong \u2014 future_agent::compaction::semantic::evidence::prepare_with_handoff_summary 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":"agent/src/compaction/semantic/evidence.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ba365bf8559b95f3631dda0660ad8ebe7071909dded6b7e52c08b14a63d1c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: remoteTerminal.remoteTerminalTransport: FunctionTooLong \u2014 remoteTerminalTransport runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/terminal/remoteTerminal.ts"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bbfc9db409700c2813cf1fc6ad31769a319fb4e968c8435197d4d6621982ec"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::content::compact::validate_layout: FunctionTooLong \u2014 future_agent::session::content::compact::validate_layout 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":"agent/src/session/content/compact.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"534a7f33413df3334edf22f354e3ba5cc281c1ff182a2b0db5c7582ca46264e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::database_backup::create_database_snapshot_cancellable: FunctionTooLong \u2014 future_agent::session::database_backup::create_database_snapshot_cancellable 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":"agent/src/session/database_backup.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ba43f2ec4c51a100e8d42253bc697e25ed551052ab350203b5f4fe124c3109"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ActivityRailSelectionToolbar.ActivityRailSelectionToolbar: FunctionTooLong \u2014 ActivityRailSelectionToolbar runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/components/layout/ActivityRailSelectionToolbar.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced604ab03cfde9e509d1f868bcaded36e41c51a5e29b4bd4f2d0ad34cad1cab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PdfPreview.PdfPreview: FunctionTooLong \u2014 PdfPreview runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/artifacts/PdfPreview.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d4344de2aa0ba0a7db13fd61f65cdd1b317a22bb46488fd674ccf2133b5469"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::remote_host::files::prepare_preview: FunctionTooLong \u2014 future_host::remote_host::files::prepare_preview 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":"host/src/remote_host/files.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce4d0c664dbdc9ed88cc1c924dc27f1ba55824d12146dc0e0f7783c631386d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: projection.applyEvent: FunctionTooLong \u2014 applyEvent runs 112 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"678ad062fd5277a27291aab647356a3f16e85eca8431ab4ba3a0fc44ae057eb5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::index::parse_args: FunctionTooLong \u2014 future_tui::index::parse_args 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":"tui/src/index.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca17ef7993d19753b348ec2455393838619040d4dccf8c871119afe6f7306cd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::screen::header: FunctionTooLong \u2014 future_tui::workbench::screen::header 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":"tui/src/workbench/screen.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"756686534b43e03d734996fbe7ba53a1e9943a446adb4ed0935e11fa20e73c11"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/signal.rs: FileTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/signal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6982775ee307f76dde663bf682cc31940cc725699736a10556888941bfb2d8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Client: ClassTooLong \u2014 446 significant 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, 3 blocks, lines 105-792. The bar is 400 significant lines; this is 46 over it, 1.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/mod.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a07a40531a98a3a53f41c536eb10bdf8136f8573289cb7e2885eaf4f3b0d478"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: shell/execution.rs: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 57 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/tools/shell/execution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0203d97a8f39581dd4ce112fc2625ec513a46f11e383c5ce39a043c291e16218"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/settings.rs: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c20ede4e1ce585da15216ce0376553439f8d556958b99420991d589f7a7da5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/MarkdownText.tsx: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a8f3447ccb728fc819131ce54517cbe326d8a57531e5ca0205a1e1d2be909f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::compaction::durable::admit: FunctionTooLong \u2014 future_agent::compaction::durable::admit 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":"agent/src/compaction/durable.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc06c364cba4b8de876b0a9b5cb754b9a50f8844163a8da6fed97c51fb64ce2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteStore.finish_segmented_checkpoint: MethodTooLong \u2014 finish_segmented_checkpoint 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":"agent/src/session/content/checkpoint.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb4f294476ca32ac06def8ba71d74264c68110c80d57b7b287810ffc3d55271"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::history::paging::read_display_page: FunctionTooLong \u2014 future_agent::session::history::paging::read_display_page 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":"agent/src/session/history/paging.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79475cb78d2d39a999b8ae9709da332eed0cada24412c8a383fa5ea7c06db72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteConversationSettings.RemoteConversationSettings: FunctionTooLong \u2014 RemoteConversationSettings runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/remote-peer/RemoteConversationSettings.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"917ffb8d1e78f6a91adbe48a1e5e6db557e1cee94a9e5e54b7c1b636bfc85325"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ActionMenu.ActionMenu: FunctionTooLong \u2014 ActionMenu runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/components/ActionMenu.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbde7074892a731af543e1b9c70b56228734666b2af864930dab11aa21625970"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PairingScreen.useStyles: FunctionTooLong \u2014 useStyles runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52784e7b4c8c793c3378478f2ac88251219ed708e2d4890ab03464aacbc693b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: agent/Composer.tsx: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: ComposerImpl (233-1008). 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da22b6fe286de210cf72f47499ec3839a65b5dc676d0a41f1a8c5d8081110d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/terminal_image.rs: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 42 free functions. The bar is 500 significant lines; this is 53 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/terminal_image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"283d247aa87b75445919744e973b5c7657d4b3dd3d20149133c5d52f01f7afe6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SyncEngine: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c111c7e99c1d9b7a06c4861b6075c4a2b23646a262a8c8e96a23c3879112ba77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: headless/mod.rs: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/headless/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1690aa4f2e689bc677d5245060dd77fab9456dfff702a0deb2de125a51431d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SkillsView.AllTab: FunctionTooLong \u2014 AllTab runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d43f643beee327b29e3e93e0fd874aa1a0d8cc7b90a5f3ff9f91905a87cabcb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ZoomableImage.createZoomController: FunctionTooLong \u2014 createZoomController runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/features/chat/components/ZoomableImage.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb52c447d4586f2c361461e17e91abff49ba4b8673badaeb1c5a88efb5789933"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Workbench.handle_workflow_key: MethodTooLong \u2014 handle_workflow_key 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":"tui/src/workbench/mod.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6fe180c441b0b07ff2c9e04b005c58dc992942e956da9fac1086655dfa3269"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ApprovalPrompt.ActionDetails: FunctionTooLong \u2014 ActionDetails runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"c738f5ac80f4ab73c46d44bef950251f59e770d5a42593b95c52dee764555389"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RemoteApprovalMenu.RemoteApprovalMenu: FunctionTooLong \u2014 RemoteApprovalMenu runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/remote-peer/RemoteApprovalMenu.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19dd4d15c94d7faa783c72412c774c72d45b5f363db228729b9d3531b5963e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: remoteTerminal.remoteTerminalTransport.open: FunctionTooLong \u2014 remoteTerminalTransport.open runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/terminal/remoteTerminal.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f761727ad9cc94165bff9978e6be5ee4c5af41b481013ac9071c0a40e3454c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::application::threads::read_thread_history: FunctionTooLong \u2014 future_host::application::threads::read_thread_history 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":"host/src/application/threads.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1066d08303bedcfd5d2f92281dda1152f1298f5019ececb5ea198b447342d52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChatArea.format_tool_call: MethodTooLong \u2014 format_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":"tui/src/components/chat_area.rs"},"region":{"startLine":3827}}}],"partialFingerprints":{"codehealthFindingId/v1":"209fd8c66f4462acc5631fb385b50dd114c99da8a547be2462b2823fbe2a0b7a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MarkdownRenderer.render_block: MethodTooLong \u2014 render_block 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":"tui/src/components/markdown.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8c26009692a1a15d9e1b5aa69370c8e6d6c250ce50e464f038e12dbc0933c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parseFutureMarkdown.ts: FileTooLong \u2014 544 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 44 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":"packages/markdown/src/parseFutureMarkdown.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d836b575c9773cb36104246e824d0ac91cac72b33f73e5a3456af81d3eb843f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useDesktopConnection: ClassTooLong \u2014 433 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 33 over it, 1.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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50acc1280014bbaee96dbfc1c2ef4bd1c29472b436c51caa1bb71178aaa9455c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/terminal.rs: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 61% of them inside a single declaration: Terminal (4 blocks, 238-939). The bar is 500 significant lines; this is 41 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":"tui/src/terminal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9545d68810a207439dd4dae008dfc18d53e650230b80cfe1d596afeddcf6f816"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: semantic/evidence.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). The bar is 500 significant lines; this is 40 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":"agent/src/compaction/semantic/evidence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8735301a8f32066202ca6ced89ee9a31af50066aeb7719a646cb24910a35d654"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/whatsapp.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). The bar is 500 significant lines; this is 40 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":"channels/src/providers/whatsapp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa6c2f67dab2be11f54b548b42c4ea7d1f71d9e03194108bceaa301cc495dc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/transport.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), declaring 33 free functions. The bar is 500 significant lines; this is 40 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":"packages/rpc/src/transport.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e778dd13ec8b0849111f136d6bda1f09df4acec355b76280e11b4c46354e48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::screen::diff_review_box: FunctionTooLong \u2014 future_tui::workbench::screen::diff_review_box 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":"tui/src/workbench/screen.rs"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"17601a69c588fbd3826d4cc87e8289698f37221758aed9f211082a751e4103aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote_host/pairing.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), declaring 31 free functions. 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":"host/src/remote_host/pairing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2175377fe071768b99d24db8d3644ea762bdce45e5ecaa35d949d04eeca82f61"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useAppLifecycle.useAppLifecycle: FunctionTooLong \u2014 useAppLifecycle 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":"mobile/src/remote/useAppLifecycle.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a234720cc5dce51b1bc7fe23a38a84199675bfdb6f23125716260cdb0b4d9f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: components/ComposerDock.tsx: FileTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded), about 92% of them inside a single declaration: ComposerDockView (37-692). The bar is 500 significant lines; this is 32 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":"mobile/src/features/chat/components/ComposerDock.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbc7a608445d71cacec7863962ba22b76239770d6681e74e8096f05647a7588"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: prompt/mod.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":"agent/src/prompt/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7591821dcdc54f71a3c6a7f25f47c940c9113815389429b26408cdc29fba0edc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::models::future::convert_future_model: FunctionTooLong \u2014 future_agent::models::future::convert_future_model 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":"agent/src/models/future.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b00a1bc385bc0ca181a2f7f3ef2acc329d433fd594803e6e5a7ad10eeffc8d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServerSession.restore_session: MethodTooLong \u2014 restore_session 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":"agent/src/rpc/session.rs"},"region":{"startLine":2154}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e611e9c56356aa7250b89450a16ace0a058bb63bcf5fde952d9a9539344a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::configure::collect_model: FunctionTooLong \u2014 future_cli::commands::configure::collect_model 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":"cli/src/commands/configure.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"93418810103fc37eca7b93c5b3f43f3d81a24326f30668027899e44d16948318"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_cli::commands::tools::build_tool_catalog: FunctionTooLong \u2014 future_cli::commands::tools::build_tool_catalog 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":"cli/src/commands/tools.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d0aac3997499bfb831572dd57bbf18fa30e0b90b45e2f0e5fe71f21e71df02"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: data.parserEntries: FunctionTooLong \u2014 parserEntries runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/shot/mock/data.ts"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932dd56e88ae0c5821d55e43069c76417a573fbd707bf67aa3e06a882c86ecd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useRemotePeers.handleCatalog: FunctionTooLong \u2014 handleCatalog runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9d483a9b175d6efd806d905d1e505149ffff5a6b5b74e8a61db8dfca7b4598"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_remote_client::session::handshake: FunctionTooLong \u2014 future_remote_client::session::handshake 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":"packages/remote-client/src/session.rs"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07962c4fa6a29ebb882f914ad76bc5d7ab2148a52819c2a6ab937f989f813db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/linq.rs: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/linq.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f3772d3284e5107b8e9e1e75d8e3541a7e09c4849e560e06db59137a60e44f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Scan: ClassTooLong \u2014 421 significant 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, 2 blocks, lines 814-1446. The bar is 400 significant lines; this is 21 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":"tui/src/workbench/syntax.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1d41f762431fbd0ac5716f8eb8ae0b81f0ca02bd174af327c773cd13211345"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: useChatFiles: ClassTooLong \u2014 421 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 21 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b686b7dd2caffe249c772fb6abce04f8e0e996d4908818791b52ed81fa21b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote/usePromptOutbox.ts: FileTooLong \u2014 526 significant lines (blank, comment-only and punctuation-only lines excluded), about 68% of them inside a single declaration: usePromptOutbox (237-729). The bar is 500 significant lines; this is 26 over it, 1.05\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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab79a9e10c763011a0d1c8701106a7b04bd589da03c47be797abcb4cac2996e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ApprovalGate.resolve_approval: MethodTooLong \u2014 resolve_approval 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":"agent/src/rpc/approval.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"48018e9f5352d6b7b182a20c56dfe48e779d60a94ca52f1b6ab665a1f3099b0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FusionSettingsPage.Form: FunctionTooLong \u2014 Form 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":"desktop/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dfe79a17b6576750e991cbfd2449ff289f57bd53daeef52d620aaf07ced0d75"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Client.connect_attempt: MethodTooLong \u2014 connect_attempt 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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"6577e510628aadea88ef47d99156d3c384ccf34aa3a52332445c191bcc757087"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyncEngine.applyOps: MethodTooLong \u2014 applyOps 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73626fcb97a3aaec469ac165470596efc5912dcf2f42738fb4cf18360cb4fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hooks/useThreadStore.ts: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded), about 73% of them inside a single declaration: useThreadStore (365-1054). The bar is 500 significant lines; this is 21 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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d73a9fdbc02d53e05efe0e5e0652d4fe07f62d179cee154e59d7b9cc8fae1c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServerSession.build_rewrite_snapshot: MethodTooLong \u2014 build_rewrite_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":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6695d47a87365e2b734fe6d36e7cef670ea7bfc281268cd6e034030abe1d48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ModelsPage.ModelsPage: FunctionTooLong \u2014 ModelsPage 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":"desktop/src/features/settings/ModelsPage.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f70f9f2f8a1c9763ff5eb50828f272df5f7a6bc7572fcf78bdf4cf2bbf4523"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::agent_bridge::queries::read_events_since: FunctionTooLong \u2014 future_host::agent_bridge::queries::read_events_since 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":"host/src/agent_bridge/queries.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"190c43f09771bc9bbb280f0a6de3a8d0c9ae085ccb7fab75e514902971b3a389"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mock/RemoteContext.tsx: FileTooLong \u2014 518 significant lines (blank, comment-only and punctuation-only lines excluded), about 70% of them inside a single declaration: RemoteProvider (197-815). The bar is 500 significant lines; this is 18 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":"mobile/shot/mock/RemoteContext.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a74138e8136a36bbb0c05d0064e93decf0db1e21188d9be79668e2c1553bf01"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Store: 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":"orchestration/fusion/src/store.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb317ed27a406db862bbcd6655f63f7ab76c924a3b675f4b0627a6985fe0770f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Store: ClassTooLong \u2014 412 significant 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 8-515. The bar is 400 significant lines; this is 12 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":"orchestration/fusion/src/store.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b902ed477ae5c65150223d9239bc013935312e4e62e5b4325f694d80bc7d796"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: remote/useDesktopConnection.ts: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: useDesktopConnection (237-899). The bar is 500 significant lines; this is 15 over it, 1.03\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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b2eb0a350742c9d61ab7a81802a44aacc3fad0a75016ce51915dab99801442"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::rpc::commands::settings::handle_compact: FunctionTooLong \u2014 future_agent::rpc::commands::settings::handle_compact 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":"agent/src/rpc/commands/settings.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea1911975de13905b918847a0c3928e4486311ffdcf12e9fa3e940b73682173"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqliteStore.publish_segmented_metadata: MethodTooLong \u2014 publish_segmented_metadata 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":"agent/src/session/content/metadata.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c0cb9d274c30719ccc01ea7eceec6cae27347c8ec14ad181651b23da6d8c1eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::session::projection::entries_to_agent_messages: FunctionTooLong \u2014 future_agent::session::projection::entries_to_agent_messages 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":"agent/src/session/projection.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"66094b8d431ebf5f810b8f4df899ab8bb50ad16d38c13b6ec11d0586d9101811"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DingtalkBridge.handle_slash_command: MethodTooLong \u2014 handle_slash_command 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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a7b64634db9794ca42d944f8766236c0ae0da1f916653453e5c7f430e57a42"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FusionSettingsPage.ModelRow: FunctionTooLong \u2014 ModelRow runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"desktop/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f264221e551c11ce078547ff16cffd20be5a617fddc481e9060b08276a10c61a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useOlderHistory.useOlderHistory: FunctionTooLong \u2014 useOlderHistory runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"mobile/src/remote/timeline/useOlderHistory.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59ea2c0608322e6e821c8b5d0e8a3aa311d89c6e961c351919e41e93ac3032f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tasks.rs: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 12 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":"host/src/tasks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b87fea6fe3c17969289867006a8317acb8e898fb6c2b347697fc36b7d2039a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::config::providers::apply_provider_upsert: FunctionTooLong \u2014 future_agent::config::providers::apply_provider_upsert 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":"agent/src/config/providers.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c47651df1c840883318c238571d1b469ccbb3f6edc5f9a074641376276fd58"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContentSequence.stamp: MethodTooLong \u2014 stamp 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":"agent/src/rpc/broadcaster/content_sequence.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba923e0ad5a4018ecd8f97543f52acd009963a60cbf1bfba63bbb15f4de3ba3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: futureos::commands::update_linux::worker: FunctionTooLong \u2014 futureos::commands::update_linux::worker 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":"desktop/src-tauri/src/commands/update_linux.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f7d9e01e35f12ac70de3ab7be1bee23b1a43204db52f5d55acbd9479bbbca0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Supervisor: 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), 118 methods, 4 blocks, lines 189-1216. 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":"packages/remote-server/src/supervisor.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"666d573da60a701a7894bfc785cb7897fcfd1ea31655b215843a84062002197b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_agent::cli::run_from_args: FunctionTooLong \u2014 future_agent::cli::run_from_args 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":"agent/src/cli.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef07634d7a2933bafe140c82e04e8d1f084f36b153798a1b4c61dd8299a80bc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_host::git_history::draw: FunctionTooLong \u2014 future_host::git_history::draw 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":"host/src/git_history.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbed54298a536c2a00315e91fe7b9612dd24fa1c5617c102ad963fc1b3fc99d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: useOlderHistory.useOlderHistory.loadOlderTimeline: FunctionTooLong \u2014 useOlderHistory.loadOlderTimeline 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":"mobile/src/remote/timeline/useOlderHistory.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21c30d38675070fb5b5ce76183987366857b4f6f13df5edfd6cbea80f6e0a10"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: future_tui::workbench::git_panel::draw: FunctionTooLong \u2014 future_tui::workbench::git_panel::draw 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":"tui/src/workbench/git_panel.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e684f187bc0e1f124e6c50fd97a749749aeb424b535beee13ee615f6c37ab3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: session/reset.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":"agent/src/session/reset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3ef23542b77dabd2e4720681659492f683b3da8813892f0902b73ef438acce"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FeishuRestClient: ClassTooLong \u2014 403 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 22 methods, 2 blocks, lines 12-561. The bar is 400 significant lines; this is 3 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":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"74efe8f934bc7c714e13c1e2a995e8dc55f42b5caafa58c4d19a58300c486f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: providers/qq.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":"channels/src/providers/qq.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5777c26419f8383825ddf71d6cb360d2a63f32b3c43cdb485fad7d8b74d772b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (46 shared lines): agent/src/runtime/scheduler_queue.rs:420-511 | agent/src/runtime/scheduler_queue.rs:599-687 \u2014 These two members are variants of one another: 46 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":"agent/src/runtime/scheduler_queue.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d5331489253e35c69f597d93b1016ee31cceb31390e16e710c38401cc006f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (40 shared lines): agent/src/session/history/display_index.rs:330-384 | agent/src/session/history/display_index.rs:396-470 \u2014 These two members are variants of one another: 40 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":"agent/src/session/history/display_index.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fdee2c5c364636909e07e594d8c6722d532df2b42822c27642e82bcdfa4ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): agent/src/session/persistence.rs:436-470 | agent/src/session/persistence.rs:474-498 \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":"agent/src/session/persistence.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6403c7ca8dfc681d17d0e262420b88bc9345e47bec36d8be225fc5f48d65c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agent/src/rpc/approval/shape.rs:309-329 | packages/rpc/src/tool_arguments.rs:87-107 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/approval/shape.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2808415a89a593af892daa0b619aba4ff313dd426ff49e96d41cb6ad7b48329"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agent/src/session/entry.rs:115-129 | agent/src/session/entry.rs:170-184 | agent/src/session/entry.rs:192-210 | agent/src/session/entry.rs:237-268 \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":"agent/src/session/entry.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c7118abb5ec008182a7960051509f0aba42f90f224c63456888afab139c452"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): agent/src/session/sqlite_store/transcript.rs:206-241 | orchestration/fusion/src/store.rs:434-440 | orchestration/fusion/src/store.rs:449-458 | orchestration/fusion/src/store.rs:485-494 \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":"agent/src/session/sqlite_store/transcript.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3925d308f54fbc79254af7ed009f2072dce793f176da71d1d07c3a8c01db57"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): host/src/store/db.rs:333-389 | host/src/store/db.rs:402-435 | host/src/store/db.rs:441-480 | host/src/store/db.rs:1678-1708 \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":"host/src/store/db.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f982f33f67d02efc9df0337dc20c49fcd3da5d9e84082a341cb31e80fbed0031"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): host/src/tasks/service.rs:271-339 | host/src/tasks/service.rs:341-357 | host/src/tasks/service.rs:359-373 | host/src/tasks/service.rs:378-393 \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":"host/src/tasks/service.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e944976abe46558784fe47e714d17d765537cf26d84a87030abc1568cfcb885"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tui/src/workbench/git_panel.rs:509-557 | tui/src/workbench/git_panel.rs:584-638 | tui/src/workbench/git_panel.rs:754-794 | tui/src/workbench/git_panel.rs:829-858 \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":"tui/src/workbench/git_panel.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8487387086a59d65fe7694607fc82f76f037cad5e4f7c22964d4ea85c29738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): tui/src/components/markdown.rs:827-915 | tui/src/components/markdown.rs:934-1014 \u2014 These two members are one piece of code written twice and then edited apart: 81 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/markdown.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"336e8335a89d1fbd0b9ad4e34e1251a49272a684da019e8c85ab8d2cd05b5938"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): packages/rpc/src/decode.rs:316-390 | packages/rpc/src/encode.rs:55-118 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"d200434b3d9e9826ae6d95b3513eebc0401f2bd1a3c5251ed5ccf606fd0f3cdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): channels/src/dingtalk/mod.rs:59-139 | channels/src/feishu/mod.rs:40-114 \u2014 These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/dingtalk/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"49dd1702442152a0cd69670e3c63ac869c0dbd915c0865f45d76355c5443a7e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): cli/src/commands/pin.rs:138-197 | cli/src/commands/pin.rs:200-242 \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":"cli/src/commands/pin.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5527fb6fe7ce64770427a25138326f79fb5b982df2925283fa7ae2b537693238"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): agent/src/session/database/mod.rs:285-333 | agent/src/session/database/readers.rs:101-139 \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":"agent/src/session/database/mod.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d32a40cdb8fbd3038eadb0963b9a2ed4a0defadfd6680f5ba6ae3e05541146a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): channels/src/providers/mattermost.rs:505-563 | channels/src/providers/slack.rs:721-784 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/mattermost.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cd54ff6bd98a338d4f006fba2c6c65b954015b3d21d08797f52125119ae75a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): packages/rpc/src/decode.rs:547-585 | packages/rpc/src/encode.rs:324-362 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"3470bc2ef92bc40b7e6fa627c0ccbe1b4f90ef933154e38c90a1c132fae1d7a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): cli/src/commands/doctor.rs:581-629 | cli/src/commands/doctor.rs:631-683 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/doctor.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40544dccfedb8a0c69e176bbb843c662bf80fc51131a5ad9aadb7ad8f7daa2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): channels/src/providers/linq.rs:743-784 | channels/src/providers/whatsapp.rs:745-795 \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":"channels/src/providers/linq.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"9842bad396df3a823e57bb51861e78c6d92f6391c62a1bee24c7aece68a71611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): cli/src/commands/archive.rs:133-174 | cli/src/commands/archive.rs:177-224 \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":"cli/src/commands/archive.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee0a30e5a69fdec9cc6337019962f5e12a0b24014141fd57372ea9c05f5c7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): agent/src/rpc/commands/session_lifecycle.rs:1098-1152 | agent/src/rpc/commands/session_lifecycle.rs:1159-1206 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/session_lifecycle.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b2dc27bec53e6e84fdc13ea7733ab711b00499046870eb7e3314c96810eb95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): channels/src/providers/email.rs:2624-2661 | channels/src/providers/irc.rs:1039-1091 \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":"channels/src/providers/email.rs"},"region":{"startLine":2624}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c60da46fe583d0616abf8195f7871981c57f33a73cbe3b211eb681d1e3c4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): cli/src/commands/session.rs:1101-1142 | cli/src/commands/session.rs:1235-1283 \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":"cli/src/commands/session.rs"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"020e8ba98f5c2d46c71d814798193f0211a9f28f78b2619bff1e3d744cca5264"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): cli/src/commands/desktop.rs:175-213 | cli/src/commands/settings.rs:234-277 \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":"cli/src/commands/desktop.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e813e9dce5118049872a4a5f8aee04834ec4ad15b4fb77cb76127ccc39778e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): channels/src/providers/telegram.rs:295-336 | channels/src/providers/telegram.rs:380-428 \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":"channels/src/providers/telegram.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"a848974c48267acc07859893519d80423ab1af1a0069360fc1d388b70c57faeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): tui/src/utils.rs:64-97 | tui/src/utils.rs:124-154 \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":"tui/src/utils.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b284e18da72d6492338d33eb10ba0d158b692364f88f518f35caa7bb2d1b6e90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): packages/rpc/src/decode.rs:413-451 | packages/rpc/src/encode.rs:132-165 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbf0fdce3392d39dcb13766ec8cf473a513d32b9a77863bc0a99d2ba85db034"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): agent/src/rpc/mod.rs:798-842 | host/src/remote_host/business/prompt.rs:375-416 \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":"agent/src/rpc/mod.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"622b2149d33ca7b5b31ff1f8c0e624b2193f23a761b90dde439695a219522e6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): agent/src/models/mod.rs:1220-1251 | agent/src/models/mod.rs:1258-1287 \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":"agent/src/models/mod.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe039323920ca2cbac7ce0d8721304e6ee6498d968b1c207c41609f20169549"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): cli/src/commands/remote.rs:109-146 | cli/src/commands/remote_peers.rs:77-121 \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":"cli/src/commands/remote.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"8798823e5357f5791a531b90f98e6358df0e63306df5a97feeaa7362f42f9ead"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): channels/src/dingtalk/dingtalk_rest.rs:36-75 | channels/src/feishu/feishu_rest.rs:46-92 \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":"channels/src/dingtalk/dingtalk_rest.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"959d5e07576ff6a3ea7ab47e3b3224fc4adde435530e8d2385f3dbe00c0e8f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): cli/src/commands/remote.rs:468-503 | cli/src/commands/remote_peers.rs:322-359 \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":"cli/src/commands/remote.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"7035c6b4695c5d78099ed862ad26c4979067f158d1e15c64ff17313a624e6277"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): cli/src/commands/configure.rs:824-861 | cli/src/commands/configure.rs:864-901 \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":"cli/src/commands/configure.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cf07bd91a09ae2b16c6b0f6bf15ac1a5dfdbe32575a2a3bf7fbdef59046fd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): channels/src/feishu/feishu_rest.rs:214-249 | channels/src/feishu/feishu_rest.rs:257-290 \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":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecc41feb41ac4a36b71839144d76831e2209f80e8aa8b399da60c5c8f75b6fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): host/src/future_login.rs:195-227 | host/src/future_login.rs:506-534 \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":"host/src/future_login.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be9362c5219efd52c8a4b9574f994e45a4f769c106ca44660d37848d8e64ce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): channels/src/providers/email.rs:490-511 | channels/src/providers/irc.rs:736-757 \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":"channels/src/providers/email.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4401c64596147ca7abd5970bc2ebcb8f07bf18f84133636d5d1a139940faedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): host/src/remote/relay.rs:207-229 | host/src/remote/relay.rs:254-277 \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":"host/src/remote/relay.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b745eeaef5b218483da7f8e9288b92996ccbaa9876c1878dedff4255901e1234"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): channels/src/dingtalk/bridge.rs:65-95 | channels/src/feishu/bridge.rs:130-157 \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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5158441adcab34baceab0a7dbc39fa9a739a11024accb06901f1b901d6f5e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): agent/src/rpc/commands/settings.rs:537-566 | agent/src/rpc/commands/settings.rs:673-720 \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":"agent/src/rpc/commands/settings.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"088e36256163e27cbaae28584ccfa0f2e05ca179646bd979960e8fdf9c134a7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): agent/src/rpc/commands/providers.rs:430-466 | agent/src/rpc/commands/providers.rs:614-661 \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":"agent/src/rpc/commands/providers.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d298e9fc1a0e5bcd04d7a769dcae5404e753e7aa79a10b933d02372ebc22f25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): agent/src/session/content/fork.rs:140-162 | agent/src/session/content/reset.rs:235-261 \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":"agent/src/session/content/fork.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"af62fcd319bc546c14dc93cddc291103cfb907129d12370e2c216d8b438be007"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): host/src/remote_host/business/tasks.rs:83-110 | host/src/tasks/service.rs:114-142 \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":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"199a338f6de6412ee7681d9eab77c9dc02f0ff41efca7092c7cbeac328de02ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): packages/remote-client/src/tasks.rs:68-99 | packages/remote-server/src/tasks.rs:64-107 \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":"packages/remote-client/src/tasks.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6479d11203e755c9bec0f1d67975ee40a50a34761465081c0b17f9ffad7d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): tui/src/skills_cli.rs:674-699 | tui/src/subprocess.rs:54-91 \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":"tui/src/skills_cli.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd9f5bb66545f2e84bb95a06874f3aac5fff78631a6e88e67f5cca88a593dad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): agent/src/session/journal_compaction.rs:212-242 | agent/src/session/sqlite_store/events.rs:274-285 | agent/src/session/sqlite_store/events.rs:294-313 \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":"agent/src/session/journal_compaction.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"576476506916d220a810474865850c877e12456f2cac46e14dc34f462229fa32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): host/src/application/threads.rs:95-120 | host/src/application/threads.rs:124-150 \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":"host/src/application/threads.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84d76b4720b785ab89ae12d94e9d4666d8d3ec990f87c3d986e81944e5bdb69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): channels/src/transport/webhook.rs:305-335 | desktop/src-tauri/src/terminal/server.rs:824-854 \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":"channels/src/transport/webhook.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d581389bc42b5bb9f35fce420e8dfa56f1e44b98773d2cf4091b2f9eba161e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): orchestration/tasks/src/store.rs:472-501 | orchestration/tasks/src/store.rs:503-531 \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":"orchestration/tasks/src/store.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89b40be97554be2fa52572279d8b2958a7502862116615085dbf84ed1e94c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): host/src/agent_bridge/persist.rs:446-468 | host/src/store/runs.rs:1228-1248 \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":"host/src/agent_bridge/persist.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"e869317268ab0ee047819fd61763b9d9491ea87d3245a0b7d0faebec6ef07138"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): channels/src/providers/imessage.rs:145-162 | channels/src/providers/imessage.rs:182-199 \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":"channels/src/providers/imessage.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"076629fcfd66550afd77c7220e7ef7aece7d795257cf24aab8eb5204a755a185"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): host/src/agent_providers/write.rs:71-97 | host/src/agent_providers/write.rs:182-213 \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":"host/src/agent_providers/write.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf44d9c8271a7dca8d1ff4cee5beef45c4abe755e85e312b76c067af6ba7dcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): packages/remote-client/src/runtime.rs:3257-3281 | packages/remote-client/src/runtime.rs:3426-3457 \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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":3257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66e38c5eda752e3c4251d2876c53862670635e3ba2d33baae40508f320c61c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): cli/src/commands/remote.rs:251-283 | cli/src/commands/remote_peers.rs:167-195 \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":"cli/src/commands/remote.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbefa18180f6455bc96fd065acc277f334aaa6682874ce36f8636a003b36800"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): host/src/error.rs:76-100 | host/src/error.rs:126-149 \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":"host/src/error.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"84406e966bd57482fe56e7d25c44129480d779dd44cc90e608c4a8446be6ee85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): cli/src/headless/agent.rs:193-211 | desktop/src-tauri/src/agent_host.rs:17-35 \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":"cli/src/headless/agent.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1152526ab97cbb67a15c8e362476fab1eadb5f4c4a36e8908bba5cdeacfbfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): orchestration/goal/src/webui/server.rs:217-236 | tui/src/paste.rs:332-351 | tui/src/workbench/links.rs:306-326 \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":"tui/src/paste.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ae4b5a6ba4028f714c9ff73c0a094b2c33d48cfd85ef859f3bc58debf5e3b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): host/src/store/threads.rs:1167-1185 | host/src/store/workspaces.rs:554-570 \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":"host/src/store/threads.rs"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0494e11ccf0848012ad027783022bfa2aa4bebafbf6c10cd4fc742e3a93659"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): agent/src/models/future.rs:340-356 | host/src/future_platform.rs:36-57 \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":"agent/src/models/future.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1afb6a2154220a91a417becbcd0560edec97b1d7a30018415e9c735172d382c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): channels/src/feishu/feishu_rest.rs:94-113 | channels/src/feishu/feishu_rest.rs:115-134 | channels/src/feishu/feishu_rest.rs:136-154 | channels/src/feishu/feishu_rest.rs:540-560 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90a54cbfcfd50796e5c53a9c44480c3cdee44a75499fa47f3d6881da3f93383"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): tui/src/index.rs:516-534 | tui/src/index.rs:541-559 \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":"tui/src/index.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"f681adae1472bc743ab7550386758c6598272698f7e2304727793b5e5bfda2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): host/src/remote_host/pairing.rs:166-185 | packages/config/src/lib.rs:67-91 \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":"host/src/remote_host/pairing.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"54361e41980c3dead716320d85b3308f23d720f46cd5a2580c0a4fe26fee1fff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): host/src/shadow_review/repository.rs:21-31 | packages/config/src/lib.rs:41-52 \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":"host/src/shadow_review/repository.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03f6359c47730d37eb7d7a7baa0108a0227ce1afec30ae582e215017d755b68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): packages/rpc/src/decode.rs:692-709 | packages/rpc/src/encode.rs:643-660 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cea8807745ddde458511cb4477a1192cee2932958ab4973e3c1e4b2d21600e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): tui/src/components/chat_area.rs:641-659 | tui/src/terminal_image.rs:276-293 \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":"tui/src/components/chat_area.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e239311630c3af11e138c876d4772684e8e0da33246a3f412dcdf73c4b352ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): tui/src/components/markdown.rs:1258-1279 | tui/src/components/markdown.rs:2048-2069 \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":"tui/src/components/markdown.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"319c51ba8788e2821f77a6d34f38ca75af861e62e841b05ced06d47c297c9da6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): channels/src/providers/qq.rs:292-314 | channels/src/providers/slack.rs:247-269 \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":"channels/src/providers/qq.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbcf9dc3fe7b812506b30c41ff4f6518db3ae05cf39bef9cc25799b89fd60e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): host/src/agent_bridge/run_control.rs:325-347 | host/src/agent_bridge/run_control.rs:377-408 \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":"host/src/agent_bridge/run_control.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc86f9b0f6e399659f2e70a9c9e8444a18d81d4ea9c545223486b338cf829f2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): agent/src/llm/mod.rs:171-194 | agent/src/llm/mod.rs:204-226 \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":"agent/src/llm/mod.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca314c49e3014a32a665e3dcd8aaa31594d0d052a580b096a6b8e6afcfef10f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): agent/src/rpc/commands/run_control.rs:119-143 | agent/src/rpc/commands/run_control.rs:219-251 \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":"agent/src/rpc/commands/run_control.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea561e0691f1920548d7da952ed3bd2cb768fd90e20d9184b2a8d05da7334f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): orchestration/tasks/src/store.rs:606-632 | orchestration/tasks/src/store.rs:634-658 \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":"orchestration/tasks/src/store.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"23dafe3c8c3b7440f7b829c3d682a9b535e4bc2a3f4d3605b0380fedc67943ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): host/src/agent_bridge/persist.rs:311-326 | host/src/agent_bridge/persist.rs:471-485 \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":"host/src/agent_bridge/persist.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"141126d38b4d44ffce94f703ab6e839b05aecf90a79f17f302619ba8e9ecbfb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): host/src/agent_bridge/queries.rs:966-987 | host/src/agent_bridge/queries.rs:1006-1021 \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":"host/src/agent_bridge/queries.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cfe678ab28eb008785da85557ef53f4e8597d6cdf8c416805b81cbda055180"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): host/src/agent_bridge/queries.rs:328-346 | host/src/agent_bridge/queries.rs:348-362 \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":"host/src/agent_bridge/queries.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d7aca2bc01d0452cf5f202ceeeefa3421cf00f0ac17b205b344f79a1424eefd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): channels/src/providers/telegram.rs:430-451 | channels/src/providers/telegram.rs:458-484 \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":"channels/src/providers/telegram.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa4f71b4d67a4e8e6a1b15e4b7ffdacd9f731b0caf222422e93b343e9eacc72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): channels/src/providers/whatsapp.rs:499-524 | channels/src/providers/whatsapp.rs:527-549 | channels/src/providers/whatsapp.rs:556-576 \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":"channels/src/providers/whatsapp.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e9c23a028ca5d377969a91bf98e9b596b93bcddaac76d5e707aced0d0f40e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agent/src/session/content/recovery.rs:558-571 | agent/src/session/sqlite_store/transcript.rs:10-24 \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":"agent/src/session/content/recovery.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7d9008eb17e2385e96b1fadfe71af50b1d73c17d2fb931bdcb0bbfe7fcf326"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): tui/src/workbench/live.rs:740-763 | tui/src/workbench/live.rs:4264-4284 \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":"tui/src/workbench/live.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d2bb880b79ccc4796811613ee15622bed0027930da7a230b6cdded6f0277fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): cli/src/commands/skills.rs:357-375 | cli/src/commands/skills.rs:444-467 \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":"cli/src/commands/skills.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d240cfa260901b695db982f89af09cee1e3e5efc788ed98f819c90ce1c33a039"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): host/src/agent_bridge/config_observer.rs:40-56 | host/src/agent_bridge/session_events.rs:51-66 \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":"host/src/agent_bridge/config_observer.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffaaaba0bb800d78de4ac2abb70b69c5011b3b0c692ab47782be83a984a3c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): tui/src/terminal_posix.rs:299-336 | tui/src/terminal_posix.rs:347-370 \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":"tui/src/terminal_posix.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4cb3b3b90214639fc704137ece31917e6f3d58a1686337e85d7ed30b2a22b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): host/src/remote_host/pairing.rs:577-589 | host/src/remote_host/pairing.rs:793-806 \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":"host/src/remote_host/pairing.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"219cea3a162a3219a5561e7d3c36f0916a206935a92aefabdce7c5f5de8de73f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): host/src/store/cleanup.rs:61-82 | host/src/store/cleanup.rs:153-172 | host/src/store/cleanup.rs:179-199 \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":"host/src/store/cleanup.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20b3e58a97340d934364883f76cf885f6dc9dc3d04398d7e4803cbdf8752668"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): channels/src/providers/mattermost.rs:572-585 | channels/src/providers/slack.rs:793-809 \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":"channels/src/providers/mattermost.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f2c8d2985f6b6026589ce18b10aec0385528f82c5d7c796f48677324b467cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): cli/src/rpc.rs:204-223 | cli/src/rpc.rs:235-254 \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":"cli/src/rpc.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8f9d59e0b154f27ec69707484fb9432788dbcb194b8f28d5eed86b7a6086fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): packages/remote-server/src/supervisor/shutdown.rs:62-72 | packages/remote-server/src/supervisor/shutdown.rs:198-214 | packages/remote-server/src/supervisor/shutdown.rs:274-290 \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":"packages/remote-server/src/supervisor/shutdown.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e12baff526506cc29b5ddbb562dad29e7a42f5f703bebcdbe36dab56fa1f7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): tui/src/workbench/live.rs:3732-3747 | tui/src/workbench/live.rs:3749-3763 \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":"tui/src/workbench/live.rs"},"region":{"startLine":3732}}}],"partialFingerprints":{"codehealthFindingId/v1":"788cdc2cf229c897390b3b21db19d3d358da016fae39d9c05a138e0ac4561d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agent/src/runtime/scheduler_queue.rs:229-246 | agent/src/runtime/scheduler_queue.rs:259-278 \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":"agent/src/runtime/scheduler_queue.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1c6689957051b1ba386e1fe22d10c7cad9ba5b87882a8b4895bfb02f314da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): cli/src/rpc.rs:306-321 | tui/src/rpc/grpc_client.rs:647-661 \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":"cli/src/rpc.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc27454f257666631abf9342e1a86b9395422520d3c7f0824defaf12a52e3ba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tui/src/rpc/grpc_client.rs:577-589 | tui/src/rpc/grpc_client.rs:911-923 \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":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcd00b9f7ac51c02d95248190a7f9c06f1568399aa4bc87a3f51fbae215c664"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): tui/src/components/chat_area.rs:1610-1625 | tui/src/components/chat_area.rs:1748-1761 \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":"tui/src/components/chat_area.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3674ab9d9b798cedddd656311bd918cb72fbdabbd549a5fe771a516dd40c339"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tui/src/workbench/live.rs:4183-4194 | tui/src/workbench/live.rs:4374-4385 \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":"tui/src/workbench/live.rs"},"region":{"startLine":4183}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff31ebbc38d0cc297b8ccf7c343a2d20f5f359c318ea7116fb638687f9d3edf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agent/src/config/providers.rs:392-404 | host/src/auth_store.rs:71-88 \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":"agent/src/config/providers.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3368af17f5420f654740c025996b286c37120df4e3b773d5e8f175610c9c776c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): packages/rpc/src/decode.rs:532-545 | packages/rpc/src/encode.rs:273-286 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a90041089ef076e51925e830d0bc85f56d15c47398bd7afbc79b4dd1fca235"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): tui/src/components/input.rs:1100-1111 | tui/src/components/input.rs:1113-1128 | tui/src/components/input.rs:1130-1145 \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":"tui/src/components/input.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9bb8de66a016510ef0513a5f6a54e9037c766fe72565f5e69ef4b5add78c05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): agent/src/sandbox/paths.rs:49-68 | orchestration/goal/src/agents/workspace_guard.rs:39-57 \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":"agent/src/sandbox/paths.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4c940713f2f8db3733fb78859153154603f3d8305238baa92d42a5409a5a75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): cli/src/commands/browser_tools.rs:911-924 | cli/src/commands/browser_tools.rs:1049-1062 | cli/src/commands/browser_tools.rs:1096-1113 \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":"cli/src/commands/browser_tools.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a4b6e269b73d88c57796f7155279f4d8117416a82d8e6bb314d7b5df5ea62a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): orchestration/tasks/src/kernel.rs:281-288 | orchestration/tasks/src/kernel.rs:305-315 \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":"orchestration/tasks/src/kernel.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3da28d6e3b5a0f0cd1dff48a92504eb9e3f228117904f55e3bfc3073738730"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cli/src/browser/chromium/cdp_connection.rs:330-351 | cli/src/browser/chromium/cdp_connection.rs:404-414 \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":"cli/src/browser/chromium/cdp_connection.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fb40303bbd356d95fd9db8115db57dff9cfcbd89d2c86994715d782e6e12cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): host/src/agent_bridge/import.rs:24-35 | host/src/shadow_review/load.rs:20-35 \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":"host/src/agent_bridge/import.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaa551af1924065ef5f7415e2fea45b824059cf9662614bee573de34fd09bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): agent/src/runtime/run_state.rs:330-347 | agent/src/runtime/run_state.rs:349-370 \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":"agent/src/runtime/run_state.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"040de968998455136be6ca56514ec1201333a705aed241557bc2f09f582c0e32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): channels/src/feishu/feishu_rest.rs:164-184 | channels/src/feishu/feishu_rest.rs:192-211 | channels/src/feishu/feishu_rest.rs:393-407 | channels/src/feishu/feishu_rest.rs:414-427 \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":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7b3dfabc27e884564fa1575d6d859e829d9cebc584baa4ef198e3e022185478"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): tui/src/components/markdown.rs:270-277 | tui/src/components/markdown.rs:2027-2033 \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":"tui/src/components/markdown.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f162d9decbee762ea1c8145fd1118c1d88b1b3bc667f45195c927389ccc9b948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agent/src/compaction/semantic.rs:863-877 | agent/src/compaction/semantic/evidence.rs:124-138 \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":"agent/src/compaction/semantic.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffca017e813718f9cfb3fed2f86cd3227a98c718edb2b01ddf5f93912751e614"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): channels/src/providers/linq.rs:661-678 | channels/src/providers/signal.rs:864-879 \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":"channels/src/providers/linq.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b5cf2a20448103f167c322fdc13ef3c058ebc26e18937850fe596db6cfa3ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): cli/src/commands/data.rs:247-261 | desktop/src-tauri/src/commands/update_linux.rs:40-52 | host/src/remote_host/files.rs:466-478 \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":"cli/src/commands/data.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d562b2887680f70085ea4a221fdf83c12288be8efac1816403c0a9dd78da7a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): agent/src/rpc/mod.rs:42-55 | packages/rpc/src/decode.rs:610-627 \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":"agent/src/rpc/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0886cd462bab6c9eacfdd96ed41ab5279b67a2bcc3e92182c0172ade1b56c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): host/src/agent_bridge/queries.rs:649-664 | host/src/agent_bridge/queries.rs:667-681 \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":"host/src/agent_bridge/queries.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e4d86e30746a7675f4a8ada23869c7becb5b4fe73d02e3b6806cff9e051ac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): packages/rpc/src/decode.rs:743-757 | packages/rpc/src/encode.rs:706-722 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ceb4a5c8d3b429437ae6386ed6d2c003e92cb8aea841b72980fb185b66b7d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): tui/src/paste.rs:121-137 | tui/src/paste.rs:197-213 \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":"tui/src/paste.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"575d489a5d8d17abef33c12379f54edca9dc372d1a43ac481680fb5d6b4a3b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agent/src/llm/mod.rs:761-769 | agent/src/llm/mod.rs:773-781 \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":"agent/src/llm/mod.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41a019bd3003c86c6e3b3f5fd459c6f20b7ce2ce4cd97cdfee184b144092209"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tui/src/components/input.rs:997-1011 | tui/src/components/input.rs:1013-1024 \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":"tui/src/components/input.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0eb3d750de4632df6a8139289c60f03b98a644a585ae4ff39acef163cbc9702"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): channels/src/transport/cipher.rs:154-165 | channels/src/transport/cipher.rs:167-179 \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":"channels/src/transport/cipher.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f592eb38a9c84fa7a69f1b22b1758dff0d85d430d77ead9287b1209bfed0a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): cli/src/browser/safari/webdriver_client.rs:170-186 | cli/src/browser/safari/webdriver_client.rs:279-292 | cli/src/browser/safari/webdriver_client.rs:329-342 \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":"cli/src/browser/safari/webdriver_client.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e611b52c9099af7b60949ce275c6e0a19a76d201d6342707986e8dc54ac50dba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): desktop/src-tauri/src/commands/runs.rs:4-17 | desktop/src-tauri/src/commands/threads.rs:38-51 \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":"desktop/src-tauri/src/commands/runs.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a16de462e9de9ed054d580e69d2baeb545de41455befbb04f9ff18799e626e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): host/src/agent_bridge/models.rs:58-71 | host/src/agent_bridge/queries.rs:694-704 | host/src/agent_bridge/queries.rs:713-723 \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":"host/src/agent_bridge/models.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e20165ab93e98bca687a6aba48270a5006b4fb0142992cba03656eb4611209"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): host/src/agent_bridge/queries.rs:292-306 | host/src/agent_bridge/queries.rs:419-432 | host/src/agent_bridge/queries.rs:444-457 \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":"host/src/agent_bridge/queries.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"f891d618474b478d87fe2c2bd58108265057debdc78b2030cb9956eb23a7e700"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tui/src/skills_cli.rs:851-858 | tui/src/subprocess.rs:169-176 \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":"tui/src/skills_cli.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3a1280fdb69b6614755fb7dbad57f6eb14ebd8b3a14050c15584cf5d11e799"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): tui/src/components/chat_area.rs:1767-1788 | tui/src/components/chat_area.rs:1790-1803 \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":"tui/src/components/chat_area.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7ce4f2b36d9fd23c361c29d31cdbadf80d6cbe5643abb7716846ec7c36b522"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): agent/src/session/entry.rs:131-145 | agent/src/session/entry.rs:147-161 \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":"agent/src/session/entry.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6b6d5ce667a268a182c0656681ced94cd8778e2249a28cb5db5e7285dbeabd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): desktop/src-tauri/src/commands/ipc_harness.rs:42-53 | desktop/src-tauri/src/commands/ipc_harness.rs:65-76 \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":"desktop/src-tauri/src/commands/ipc_harness.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97740595e8171a889d2c810d8eeb37fad8e713ad466e6dd98667d923c77ba03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tui/src/workbench/live.rs:816-827 | tui/src/workbench/live.rs:860-876 \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":"tui/src/workbench/live.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"492e8889fbcb07fb74714aaf3c68ced3e3effa55f8326a86a07feebd45c60580"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agent/src/llm/adapters/anthropic.rs:504-513 | agent/src/llm/adapters/openai_responses.rs:927-937 \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":"agent/src/llm/adapters/anthropic.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c4710719ac688361bcd1a24df7e4f7e07120762a069f7f0e3d650def42065a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): tui/src/components/chat_area.rs:971-983 | tui/src/components/diff.rs:549-561 \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":"tui/src/components/chat_area.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"be18318eadb69e6a3ab5dd0826ada8902cb49b48b8aa4d7f1f7c298b32cc81bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): channels/src/providers/imessage.rs:291-306 | channels/src/providers/imessage.rs:308-322 \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":"channels/src/providers/imessage.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f78311df1e69fac8f64a416e919a836c6511a2c2d9696947248d636356e80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): host/src/crash_log.rs:159-173 | tui/src/crash.rs:275-289 \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":"host/src/crash_log.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"191e8c31adcb0e1be64237156e6384990a0feb01a64f4942450be4a7c0edb0bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): host/src/home.rs:23-31 | host/src/tasks/service.rs:12-20 \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":"host/src/home.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f6947faaa6d33f8e563fb225454b3c4492245803fa14834b3523c34a00e8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): host/src/store/cleanup.rs:122-149 | host/src/store/cleanup.rs:233-251 \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":"host/src/store/cleanup.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a694f952e097db9b4ab3331554fdbbe8387cfd91af767d0178ddfdfad17585"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agent/src/sandbox/windows/capability.rs:256-265 | channels/src/transport/signature.rs:44-52 \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":"agent/src/sandbox/windows/capability.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"822f704ace81dcd04d95ae2db84f943d89909e042d24ebda25724cd574fe61ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): channels/src/bridge/mod.rs:606-620 | host/src/store/artifacts.rs:247-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":"channels/src/bridge/mod.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b22d5b7427eb37f94712f89347be217acc2bb7681c75b789c0ba238a9cdedec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): channels/src/grpc_client.rs:161-177 | orchestration/goal/src/agent_client.rs:228-245 | orchestration/goal/src/agent_client.rs:372-390 \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":"channels/src/grpc_client.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"2587ffd20ca772106f907951e44b32144a07059e9dad015dd10abba80490b377"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): channels/src/status.rs:202-209 | channels/src/status.rs:212-219 \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":"channels/src/status.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4e1b0dafeba686c406206a8775308239aa33efa75ef59b1063e7878541a857"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): cli/src/browser/chromium/chromium_manager.rs:15-30 | cli/src/browser/safari/safari_manager.rs:401-417 \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":"cli/src/browser/chromium/chromium_manager.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c62aef1fd4f5287226bbfbb834cb1849bf641a45474f52be6c9edfd5586cba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): host/src/agent_bridge/delete_outbox.rs:135-144 | host/src/agent_bridge/observer.rs:424-433 \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":"host/src/agent_bridge/delete_outbox.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"124aa189651ab20f35cf6a12afaaf5f8a698029949c014e743255e0edcf7ad7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): host/src/git_history.rs:526-539 | tui/src/workbench/diff_review.rs:141-154 \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":"host/src/git_history.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbdf8a819d668b26c2c8d5e884284b0efd5a47052b770320a64d8d4daefa535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tui/src/rpc/grpc_client.rs:473-488 | tui/src/rpc/grpc_client.rs:491-502 \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":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc17cb1ee3b37f528e25b206987c616177200b502082050f085fe6d9139200ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): agent/src/rpc/protocol.rs:242-254 | agent/src/rpc/protocol.rs:262-274 \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":"agent/src/rpc/protocol.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"424e23e5b84be28ebe60bfbceca613c4483058388c73d3495e0237f026bba920"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tui/src/workbench/syntax.rs:1051-1058 | tui/src/workbench/syntax.rs:1060-1070 \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":"tui/src/workbench/syntax.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"9153e5ddb9f7a52e7a1da7a103e6e6426eedb7bd9ea41cd17c8da04d3fda2d82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): cli/src/commands/configure.rs:650-663 | cli/src/commands/configure.rs:794-807 \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":"cli/src/commands/configure.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"6970180b7044844ca9d7b7da16d0ddb34aab287959a27da3db6a338aa6aa6428"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cli/src/commands/task.rs:496-507 | host/src/tasks/service.rs:203-213 \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":"cli/src/commands/task.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b8bc823ac722a2f6e2d506789c45545cdb8a4a44722721925e14398f0a9326"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agent/src/agent/run_loop.rs:60-71 | agent/src/agent/run_loop.rs:76-85 \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":"agent/src/agent/run_loop.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af377df98418bbf72c75b64992ccaa54ed2b1ec54c6034c2587187158609ddb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): cli/src/commands/browser_tools.rs:1261-1269 | cli/src/commands/browser_tools.rs:1274-1286 \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":"cli/src/commands/browser_tools.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"104aa7d4421224753cf2e09cb8f7d6254281384b0b7916dade1b5eca82869df1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): cli/src/commands/mcp_http.rs:399-406 | tui/src/skills_cli.rs:539-549 \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":"cli/src/commands/mcp_http.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb3ac7d53a4660f4c2829a52cd2b91b3c61b43287a98ee6d13c5c0142440566"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): host/src/agent_bridge/queries.rs:762-772 | host/src/agent_bridge/queries.rs:791-801 \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":"host/src/agent_bridge/queries.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"539610e88b946516192a778c7cdb39ffde8f2546d713f15936a2eb7453bce97b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): host/src/store/deletions.rs:48-55 | orchestration/tasks/src/store.rs:732-737 \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":"host/src/store/deletions.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89a05064342d6b85bd6da0ce251b58deb59de123130b433aae944b033dd790f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): agent/src/rpc/session.rs:1634-1646 | agent/src/rpc/session.rs:1662-1684 | agent/src/rpc/session.rs:1714-1730 \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":"agent/src/rpc/session.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"76268cbbc12fa0f920ef3e71a482bed0813df732987fd7c33446444d91692b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): host/src/agent_bridge/persist.rs:435-439 | host/src/store/runs.rs:1219-1223 \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":"host/src/agent_bridge/persist.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"789fe4b972d7ee96f0de3b28aa1acbb43b2a3de04169c54ea1e8fb4d2af81489"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): host/src/store/deletions.rs:74-84 | host/src/store/threads.rs:937-951 \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":"host/src/store/deletions.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d256e2f985477c5f5114313c36f171809bf201f34264008ba4cd16acc9d4b89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): orchestration/fusion/src/store.rs:154-158 | orchestration/fusion/src/store.rs:161-172 \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":"orchestration/fusion/src/store.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e1aa7bedc2a44980a21c5baabf030bd38eb425615a07eeafc85e3f550d41993"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agent/src/agent/run_loop.rs:2016-2026 | agent/src/agent/run_loop.rs:2036-2046 \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":"agent/src/agent/run_loop.rs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"5620c550cde7dbc2ea193a415dfad15179cc87e52dbfcd2f8ac00c32aa6fddd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agent/src/config/providers.rs:360-369 | agent/src/sandbox/rules.rs:407-414 \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":"agent/src/config/providers.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4301706aaa1fe3b16ccbae989a5cc3bac88a3fb0ee50398bdfd6d3992a23dbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agent/src/session/sqlite_store/mod.rs:39-45 | agent/src/session/sqlite_store/mod.rs:160-172 \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":"agent/src/session/sqlite_store/mod.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"294afd55e1b9d0d07faec9f088b9da6435e1369565d4ed6c49d89ba2a3f8af97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): host/src/cli_tool.rs:202-212 | host/src/git_history.rs:293-302 \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":"host/src/cli_tool.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20c45a3c3016395c41e68b8cfac0c0311bb83a2b423052a3f6463206ebaabeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): host/src/store/approvals.rs:106-117 | host/src/store/approvals.rs:122-133 | host/src/store/approvals.rs:173-184 | host/src/store/runs.rs:158-169 | host/src/store/threads.rs:46-57 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/store/approvals.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"a137c58f7906528c578b91b00c98094e68fa8a05e16fe355eda666626f1757b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): packages/app-workspaces/src/lib.rs:213-226 | packages/app-workspaces/src/lib.rs:230-243 \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":"packages/app-workspaces/src/lib.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1219a758d9cdd1c4526e4d360138c73236325ea6faa219eb12ef49de1939570e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): packages/remote-crypto/src/lib.rs:92-103 | packages/remote-crypto/src/lib.rs:104-115 \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":"packages/remote-crypto/src/lib.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e5018f15ed58c033e34ebe2a428143d9fe124e106487ed5c7ed7c116c0ac85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): packages/rpc/src/decode.rs:115-120 | packages/rpc/src/decode.rs:632-637 | packages/rpc/src/decode.rs:655-660 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad57640c8cb5d6e436b325f67744476431406192e91914b62fbaecbbddacc9b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): tui/src/components/chat_area.rs:4087-4092 | tui/src/components/markdown.rs:2019-2024 \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":"tui/src/components/chat_area.rs"},"region":{"startLine":4087}}}],"partialFingerprints":{"codehealthFindingId/v1":"af234dc67278f0c79b26b26718b0044ce52852d401c42490597431f8c7994568"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): tui/src/workbench/live.rs:3707-3716 | tui/src/workbench/live.rs:3720-3730 \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":"tui/src/workbench/live.rs"},"region":{"startLine":3707}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a49932cb4fa56161dcf78e96354bfb3e49df5d75d1e0daf87c7286cdf111295"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tui/src/workbench/state.rs:343-355 | tui/src/workbench/state.rs:366-373 \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":"tui/src/workbench/state.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"6197fd36dd31d426f1a83c55af65174301548fdb5c8cd9a87f50b442e6cad506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): channels/src/providers/wecom.rs:350-366 | channels/src/providers/whatsapp.rs:424-439 \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":"channels/src/providers/wecom.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"905906fb6a0c162ad77c4b62595b12a1f20e3befd5ddce6c2fe3ce58c592c96a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): cli/src/commands/model_settings.rs:239-245 | cli/src/commands/model_settings.rs:474-480 \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":"cli/src/commands/model_settings.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d860d08e03a45f9d78b3289aef13f05c4f6d031b9afd361fbf92cddb983ca0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): packages/rpc/src/decode.rs:587-596 | packages/rpc/src/encode.rs:371-380 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6212b4378b15fa0af5e1a9f7a10720c380358f9487ce17faf4ed4b0629d3ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agent/src/session/history/paging.rs:125-134 | agent/src/utils/mod.rs:25-35 \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":"agent/src/session/history/paging.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b7347249dcd46a805158c3e06c9d87d11585bb674f73d88a0a46b3661ca438"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): cli/src/browser/chromium/chromium_manager.rs:61-69 | cli/src/browser/safari/safari_manager.rs:419-427 \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":"cli/src/browser/chromium/chromium_manager.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7417e7523c5b2b886b4797a78db2a297409bbb7bfbfebcfffa0edaf2b7d26f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): host/src/remote_host/command_diagnostics.rs:77-88 | host/src/remote_host/command_diagnostics.rs:93-102 \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":"host/src/remote_host/command_diagnostics.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2650acc697620862aecdf01d71c99f85a7aa63d968ecea786ce45f95654de88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): packages/rpc/src/decode.rs:403-411 | packages/rpc/src/encode.rs:122-130 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57bf52ca9e134b2bbc10bcc4b8c879e034cab3d8b5935670ea6dd9ec8c78ec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agent/src/session/content/checkpoint_retirement.rs:20-27 | agent/src/session/content/reset.rs:14-28 \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":"agent/src/session/content/checkpoint_retirement.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47ea2b34c400fc0bfe1eea57f129c89ffc7e58ccf2d6d2e0b43b0c56a872a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): agent/src/rpc/commands/settings.rs:372-381 | agent/src/rpc/commands/settings.rs:414-423 | agent/src/rpc/commands/settings.rs:428-436 \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":"agent/src/rpc/commands/settings.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"886aa7531cfb5fc873d66dc4fe84bb14bf51e648d3cda90e56302617314d8898"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): agent/src/session/journal_reclaim.rs:134-138 | agent/src/session/journal_reclaim.rs:140-144 \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":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ee135bb1e1f707f06308ca0f84280b75011c203a4124fd13534e11f95cb2c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): channels/src/feishu/feishu_rest.rs:371-385 | channels/src/feishu/feishu_rest.rs:523-537 \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":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2c9c35586955044f487e0b0745d34594e0e87299c9190a224ecd6bbea35c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): channels/src/status.rs:169-178 | channels/src/status.rs:181-191 \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":"channels/src/status.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cf30319336104d36e3637d4e0a71cbe29e904da6b4c8eceff87fd72a663e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): cli/src/commands/browser_tools.rs:1288-1296 | cli/src/commands/browser_tools.rs:1305-1311 \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":"cli/src/commands/browser_tools.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"1303dc9022b79077ab863c9b59873b40659f6210967ed6521c07a66806ef4a2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): host/src/fusion/resilience.rs:203-207 | host/src/fusion/resilience.rs:208-215 \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":"host/src/fusion/resilience.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bda1f005152723da60c03dc795f7510d8b8c552e247880779d22e39c989843"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): host/src/store/runs.rs:834-842 | host/src/store/runs.rs:845-853 \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":"host/src/store/runs.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb81c060c84479bd93424d36c10b860ed0885a71c7c9ceb36be9fbc4fa2d7f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): orchestration/tasks/src/store.rs:571-584 | orchestration/tasks/src/store.rs:586-592 | orchestration/tasks/src/store.rs:707-713 \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":"orchestration/tasks/src/store.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3c25528c09244d8c7d22144e3d83d1c5eeaf124645877c73a1eb566f719f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): agent/src/session/content/stream_body.rs:34-41 | agent/src/session/content/stream_body.rs:104-108 \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":"agent/src/session/content/stream_body.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"552147242001a0338dfa3bd5c40d3ba5ad51b2f92dcbffefd36ceee7447d3a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): host/src/store/threads.rs:542-554 | host/src/store/threads.rs:916-924 \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":"host/src/store/threads.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37339a0e1ef396b6878bc88b331fd36d768da7f7499b6b4bf789bab50f73383"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): tui/src/worktree.rs:206-213 | tui/src/worktree.rs:216-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":"tui/src/worktree.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f91e2561a5c1f3fbb4eab8585cf2e4aefb595abc9098c142b20b9e6baa07bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): channels/src/providers/email.rs:405-413 | channels/src/providers/irc.rs:342-350 \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":"channels/src/providers/email.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e0f1c1c8ba2970af0f2a1dedda0bf294221a4c616fd306380b21bb17882abb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agent/src/service/work.rs:45-56 | agent/src/service/work.rs:58-67 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/service/work.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de15dad12e97e42367ae2f795565fa16ceb165655a471c62b1f2663bcffb2bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): host/src/agent_bridge/observer.rs:88-97 | host/src/agent_bridge/reconciliation.rs:1050-1059 | host/src/agent_bridge/stream.rs:20-29 \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":"host/src/agent_bridge/observer.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ca8b168dbe31c431a5a9d3bb305bf910c253bb0ff0ade17b4de07b8edbdda1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tui/src/workbench/launchpad.rs:116-127 | tui/src/workbench/live.rs:5018-5030 \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":"tui/src/workbench/launchpad.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e08b7b51cfef38b79c5d7504fa6e1337955d620315d73599e92776847a9183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): host/src/remote/supervisor/state.rs:16-40 | host/src/remote_peer/host.rs:33-43 \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":"host/src/remote/supervisor/state.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a67c4e577b9026080c948a94c9a91a885a7dc86d454c65792e82f7218c78596"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): host/src/store/threads.rs:332-345 | host/src/store/threads.rs:407-420 \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":"host/src/store/threads.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"3400b88f45a790917a8d8bcb0bff6f599199b38051a194d8abe1215e5b9e8db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agent/src/sandbox/paths.rs:122-132 | orchestration/goal/src/agents/workspace_guard.rs:65-74 \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":"agent/src/sandbox/paths.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a91611b0c684cf1eaf0715da1fc73cff806dfb4ed7e934d857ebecd8091f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agent/src/skills/manager.rs:866-878 | agent/src/skills/mod.rs:313-321 \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":"agent/src/skills/manager.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3718f935b5d352b9620cb4948038bb5583ac493eeea8fbbfcf9d7389ea4cb51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): channels/src/grpc_client.rs:415-432 | tui/src/rpc/grpc_client.rs:973-982 \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":"channels/src/grpc_client.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5e6bcc76665724bc4b7ac026c5797ea4124ad2a099331b3f475a30d840d5fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): desktop/src-tauri/src/commands/debug.rs:25-27 | desktop/src-tauri/src/commands/update.rs:1989-1991 \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":"desktop/src-tauri/src/commands/debug.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d06b53f82ff9479b25bc12f2bb1fa0b66dda80afcdec22a6dec7a82359f617"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): desktop/src-tauri/src/commands/git_history.rs:22-32 | desktop/src-tauri/src/commands/review.rs:27-34 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src-tauri/src/commands/git_history.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a738e4abeb7577cc117c2fd891dce55232aa22ca2da4c6b86ded42d85d6024b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): desktop/src-tauri/src/commands/git_history.rs:39-46 | desktop/src-tauri/src/commands/review.rs:15-22 \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":"desktop/src-tauri/src/commands/git_history.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb091adba787cb9ce786e7c73ddee21e917b69c188a4044aed70edd12bc031e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): host/src/files.rs:48-57 | host/src/remote_host/session_files.rs:143-152 | packages/app-workspaces/src/lib.rs:701-710 \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":"host/src/files.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e84f586fc950a4156026e62491a1223a15e5293b9987b9c9eb5329c87b649c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): host/src/tasks/service.rs:222-228 | host/src/tasks/service.rs:395-401 \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":"host/src/tasks/service.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc49401741749431f0e0a49024536b4ecc6b25ba177cb05239cd8c75ff0d7c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): orchestration/goal/src/compat.rs:314-322 | tui/src/home.rs:11-17 \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":"tui/src/home.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa9679722e137ea9a54d170ddea72efed7734752fc167cb154adb8d718973b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): packages/app-workspaces/src/lib.rs:175-197 | host/src/store/paging.rs:418-430 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/app-workspaces/src/lib.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4aaa2fea6bdc88760250a358e8aa8991a73cd16077f3874c08486acf23008e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): tui/src/skills_cli.rs:819-827 | tui/src/subprocess.rs:145-153 \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":"tui/src/skills_cli.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"af76ae17ccd9055fc52093eb3c1c634aa2ace8ef33011a81bcc56e1ad118a3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): cli/src/browser/chromium/chromium_session.rs:340-358 | cli/src/browser/chromium/chromium_page.rs:366-376 \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":"cli/src/browser/chromium/chromium_session.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db757cc9e220199ac3e7fbde3010282cbf0c0894952ce8ac81fffef7db2c48f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): packages/remote-client/src/runtime.rs:1042-1055 | host/src/agent_bridge/observer.rs:550-558 \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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8f5ff8282eb12ca595e37c59f26c93b6974824aadc03ce1bfbbc9926148bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): packages/rpc/src/decode.rs:453-461 | packages/rpc/src/encode.rs:167-175 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35fee60b149fdae668d237a6339e510266ddda12a468b9e5445ae1aca651478"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): cli/src/commands/models.rs:11-19 | cli/src/commands/session.rs:135-143 \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":"cli/src/commands/models.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2d643f22cd8194068c9912cb84555430a1da99d4e5169ec531ce20b3dbec5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): host/src/store/runs.rs:244-264 | host/src/store/db.rs:543-553 \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":"host/src/store/runs.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"151964d43076ddb5a925052cb379319425fcddb62bcb5f81c251f46e1af55e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): channels/src/providers/irc.rs:759-768 | channels/src/providers/email.rs:543-548 \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":"channels/src/providers/irc.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e80a87495fde4fb9158baff882b7bc72c1d26026ff52a63d0a3e23ee1fb7da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): cli/src/commands/session.rs:124-132 | orchestration/goal/src/decision/mod.rs:734-742 \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":"cli/src/commands/session.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada2c437fd862fa0b2fc62f0f7e2ab0238bf11d6e22b6ab00cb16833c28bb52a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): tui/src/workbench/live.rs:4941-4950 | packages/remote-server/src/wire_limits.rs:422-431 \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":"tui/src/workbench/live.rs"},"region":{"startLine":4941}}}],"partialFingerprints":{"codehealthFindingId/v1":"b008d05a1d3deeed7310e70c378b715ec5d6e4cbcb9eb093f1602cfd098c008e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): agent/src/rpc/export_html.rs:529-536 | agent/src/skill_reco/mod.rs:870-878 \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":"agent/src/rpc/export_html.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"755d150a485eb7a6742e94e60ba03a8d9600c76048883601357260ce494dda5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): channels/src/cli_cmd.rs:279-285 | cli/src/commands/mcp_servers.rs:1230-1236 | tui/src/workbench/local.rs:200-207 \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":"channels/src/cli_cmd.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"10be8c4f3d38aa353bb961b107e6f032fb30924eb934890b343de41a0b97b43e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): channels/src/feishu/card.rs:294-305 | host/src/remote_host/business/tasks.rs:17-26 \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":"channels/src/feishu/card.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"61150684b8fb629ecbcac9f0f2873b606c2485e5a1469b9970f65c52d591f7c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/app-settings/src/lib.rs:126-133 | packages/app-workspaces/src/lib.rs:36-42 \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":"packages/app-settings/src/lib.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58e2a110507827e8ffbe570c26178474b6768967309b4f8c4f5882eced175b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): desktop/src-tauri/src/terminal/ticket.rs:111-120 | desktop/src-tauri/src/terminal/server.rs:975-981 \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":"desktop/src-tauri/src/terminal/ticket.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"983a9d55b17593e76a8995ff93b0ca9fc25a8b6230fcecebf2333eb076a54760"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agent/src/llm/mod.rs:95-101 | orchestration/goal/src/state.rs:1053-1059 \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":"agent/src/llm/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b54610483b19b8935d38223d7afe5d2f3552e26601d508d73a1af0f8d76b1fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): channels/src/providers/linq.rs:576-584 | channels/src/providers/whatsapp.rs:477-485 \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":"channels/src/providers/linq.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"276a9d78d96f7fc6ea0f25e3538f79fe0c2aca3c9f19f7e4950365c7924d18f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agent/src/compaction/semantic.rs:879-885 | cli/src/axi.rs:164-173 \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":"agent/src/compaction/semantic.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b25dc27698faf14be5f68ce1bdb8060ed04f0b1ff1cfd79905a1d63aebe387f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): agent/src/session/content/compress.rs:34-45 | agent/src/session/content/rechunk.rs:30-43 | agent/src/session/content/retire.rs:32-48 | agent/src/session/journal_reclaim.rs:147-153 \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":"agent/src/session/content/compress.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"35dab1d226e52f8b3178432ac12bf445c5092d7ea040b7ac88b947e5028afc86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): cli/src/commands/session_journal.rs:138-150 | cli/src/commands/session_prune.rs:180-188 \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":"cli/src/commands/session_journal.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d100c6eb9ea8f16dcdd72b3c7db85bb03d55b770362d19dd3ea4b7928ed365"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): host/src/remote_host/business/mod.rs:232-237 | host/src/remote_host/business/terminal.rs:263-268 \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":"host/src/remote_host/business/mod.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b3e960af5278954d8062988b708ae204fa581b61e64bf589d652931e84a0a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): host/src/store/markdown_refs/resolve.rs:255-271 | host/src/store/review_snapshots.rs:323-341 \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":"host/src/store/markdown_refs/resolve.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"101e5188fb83efcbc990981a91fa3afd9b6c15dcdc35c025122b8a2a57b1bf7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): agent/src/session/content/checkpoint_retirement.rs:7-14 | agent/src/session/content/metadata.rs:78-81 | agent/src/session/history/recovery.rs:67-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":"agent/src/session/content/checkpoint_retirement.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a76802dce3633c365e155d16d45df78f88e3db158095833b918124f0a6177be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): cli/src/commands/model_settings.rs:734-742 | cli/src/commands/settings.rs:56-64 \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":"cli/src/commands/model_settings.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffef33710b30095654fb6b91802fd8180e06dbba8a3ea2936c179ce86a83be90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): agent/src/approval_review/evidence.rs:541-550 | agent/src/types/mod.rs:549-557 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/approval_review/evidence.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"059ddc0b3e07e2db4b84007491f4efd8650999d8d0bb7d4f8b2b318e25fca877"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agent/src/session/reset.rs:218-225 | agent/src/types/mod.rs:510-516 \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":"agent/src/session/reset.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b93a5f2ba71f7423a6bf93da81baf5693c8fc0d3029567f91ec82d538de399"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): agent/src/session/content/compress.rs:58-62 | agent/src/session/journal_compaction.rs:105-109 \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":"agent/src/session/content/compress.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f405c9aa317d7b464f3d7c305e9fe217ead1bd4441b4f58b03646730eda13c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): desktop/src-tauri/src/terminal/server.rs:678-683 | tui/src/workbench/layout.rs:324-330 \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":"desktop/src-tauri/src/terminal/server.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e55f96fb23d8b6ce7a348ba4966659932019c65c45dffe87a4cfc125d3d9bea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): host/src/store/db.rs:566-575 | host/src/store/markdown_refs/resolve.rs:236-249 \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":"host/src/store/db.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"248c0c1648f479da475c752808670f64f0849b9ece4a90ffba0178ef979324ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/app-settings/src/lib.rs:137-144 | packages/app-workspaces/src/lib.rs:46-52 \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":"packages/app-settings/src/lib.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"2545db15e26d52fd4c23793c180cbde1c74899be70cdea5f8280b91fcfe3453b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): packages/remote-client/src/credentials.rs:98-104 | packages/remote-server/src/credentials.rs:29-36 \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":"packages/remote-client/src/credentials.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"914852bf11942daaa8e3a17297f56ed8b55f70d71b0650b61eb4657d7930f315"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): channels/src/providers/email.rs:1472-1477 | channels/src/providers/irc.rs:384-389 \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":"channels/src/providers/email.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6bc69cdfbdbf4eedf48d41a241ea4aa987566df446ff818ec5460bb16d49ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): orchestration/goal/src/scheduler/state.rs:54-59 | tui/src/workbench/screen.rs:900-903 \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":"tui/src/workbench/screen.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4a058bad6674ce6d7392b87f63bbb4311b4da1216ebe10b706adc1187b6cfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): packages/rpc/src/decode.rs:598-608 | packages/rpc/src/encode.rs:382-392 \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":"packages/rpc/src/decode.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbc4bb258eaf7e0b3d798c64a0b01ba4fbe062305de399624bde1e5016fa191"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): channels/src/grpc_client.rs:441-452 | orchestration/goal/src/agent_client.rs:466-478 \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":"channels/src/grpc_client.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d72e8420c11333ff45d81af14b7176cc021e14867a9a993aa956782593d87e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): agent/src/session/content/metadata.rs:83-87 | agent/src/session/history/display_index.rs:108-115 | agent/src/session/history/recovery.rs:85-94 \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":"agent/src/session/content/metadata.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2546f5f769ec312498d62d02bf79db306055d138701075454ab8c03248dc22ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): channels/src/grpc_client.rs:455-466 | orchestration/goal/src/agent_client.rs:251-262 \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":"channels/src/grpc_client.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"9726256f7f3d959ef7fe997e238b8f12fc50d356f0b09716c31dedb142b190b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): channels/src/providers/email.rs:398-403 | channels/src/providers/irc.rs:335-340 \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":"channels/src/providers/email.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0809fd8221c9d38b1fbe5e7dc16bb1a3c232f5629500e3d672184d89b89ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): channels/src/providers/email.rs:2616-2622 | channels/src/providers/signal.rs:493-497 \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":"channels/src/providers/email.rs"},"region":{"startLine":2616}}}],"partialFingerprints":{"codehealthFindingId/v1":"3148bed72743d34d300fd084d547bf973109283793370b8d992587320dcf6e65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): cli/src/browser/browser_state.rs:291-296 | cli/src/browser/selector.rs:152-157 | cli/src/commands/browser_tools.rs:1390-1395 \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":"cli/src/browser/browser_state.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc81bcce2d61b10fc4f3fcac838997ba67928cc53b68e6775557e17d36e382c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): channels/src/grpc_client.rs:395-406 | orchestration/goal/src/agent_client.rs:279-290 | tui/src/rpc/grpc_client.rs:553-564 \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":"channels/src/grpc_client.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"8297a59f85fc666f60ac6f4098f6bf69aed10707afbaa56e3fa106753cf97227"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): cli/src/commands/mcp_servers.rs:1040-1046 | tui/src/workbench/editor.rs:99-105 | tui/src/workbench/state.rs:376-382 \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":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"092e0a385eb6d63d83a675ab57f1df56f6cdd26a464be19f36aced3d99a9501a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): cli/src/headless/mod.rs:988-995 | desktop/src-tauri/src/agent_bridge/client.rs:6-25 \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":"cli/src/headless/mod.rs"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6600ef7e9a508160c64e6f26b6cdf1b85499191beea9077cd5f98a4ce4d376"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): host/src/store/artifacts.rs:274-283 | host/src/store/markdown_refs/resolve.rs:127-139 \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":"host/src/store/artifacts.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e3a34f192d9513fcfefe04468bd9934879afcfbd98729848c274ba213a6631"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): host/src/store/paging.rs:329-338 | packages/app-workspaces/src/lib.rs:407-414 \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":"host/src/store/paging.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"e638625c62f35577e2c849603a56d29ea976f6453bddab317e46446bd255120f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): agent/src/compaction/mod.rs:497-507 | agent/src/rpc/commands/session_title.rs:173-184 \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":"agent/src/compaction/mod.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"849d690324802d43a18c4dc971d3765f23e0a852eef819eb79ad004283bef362"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agent/src/session/content/mod.rs:101-110 | packages/app-workspaces/src/lib.rs:628-637 \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":"agent/src/session/content/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1042f9c120e21b16e76d46d708caf6020ea36f54586eae3cb133a4fbc7862241"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): channels/src/providers/wecom.rs:369-374 | packages/remote-client/src/runtime.rs:959-966 \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":"channels/src/providers/wecom.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f5f082fb0a79341e98f64bdc0ab811ee65ae3e9efb2239f85fa2a1548ea353"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): cli/src/commands/tools.rs:176-181 | orchestration/goal/src/quota/slot_accounting.rs:102-108 \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":"cli/src/commands/tools.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b2937af2e490e8fe5886a5bc96fb1b82c049a3770f84cd80f38ab052915d74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): cli/src/relay/room.rs:103-108 | host/src/remote/relay.rs:170-173 \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":"cli/src/relay/room.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"07307bb98db589422f0e224b2eaec5c48425a63ea3e4ed3d67b733177e79cb74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): cli/src/utils/time.rs:9-14 | orchestration/goal/src/state.rs:1641-1646 \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":"cli/src/utils/time.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf504e01a0a8ba7f9532d8312a13b88cf7231f360f49985005f68e9d887046b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): host/src/remote_host/pairing.rs:716-722 | packages/remote-protocol/src/invitation.rs:133-136 \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":"host/src/remote_host/pairing.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23b91f2534934c7594a5ef0ac7782c4738b48d6629a6485ec572eab04d7860e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): agent/src/main.rs:8-11 | channels/src/main.rs:9-12 | cli/src/main.rs:18-21 | tui/src/main.rs:9-12 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/main.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2736be840bda4597a5d71ee7c4e36520747f17598ebaaa421ab32ae0e7208aa4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): agent/src/skills/manager.rs:39-44 | channels/src/bridge/dedup.rs:89-95 \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":"agent/src/skills/manager.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aba10ff6db3484f1dd831373738b365937ff5e0798cc5b10f594656b8b388fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): channels/src/providers/discord.rs:235-243 | host/src/conversations.rs:73-80 \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":"channels/src/providers/discord.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee9110cd7f7a2c068dd7b00ccafa5f04769a6ec615bc56c36b5ddd96d589f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (134\u2013145 lines \u00D7 2): host/src/git_history.rs:626-759 | tui/src/workbench/git_panel.rs:320-464 \u2014 before extracting anything, compare \u0060host/src/git_history.rs\u0060 and \u0060tui/src/workbench/git_panel.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 207 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 \u0060host/src/git_history.rs:626\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":"host/src/git_history.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9380aa1e98169e63e0b00b7711d7c44978b87e79a20260d21199e4f8b35e790"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201331 lines \u00D7 2): tui/src/workbench/git_panel.rs:608-638 | tui/src/workbench/git_panel.rs:766-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 \u0060tui/src/workbench/git_panel.rs:608\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":"tui/src/workbench/git_panel.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"37d406d50a3c0fb4f3bf426b026611b687e130330e52fa6463cb92bfab846631"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45 lines \u00D7 2): cli/src/rpc.rs:1686-1730 | tui/src/rpc/grpc_client.rs:1402-1446 \u2014 before extracting anything, compare \u0060cli/src/rpc.rs\u0060 and \u0060tui/src/rpc/grpc_client.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 83 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 \u0060cli/src/rpc.rs:1686\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/rpc.rs"},"region":{"startLine":1686}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f6e75e618bf89b9b9368b3a6fbdd738a9e45333499854f70008dbc35e22791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): host/src/git_history.rs:587-615 | tui/src/workbench/git_panel.rs:280-308 \u2014 before extracting anything, compare \u0060host/src/git_history.rs\u0060 and \u0060tui/src/workbench/git_panel.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 207 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":"host/src/git_history.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb4236359dcdf2ef2bbca519bab122ed30bcdc7c21df4ce0df925b531e41ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): agent/src/llm/mod.rs:593-618 | agent/src/llm/mod.rs:647-672 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/llm/mod.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12236d533b2b9ee478b4addf5c409f9b21ced424860035122f0cae949940c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 2): cli/src/rpc.rs:172-197 | tui/src/rpc/grpc_client.rs:1371-1394 \u2014 before extracting anything, compare \u0060cli/src/rpc.rs\u0060 and \u0060tui/src/rpc/grpc_client.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 83 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 \u0060cli/src/rpc.rs:172\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/rpc.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8befa3a3c489d311f090fda948fce3d04a0589387404bb43eef3bdd862579fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): channels/src/feishu/bridge.rs:892-915 | channels/src/feishu/bridge.rs:974-997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/feishu/bridge.rs:892\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":"channels/src/feishu/bridge.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"1872a49c31f29ca73715983fc7d8d7e3d10a97c9a562394b79dfff587834a771"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): packages/remote-client/src/tasks.rs:69-91 | packages/remote-server/src/tasks.rs:65-87 \u2014 before extracting anything, compare \u0060packages/remote-client/src/tasks.rs\u0060 and \u0060packages/remote-server/src/tasks.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. 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":"packages/remote-client/src/tasks.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"946f64db6514bce43fa308db533be73383a161f818c588078d6457617daf3054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): agent/src/session/history/display_index.rs:363-382 | agent/src/session/history/display_index.rs:447-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/history/display_index.rs:363\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/history/display_index.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"379154f887a7235e0f8b702cdbb2b2afb99f9d80853df4931e64910fad4f379e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): channels/src/feishu/prompt_loop.rs:170-190 | channels/src/feishu/prompt_loop.rs:220-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060channels/src/feishu/prompt_loop.rs:192\u0060 calls \u0060from_millis\u0060 and \u0060channels/src/feishu/prompt_loop.rs:243\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":"channels/src/feishu/prompt_loop.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"904f22380bbfd6126e66b9ab236191a497f27a73c16467b54abcc188411fc9ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): tui/src/utils.rs:896-919 | tui/src/workbench/run.rs:1993-2016 \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":"tui/src/utils.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d6bd1cbdb59df1e69feb7b18932bf894e3ef11c94a22b449b68e9e3521a768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agent/src/rpc/session_prompt.rs:1071-1090 | agent/src/rpc/session_prompt.rs:2057-2076 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/rpc/session_prompt.rs:1071\u0060 it begins part-way through the construct above it, so those exact 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":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"250f43945cbd0b97b402dcad4b818e0b31fb650b6ef0b5b534989c5b61d81c9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agent/src/runtime/scheduler_queue.rs:461-480 | agent/src/runtime/scheduler_queue.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 \u0060agent/src/runtime/scheduler_queue.rs:461\u0060 it begins part-way through the construct above it, so those exact 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":"agent/src/runtime/scheduler_queue.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"094cf54fd7cde04e68cbcbe76348bb7f66216e25fd8cc4a52cb47e9a884e2ee9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): channels/src/feishu/bridge.rs:605-624 | channels/src/feishu/bridge.rs:707-725 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/feishu/bridge.rs:605\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":"channels/src/feishu/bridge.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"6925f794a234a86045b8857e35c194a29a7a246a576ceb4fe99cc8cfee05a7a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): tui/src/skills_cli.rs:675-694 | tui/src/subprocess.rs:55-74 \u2014 before extracting anything, compare \u0060tui/src/skills_cli.rs\u0060 and \u0060tui/src/subprocess.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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 \u0060tui/src/skills_cli.rs:675\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/skills_cli.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77169db96b6d6ce898c4a8cd6782e17ccbf325230020b5b01413d46e72b9cd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 3): agent/src/tools/mod.rs:733-751 | host/src/agent_bridge/persist.rs:450-468 | host/src/store/runs.rs:1232-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/agent_bridge/persist.rs:450\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 \u0060command\u0060 to \u0060\u0026str\u0060 in one and \u0060Option\u003C\u0026str\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":"agent/src/tools/mod.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2b324f565527d2296afe30e3f2a73525630da1fc4bf10ad937b2cc3d33af59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): cli/src/browser/chromium/chromium_session.rs:641-659 | cli/src/browser/chromium/chromium_session.rs:823-841 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/browser/chromium/chromium_session.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":"cli/src/browser/chromium/chromium_session.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa67c9b5fa6b47eb8091d3f1fbfb53afebe669c49051ae9c269408c35b3c7455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): orchestration/tasks/src/store.rs:473-491 | orchestration/tasks/src/store.rs:504-522 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060orchestration/tasks/src/store.rs:473\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"orchestration/tasks/src/store.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6697eb0c0c1c0ee5dd32001bb9c5d9c036e44499f72474804896f0f9182b7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): tui/src/components/markdown.rs:1402-1419 | tui/src/components/markdown.rs:1678-1696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/components/markdown.rs:1402\u0060 it does not close everything it opens, so those exact 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, \u0060tui/src/components/markdown.rs:1420\u0060 calls \u0060is_some\u0060, \u0060Some\u0060, \u0060push\u0060 and \u0060tui/src/components/markdown.rs:1697\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":"tui/src/components/markdown.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d24f5db32feb47bf98423536b760dac5669842a5516fca15fd827cc6a9f008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): agent/src/rpc/approval.rs:218-234 | agent/src/rpc/approval.rs:461-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 \u0060agent/src/rpc/approval.rs:461\u0060 it begins part-way through the construct above it, so those exact 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":"agent/src/rpc/approval.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c071042e21a76f4cd3d2a1bfd4920daaac6e81e31558bc7e0cd9770434e48e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): orchestration/tasks/src/store.rs:610-627 | orchestration/tasks/src/store.rs:637-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"orchestration/tasks/src/store.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b52855f068da6ae24de2c650dce6e3b61aa48abcdc3164f5056ae378622b56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): packages/remote-client/src/runtime.rs:2168-2185 | packages/remote-client/src/runtime.rs:2280-2296 \u2014 both copies are in the same file, so extract the block 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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2066194d84dfd502f49536b128802ddf5bc5a53faab4262a3b0d421a8363600f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agent/src/rpc/approval.rs:199-215 | agent/src/rpc/approval.rs:432-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/rpc/approval.rs:199\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/approval.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"520b21933c14f1072a2124e675d6899789672754aa32f29a050b02816ce14e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): agent/src/rpc/approval/shape.rs:310-326 | packages/rpc/src/tool_arguments.rs:88-104 \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":"agent/src/rpc/approval/shape.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f65ea3ab8103b3153506502377ead06dcd7ea02d106f97f582c8055f8db3fb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): cli/src/commands/desktop.rs:176-192 | cli/src/commands/settings.rs:235-251 \u2014 before extracting anything, compare \u0060cli/src/commands/desktop.rs\u0060 and \u0060cli/src/commands/settings.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/desktop.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d7564f277eafdb3cafd4582935c96c09a0b54bd0e5892e82e264eec6a4a4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): host/src/remote_host/business/git.rs:21-36 | host/src/remote_host/business/git.rs:43-59 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/remote_host/business/git.rs:21\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/git.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecde8ad8fafab4be5c7543679c0577081a6f0a86a71e1d593f772863aa7d3fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): tui/src/utils.rs:1041-1057 | tui/src/utils.rs:1086-1100 \u2014 both copies are in the same file, so extract the block 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":"tui/src/utils.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa26c4313564fc21f5b1a6526c0ee2d90afdcb8fd673308b9989c5dc7b5ae30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): agent/src/runtime/scheduler_queue.rs:489-504 | agent/src/runtime/scheduler_queue.rs:666-680 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/runtime/scheduler_queue.rs:489\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":"agent/src/runtime/scheduler_queue.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"e84002be468716add09fdc9c21a107bae09a01e461986252e4bf26de8515ce5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): host/src/application/threads.rs:100-113 | host/src/application/threads.rs:128-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/application/threads.rs:100\u0060 it does not close everything it opens, so those exact 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":"host/src/application/threads.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"096e379feee7a92f792c36919850010e044781b724bd0494f1fa3de2106ce77c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): packages/rpc/src/decode.rs:694-709 | packages/rpc/src/encode.rs:645-660 \u2014 before extracting anything, compare \u0060packages/rpc/src/decode.rs\u0060 and \u0060packages/rpc/src/encode.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060packages/rpc/src/decode.rs:694\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 \u0060model\u0060 to \u0060\u0026proto::ModelEntry\u0060 in one and \u0060\u0026crate::payloads_ext::ModelEntryPayload\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":"packages/rpc/src/decode.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f3301239b29e575c014f828470c2f193e619b38210d065e667238089467fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): tui/src/components/markdown.rs:1262-1277 | tui/src/components/markdown.rs:1290-1305 \u2014 both copies are in the same file, so extract the block 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":"tui/src/components/markdown.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b08348bc830e1c3dc00661d9b96bb4c21d50837d12b6efc8fb3d0b086930169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): cli/src/browser/chromium/chromium_page.rs:89-103 | cli/src/browser/chromium/chromium_page.rs:133-147 | cli/src/browser/chromium/chromium_page.rs:229-243 \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":"cli/src/browser/chromium/chromium_page.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e8f045e2a8cdd83bcc4aec73391ff4b4f5b593c763841fe5494c0461a72e3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): cli/src/browser/chromium/chromium_session.rs:751-765 | cli/src/browser/chromium/chromium_session.rs:772-786 | cli/src/browser/chromium/chromium_session.rs:795-809 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060cli/src/browser/chromium/chromium_session.rs:771\u0060 calls \u0060insert\u0060, \u0060into\u0060 and \u0060cli/src/browser/chromium/chromium_session.rs:750\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":"cli/src/browser/chromium/chromium_session.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a95d213c88d37f38a9c55273df73eaebe2fafbef8262fabbf987a1ffaf2dc8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): agent/src/agent/run_loop.rs:1362-1375 | agent/src/agent/run_loop.rs:1535-1549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/agent/run_loop.rs:1362\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":"agent/src/agent/run_loop.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f0e06a5700735a1e32997175e9df15ab30228515b2af2b607cac00f9f20a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): agent/src/session/history/display_index.rs:332-344 | agent/src/session/history/display_index.rs:397-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 \u0060agent/src/session/history/display_index.rs:332\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":"agent/src/session/history/display_index.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9241da3ea2c9e14b433561b96c65aae22b2332853d05641b6b519f21e479d716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 2): channels/src/dingtalk/bridge.rs:456-465 | channels/src/feishu/prompt_loop.rs:85-99 \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 \u0060channels/src/dingtalk/bridge.rs:456\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c968736def50ee5a4a8a61788dd32d09ba018883bd4290303c1783032381d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): channels/src/providers/telegram.rs:301-315 | channels/src/providers/telegram.rs:320-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/providers/telegram.rs:301\u0060 it begins part-way through the construct above it, so those exact 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":"channels/src/providers/telegram.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc6527ca79f93db6a0a65bebebf9ff46b2af14835829986d483cc9f66e988a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): host/src/git_history.rs:766-778 | tui/src/workbench/git_panel.rs:476-490 \u2014 before extracting anything, compare \u0060host/src/git_history.rs\u0060 and \u0060tui/src/workbench/git_panel.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 207 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":"host/src/git_history.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7990c53e2d361c5356d4a55c09748696c1908c774e71dd16ecc1d45dcde23e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): host/src/tasks.rs:575-589 | host/src/tasks.rs:612-626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/tasks.rs:575\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/tasks.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"8649153e853d1fe1e5d4873a8db51bd088af4b7a0e3da7186530b0a0aeb87917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): agent/src/session/persistence.rs:437-450 | agent/src/session/persistence.rs:475-488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/persistence.rs:437\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/persistence.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f370f25201145228bdabfb6515a6578db7d8bb68adaa25c47bb24b33981d705c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 2): channels/src/dingtalk/bridge.rs:130-138 | channels/src/feishu/bridge.rs:205-218 \u2014 \u0060channels/src/dingtalk/bridge.rs\u0060 and \u0060channels/src/feishu/bridge.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/dingtalk/bridge.rs:130\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 \u0060event\u0060 to \u0060DingtalkEvent\u0060 in one and \u0060FeishuEvent\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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f01c975977bb2f70ff42cafccb80f311a125a6cfe8e7c67eba4afc5036d3c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): channels/src/dingtalk/bridge.rs:477-487 | channels/src/feishu/prompt_loop.rs:147-160 \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 \u0060channels/src/dingtalk/bridge.rs:477\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f4f32133e3dfdd575ab71d848dfff702323395dfcd30158a68c52b299365b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): channels/src/dingtalk/mod.rs:99-109 | channels/src/feishu/mod.rs:71-84 \u2014 \u0060channels/src/dingtalk/mod.rs\u0060 and \u0060channels/src/feishu/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 32 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/dingtalk/mod.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":"channels/src/dingtalk/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff10dfe26efb624333dec28c3c720fc7259f4f60ddb839d04b694cda26041a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): channels/src/feishu/feishu_rest.rs:228-241 | channels/src/feishu/feishu_rest.rs:269-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/feishu/feishu_rest.rs:228\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c66fe3fe0ba514fd93900b08cae1cf75cd6fd4e559104575527a013264fd6d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): channels/src/providers/linq.rs:768-781 | channels/src/providers/whatsapp.rs:778-792 \u2014 before extracting anything, compare \u0060channels/src/providers/linq.rs\u0060 and \u0060channels/src/providers/whatsapp.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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 \u0060channels/src/providers/linq.rs:768\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/linq.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"761efaaeb1540f26bbf8800f6a834169c9d878ebdcf56691cf02c8f5fb11fef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): channels/src/providers/telegram.rs:392-405 | channels/src/providers/telegram.rs:411-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/providers/telegram.rs:392\u0060 it begins part-way through the construct above it, so those exact 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":"channels/src/providers/telegram.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c46cd3b8bb53c157ede5fcf593dd587d9208633f8ce73d8e76c9caf2a574d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/src/commands/session_history.rs:56-69 | cli/src/commands/session_transcript.rs:154-167 \u2014 before extracting anything, compare \u0060cli/src/commands/session_history.rs\u0060 and \u0060cli/src/commands/session_transcript.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060cli/src/commands/session_history.rs:56\u0060 it does not close everything it opens, so those exact 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":"cli/src/commands/session_history.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abb0e7f3a743b8000fe4dc46c7ff6f95a0fe2554ed43fd619933dca46319252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cli/src/commands/tools.rs:591-604 | cli/src/commands/tools.rs:648-661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/tools.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/tools.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47b532d09cac6e3954ad0befb40a3787d2617aa5ff36a0fc738b864a73f4e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): host/src/agent_bridge/observer.rs:1142-1155 | host/src/agent_bridge/observer.rs:1346-1359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/agent_bridge/observer.rs:1142\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/observer.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b511a852ef7560979f3a6be2d4d1db82b1af567732e8b89ce5b49242ae64708d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): host/src/agent_bridge/reconciliation.rs:559-572 | host/src/agent_bridge/reconciliation.rs:982-991 \u2014 both copies are in the same file, so extract the block 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":"host/src/agent_bridge/reconciliation.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c623ae0872cbb09cca5f35994549bce01a3c1096ce494bdfd6e6bf120c0aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): tui/src/components/markdown.rs:1911-1923 | tui/src/components/markdown.rs:1940-1953 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/components/markdown.rs:1911\u0060 it does not close everything it opens, so those exact 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, \u0060tui/src/components/markdown.rs:1939\u0060 calls \u0060iter\u0060, \u0060enumerate\u0060 and \u0060tui/src/components/markdown.rs:1908\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":"tui/src/components/markdown.rs"},"region":{"startLine":1911}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3a476e1d41be77dda24ab7be0e17f429a757c4305449df60784608fc190884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): tui/src/stdin_buffer.rs:242-255 | tui/src/stdin_buffer.rs:272-285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/stdin_buffer.rs:242\u0060 it begins part-way through the construct above it, so those exact 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":"tui/src/stdin_buffer.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d781a466ea55e11825168498079af6ea299a267899767ac953fa07a9082a015"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): agent/src/agent/run_loop.rs:1435-1447 | agent/src/agent/run_loop.rs:1494-1506 | agent/src/agent/run_loop.rs:1624-1636 \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 \u0060agent/src/agent/run_loop.rs:1435\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":"agent/src/agent/run_loop.rs"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8276eded5f2831c37af510c8eeb0d0ea3dd2ca25234723ad915de4ab23e8348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agent/src/agent/run_loop.rs:487-499 | agent/src/agent/run_loop.rs:765-777 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/agent/run_loop.rs:487\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/agent/run_loop.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cec035e36c35de156765d65fb1ab427a8105885f00020cb883f5fb372dbc14d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agent/src/rpc/broadcaster/replay.rs:95-107 | agent/src/rpc/broadcaster/replay.rs:339-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/rpc/broadcaster/replay.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agent/src/rpc/broadcaster/replay.rs:335\u0060 calls \u0060then\u0060, \u0060capture\u0060, \u0060clone\u0060 and \u0060agent/src/rpc/broadcaster/replay.rs:94\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":"agent/src/rpc/broadcaster/replay.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc32518abf3d0215610a5f00231aca6043c9643d828b40a0f43e868fa41f0577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agent/src/rpc/session.rs:572-584 | agent/src/rpc/session_prompt.rs:512-524 \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":"agent/src/rpc/session.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d87861fa994716a8ab831bf796819913e6976cd39f4dab9e303c861aecd1523"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): agent/src/session/content/reader.rs:540-552 | agent/src/session/content/reader.rs:659-671 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/content/reader.rs:540\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":"agent/src/session/content/reader.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f87e3735a46a1c2556d27e678981c9817698842b9813c1112899af5a7f30b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): agent/src/session/journal_reclaim.rs:709-721 | agent/src/session/journal_reclaim.rs:794-805 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/journal_reclaim.rs:709\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b2962d7d444253372727eff0b0d090630c80c915c78d0ae2891305a39462c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): agent/src/tools/shell/execution.rs:612-622 | agent/src/tools/shell/execution.rs:675-687 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/tools/shell/execution.rs:612\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/tools/shell/execution.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed1f18e32f5f8fa929096cb5cbfff247ed80daf67bcaa9eca7da7ed985a9b83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): cli/src/commands/desktop.rs:104-116 | cli/src/commands/settings.rs:194-206 \u2014 before extracting anything, compare \u0060cli/src/commands/desktop.rs\u0060 and \u0060cli/src/commands/settings.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/desktop.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b186e34cfd1f1c8a3254c80acf6b07d285d57abaa3b111c11094ecfdd255be5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): cli/src/commands/remote.rs:404-416 | cli/src/commands/remote_peers.rs:286-298 \u2014 before extracting anything, compare \u0060cli/src/commands/remote.rs\u0060 and \u0060cli/src/commands/remote_peers.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"cli/src/commands/remote.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b36fbb216ef9e8a8c7babb4989f441452f96972a2be7c695d64b61e16eddb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): desktop/src-tauri/src/commands/files.rs:169-181 | desktop/src-tauri/src/commands/remote.rs:162-173 \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":"desktop/src-tauri/src/commands/files.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c951c8c5d5fbed930d7950420340e7a1d191c9b1311e8ea66c65ec4ff2051a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): host/src/agent_providers/validate.rs:270-282 | host/src/agent_providers/write.rs:83-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_providers/validate.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8224a918ab3b8d0156b7f5b26fb22b9f74b04200964ecc5f7a20fe04d09301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): tui/src/terminal_posix.rs:317-329 | tui/src/terminal_posix.rs:359-368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/terminal_posix.rs:317\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/terminal_posix.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c7e0161ca16e96f7ee197b8942547f1a79f93d538107f09dec6d8d970cf8c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): tui/src/index.rs:319-330 | tui/src/index.rs:337-348 | tui/src/index.rs:355-366 | tui/src/index.rs:374-385 | tui/src/index.rs:404-415 | tui/src/index.rs:435-446 | tui/src/index.rs:454-465 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/index.rs:319\u0060 it begins part-way through the construct above it, so those exact 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, \u0060tui/src/index.rs:368\u0060 calls \u0060is_empty\u0060 and \u0060tui/src/index.rs:332\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":"tui/src/index.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1281a8597866c24386ec504791dbb376dcb266744081c9f1a193db1956afd897"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): host/src/remote_host/business/tasks.rs:414-423 | host/src/remote_host/business/tasks.rs:471-480 | host/src/remote_host/business/tasks.rs:512-523 \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 \u0060host/src/remote_host/business/tasks.rs:414\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, \u0060host/src/remote_host/business/tasks.rs:511\u0060 calls \u0060wake\u0060 and \u0060host/src/remote_host/business/tasks.rs:413\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":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b92111d60116881a153186ab88bccdbf42c9dbcefc42063112494bb3d32e8d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): packages/remote-client/src/runtime.rs:3095-3106 | packages/remote-client/src/runtime.rs:3269-3279 | packages/remote-client/src/runtime.rs:3442-3452 \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 \u0060packages/remote-client/src/runtime.rs:3095\u0060 it begins part-way through the construct above it, so those exact 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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":3095}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dc84cde4b86ad75b69b3c8affb44b205b7de18a805b1fed625388d4cdebaab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): tui/src/workbench/git_panel.rs:537-548 | tui/src/workbench/git_panel.rs:608-623 | tui/src/workbench/git_panel.rs:766-781 \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 \u0060tui/src/workbench/git_panel.rs:537\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/git_panel.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f19708acada49efe5deeb43daf602639b970c54d055c2fb86ca24c51db11f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): agent/src/agent/run_loop.rs:517-528 | agent/src/agent/run_loop.rs:785-796 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/agent/run_loop.rs:517\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/agent/run_loop.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"e685747edbc050a7e770dbc64b6cd2bfaa998730d6e52e1ab4b79983d8773ec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 2): agent/src/agent/run_loop.rs:1508-1514 | agent/src/agent/run_loop.rs:1660-1671 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/agent/run_loop.rs:1508\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/agent/run_loop.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3d050c8531254b500b1e809640559edaea7be03789938b3eefeb64031d0418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): agent/src/rpc/commands/settings.rs:115-126 | agent/src/rpc/commands/settings.rs:204-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/rpc/commands/settings.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/settings.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"560a80facf301f1b6bbffdcccf06f745d1925aa708669052b8c11e84c094708b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): agent/src/runtime/scheduler_queue.rs:424-435 | agent/src/runtime/scheduler_queue.rs:604-614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/runtime/scheduler_queue.rs:424\u0060 it does not close everything it opens, so those exact 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":"agent/src/runtime/scheduler_queue.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bfe16cf10a4a3ae42e7ceae578b8c810f65b1e67ddbf1706fc55941cdd1a00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): channels/src/dingtalk/mod.rs:115-126 | channels/src/feishu/mod.rs:90-101 \u2014 \u0060channels/src/dingtalk/mod.rs\u0060 and \u0060channels/src/feishu/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 32 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/dingtalk/mod.rs:115\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/dingtalk/mod.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"347ec0a744623f1d4b8fde3e4928265da8412a7f2695a66aacbf9bdccdf11238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): channels/src/feishu/prompt_loop.rs:241-252 | channels/src/feishu/prompt_loop.rs:278-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/feishu/prompt_loop.rs:241\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":"channels/src/feishu/prompt_loop.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9549ec66fa9e00c9bfec650715abfeb4819c347205563dd0083bd6ab684e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): channels/src/feishu/prompt_loop.rs:260-270 | channels/src/feishu/prompt_loop.rs:306-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/feishu/prompt_loop.rs:306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/prompt_loop.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7a50c3a4aff165debfe9c2756acac2b53d317023dc22fd8ef3c79a20be09f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): channels/src/providers/whatsapp.rs:534-545 | channels/src/providers/whatsapp.rs:561-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 \u0060channels/src/providers/whatsapp.rs:534\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/whatsapp.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ede88771f340a67551c39c050ab95c4dd37458e5e408a89ec51b4d7eb50e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/src/browser/chromium/chromium_page.rs:280-291 | cli/src/browser/chromium/chromium_session.rs:183-194 \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 \u0060cli/src/browser/chromium/chromium_page.rs:280\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/browser/chromium/chromium_page.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbfa6de82c8d85b1288bbcf911678a040af8ad52a90364c30d55a8e40facc89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): cli/src/browser/chromium/chromium_session.rs:940-950 | cli/src/browser/chromium/chromium_session.rs:964-975 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/browser/chromium/chromium_session.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":"cli/src/browser/chromium/chromium_session.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0379ae85431265cb7d318dd07e4eac4b4a60d3225b0022d7b6b97b03bb7db7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/src/commands/desktop.rs:196-207 | cli/src/commands/settings.rs:260-271 \u2014 before extracting anything, compare \u0060cli/src/commands/desktop.rs\u0060 and \u0060cli/src/commands/settings.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/desktop.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":"cli/src/commands/desktop.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1b826c62dd969385b0ebbcf39ce74ba9b683a9f1f4f83d0ce3269f4dda6c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/src/commands/mcp.rs:65-76 | cli/src/commands/mcp.rs:163-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/mcp.rs:65\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060cli/src/commands/mcp.rs:61\u0060 calls \u0060Some\u0060, \u0060insert\u0060, \u0060to_string\u0060 and \u0060cli/src/commands/mcp.rs:161\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":"cli/src/commands/mcp.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac8d6b312b2edb0a42750b7bb5474852c98b28eb0096a1232947370e23ddfa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/src/commands/run.rs:196-207 | tui/src/index.rs:76-87 \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 \u0060cli/src/commands/run.rs:196\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/run.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed0de0d622d5848c022eb5151aec05cc790c1c0696900779350812905a34c9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/src/rpc.rs:307-318 | tui/src/rpc/grpc_client.rs:648-659 \u2014 before extracting anything, compare \u0060cli/src/rpc.rs\u0060 and \u0060tui/src/rpc/grpc_client.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 83 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":"cli/src/rpc.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"73100703af3b147d86bd44ab0f4ee261168adeb9c85a81cb5e7ab5717faeeb0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): host/src/remote_host/business/catalog.rs:170-181 | host/src/remote_host/business/catalog.rs:187-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/remote_host/business/catalog.rs:170\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":"host/src/remote_host/business/catalog.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d76ccb3584a7e41c57eee146320c5fee784909891b35c2cc99176e6ea9cbb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): packages/rpc/src/transport.rs:614-625 | packages/rpc/src/transport.rs:643-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/rpc/src/transport.rs:614\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rpc/src/transport.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"5377280788cfe216a9c8ffa91adf810e0dce01a66bdfd6ca637f880f06bd315a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): tui/src/components/chat_area.rs:1615-1625 | tui/src/components/chat_area.rs:1750-1761 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/components/chat_area.rs:1615\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/chat_area.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08aa15bbe50a0159ccf445ce792408903f58eaa912b60384e417495f66e0b07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tui/src/components/chat_area.rs:1934-1945 | tui/src/components/chat_area.rs:1971-1982 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/components/chat_area.rs:1934\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":"tui/src/components/chat_area.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d998a60ca35891a13ee11120496898a645db9c839ec0eaee3d6d2712e206c09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tui/src/workbench/screen.rs:1067-1078 | tui/src/workbench/screen.rs:1084-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 \u0060tui/src/workbench/screen.rs:1067\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/screen.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"e879286540a32530a80e91140794c9c64903935cb1c3050799de98a6b0ae3ad5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): channels/src/feishu/feishu_rest.rs:103-113 | channels/src/feishu/feishu_rest.rs:124-134 | channels/src/feishu/feishu_rest.rs:144-154 \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 \u0060channels/src/feishu/feishu_rest.rs:103\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"360a2c9f846b3544c161f00ae81a3a715aa334f4768829cbae42711e5644be93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): host/src/remote_host/business/transfers.rs:18-28 | host/src/remote_host/business/transfers.rs:31-40 | host/src/remote_host/business/transfers.rs:71-81 \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":"host/src/remote_host/business/transfers.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe8222ae811f54da468cf9ee840e426a1f4d793cf94a9dc53cf122b85899146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): agent/src/config/providers.rs:393-403 | host/src/auth_store.rs:75-84 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"agent/src/config/providers.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5012825c6ec7f368ddfb73e212a907e529f2bbb96d9861b20b27cc7715b9e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): agent/src/rpc/session_prompt.rs:867-877 | agent/src/rpc/session_prompt.rs:892-902 \u2014 both copies are in the same file, so extract the block 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":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6679cdef514fb05f70884ced7a48fe286c21f231e9aca4216ceed2548b6dd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): agent/src/session/content/reader.rs:405-414 | agent/src/session/content/reader.rs:844-854 \u2014 both copies are in the same file, so extract the block 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":"agent/src/session/content/reader.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef5595634a046398d3116ec6a5cba29c9957b55c95b05a470ee3fc31552cbce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): channels/src/feishu/feishu_rest.rs:139-149 | channels/src/feishu/feishu_rest.rs:343-353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/feishu/feishu_rest.rs:139\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c184eb38c66349561a956ed4d89718e79797aed4d172362928c2a20da65af8ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): channels/src/providers/discord.rs:661-671 | channels/src/providers/qq.rs:631-641 \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 \u0060channels/src/providers/discord.rs:661\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/discord.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba172f9425e606c17ae2c8f9b0dc711b130c937d6e99858f9f462478100c0a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/src/browser/safari/webdriver_client.rs:282-292 | cli/src/browser/safari/webdriver_client.rs:332-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/browser/safari/webdriver_client.rs:282\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/browser/safari/webdriver_client.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"75be72af90066e0396ac0b3f1accd63fe9b005cf56fa090bec699c431dcec784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): cli/src/commands/model_settings.rs:537-547 | cli/src/commands/model_settings.rs:685-694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/model_settings.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"add8446d7d7f99e449ab666897f6a7fe691a78318729378910542c33e686e3f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/src/commands/remote.rs:255-265 | cli/src/commands/remote_peers.rs:171-181 \u2014 before extracting anything, compare \u0060cli/src/commands/remote.rs\u0060 and \u0060cli/src/commands/remote_peers.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060cli/src/commands/remote.rs:255\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":"cli/src/commands/remote.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6438f70b91eee0470db95948f1cdeae5d858aea9c829a113ed21d099519a4b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cli/src/commands/remote_peers.rs:749-760 | cli/src/commands/remote_peers.rs:857-868 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/remote_peers.rs:749\u0060 it does not close everything it opens, so those exact 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":"cli/src/commands/remote_peers.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdb16154efd2eeecdf7c7473477a07df35923a12824af9f72cdfa92f06a8a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/src/commands/skills.rs:145-155 | cli/src/commands/skills.rs:304-314 \u2014 both copies are in the same file, so extract the block 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":"cli/src/commands/skills.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"898b72469d2b564fb2b47e1005047295d4ed2d18554e11628665ab875a5de2da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): host/src/remote_host/business/prompt.rs:10-20 | host/src/remote_host/business/prompt.rs:100-110 \u2014 both copies are in the same file, so extract the block 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":"host/src/remote_host/business/prompt.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3ea8407dd4c7b736819ea8ac7c3995e29b3c3c4a9fe9b43f52f41a4ed51b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tui/src/notifications.rs:496-506 | tui/src/notifications.rs:525-535 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/notifications.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/notifications.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d033ee6c244e671e6bad8a948253e3c0d0406905ef16746fbd199b00584909"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): tui/src/skills_cli.rs:646-656 | tui/src/subprocess.rs:41-49 \u2014 before extracting anything, compare \u0060tui/src/skills_cli.rs\u0060 and \u0060tui/src/subprocess.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"tui/src/skills_cli.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"f496f97bdc3898bf51d71f860c194e0404f6ff81bd3ba4020ad203155955ab45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tui/src/workbench/panels.rs:864-874 | tui/src/workbench/panels.rs:884-894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/workbench/panels.rs:864\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":"tui/src/workbench/panels.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"d819f9e08a611a3ca707cff226f94e6d2fa4e9e08013a3d0ffe6e65b864d0e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tui/src/workbench/run.rs:458-468 | tui/src/workbench/run.rs:481-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/run.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08aa34f54b9c25a2046a918dd54ebe8a746594fbf44204b75178ed2e51beef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): agent/src/session/entry.rs:120-129 | agent/src/session/entry.rs:175-184 | agent/src/session/entry.rs:201-210 | agent/src/session/entry.rs:259-268 \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 \u0060agent/src/session/entry.rs:120\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":"agent/src/session/entry.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"325935d818b423d1fd6a2b6302a0a1dc49b9b325b1a3e01aca1f66ca89331d9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): host/src/store/db.rs:378-387 | host/src/store/db.rs:423-432 | host/src/store/db.rs:469-478 | host/src/store/db.rs:1697-1706 \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 \u0060host/src/store/db.rs:378\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/store/db.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8573ff55c9d858f9a4c48147e21a2081dfb007b59fdddafc1a0d26f8569840a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): agent/src/llm/adapters/openai_responses.rs:267-275 | agent/src/llm/adapters/openai_responses.rs:288-297 | agent/src/llm/adapters/openai_responses.rs:306-314 \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":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73bebc2a35c9cad9e96221df6405b36e55744c4f0190ce6a3863b665b9b0cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agent/src/agent/run_loop.rs:539-548 | agent/src/agent/run_loop.rs:809-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agent/src/agent/run_loop.rs:808\u0060 calls \u0060Some\u0060, \u0060clone\u0060 and \u0060agent/src/agent/run_loop.rs:538\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":"agent/src/agent/run_loop.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"48bb29f7e02d6a819b06e3811d29f6b64c4c8bb47769ada3794c3e96e6510ade"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agent/src/llm/adapters/anthropic.rs:136-145 | agent/src/llm/adapters/openai_responses.rs:153-162 \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 \u0060agent/src/llm/adapters/anthropic.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":"agent/src/llm/adapters/anthropic.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f452fe0d2c2d63599591358272c54d90ac36153f2cd13003f7e3b9848480a8dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agent/src/rpc/mod.rs:46-55 | packages/rpc/src/decode.rs:618-627 \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 \u0060agent/src/rpc/mod.rs:46\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":"agent/src/rpc/mod.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e84e48cc583fe8f936aa58b6252748270b029023b7a628d813017f0d756f78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agent/src/rpc/session.rs:764-773 | agent/src/rpc/session.rs:872-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 \u0060agent/src/rpc/session.rs:764\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/session.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead6c476f11026ae15a5c365f8e9471b404fe021c769a93f77ac3c5dcb614b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agent/src/session/content/journal.rs:767-776 | agent/src/session/content/reader.rs:1030-1039 \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":"agent/src/session/content/journal.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"a783046c12f5a71017adac80453b2b5c1b001df8c6ae680aed4c6dcb33a4a905"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): agent/src/session/projection.rs:116-125 | agent/src/types/mod.rs:1231-1239 \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 \u0060agent/src/session/projection.rs:116\u0060 it does not close everything it opens, so those exact 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":"agent/src/session/projection.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd203af8053c3daf81d8052277bf3585a663460d6ee578ab009206773c209a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): channels/src/providers/email.rs:2630-2639 | channels/src/providers/irc.rs:1049-1059 \u2014 before extracting anything, compare \u0060channels/src/providers/email.rs\u0060 and \u0060channels/src/providers/irc.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060channels/src/providers/email.rs:2630\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/email.rs"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a1e2214779d6d30acbd026ead39ebc8b22ca9aa8d6cf7cb8adb122d765642f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): cli/src/commands/browser_tools.rs:792-801 | cli/src/commands/browser_tools.rs:824-832 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/browser_tools.rs:792\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":"cli/src/commands/browser_tools.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39845ce395287906b2b1c40fa4b2d37c6e393084b50f186ee148683eb13254e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): cli/src/commands/model_settings.rs:520-529 | cli/src/commands/model_settings.rs:675-683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/model_settings.rs:520\u0060 it begins part-way through the construct above it, so those exact 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":"cli/src/commands/model_settings.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b68a5a21aead00c9e359f0acf827ac8ae908494967449e9eaa0977575b70ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/src/commands/model_settings.rs:619-628 | cli/src/commands/model_settings.rs:708-717 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/model_settings.rs:619\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/model_settings.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04539eb5976dd65bc5ed226f58a20a360fd0ca6a958899fe5dbf82827f7216f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/src/commands/pin.rs:176-185 | cli/src/commands/pin.rs:223-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/pin.rs:176\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/pin.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"159657abb14615ca5cc3765151785a62e802a706033b5d64fcf05422afb39c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): desktop/src-tauri/src/commands/update.rs:503-511 | desktop/src-tauri/src/commands/update.rs:1785-1794 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060desktop/src-tauri/src/commands/update.rs:503\u0060 it begins part-way through the construct above it, so those exact 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":"desktop/src-tauri/src/commands/update.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8feaea9a03dffc1bd2f6a2541bb78dccb95889da4aad3e31b1117135ee1725"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): host/src/agent_bridge/delete_outbox.rs:18-27 | host/src/agent_bridge/delete_outbox.rs:29-38 \u2014 both copies are in the same file, so extract the block 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":"host/src/agent_bridge/delete_outbox.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b5ce1948f27819dd9999ade4f88dbc4f225e617b04a5cf0686b5b7425f4ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): host/src/agent_bridge/queries.rs:337-346 | host/src/agent_bridge/queries.rs:353-362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/agent_bridge/queries.rs:337\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/queries.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"05daf60196b7b8dcbd268d46e3997a898336dd4b19e6a527ccac64cd073b91e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): host/src/agent_bridge/stream.rs:234-243 | host/src/agent_bridge/stream.rs:428-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/stream.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb44ce67ec4be74c7ac1ec175af03db06f0c6aefce9f6065e317fb7181c6326"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): host/src/store/paging.rs:234-243 | host/src/store/paging.rs:402-410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/store/paging.rs:234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/store/paging.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec604d54a06091add9cdd346687d3b3e4178f3e2732684774a3599a66492dfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): tui/src/components/chat_area.rs:3913-3923 | tui/src/components/chat_area.rs:3929-3939 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/components/chat_area.rs:3913\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/chat_area.rs"},"region":{"startLine":3913}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c99ac4e11d548b24e8924319c573c48cb7e5ee8445743fce40518db91fa9d89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tui/src/components/markdown.rs:776-785 | tui/src/components/markdown.rs:896-905 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/components/markdown.rs:776\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/markdown.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dff6f4931f3c5f876cba626f4157b3b4aab36418f1a8585ee5bc15580a03356"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tui/src/workbench/panels.rs:425-434 | tui/src/workbench/panels.rs:452-461 \u2014 both copies are in the same file, so extract the block 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":"tui/src/workbench/panels.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e778f6864dc3d371a27ebb47e69f88b3f4c94f14d7aa641853fe80b20df2973"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): tui/src/index.rs:321-330 | tui/src/index.rs:339-348 | tui/src/index.rs:357-366 | tui/src/index.rs:418-426 \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 \u0060tui/src/index.rs:321\u0060 it begins part-way through the construct above it, so those exact 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, \u0060tui/src/index.rs:368\u0060 calls \u0060is_empty\u0060 and \u0060tui/src/index.rs:332\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":"tui/src/index.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a92ea6e6194aaa945581af3989bf93b29299caf681b8b1abdb4ba93a6f6262"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agent/src/llm/adapters/openai_responses.rs:320-328 | agent/src/llm/adapters/openai_responses.rs:334-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7f49e46fbd5d407a802ea631a6e3b43e111a3365cced6c6fb15e6115e8003c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agent/src/rpc/mod.rs:806-814 | host/src/remote_host/business/prompt.rs:381-389 \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 \u0060agent/src/rpc/mod.rs:806\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/mod.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eff91ab0302d33e15c2d87a1049c2ef7e1d028760be51daeb283e6443286be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agent/src/session/content/reader.rs:473-481 | agent/src/session/content/reader.rs:602-610 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/content/reader.rs:473\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/reader.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ec385c8c992457db02b7c07db0f5b7b08a181a123e7c9094b254fa8eabcf17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): channels/src/dingtalk/bridge.rs:269-277 | channels/src/feishu/bridge.rs:680-688 \u2014 \u0060channels/src/dingtalk/bridge.rs\u0060 and \u0060channels/src/feishu/bridge.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/dingtalk/bridge.rs:269\u0060 it does not close everything it opens, so those exact 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, \u0060channels/src/feishu/bridge.rs:692\u0060 calls \u0060is_empty\u0060 and \u0060channels/src/dingtalk/bridge.rs:280\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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0ceebd8733f039d2b6e758ef478c34110d2ffc68aa3a587a4873d37759051f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): channels/src/feishu/feishu_rest.rs:142-150 | channels/src/feishu/feishu_rest.rs:549-556 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/feishu/feishu_rest.rs:142\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4c83cfaeb4311da8f421353569637dda1f93e7c065cf9b899f63cb2f526ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): channels/src/providers/discord.rs:424-435 | channels/src/providers/qq.rs:463-474 \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":"channels/src/providers/discord.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ded1ed9e67f3f858c549a1e03e2c89750dbdbe821f70d607e2b763c57e3404"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/src/headless/agent.rs:194-202 | desktop/src-tauri/src/agent_host.rs:18-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/headless/agent.rs:194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/headless/agent.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4028cb308e0d33f276047359eeaa1f1cc34610ed37cee8ead8fb951b1f98d616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): desktop/src-tauri/src/commands/update_linux.rs:98-106 | desktop/src-tauri/src/commands/update_macos.rs:192-200 \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 \u0060desktop/src-tauri/src/commands/update_linux.rs:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src-tauri/src/commands/update_linux.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"92056709f80e05e7fd4147485ed7f6967eff272822748750d58318dda0c501e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): host/src/agent_bridge/import.rs:529-537 | host/src/agent_bridge/import.rs:589-597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/agent_bridge/import.rs:529\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":"host/src/agent_bridge/import.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"70028d6a05b7f37a19cac0d964389c15cf106552b645a7cabf734dcf4f130d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): host/src/agent_bridge/reconciliation.rs:191-199 | host/src/agent_bridge/reconciliation.rs:302-310 \u2014 both copies are in the same file, so extract the block 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":"host/src/agent_bridge/reconciliation.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"626cdee9420764059341dbf5ca6e4e8fc3f8ae1ad6fd59dca7a3c1ab55bf4527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): packages/remote-client/src/session.rs:1275-1283 | packages/remote-server/src/connection.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/remote-client/src/session.rs:1275\u0060 it begins part-way through the construct above it, so those exact 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":"packages/remote-client/src/session.rs"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdf4ee462a320f948ee68d176522d70ffae178fcea3016af5d8377e9e45a32c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tui/src/index.rs:389-397 | tui/src/index.rs:418-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/index.rs:389\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/index.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"5940d9ad98745781044dfe35226521c4954657f9c574e812f60b601c340656b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tui/src/workbench/live.rs:4008-4016 | tui/src/workbench/live.rs:4027-4035 \u2014 both copies are in the same file, so extract the block 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":"tui/src/workbench/live.rs"},"region":{"startLine":4008}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42cbd964ba0e7226ce999f0f71f82039c73d8ef3d6d93aef1fb8079969d6288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): tui/src/workbench/run.rs:1377-1385 | tui/src/workbench/run.rs:1821-1829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/workbench/run.rs:1377\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":"tui/src/workbench/run.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd99b1b92f1e91cc1e197a6c2599b5d5c338f84803057fe1b14f9d08afdcc5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): agent/src/rpc/mod.rs:46-53 | packages/rpc/src/decode.rs:618-625 | packages/rpc/src/encode.rs:400-407 \u2014 before extracting anything, compare \u0060packages/rpc/src/decode.rs\u0060 and \u0060packages/rpc/src/encode.rs\u0060 as WHOLE FILES: this scan already matched 4 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060event\u0060 to \u0060\u0026proto::ReplayEvent\u0060 in one and \u0060\u0026ReplayEventPayload\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, \u0060packages/rpc/src/encode.rs:408\u0060 calls \u0060event_payload\u0060 and \u0060agent/src/rpc/mod.rs:54\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":"agent/src/rpc/mod.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca48cbb6f8c5aa8e7af656f9d34e8a2bc04d68fd4d381229b6b5864d8bf8f41b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): channels/src/feishu/prompt_loop.rs:442-449 | channels/src/feishu/prompt_loop.rs:500-506 | channels/src/feishu/prompt_loop.rs:524-530 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060channels/src/feishu/prompt_loop.rs:440\u0060 calls \u0060as_deref\u0060, \u0060Some\u0060, \u0060is_some\u0060 and \u0060channels/src/feishu/prompt_loop.rs:499\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":"channels/src/feishu/prompt_loop.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7506e7b4e219b255f2b7892cb95a0bb431e5bb46cca1f5fa4d4a75f2816b119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): cli/src/commands/session_compact.rs:36-43 | cli/src/commands/session_history.rs:57-64 | cli/src/commands/session_transcript.rs:155-162 \u2014 before extracting anything, compare \u0060cli/src/commands/session_history.rs\u0060 and \u0060cli/src/commands/session_transcript.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060cli/src/commands/session_compact.rs:36\u0060 it does not close everything it opens, so those exact 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":"cli/src/commands/session_compact.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ec748965f6c95261f5b643025420a0967be6a1e34ddceff2253cc6325782d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): host/src/remote_host/business/catalog.rs:328-335 | host/src/remote_host/business/catalog.rs:346-353 | host/src/remote_host/business/catalog.rs:359-366 \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 \u0060host/src/remote_host/business/catalog.rs:328\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":"host/src/remote_host/business/catalog.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7111c0d98bca2c1768f262d9a35d6eae9da8e624ec32c6580f9f89d579cb1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): agent/src/session/content/checkpoint.rs:156-162 | agent/src/session/content/checkpoint.rs:408-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/content/checkpoint.rs:156\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agent/src/session/content/checkpoint.rs:407\u0060 calls \u0060query_row\u0060, \u0060get\u0060 and \u0060agent/src/session/content/checkpoint.rs:155\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":"agent/src/session/content/checkpoint.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ff658dbfca31da692ffc4add21b3d85142d712aae6c7a866b13575fc1fb798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agent/src/session/content/entries.rs:563-570 | agent/src/session/journal_reclaim.rs:412-419 \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 \u0060agent/src/session/content/entries.rs:563\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":"agent/src/session/content/entries.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06bcbf8a051112d8598ff0f68931db0b69454608bc81d163c4539efbb0ce966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agent/src/session/content/mod.rs:384-391 | agent/src/session/content/stream_body.rs:78-85 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/content/mod.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/mod.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfb78726c7dbd14602251a5a2ef8ebdda9d928a42343fc79864f96125ff3357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): channels/src/feishu/bridge.rs:650-658 | channels/src/feishu/bridge.rs:740-748 \u2014 both copies are in the same file, so extract the block 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":"channels/src/feishu/bridge.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"f036cb79cf87a9054df66bf40fef422512ea6a6350e0974dc9f6568b44c2b6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): channels/src/feishu/feishu_ws.rs:371-378 | channels/src/feishu/feishu_ws.rs:566-573 \u2014 both copies are in the same file, so extract the block 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":"channels/src/feishu/feishu_ws.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acab4e8679a33ffb2061247d5ea02aa8a61d63576c6ec0161409e2407b0eab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): channels/src/providers/linq.rs:749-756 | channels/src/providers/whatsapp.rs:756-763 \u2014 before extracting anything, compare \u0060channels/src/providers/linq.rs\u0060 and \u0060channels/src/providers/whatsapp.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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":"channels/src/providers/linq.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5017f94cfe4254fe6b307763d7834f94e1c8caa8566cf232223549ebe36c989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): channels/src/providers/whatsapp.rs:508-515 | channels/src/providers/whatsapp.rs:534-541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/providers/whatsapp.rs:508\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/whatsapp.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aac4286c82c87956eafa94dba5119ebe0bb404af2f4be08ca01dfa75f79354f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/src/browser/chromium/cdp_connection.rs:337-344 | cli/src/browser/chromium/cdp_connection.rs:405-412 \u2014 both copies are in the same file, so extract the block 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":"cli/src/browser/chromium/cdp_connection.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"959871e4ffc013d348222ffc7f3b4d8a9d7c0b64d7fe6a83f242ddb8f1a76eea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/src/browser/chromium/chromium_manager.rs:62-69 | cli/src/browser/safari/safari_manager.rs:420-427 \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":"cli/src/browser/chromium/chromium_manager.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2d8b488feff5b8b3a7a8ea8a9d9cb6ce29bcacece459dc01e3df6a53546c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/src/commands/archive.rs:134-141 | cli/src/commands/pin.rs:201-208 \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":"cli/src/commands/archive.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50bb1021223f2d0867861df2960b0af671076f338fbf324eededde5467ca65b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): cli/src/commands/archive.rs:178-195 | cli/src/commands/pin.rs:139-156 \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 \u0060cli/src/commands/archive.rs:178\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/archive.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5fcf9c16484a8f6c5331fa493b856535922c35305b03cbae1f14af2c9248ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/src/commands/browser_tools.rs:397-404 | cli/src/commands/browser_tools.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/browser_tools.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"5940733cfa011359d4bb537d6f7f46bf4c2a0d4c71ac1857dc8156ae7f848df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/src/commands/mcp_servers.rs:541-548 | cli/src/commands/task.rs:536-543 \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 \u0060cli/src/commands/mcp_servers.rs:541\u0060 it begins part-way through the construct above it, so those exact 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":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7e4fb458b6280e36b5aee9ed69b65e695b2fca61ba1f555547c458a0a26d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/src/commands/session_status.rs:60-67 | cli/src/commands/session_transcript.rs:152-159 \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 \u0060cli/src/commands/session_status.rs:60\u0060 it does not close everything it opens, so those exact 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, \u0060cli/src/commands/session_transcript.rs:160\u0060 calls \u0060insert\u0060, \u0060Err\u0060 and \u0060cli/src/commands/session_status.rs:68\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":"cli/src/commands/session_status.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"be48ccf24b334a51ff18de249dbcf42b6a5167f45557fe078fe211026e7832ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/src/commands/task.rs:668-676 | host/src/remote_host/business/tasks.rs:99-107 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/task.rs:668\u0060 it begins part-way through the construct above it, so those exact 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, \u0060cli/src/commands/task.rs:667\u0060 calls \u0060task_timezone\u0060, \u0060name\u0060 and \u0060host/src/remote_host/business/tasks.rs:98\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":"cli/src/commands/task.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f776a2963f4caf92cd29566c67bda59b2032a36b484135788e7b119b27ba9a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/src/commands/tools.rs:1358-1365 | cli/src/commands/tools.rs:1367-1374 \u2014 both copies are in the same file, so extract the block 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":"cli/src/commands/tools.rs"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb5c70d47c9f345c7b3dde98c3e8a49ce4d330cb5dd1141ad7915fdd8f141ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): host/src/agent_bridge/import.rs:618-625 | host/src/agent_bridge/session.rs:405-411 \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 \u0060host/src/agent_bridge/import.rs:618\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/import.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d0b24322b325a5cfc5a980038bec1df8e617e205adecf2f6358d16708f2bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): host/src/agent_bridge/persist.rs:312-320 | host/src/agent_bridge/persist.rs:472-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/persist.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e606153d96fe50de7a7d6a1496f85d7d8e3bdc142f2088f0711689956dda14a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): host/src/agent_bridge/reconciliation.rs:215-222 | host/src/agent_bridge/reconciliation.rs:470-476 \u2014 both copies are in the same file, so extract the block 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":"host/src/agent_bridge/reconciliation.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c34e9081e37b92cf216a506e6700b2c7a8dcbf0f45dbe85869fade21d1603b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): host/src/home.rs:24-31 | host/src/tasks/service.rs:13-20 \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":"host/src/home.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"074f1869ab041fee74dce8ed987f681dcecc2ab1d3002105cc351ce0b725f313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): host/src/remote_host/business/tasks.rs:427-434 | host/src/remote_host/business/tasks.rs:494-501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/remote_host/business/tasks.rs:427\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c87b9c5d433109e41abe55f85bd968520824d05cc910302e9d95a36b34ba275"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): host/src/store/threads.rs:1171-1178 | host/src/store/workspaces.rs:558-565 \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 \u0060host/src/store/threads.rs:1171\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":"host/src/store/threads.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a0f1dbd29b0ce3f201aa4d5692477c59bba3ade7accf6babf417e18a0b3db0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/rpc/src/decode.rs:321-328 | packages/rpc/src/encode.rs:58-65 \u2014 before extracting anything, compare \u0060packages/rpc/src/decode.rs\u0060 and \u0060packages/rpc/src/encode.rs\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rpc/src/decode.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeabca31e550f5b22d8af103ace721106fe94ccd9a231a73cc6645142ac758cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): packages/rpc/src/decode.rs:534-541 | packages/rpc/src/encode.rs:275-282 \u2014 before extracting anything, compare \u0060packages/rpc/src/decode.rs\u0060 and \u0060packages/rpc/src/encode.rs\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rpc/src/decode.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"66af129c762af0a5574f39e0b47ff9588d41f569365d7718067985f91f1a1c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tui/src/utils.rs:324-335 | tui/src/utils.rs:342-353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/utils.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":"tui/src/utils.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c2590059ccd4f5f091b4aabba66077e8e84f8175b85d09c0ad2a169bf5d875"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tui/src/workbench/git_panel.rs:766-780 | tui/src/workbench/git_panel.rs:841-848 \u2014 both copies are in the same file, so extract the block 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":"tui/src/workbench/git_panel.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a5c24d2119f6b9289f1c925a1e0679f0ebf96c1db9ad35a46bed2b513993d8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): channels/src/feishu/feishu_rest.rs:102-109 | channels/src/feishu/feishu_rest.rs:123-130 | channels/src/feishu/feishu_rest.rs:143-150 | channels/src/feishu/feishu_rest.rs:550-556 \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 \u0060channels/src/feishu/feishu_rest.rs:102\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53253d9b1e070ff3580bb363219bf4e6c6f01b828bedbecf456c6cf991550c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): channels/src/dingtalk/dingtalk_ws.rs:169-175 | channels/src/dingtalk/dingtalk_ws.rs:186-192 | channels/src/dingtalk/dingtalk_ws.rs:202-208 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060channels/src/dingtalk/dingtalk_ws.rs:201\u0060 calls \u0060dispatch_bot_callback\u0060 and \u0060channels/src/dingtalk/dingtalk_ws.rs:167\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":"channels/src/dingtalk/dingtalk_ws.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40e56d446522689bc537a26d92a63d7dc2f33935d1728db0c7ac9c520c5d4da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): cli/src/relay/room.rs:348-354 | cli/src/relay/room.rs:411-417 | cli/src/relay/room.rs:455-461 \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 \u0060cli/src/relay/room.rs:348\u0060 it does not close everything it opens, so those exact 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, \u0060cli/src/relay/room.rs:345\u0060 calls \u0060valid_identifier\u0060, \u0060Err\u0060 and \u0060cli/src/relay/room.rs:410\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":"cli/src/relay/room.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f50a8eb78af91b1c9c6b887eabd3f620ed87ff77ec0418fdf3d58979011167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): host/src/remote_host/business/tasks.rs:428-434 | host/src/remote_host/business/tasks.rs:456-462 | host/src/remote_host/business/tasks.rs:495-501 \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 \u0060host/src/remote_host/business/tasks.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":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecd6d92e3c2dbe36347457f9b9444e66ec1ce610cefe8d359e82da0854bfa57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/rpc/session.rs:530-536 | agent/src/rpc/session.rs:678-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/rpc/session.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060\u0026mut\u0060 in one and \u0060super) fn flush_cancelled_receipts_when_idle(\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":"agent/src/rpc/session.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57bb127ed08f7099c903e221c526b76851cb7d0dc52beea5a6dec7ce8207d57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/rpc/session_prompt.rs:917-923 | agent/src/rpc/session_prompt.rs:2083-2089 \u2014 both copies are in the same file, so extract the block 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":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6f7781121501f03d495f72e7e3dac5ada472cf314c656ae1dc11b271daeadb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/session/database/connection.rs:33-39 | agent/src/skills/registry.rs:174-180 \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":"agent/src/session/database/connection.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4450b1770db66acab0a64eb9dc757e5f417e156bae7cd53c0d46a12c189b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/skills/mod.rs:324-330 | agent/src/skills/mod.rs:363-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/skills/mod.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. 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":"agent/src/skills/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b1307fae1bb6820a4a8aecc67cde3ae0151b8a2351fb0326f9434183ece566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): channels/src/dingtalk/bridge.rs:70-79 | channels/src/feishu/bridge.rs:132-141 \u2014 \u0060channels/src/dingtalk/bridge.rs\u0060 and \u0060channels/src/feishu/bridge.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 33 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/dingtalk/bridge.rs:70\u0060 it does not close everything it opens, so those exact 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 \u0060event\u0060 to \u0060DingtalkEvent\u0060 in one and \u0060FeishuEvent\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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"343fb51f5f04eae9c7b7d3f6752277c2dde65de1d49db3eb140329f1edb6de99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/commands/mcp_servers.rs:771-777 | cli/src/commands/mcp_servers.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 \u0060cli/src/commands/mcp_servers.rs:771\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":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"4700b9cca56784ef960197df267535877e5d13c4b840f0ea331a8ba6626d0b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/commands/tools.rs:403-409 | cli/src/commands/tools.rs:476-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/tools.rs:403\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/tools.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0171813e52dfc7ccc34fa13fce34e5e8d48b345c3c2734230c13069bdbee29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/remote-server/src/supervisor/shutdown.rs:63-69 | packages/remote-server/src/supervisor/shutdown.rs:429-435 \u2014 both copies are in the same file, so extract the block 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":"packages/remote-server/src/supervisor/shutdown.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5807a707b18d8beb9d788f166b005f5b0a08231f407012c89d5124b1e542b76a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tui/src/components/chat_area.rs:643-649 | tui/src/terminal_image.rs:278-284 \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 \u0060tui/src/components/chat_area.rs:643\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/chat_area.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"93154a2dc0c75036200d46529e6f25c04a0c7409e0975ea9d59ab9fc56fddb42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): host/src/remote_host/business/tasks.rs:353-360 | host/src/remote_host/business/tasks.rs:417-422 | host/src/remote_host/business/tasks.rs:474-479 | host/src/remote_host/business/tasks.rs:515-522 \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 \u0060host/src/remote_host/business/tasks.rs:417\u0060 it begins part-way through the construct above it, so those exact 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":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e530f4b0d0489fb4a0c100a3506861df5bbe51214fc553c17aae2a77802c623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/config/providers.rs:169-175 | agent/src/config/providers.rs:194-200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/config/providers.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6ff8c0570a05fe62d96cb5b5197ff870f014e8dfc3657d86d0ab157df02931"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent/src/session/content/checkpoint.rs:144-149 | agent/src/session/content/checkpoint.rs:394-399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/content/checkpoint.rs:144\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, \u0060agent/src/session/content/checkpoint.rs:393\u0060 calls \u0060clone\u0060 and \u0060agent/src/session/content/checkpoint.rs:143\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":"agent/src/session/content/checkpoint.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca2f4db09c4bc6bbf3fa89d472c8069127882d58b500059c099698af25e0d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/session/history/display_index.rs:352-358 | agent/src/session/history/display_index.rs:423-429 \u2014 both copies are in the same file, so extract the block 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":"agent/src/session/history/display_index.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee2c76bd5eb98b1711846e983a0eaa86b5b1189b490ec2608942e63e4b2c069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent/src/session/journal_reclaim.rs:931-936 | agent/src/session/journal_reclaim.rs:950-955 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/journal_reclaim.rs:931\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0554e6f7c8dbb332c93fe3444e17c2ca59e2a59a663beafe12ef8b2308d4f58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): channels/src/providers/email.rs:1833-1839 | tui/src/workbench/links.rs:315-321 \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 \u0060channels/src/providers/email.rs:1833\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/email.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"54dc0b01ab24f9258bce10c08741ff35067c687f4787d04358714893d614dfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20136 lines \u00D7 3): cli/src/commands/mcp_servers.rs:398-403 | cli/src/commands/mcp_servers.rs:663-666 | cli/src/commands/mcp_servers.rs:776-781 \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 after the matched lines, \u0060cli/src/commands/mcp_servers.rs:403\u0060 calls \u0060start\u0060 and \u0060cli/src/commands/mcp_servers.rs:666\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":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b1c830fbcb3b29ff6c5bbe128e45bb810e6ecd52941c5f506e0fa4fd28051b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/commands/session_journal.rs:291-296 | cli/src/commands/session_status.rs:368-373 \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":"cli/src/commands/session_journal.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4316b7a49e452a98d987a21fd3882d7b7871293bcc1e5f5c1eb96feb5fa371"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/commands/session_prune.rs:348-353 | cli/src/commands/session_transcript.rs:1087-1092 \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":"cli/src/commands/session_prune.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b0e1769c18cd1eb326b025ab9d43e2b4cfd4c077b75ed09377eae86ad8758e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): host/src/files.rs:49-54 | packages/app-workspaces/src/lib.rs:702-707 \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 \u0060host/src/files.rs:49\u0060 it does not close everything it opens, so those exact 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 \u0060path\u0060 to \u0060\u0026Path\u0060 in one and \u0060PathBuf\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":"host/src/files.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a49f89de9be4d05bd63ffa84a6c1e3b9e215c88447929ff6f6f373d26158fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): host/src/git_history.rs:546-563 | tui/src/workbench/git_panel.rs:208-225 \u2014 before extracting anything, compare \u0060host/src/git_history.rs\u0060 and \u0060tui/src/workbench/git_panel.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 207 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 \u0060host/src/git_history.rs:546\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/git_history.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee42360aab94ecf724eb9f140567a69687747aa8c0bb2097866912f28b613d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tui/src/components/input.rs:1091-1098 | tui/src/components/input.rs:1121-1128 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/components/input.rs:1091\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":"tui/src/components/input.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"729902aaf2ad05c6676c36b888b1c78b9b47d0c8bbb182b9e1d6ca5819e89435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tui/src/stderr_log.rs:71-76 | tui/src/stderr_log.rs:135-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 \u0060tui/src/stderr_log.rs:71\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/stderr_log.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5ced827e13d40e7bac4396ab663f92bd15eb133d48f3f5fa878df11457eb86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tui/src/utils.rs:68-73 | tui/src/utils.rs:75-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/utils.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01269d8492b000448ce783fb029183e5f749f8790da5315f07284f73fb3239a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): host/src/remote_host/business/tasks.rs:421-425 | host/src/remote_host/business/tasks.rs:478-482 | host/src/remote_host/business/tasks.rs:521-525 | host/src/remote_host/business/tasks.rs:534-538 \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 \u0060host/src/remote_host/business/tasks.rs:421\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":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"10aca2629b7e545a93683cc8452f0d89dd5839c46927367ad2e818dff6a76b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): host/src/tasks/service.rs:272-276 | host/src/tasks/service.rs:342-346 | host/src/tasks/service.rs:360-364 | host/src/tasks/service.rs:379-383 \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":"host/src/tasks/service.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c36edd1fa407ee8403c5e8b45d953462315a7d822ee338c5acd808bad58a75d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): cli/src/commands/session_history.rs:147-151 | cli/src/commands/session_prune.rs:349-353 | cli/src/commands/session_transcript.rs:1088-1092 \u2014 before extracting anything, compare \u0060cli/src/commands/session_history.rs\u0060 and \u0060cli/src/commands/session_transcript.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060cli/src/commands/session_history.rs:147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session_history.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3c144a11e67e045e1d33794915eaf027305fe291675425dfb4266a59c1894d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): tui/src/utils.rs:68-72 | tui/src/utils.rs:75-79 | tui/src/utils.rs:135-139 \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":"tui/src/utils.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fafd34ff4760a15bad6c4eb7c95558a63d3471e5e9101c2e5329a4478268a63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent/src/llm/adapters/openai_responses.rs:930-935 | agent/src/llm/adapters/openai_responses.rs:945-950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/llm/adapters/openai_responses.rs:930\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"39568dd45388566d90dc7f8efa70762a190beeab883790d6173812a3ef431003"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agent/src/rpc/session_prompt.rs:448-452 | agent/src/rpc/session_prompt.rs:578-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/rpc/session_prompt.rs:448\u0060 it begins part-way through the construct above it, so those exact 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":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f42293db0f10eefefdc6c78306a227e75e79484172525ffa418b7d53db38c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agent/src/session/content/journal.rs:1036-1040 | agent/src/session/content/reader.rs:431-435 \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 \u0060agent/src/session/content/journal.rs:1036\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/journal.rs"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fb1e24e302a3ef5b477e9aafb203142452646415dfc48c144aeef25c6a6635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agent/src/session/content/journal.rs:1042-1046 | agent/src/session/content/reader.rs:434-438 \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 \u0060agent/src/session/content/journal.rs:1042\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":"agent/src/session/content/journal.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c63de31905f0df67c80182cf6f531e6effe9bf9fbf10729093adbf55555434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent/src/session/history/purge.rs:58-63 | agent/src/session/journal_reclaim.rs:334-339 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/history/purge.rs:58\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/history/purge.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a18a9b35cc77d189f8c2d2875c26eebe66b612644ba2117ad455610b3c3796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agent/src/session/identity.rs:109-113 | agent/src/session/identity.rs:190-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/identity.rs:109\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":"agent/src/session/identity.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"969e2ca9c24edb2b6e6996fd371ffd343561b9dc337db3690a45bedec083644f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agent/src/session/journal_reclaim.rs:256-260 | agent/src/session/journal_reclaim.rs:505-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/journal_reclaim.rs:256\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3c12136fbea9799cb8f41a2c8833bdb4647b05839dbbde30007b0803abbefc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): channels/src/providers/email.rs:2014-2018 | channels/src/providers/slack.rs:486-490 \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 \u0060channels/src/providers/email.rs:2014\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/email.rs"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a2b8fc3f32ef6ef93043f16c2b822d6d799c81b75e9888cbd818dfde0f6821"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/browser/chromium/chromium_page.rs:76-81 | cli/src/browser/chromium/chromium_page.rs:128-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/browser/chromium/chromium_page.rs:76\u0060 it does not close everything it opens, so those exact 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":"cli/src/browser/chromium/chromium_page.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2386eb43a0143c6fa0c70b83eb9db5135ea72bcab87be73d00497a7a8a9f614b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/src/commands/model_settings.rs:253-258 | cli/src/commands/model_settings.rs:383-387 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/model_settings.rs:253\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/model_settings.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8478c61b19d1d3dbd3f878c773fc4d0ee5ebca750c2d0330f43ffa8710e6cb98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/commands/session.rs:1134-1139 | cli/src/commands/session.rs:1148-1153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/session.rs:1134\u0060 it begins part-way through the construct above it, so those exact 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":"cli/src/commands/session.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5c1ba24eebb7f8f8560c588470b39dfef4c866503a02d2b7959f010c3d6d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): host/src/agent_bridge/session.rs:137-142 | host/src/agent_bridge/session.rs:312-318 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/agent_bridge/session.rs:137\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/session.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceda104cb94a66b5cd1264a20245881eee77bcfda473642f28285d0f88c7e10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): host/src/application/approvals.rs:54-58 | host/src/application/approvals.rs:71-75 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060SaveApprovalRuleInput\u0060 in one and \u0060SaveApprovalRulesInput\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":"host/src/application/approvals.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"993c5f951098bdac798028edb5d34d3d0ac86da2f21ad4c03d68830656f140ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): host/src/remote_host/business/catalog.rs:147-151 | host/src/remote_host/business/settings.rs:131-135 \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 \u0060host/src/remote_host/business/catalog.rs:147\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":"host/src/remote_host/business/catalog.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5895020baf643619cebea9f1861e34a81d74b8d14d58db8904121e306652948e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): host/src/agent_bridge/import.rs:26-31 | host/src/shadow_review/repository.rs:24-28 | packages/config/src/lib.rs:45-49 \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 \u0060host/src/agent_bridge/import.rs:26\u0060 it begins part-way through the construct above it, so those exact 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":"host/src/agent_bridge/import.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e097ce3cd0e2aebe3190a4d351a4c8e5191c4f193d83a58fb1906dd9ad2dcd1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tui/src/skills_cli.rs:852-858 | tui/src/subprocess.rs:170-176 \u2014 before extracting anything, compare \u0060tui/src/skills_cli.rs\u0060 and \u0060tui/src/subprocess.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"tui/src/skills_cli.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"e885f617c4110284e8038694fdce661ef4e1644dbda34a4aa7a834d54aab183b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tui/src/terminal_windows.rs:206-211 | tui/src/terminal_windows.rs:223-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/terminal_windows.rs:206\u0060 it does not close everything it opens, so those exact 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":"tui/src/terminal_windows.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aee7abaf642ec1c042ed2d623d55fc6bf408bc825c4b87c8dd9b6e5d223f304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 3): tui/src/workbench/live.rs:2031-2034 | tui/src/workbench/live.rs:2571-2575 | tui/src/workbench/live.rs:2585-2590 \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 \u0060tui/src/workbench/live.rs:2571\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/live.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1283e60df601e92d6493ff3ea2b3dd86ca63ad1376e1db438f40e50c70ea497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tui/src/workbench/syntax.rs:974-978 | tui/src/workbench/syntax.rs:1066-1070 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/workbench/syntax.rs:974\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":"tui/src/workbench/syntax.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"132f49c183fccb87b06a87304111d769e3870781b4d1822acf8c8ac50352ad55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/config/providers.rs:147-153 | cli/src/commands/configure.rs:809-815 \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":"agent/src/config/providers.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"186e157b6802f79248e4d227cae2ebaf29004561f316158caf7ae8c0c6c4aa67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent/src/llm/adapters/openai_chat.rs:360-365 | agent/src/llm/adapters/openai_responses.rs:920-925 \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":"agent/src/llm/adapters/openai_chat.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2d0902a3eb03724971967a76da5d2a82389411c3763f5e9b802dcf7b5dd854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): agent/src/rpc/approval/shape.rs:331-346 | packages/rpc/src/tool_arguments.rs:109-124 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/approval/shape.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"797b34f4b4ed2e0665612f8870b83d2d8587e2fa5ada6cdb048d20f127df1313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/rpc/export_html.rs:540-546 | cli/src/utils/string.rs:10-17 \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":"agent/src/rpc/export_html.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"181ceb0158867da8921e90f218e229921b15eb54bd3a724667080fc53e048011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/utils/mod.rs:281-287 | packages/rpc/src/home.rs:68-74 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/utils/mod.rs:281\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/utils/mod.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2c17ef8ce11c174d94345e48f4ced204b85670415f1d6c5c5b7c8984e4ce52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): channels/src/dingtalk/mod.rs:21-26 | channels/src/feishu/mod.rs:24-29 \u2014 \u0060channels/src/dingtalk/mod.rs\u0060 and \u0060channels/src/feishu/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 32 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/dingtalk/mod.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"08208dbcf7af2411a2f71ae66f6efa9c38ca5be3994bcc0b6c7c44421af58e5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): channels/src/providers/email.rs:350-357 | channels/src/providers/irc.rs:294-301 \u2014 before extracting anything, compare \u0060channels/src/providers/email.rs\u0060 and \u0060channels/src/providers/irc.rs\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/email.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"518ab7d6d1d8409c58f1d523fda9dca6042644f60d485bdec73c4fb5667983aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): channels/src/providers/linq.rs:116-123 | channels/src/providers/telegram.rs:110-117 | channels/src/providers/wecom.rs:125-132 | channels/src/providers/whatsapp.rs:113-120 \u2014 before extracting anything, compare \u0060channels/src/providers/linq.rs\u0060 and \u0060channels/src/providers/whatsapp.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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":"channels/src/providers/linq.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac789696fada3aa7610850f19a11cc81ab4fe6ec1dc2a0c5993c50e16bfac3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): channels/src/providers/wecom.rs:175-181 | cli/src/relay/sign.rs:42-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/wecom.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4336b87c925aa64edfbe7e16b66409192420cf951d4a513b2b83bbd301fccfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): channels/src/transport/signature.rs:61-70 | desktop/src-tauri/src/terminal/server.rs:908-917 \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":"channels/src/transport/signature.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1148184f4fa1fe761ba93a0c7806ecbb7bcb11c7a8a6d3146afc9c025db2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/commands/desktop.rs:95-100 | host/src/store/util.rs:62-67 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/desktop.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff50fd16f9e8f596f0cf1c0a6fe8313383d6718be8bdc6081424102b0a4c5cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 7): cli/src/commands/home.rs:183-188 | cli/src/commands/task.rs:346-351 | host/src/agent_bridge/observer.rs:208-213 | host/src/remote_host/business/tasks.rs:315-320 | host/src/tasks.rs:44-49 | host/src/tasks/service.rs:26-31 | tui/src/workbench/live.rs:5289-5294 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/home.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f03be7d525de1de90a991bab2e81a3ca2227c7593ddcbb085e479da9bf8c03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/commands/remote.rs:553-559 | cli/src/commands/remote_peers.rs:368-374 \u2014 before extracting anything, compare \u0060cli/src/commands/remote.rs\u0060 and \u0060cli/src/commands/remote_peers.rs\u0060 as WHOLE FILES: this scan already matched 4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/remote.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac49ecfd241606094c62da42c616fb72c2092f6c70f7789a3c8fcc5122bcb54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/commands/remote.rs:1846-1851 | packages/remote-server/src/pairing.rs:73-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/remote.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d55c0774f379caad3731bcf400d72193df10d111ba88a6e6de93e8199184e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): cli/src/commands/session.rs:429-436 | cli/src/commands/skills.rs:347-354 | tui/src/index.rs:752-759 \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":"cli/src/commands/session.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"9001b6271ff289a7b9a8431672f89af0ffa583524ef3f9dfc83e908fdea8bb9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/commands/session_journal.rs:118-124 | cli/src/commands/session_status.rs:104-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session_journal.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cc2ca584241f48f8c06d6ccbe465c2c03856440516493f6dd6c07e5869dec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/commands/settings.rs:48-54 | packages/app-settings/src/lib.rs:658-664 \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":"cli/src/commands/settings.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5262e596c6885604b7f5a19f2da6421089b8eb83465843a8603010c69604bd85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/src/headless/agent.rs:181-188 | desktop/src-tauri/src/agent_host.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":"cli/src/headless/agent.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bcf841cc1a1da144dea0bd6ab774bca6190406355db0e4937f4b19d72b23005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): cli/src/relay/room.rs:574-579 | cli/src/relay/server.rs:575-580 | packages/remote-client/src/runtime.rs:3499-3504 \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":"cli/src/relay/room.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7cd0f81626fe4989369b1b8f4204a15db2eb008e11004c8d2a7d0340787c24e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): host/src/remote_peer/platform.rs:169-173 | packages/http/src/dns/config.rs:326-330 \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":"host/src/remote_peer/platform.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"605de6ee7f544ef6e1d2025c373744207e5da3b38545eb7e345b491f9346a1f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): orchestration/tasks/src/kernel.rs:118-124 | tui/src/workbench/mod.rs:4541-4547 \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":"orchestration/tasks/src/kernel.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b53044232a9bc3280abd80cb7c7f65a7780b719c7aabc2c8c5b78347698d938"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): packages/remote-client/src/tasks.rs:25-29 | packages/remote-server/src/tasks.rs:26-30 \u2014 before extracting anything, compare \u0060packages/remote-client/src/tasks.rs\u0060 and \u0060packages/remote-server/src/tasks.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. 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":"packages/remote-client/src/tasks.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c6d1e65e2cffa76c2b66e261b4b133ff927b989ecd28b6d1c6cdb6d59f4a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): packages/remote-client/src/tasks.rs:39-45 | packages/remote-server/src/tasks.rs:40-46 \u2014 before extracting anything, compare \u0060packages/remote-client/src/tasks.rs\u0060 and \u0060packages/remote-server/src/tasks.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. 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":"packages/remote-client/src/tasks.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"91859c6295dfcb4a13791f55bb4e0e2867409ca7e00bf5bdf14697946f1826b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): packages/remote-server/src/diagnostics.rs:7-12 | packages/remote-server/src/health.rs:230-235 | packages/remote-server/src/supervisor.rs:1227-1232 \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":"packages/remote-server/src/diagnostics.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3522056d9d6cbe189d1ec0263b6f6070e8de0541ea35cd585d7b4e02c3c3bea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): tui/src/skills_cli.rs:843-848 | tui/src/subprocess.rs:161-166 \u2014 before extracting anything, compare \u0060tui/src/skills_cli.rs\u0060 and \u0060tui/src/subprocess.rs\u0060 as WHOLE FILES: this scan already matched 4 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. 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":"tui/src/skills_cli.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd80bb377c243be48e0065e539e319482d448a42b4252b165979f694720055f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent/src/session/content/compress.rs:51-56 | agent/src/session/journal_compaction.rs:111-116 \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":"agent/src/session/content/compress.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8354a324ca5f2557e7f0d3d0206062bef2118b9e0d04363bf25a5c009e419fd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): channels/src/providers/linq.rs:737-741 | channels/src/providers/telegram.rs:812-816 | channels/src/providers/wecom.rs:582-586 | channels/src/providers/whatsapp.rs:739-743 \u2014 before extracting anything, compare \u0060channels/src/providers/linq.rs\u0060 and \u0060channels/src/providers/whatsapp.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 36 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":"channels/src/providers/linq.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44a68ae0791aed97296258abd2f827424dac2282d2dc4f9c9f3c13fffe61006"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agent/src/session/journal_reclaim.rs:397-414 | agent/src/session/journal_reclaim.rs:495-503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/journal_reclaim.rs:397\u0060 it does not close everything it opens, so those exact 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":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"7472f9ab746f303db2c8063ac2449e1d184f544fe5549bf88a58efedff2747eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): channels/src/feishu/bridge.rs:610-624 | channels/src/feishu/bridge.rs:712-725 | channels/src/feishu/bridge.rs:808-823 \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 \u0060channels/src/feishu/bridge.rs:610\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/feishu/bridge.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf30639e46ef683d5aa893b35a54c42ae5b3ea0885e9a97cf4e79f6a430010ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): packages/remote-server/src/commands.rs:488-501 | packages/remote-server/src/commands.rs:713-726 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060packages/remote-server/src/commands.rs:488\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/commands.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11c54f7e20e39365cb0209a78578a2ad5b6d53e1841473ccfdb2f9a9c8a3843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): channels/src/feishu/bridge.rs:550-560 | channels/src/feishu/bridge.rs:803-816 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/feishu/bridge.rs:550\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":"channels/src/feishu/bridge.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a13aa51c481bb18000ee1c13ac5f1f839c5c8b6f67be9645da8d790b0bc59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): desktop/src-tauri/src/commands/update_windows.rs:131-142 | desktop/src-tauri/src/commands/update_windows.rs:152-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060desktop/src-tauri/src/commands/update_windows.rs:131\u0060 it begins part-way through the construct above it, so those exact 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":"desktop/src-tauri/src/commands/update_windows.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dbbdeff30cb575aee07546a8714a7f3ea734a632e119428153678896524eca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): host/src/remote_host/business/providers.rs:49-60 | host/src/remote_host/business/providers.rs:78-89 \u2014 both copies are in the same file, so extract the block 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":"host/src/remote_host/business/providers.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fd2da54ee3b9752f74507fabbfab4adb53232f0d5ebf15b8fe852b69225d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): cli/src/browser/chromium/chromium_console_hook.rs:80-91 | cli/src/browser/chromium/chromium_page.rs:280-291 | cli/src/browser/chromium/chromium_session.rs:183-194 \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 \u0060cli/src/browser/chromium/chromium_console_hook.rs:80\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/browser/chromium/chromium_console_hook.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7da31bce4c6e53e7f54b8e3ef7452f18d807477bf4e46f60b066c15f943a5e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): host/src/remote_host/business/history.rs:345-353 | host/src/remote_host/business/history.rs:377-388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/remote_host/business/history.rs:345\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":"host/src/remote_host/business/history.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"831fd470571d2c7a8f387a725eee48acb8811c08463892d25c58d984e7029051"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): channels/src/providers/irc.rs:149-160 | channels/src/providers/signal.rs:171-182 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/providers/irc.rs:149\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/irc.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f708c3c6669236578e847b42aac8a47f79fa32e421d60acb1fe63d3372931c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): host/src/remote_host/business/catalog.rs:38-45 | host/src/remote_host/business/history.rs:373-383 \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 \u0060host/src/remote_host/business/catalog.rs:38\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/catalog.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1fbfe32d37ac3caca2807f8509b1def71ac0ef7ed49ba87e8507a7319bd4428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agent/src/session/content/compress.rs:72-81 | agent/src/session/content/rechunk.rs:52-62 \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":"agent/src/session/content/compress.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bcdfd6c41b0d62c51f415c24b2f4c5cb99ef4cec3d7f327bdc35aab335400e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): channels/src/feishu/feishu_rest.rs:64-74 | channels/src/feishu/feishu_rest.rs:349-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 \u0060channels/src/feishu/feishu_rest.rs:64\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"channels/src/feishu/feishu_rest.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76475f532312cac3a24130771ab79e41636880de60d7dc709abeac47bdc27b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agent/src/llm/adapters/openai_responses.rs:202-221 | agent/src/llm/adapters/openai_responses.rs:227-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/llm/adapters/openai_responses.rs:202\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":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93a37a1fbf94e4717b4e67cbdafc1a5edf8edee4709bf5b3164c9e6454a1e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): host/src/remote_host/business/catalog.rs:284-293 | host/src/remote_host/business/catalog.rs:332-342 | host/src/remote_host/business/catalog.rs:350-355 \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 \u0060host/src/remote_host/business/catalog.rs:284\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":"host/src/remote_host/business/catalog.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd2a9e8a12b131d16dd30ab877f4f6547ff057d3ccbcccb31f60bb394a783fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): cli/src/commands/remote_peers.rs:792-799 | cli/src/commands/remote_peers.rs:886-896 \u2014 both copies are in the same file, so extract the block 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":"cli/src/commands/remote_peers.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a78b38497af26766b91f2f469e3ff7e7c4ff89e1bbd7aa75d7e10bf9e27379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): host/src/remote_host/files.rs:1128-1137 | host/src/remote_host/files.rs:1146-1155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/remote_host/files.rs:1128\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":"host/src/remote_host/files.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69070b0f42a9dc8515609229ed2fa6285e0831f12a96a7ab3298974932c2a88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): host/src/agent_providers/write.rs:74-81 | host/src/agent_providers/write.rs:185-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/agent_providers/write.rs:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"host/src/agent_providers/write.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"996cfb5c6d0bc65e62e4f2d25a12be3bdbf10619c68e380b338358469ec2f03a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): cli/src/commands/session_control.rs:121-127 | cli/src/commands/session_history.rs:81-87 | cli/src/commands/session_transcript.rs:195-204 \u2014 before extracting anything, compare \u0060cli/src/commands/session_history.rs\u0060 and \u0060cli/src/commands/session_transcript.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060cli/src/commands/session_control.rs:121\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session_control.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a5f4c39459e97f92e4dd8389020b4b34dfc5fcdeed049aadfda97217a639a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): agent/src/session/database_backup.rs:66-75 | agent/src/session/database_backup.rs:85-94 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/database_backup.rs:66\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/database_backup.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4241b88f7e126f4b50a1e6518a8931d660303313bb30df2b13a90dbe1bddef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): cli/src/commands/session.rs:1103-1112 | cli/src/commands/session.rs:1237-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 \u0060cli/src/commands/session.rs:1103\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0772c6dab1d256a20706747ce74db2fd39353f643a4cde6069aac06a98f936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): channels/src/providers/telegram.rs:435-443 | channels/src/providers/telegram.rs:467-476 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/providers/telegram.rs:467\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/telegram.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb9589dcde865787a3350b6fb1502291a4a1ebc9b08d74a805f0527893f00b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/llm/adapters/openai_responses.rs:224-232 | agent/src/llm/adapters/openai_responses.rs:249-255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/llm/adapters/openai_responses.rs:224\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":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"6da9225831776bb55ec606764b93a4c9bba3a3283c10308c5e2c851a50a6f2f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): channels/src/providers/mattermost.rs:528-536 | channels/src/providers/slack.rs:731-739 \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 \u0060channels/src/providers/mattermost.rs:528\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/mattermost.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d4fc40a2fc88fafab2f7342ce994957afc182333f800502d882a9b9d748e43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): host/src/agent_bridge/session_events.rs:113-121 | host/src/agent_bridge/session_events.rs:184-192 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/agent_bridge/session_events.rs:113\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/session_events.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1ed17fdddb7bcdcdb21833d898bcbe1778c187e5d23edb7d4bc9f8063c049c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/src/commands/tools.rs:1447-1455 | cli/src/commands/tools.rs:1461-1469 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/tools.rs:1447\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":"cli/src/commands/tools.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ca981f34306b322f731c4d9cd0774d3e6215eb392efd9d19b885395d60153a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/src/commands/doctor.rs:587-595 | cli/src/commands/doctor.rs:637-645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/doctor.rs:587\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":"cli/src/commands/doctor.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13ea43073e7e2a9a53422aad4ee5efcb15522560499324af7fc8ef4ac50dc04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/src/commands/remote.rs:956-964 | cli/src/commands/remote.rs:1514-1522 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/remote.rs:956\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/remote.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"38af9464ab76f283780f8f79f700ff26fe09211946b19947ea63562cb877b413"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): agent/src/session/content/checkpoint.rs:192-200 | agent/src/session/content/checkpoint.rs:457-465 | agent/src/session/content/metadata.rs:245-253 \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 \u0060agent/src/session/content/checkpoint.rs:192\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":"agent/src/session/content/checkpoint.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d623eef9b0f7986926d8282409e38824c0f7ff6ebaaee83dd0984cb625668f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent/src/session/sqlite_store/transcript.rs:194-199 | agent/src/session/sqlite_store/transcript.rs:215-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/session/sqlite_store/transcript.rs:215\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/sqlite_store/transcript.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2ec293731bffa114df6da6128caf19dc96d9f316194573e881cc95bd451ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): agent/src/rpc/commands/session_lifecycle.rs:1121-1129 | agent/src/rpc/commands/session_lifecycle.rs:1172-1180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/rpc/commands/session_lifecycle.rs:1121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/session_lifecycle.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2e31f0978c56ac91e4c8a2b36784de22cc3e5efbac9c8b08b67abf22aba860"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/commands/doctor.rs:636-644 | cli/src/commands/doctor.rs:714-719 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/doctor.rs:636\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":"cli/src/commands/doctor.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"538d4cfd5b1b2712a6f5da03a11eb4ae220f29c3717d683aa628661d67bf1fe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): cli/src/commands/doctor.rs:621-629 | cli/src/commands/doctor.rs:675-683 | cli/src/commands/doctor.rs:729-737 \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 \u0060cli/src/commands/doctor.rs:621\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/doctor.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72643885541830302cf917f1aceefefde8c8466f3e0ae5e7b9554d49527c099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): cli/src/commands/remote.rs:490-498 | cli/src/commands/remote_peers.rs:346-354 \u2014 before extracting anything, compare \u0060cli/src/commands/remote.rs\u0060 and \u0060cli/src/commands/remote_peers.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060cli/src/commands/remote.rs:490\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/remote.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"8949c5f151de60e7519a8cf6ed7745e0ca5669d6b0f47389acb401a471e56703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agent/src/session/journal_compaction.rs:218-225 | agent/src/session/sqlite_store/events.rs:340-348 \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 \u0060agent/src/session/journal_compaction.rs:218\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/journal_compaction.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d93878f4c2cf6b6f82df2895120eabd16670d9b517b47f4107e9670a257d824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): desktop/src-tauri/src/commands/update_linux.rs:164-172 | desktop/src-tauri/src/commands/update_macos.rs:160-168 \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 \u0060desktop/src-tauri/src/commands/update_linux.rs:164\u0060 it begins part-way through the construct above it, so those exact 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":"desktop/src-tauri/src/commands/update_linux.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcee968258509cfa966ff8dbae1785ad563aef1634df783f7d1b1cb38a9f8aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): host/src/future_login.rs:201-217 | host/src/future_login.rs:512-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/future_login.rs:201\u0060 it begins part-way through the construct above it, so those exact 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":"host/src/future_login.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e5d9ec7c6ca2d6a0ee3514c7924c011a4a2dcfc7e04def1f79ae1992d2f94b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): channels/src/feishu/feishu_ws.rs:339-344 | channels/src/feishu/feishu_ws.rs:347-352 | channels/src/feishu/feishu_ws.rs:355-360 | channels/src/feishu/feishu_ws.rs:374-381 | channels/src/feishu/feishu_ws.rs:564-570 \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 \u0060channels/src/feishu/feishu_ws.rs:339\u0060 it begins part-way through the construct above it, so those exact 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, \u0060channels/src/feishu/feishu_ws.rs:337\u0060 calls \u0060or_else\u0060, \u0060get\u0060 and \u0060channels/src/feishu/feishu_ws.rs:345\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":"channels/src/feishu/feishu_ws.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fbc1c4426351e0d48a9d2012ec1815a61e01c2ae9637e158f825e89d449375"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): host/src/remote_host/business/tasks.rs:504-511 | host/src/tasks/service.rs:386-391 \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":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11531974b05b5b8fe0bce82df68b2447d033ce8b217c93a45302e95669e96bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): channels/src/providers/mattermost.rs:550-557 | channels/src/providers/slack.rs:771-778 \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 \u0060channels/src/providers/mattermost.rs:550\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/mattermost.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e222dbe3abbaf1f6a363e3b6727632b4d6d797b2af40d152af1c47f8bf96447"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/commands/remote.rs:741-747 | cli/src/commands/remote.rs:1680-1687 \u2014 both copies are in the same file, so extract the block 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":"cli/src/commands/remote.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f8d3dc12096a79f2d25029f253b1684ab4d7c1870d7d09719968fa361ecc9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/commands/task.rs:1366-1372 | cli/src/commands/task.rs:1605-1612 \u2014 both copies are in the same file, so extract the block 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":"cli/src/commands/task.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f87b7c3b10e2cf8e8f114c3012791be2997233d6bc048ee86b334d393e40d86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): host/src/files.rs:223-230 | host/src/remote_host/files.rs:457-464 \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 \u0060host/src/files.rs:223\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/files.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a6b67af95bda6391286a6a69b0d2396df821bcf5594fa7dfb0d86ba990a5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): host/src/agent_bridge/config_observer.rs:48-55 | host/src/agent_bridge/session_events.rs:58-65 \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 \u0060host/src/agent_bridge/config_observer.rs:48\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/config_observer.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9392cd71a526f3af7cca3c3dba8febfa5bac65abbea411e66f76da0e5eb6ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): channels/src/providers/linq.rs:752-759 | channels/src/providers/wecom.rs:608-613 \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 \u0060channels/src/providers/linq.rs:752\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/linq.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa016c1245a331ee94173056dbb4a5c14cfe62d062b111ab26b3db6953b826a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): agent/src/rpc/commands/providers.rs:335-342 | agent/src/rpc/commands/providers.rs:347-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/providers.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53482c11652ed676df9b0f773e50b90280f9a438b1bf660770cc929c4e742a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tui/src/rpc/grpc_client.rs:463-470 | tui/src/rpc/grpc_client.rs:495-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/rpc/grpc_client.rs:463\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc1005480b2be6aa6143f59d5a881bb5bc960a625fda13cbaa3c5dc9d8b3a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/browser/chromium/chromium_session.rs:559-565 | cli/src/browser/chromium/chromium_session.rs:567-573 \u2014 both copies are in the same file, so extract the block 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":"cli/src/browser/chromium/chromium_session.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ce58ade709709701d3b823b4bbcd8866770313731b013fa4d29d9500ebb2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): host/src/remote/relay.rs:219-225 | host/src/remote/relay.rs:267-273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/remote/relay.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":"host/src/remote/relay.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe245641d47e5e81d1c53a408121df3c34950560cb32b88b8ce36788c4b30af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tui/src/index.rs:524-530 | tui/src/index.rs:549-555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/index.rs:524\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/index.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"64dcbbf2a56ae595c191f6685753702a0c118adeb746dd80b6d70cfd37ece59b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): host/src/future_login.rs:202-208 | host/src/future_login.rs:261-266 | host/src/future_login.rs:513-519 \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 \u0060host/src/future_login.rs:202\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"host/src/future_login.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"92feadb6cc17fac184cc1268044fef5c014240b357f41f60e5a2d0d9d25d31fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/rpc/commands/session_lifecycle.rs:1132-1138 | agent/src/rpc/commands/session_lifecycle.rs:1183-1189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/rpc/commands/session_lifecycle.rs:1132\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":"agent/src/rpc/commands/session_lifecycle.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aaab8a0e933609c9b2665fc6d9fc9ff9b1df1f7581d7e6d4d90680909aa60e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/commands/task.rs:648-654 | cli/src/commands/task.rs:1473-1479 \u2014 both copies are in the same file, so extract the block 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":"cli/src/commands/task.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"a752f79c8ac7265d67ffd5c9a34744c43fbf690cf3949f3d8520d8f0656aeacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): host/src/agent_bridge/delete_outbox.rs:138-144 | host/src/agent_bridge/observer.rs:427-433 \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 \u0060host/src/agent_bridge/delete_outbox.rs:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/delete_outbox.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43d46918f619fbf13879234047f65ad2ec07191b6f1247e8ec59de90d5eb7bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): channels/src/providers/qq.rs:685-691 | channels/src/providers/qq.rs:694-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 \u0060channels/src/providers/qq.rs:685\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/qq.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"692f27213cae2d63464e865a61e13bafd63367e375afacd46f4fe06949b988a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): host/src/agent_bridge/delete_outbox.rs:136-142 | host/src/agent_bridge/observer.rs:425-431 | host/src/agent_bridge/reconciliation.rs:1051-1057 \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. 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":"host/src/agent_bridge/delete_outbox.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a336632900a5eb66ae9e6dafee2871758622178dededf30d05451ad099e37f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/rpc.rs:206-212 | cli/src/rpc.rs:237-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/rpc.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/rpc.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"330537569ae6716ad50bccbc266e983274e9828a8013c8f68dd6808fe5847615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/browser/input.rs:63-68 | cli/src/browser/input.rs:110-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/browser/input.rs:110\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/browser/input.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"de185676e5cd7c9d25b55d7be3170eb92a4d44d61bf593507459652679ebec55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): channels/src/feishu/feishu_ws.rs:516-521 | channels/src/feishu/feishu_ws.rs:598-602 \u2014 both copies are in the same file, so extract the block 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":"channels/src/feishu/feishu_ws.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1619e61720895c02ca28636382bf715440fa9b21f0a2187d2310efc25b1ec35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/src/commands/remote.rs:2502-2507 | cli/src/commands/remote.rs:2537-2541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/remote.rs:2502\u0060 it begins part-way through the construct above it, so those exact 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":"cli/src/commands/remote.rs"},"region":{"startLine":2502}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f725f24c3ef64f66ce54bbffb425c79f450c6e21329aa15602bd3f2effce154"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): agent/src/session/content/reader.rs:323-328 | agent/src/session/content/reader.rs:358-363 | agent/src/session/content/reader.rs:427-432 \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 \u0060agent/src/session/content/reader.rs:323\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/reader.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2053d02679c8056bb2afaa16f8417585aa4a79c95db929152cf41d303efa4f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/browser/chromium/chromium_manager.rs:43-48 | cli/src/browser/safari/safari_manager.rs:391-396 \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":"cli/src/browser/chromium/chromium_manager.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dac62ceb02db51422da79034be335b48061da4b7b38e6094853b610bb939867"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent/src/compaction/semantic.rs:635-640 | agent/src/compaction/semantic.rs:703-708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/compaction/semantic.rs:635\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/compaction/semantic.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca826be48b0fc923495863f5a4d8ab3e1cd076a80f9363c3bbf50a28c0763b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): host/src/remote_host/business/catalog.rs:256-261 | host/src/remote_host/business/catalog.rs:314-319 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/remote_host/business/catalog.rs:256\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":"host/src/remote_host/business/catalog.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcad02b0166774bdbd87d5030aac682dd69123859ab1e28104d1d47d66ab5b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/commands/session.rs:1119-1124 | cli/src/commands/session.rs:1251-1256 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/session.rs:1119\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":"cli/src/commands/session.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e54a646d3fc09b5344cc9ef8154d8a87a40bdc8927cc61a8e81d7dc6b95e9c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agent/src/session/content/fork.rs:143-148 | agent/src/session/content/reset.rs:237-241 \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 \u0060agent/src/session/content/fork.rs:143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/fork.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e1f1503a9f802d46e9c0699749654d8a3afc594725ed19e35ea6898930e60f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): agent/src/rpc/prompt_helpers.rs:220-225 | agent/src/rpc/prompt_helpers.rs:295-300 \u2014 both copies are in the same file, so extract the block 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":"agent/src/rpc/prompt_helpers.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aef57fd4a449c2d936dac076f5b838f7eba5d36d7fff05b5aca52da788e154"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 4): agent/src/session/sqlite_store/transcript.rs:237-241 | orchestration/fusion/src/store.rs:437-440 | orchestration/fusion/src/store.rs:451-455 | orchestration/fusion/src/store.rs:487-491 \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 \u0060agent/src/session/sqlite_store/transcript.rs:237\u0060 it begins part-way through the construct above it, so those exact 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":"agent/src/session/sqlite_store/transcript.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"986a110e5b0be433c10b20dfe2a803f5a1a55c64fbf20857688c907d9fa8b3c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agent/src/session/fork.rs:244-248 | agent/src/session/fork.rs:259-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agent/src/session/fork.rs:241\u0060 calls \u0060filter\u0060, \u0060is_empty\u0060 and \u0060agent/src/session/fork.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":"agent/src/session/fork.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"913144230b7b6ec56893c23600808944d52366c60f6982f228b7bcaa38cb49d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): host/src/remote_host/business/tasks.rs:361-365 | host/src/remote_host/business/tasks.rs:568-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 \u0060host/src/remote_host/business/tasks.rs:361\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1019770dda909b3000a534fa813d912053a1e4fe5721c7c0edb4554f037ea370"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): host/src/remote_host/business/tasks.rs:330-334 | host/src/remote_host/business/tasks.rs:564-568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/remote_host/business/tasks.rs:330\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e5e0aaacb62abd557721f256a790a96240da05b15a58e4f01dcc450a4e2397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/src/commands/task.rs:1341-1345 | cli/src/commands/task.rs:1422-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":"cli/src/commands/task.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c62045bf8d220ff8078968e5fbaabc80582fa54e6164800a74b771e05ee691"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): agent/src/session/reset.rs:420-424 | agent/src/session/reset.rs:435-439 \u2014 both copies are in the same file, so extract the block 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":"agent/src/session/reset.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ecef5d38551d77691b28283c29584eae4ef371dcb813d9ddcbed34d51b1238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): agent/src/session/fork.rs:237-241 | agent/src/session/fork.rs:244-248 | agent/src/session/fork.rs:259-263 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060agent/src/session/fork.rs:241\u0060 calls \u0060filter\u0060, \u0060is_empty\u0060 and \u0060agent/src/session/fork.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":"agent/src/session/fork.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e171a72038c8d1fe2df7b505a9349836fbba9aa72d74f79a0e3f454508da788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): channels/src/providers/email.rs:439-443 | channels/src/providers/irc.rs:324-328 \u2014 before extracting anything, compare \u0060channels/src/providers/email.rs\u0060 and \u0060channels/src/providers/irc.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060channels/src/providers/email.rs:439\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/email.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5d8cfc0b8cddf22ed47397dcc77612296107c46465cf8fedd2b4faff23e6aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): channels/src/providers/email.rs:491-497 | channels/src/providers/irc.rs:737-743 \u2014 before extracting anything, compare \u0060channels/src/providers/email.rs\u0060 and \u0060channels/src/providers/irc.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060channels/src/providers/email.rs:491\u0060 it does not close everything it opens, so those exact 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":"channels/src/providers/email.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f41c3d53e54939f6d611503de933082a72f97fc4203c129a178bb7dabf87838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): channels/src/providers/email.rs:643-647 | channels/src/providers/email.rs:1271-1275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060channels/src/providers/email.rs:643\u0060 it does not close everything it opens, so those exact 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 \u0060config\u0060 to \u0060\u0026SmtpConfig\u0060 in one and \u0060\u0026ImapConfig\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":"channels/src/providers/email.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"c443239663447c535ef834565e4c7ce943c99982f0ce17627ac459aeacb5cabc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): channels/src/providers/irc.rs:410-414 | channels/src/providers/irc.rs:428-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 \u0060channels/src/providers/irc.rs:410\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/providers/irc.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b433f8a29e9a72166270887b7e3580e89b90f501a820f2f13a95c18713f5504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): cli/src/browser/chromium/chromium_navigation.rs:37-42 | cli/src/browser/chromium/chromium_navigation.rs:137-142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/browser/chromium/chromium_navigation.rs:37\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/browser/chromium/chromium_navigation.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6bef96e3200e71e1af13937bf95fd099855b359e0932b5918749b45798c195"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): cli/src/commands/desktop.rs:131-137 | cli/src/commands/settings.rs:215-221 \u2014 before extracting anything, compare \u0060cli/src/commands/desktop.rs\u0060 and \u0060cli/src/commands/settings.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/desktop.rs:131\u0060 it begins part-way through the construct above it, so those exact 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":"cli/src/commands/desktop.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3700cdf05622c112a9c7f13bc59366c2805b77349e7abb3f256885c24ae9119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/src/commands/task.rs:497-501 | host/src/remote_host/business/tasks.rs:178-182 \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 \u0060cli/src/commands/task.rs:497\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/task.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d7487ed4761ad8bd623b46f33399e82b281309def76514d6a119378be174e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/src/commands/task.rs:895-905 | cli/src/commands/task.rs:1202-1212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/task.rs:895\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/task.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8985fba739a6bc78f35858fd0ed4d780975785b3a1f781472ab631c27fb2ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/src/commands/task.rs:879-883 | cli/src/commands/task.rs:1186-1190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/task.rs:879\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/task.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"39e6006a9350821966186ca8079de8a0b5f1e380e920e8f2e0ebb72c72702aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/src/commands/task.rs:887-891 | cli/src/commands/task.rs:1194-1198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/src/commands/task.rs:887\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/task.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5c6615945505bc7102c4dcb2e6cdd2977df45f121c6fe416508b8bac51ee37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/src/commands/tools.rs:577-581 | cli/src/commands/tools.rs:634-638 \u2014 both copies are in the same file, so extract the block 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":"cli/src/commands/tools.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f8c3cc6e30e90286fbdf4b12218ea3541974f825392a3452f98ecdf7af2eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): host/src/agent_bridge/import.rs:363-367 | host/src/agent_bridge/import.rs:370-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060host/src/agent_bridge/import.rs:363\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/import.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9e653df13173794970829db23cce344afa1aff32e8740b5addb13e7e2e0cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): packages/remote-client/src/session.rs:1247-1251 | packages/remote-server/src/connection.rs:96-100 \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 \u0060creds\u0060 to \u0060\u0026PeerCreds\u0060 in one and \u0060\u0026PairingCreds\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":"packages/remote-client/src/session.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"133eff3d0e45273f362712a0d44619f054f0297dd27f987a7615a0d9d85738c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tui/src/keys.rs:294-298 | tui/src/keys.rs:645-649 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/keys.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0414f5029bd1b54e02858b4f2fb23cc69972cd26f572f570d96c2284705690c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tui/src/workbench/git_panel.rs:585-589 | tui/src/workbench/git_panel.rs:755-759 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/workbench/git_panel.rs:585\u0060 it does not close everything it opens, so those exact 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, \u0060tui/src/workbench/git_panel.rs:590\u0060 calls \u0060get\u0060, \u0060copied\u0060, \u0060unwrap_or\u0060 and \u0060tui/src/workbench/git_panel.rs:760\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":"tui/src/workbench/git_panel.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e8a7ba48bb686c70fffa2dc31baa1b38e5c96fcb8a8c6840798145e17ae0a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): tui/src/workbench/screen.rs:1721-1725 | tui/src/workbench/screen.rs:1771-1775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tui/src/workbench/screen.rs:1721\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":"tui/src/workbench/screen.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"604b5ed73826d4a8cd4e0064e5fc61e0f834878aedee7ae6fdbfd247b015f987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): mobile/modules/future-file-handler/ios/FileHandlerModule.swift:31-36 | mobile/modules/future-file-handler/ios/FileHandlerModule.swift:41-46 \u2014 both copies are in the same file, so extract the block 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":"mobile/modules/future-file-handler/ios/FileHandlerModule.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc95b62dcefb696799cbb0b6d270751932204a2570ffed84bf26dd01b025ddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): agent/src/sandbox/windows/acl.rs:61-117 | agent/src/sandbox/windows/acl.rs:157-214 \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":"agent/src/sandbox/windows/acl.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a7059bef373ffc4d428906ad215d76cd304f616bd45b0fc70e9400aac845ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): scripts/screenshots/capture.py:766-793 | scripts/screenshots/capture.py:882-909 \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":"scripts/screenshots/capture.py"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb70d4b9c04dc9f393f8abccaa50b64900b29d95a6161871984b7df2dd265a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): agent/src/sandbox/windows/process.rs:319-367 | agent/src/sandbox/windows/token.rs:192-242 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/sandbox/windows/process.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb7f7c6ff33ec5e5a1502cb3da01d4882c4bc4a3ad4c53eb3550a2d097c5d85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): scripts/screenshots/capture.py:1096-1125 | scripts/screenshots/capture.py:1329-1353 \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/screenshots/capture.py"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"a083077cc8ee656f3de5eab7d6136971857c8d811797e62ac60ef5ee1dcb74e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): scripts/compaction_experiment/harness.py:165-179 | scripts/compaction_experiment/run_open_book.py:79-94 \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":"scripts/compaction_experiment/harness.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d988c5a5af4e34773477126bf62b61a8a476e05ec454850af5270e940dda86b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): scripts/measure/measure-lean-history.py:116-138 | scripts/measure/verify-e2e-bytes.py:190-209 \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":"scripts/measure/measure-lean-history.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"15481807abdb48c5d28a5cdc282deb3eb3565624c3c0707e0cce9d6a02db8ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): agent/src/sandbox/windows/token.rs:254-280 | agent/src/sandbox/windows/token.rs:348-368 \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":"agent/src/sandbox/windows/token.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0013c9d9b4c4a4c6b88f59ee954433e3d0801100462dbd019d0194303a77faac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): scripts/docs/generate_models.py:140-178 | scripts/docs/generate_models.py:182-224 \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":"scripts/docs/generate_models.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"196ed6f3c35b651174aecb4b54380de0cac19ad88cf758cd763863dfdc3007fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): scripts/measure/measure-sync-browser.py:30-39 | scripts/perf/remote-commands/measure-remote-latency.py:77-86 \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":"scripts/measure/measure-sync-browser.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"95080ef00255dab50ec06d7a0eaebc4564e09fc3836453b47a58b515087bb950"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): scripts/measure/measure-live-lane.py:25-34 | scripts/measure/verify-e2e-bytes.py:178-186 \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/measure/measure-live-lane.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"63558dcea5c13054a58e83e37884d76fc868ffe1a15ec3a35ed976fe47208808"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agent/src/sandbox/linux/plan.rs:410-421 | agent/src/sandbox/linux/plan.rs:434-443 \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":"agent/src/sandbox/linux/plan.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"778b7f22f2f13c8c4524786c14f9432aa9dc6ff2dc9923e1e4b2a24086cd09ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): agent/src/sandbox/linux/helper.rs:678-684 | agent/src/sandbox/linux/helper.rs:686-692 \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":"agent/src/sandbox/linux/helper.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f59e2f1b645aeed66ae6714e9e53c42d6c16c5c54e4428159734c05272f817"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): agent/src/sandbox/linux/request.rs:220-230 | agent/src/sandbox/linux/plan.rs:333-342 \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":"agent/src/sandbox/linux/request.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae09d4bdf4779d4161ace2a0288d45a8500dbb8289e33b59cab2273c437b7b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): scripts/perf/remote-commands/scale/build_scale_data.py:53-63 | scripts/perf/remote-commands/scale/run_scale_sweep.py:44-48 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/perf/remote-commands/scale/build_scale_data.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"58500c13c56870e889c63686a61bca7f471616c56471586be73a87042d5d0ccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): scripts/measure/mutation/analyze-queue.py:30-35 | scripts/measure/mutation/verify-attribution.py:38-42 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/mutation/analyze-queue.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5209f1d5913d2370a9ddd56f571a23d2cf9d4fdee70f9cf1381e930453587a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): agent/src/sandbox/windows/acl.rs:87-117 | agent/src/sandbox/windows/acl.rs:184-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/sandbox/windows/acl.rs:87\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":"agent/src/sandbox/windows/acl.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0395f450af547b961c72bad173d828e4b7e07c4bca47788a7fe85973a7bab52f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): agent/src/sandbox/windows/process.rs:328-347 | agent/src/sandbox/windows/token.rs:203-222 \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 \u0060agent/src/sandbox/windows/process.rs:328\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":"agent/src/sandbox/windows/process.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b6c845ac5c1e24fef3f00e94caf1e6b29bdf546ce984325700b76be11fdcbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): agent/src/sandbox/windows/acl.rs:62-79 | agent/src/sandbox/windows/acl.rs:158-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/sandbox/windows/acl.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a50d3a0c6d066adcbf8ebf89884c38dd7dc5ceb7ac031a810639be945d64f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): agent/src/sandbox/linux/plan.rs:415-421 | agent/src/sandbox/linux/plan.rs:437-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060agent/src/sandbox/linux/plan.rs:415\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: \u0060agent/src/sandbox/linux/plan.rs:415\u0060 is reached only past a guard at line 411 that tests \u0060rule.access\u0060 and leaves the function early, and \u0060agent/src/sandbox/linux/plan.rs:437\u0060 reads \u0060rule.access\u0060 with no such check. What separates these copies is not which lines they run but which PRECONDITION they enforce, so one of them is operating on state the other one refuses. Decide which is intended BEFORE unifying them \u2014 extract the shared part and whichever copy is missing the check keeps running unchecked, and if the guard is the correct behaviour then that hole is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/sandbox/linux/plan.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a824dba4a98f7a4873a58904b4f79eb64cea31a2480bf826758a16499468e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): scripts/measure/measure-lean-history.py:51-79 | scripts/measure/verify-e2e-bytes.py:146-174 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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/measure/measure-lean-history.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ffc2012fa146b1b351112bdedc462a142e453e01d630e8cc159543478e3492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): scripts/screenshots/capture.py:776-785 | scripts/screenshots/capture.py:889-899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/screenshots/capture.py:774\u0060 calls \u0060ffmpeg_path\u0060 and \u0060scripts/screenshots/capture.py:888\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/screenshots/capture.py"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1f24b0ece93d98ff5638dda27cbfe8f2c5750d6f35a48e3d87b8c1d8e60176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/measure/measure-lean-history.py:116-125 | scripts/measure/verify-e2e-bytes.py:190-199 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/measure-lean-history.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df7006d5cc63c8ea54e306bc7cf4484d9339389dba1845808e519cd2083c35c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): scripts/measure/measure-lean-history.py:129-138 | scripts/measure/verify-e2e-bytes.py:202-207 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/measure-lean-history.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca055a9873bf6fe06bd6e66d995067e545e0a71210688556c79aa475fa1609b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): scripts/perf/remote-commands/scale/summarize_scaling.py:335-343 | scripts/perf/remote-commands/scale/summarize_scaling.py:355-363 | scripts/perf/remote-commands/scale/summarize_scaling.py:374-381 \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":"scripts/perf/remote-commands/scale/summarize_scaling.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2c1d0be61d757f440734d0ad45a82db771fa2053ea8cc64c20db15ef32ac5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): scripts/compaction_experiment/harness.py:328-336 | scripts/compaction_experiment/run_closed_book.py:561-568 \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 \u0060scripts/compaction_experiment/run_closed_book.py:561\u0060 it begins part-way through the construct above it, so those exact 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, \u0060scripts/compaction_experiment/run_closed_book.py:569\u0060 calls \u0060normalize\u0060 and \u0060scripts/compaction_experiment/harness.py:337\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":"scripts/compaction_experiment/harness.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e878afad86ec3b734c11d2ec6aa00932fe7f3f4c2408c2167fe8ec6b93ca366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/docs/generate_models.py:399-410 | scripts/docs/generate_models.py:421-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/docs/generate_models.py"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"e075925ba9204c2ee6e60f3a238cfe855887d1c9fe0e24dd18960326a6630c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/screenshots/gen-demo-assets.py:125-133 | scripts/screenshots/gen-demo-assets.py:149-157 \u2014 both copies are in the same file, so extract the block 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, \u0060scripts/screenshots/gen-demo-assets.py:124\u0060 calls \u0060set_xlim\u0060 and \u0060scripts/screenshots/gen-demo-assets.py:148\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/screenshots/gen-demo-assets.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c881f8927cc40046d8b6e5788982184d77fc9345e89857ef927f60f81b3ccf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): scripts/screenshots/capture.py:767-773 | scripts/screenshots/capture.py:882-889 | scripts/screenshots/capture.py:1042-1048 | scripts/screenshots/capture.py:1102-1108 \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. 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 after the matched lines, \u0060scripts/screenshots/capture.py:774\u0060 calls \u0060ffmpeg_path\u0060 and \u0060scripts/screenshots/capture.py:891\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/screenshots/capture.py"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba41a0d9c76bcd0eb757d7412c6d36b4538f53a067ac0920e258e64a856df3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/compaction_experiment/harness.py:337-344 | scripts/compaction_experiment/run_closed_book.py:571-578 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060scripts/compaction_experiment/run_closed_book.py:569\u0060 calls \u0060normalize\u0060 and \u0060scripts/compaction_experiment/harness.py:336\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":"scripts/compaction_experiment/harness.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f4c53a05e0be4065b9b51ca8904fad4b9813e31295d976dc5d60659a7df2ec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/compaction_experiment/harness.py:347-354 | scripts/compaction_experiment/run_closed_book.py:598-605 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060scripts/compaction_experiment/run_closed_book.py:606\u0060 calls \u0060list\u0060 and \u0060scripts/compaction_experiment/harness.py:355\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":"scripts/compaction_experiment/harness.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7168a14fc9d92d5e3777ec1a5483d56d7b641b9542fca8f2e1c8a93ba1468c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/measure/measure-live-lane.py:27-34 | scripts/measure/verify-e2e-bytes.py:179-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 \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/measure/measure-live-lane.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea82708b268aa462b3dd091cc4a8538803e8d48415db7509a061dc66b5bc2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): scripts/screenshots/capture.py:1045-1051 | scripts/screenshots/capture.py:1105-1110 | scripts/screenshots/capture.py:1331-1336 \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":"scripts/screenshots/capture.py"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"189ebd43d4e801d6a14d6ca72915a12941fd74b0920a6ebf8fcd5a670b784d7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): scripts/perf/remote-commands/scale/summarize_scaling.py:338-348 | scripts/perf/remote-commands/scale/summarize_scaling.py:377-382 | scripts/perf/remote-commands/scale/summarize_scaling.py:396-402 \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":"scripts/perf/remote-commands/scale/summarize_scaling.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b3afb1bbe235cb34066c0e9a6df4eb9b3670f59c594c9ceea5e4ef0eb19b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/compaction_experiment/run_closed_book.py:123-128 | scripts/compaction_experiment/run_closed_book.py:153-158 \u2014 both copies are in the same file, so extract the block 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, \u0060scripts/compaction_experiment/run_closed_book.py:130\u0060 calls \u0060get\u0060 and \u0060scripts/compaction_experiment/run_closed_book.py:159\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/compaction_experiment/run_closed_book.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"839f5d5cb77a9358526a7fb1c802685bb552b30a790ed66f4617827979082f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): scripts/screenshots/tui_terminal.py:696-701 | scripts/screenshots/tui_terminal.py:793-795 | scripts/screenshots/tui_terminal.py: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060scripts/screenshots/tui_terminal.py:694\u0060 calls \u0060screen_from_stream\u0060, \u0060check\u0060, \u0060join\u0060 and \u0060scripts/screenshots/tui_terminal.py:792\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/screenshots/tui_terminal.py"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f7d8f98c7df068c940883bac600b90ee2560ab2b8d964e89952088b3251461"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/ci/headless-measurement.py:167-171 | scripts/ci/headless-measurement.py:207-211 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/headless-measurement.py"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01105371dd1587cd2dd0299889e0338ac3b58e711364585fc05a15bb3ca8857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/compaction_experiment/capture_shape.py:53-58 | scripts/compaction_experiment/capture_shape.py:152-157 \u2014 both copies are in the same file, so extract the block 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/compaction_experiment/capture_shape.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fea55c7717d461ddadf3ecd857fe4e3f09d133ce991970276e431f479182cb5"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project future-host: future-host has instability 0.87 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8539c4f19f1b548fd8debdc6e1efa283c8af4087817cd41a8c6c539deb6196ce"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project future-tui: future-tui has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a59cff38ac9a7dda5fb242edfd5c9a86f91b8714e592d6e70ab5868b15aab401"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @future-os/git-graph: @future-os/git-graph: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"443b4bf69d9f9656d969d08faf00692771248764d5d5c86669cf159e386bbab5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @future-os/json-preview: @future-os/json-preview: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9994280630338c8517cde43bd4cd4f6331e936989df066a02f7ccd80b00ba85d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @future-os/markdown: @future-os/markdown: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2bd461e333c8669257127d919b7ccd50d9d3f9868314db27610eaa47924ffdb7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @future-os/peer-icons: @future-os/peer-icons: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a05c63f875dd2cb266ae32c2aa9eac7740300d7da68bdbdea1b63eea15a61119"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-app-settings: future-app-settings: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"33e94a6b6734df4756182a9a8fa329c89ecbda82edc9c7e62e540ac5dd70d5f5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-http: future-http: 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":"dcae4a5252535e723f8be4d7a861e2109bc605192bdb81de0ab16dbc85539c66"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-logging: future-logging: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c23565186f791783f7d913d46e7f128435d276b3285fdb1aa717c9eb4a7728e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-remote-crypto: future-remote-crypto: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"02c2e3fa80f512e95f5f7ea44bba506be2e95365f184b8cd4bdd486c9143a73d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-rpc: future-rpc: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7387ab95989118b6a3b1e1496caa08df7ee8f1f080ad16717fc7aa331dc42591"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @future-os/thread-projection: @future-os/thread-projection: abstractness 0.10, instability 0.00, distance 0.90 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1aff14a7143a425466906fdaf4a2eebd72d0efcb53a657ecb991018e0173c28a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-share-intent: future-share-intent: abstractness 0.13, instability 0.00, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b5332a76d62c69b5d99382954141746f38025db82e124b97107af33323059441"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-file-handler: future-file-handler: abstractness 0.17, instability 0.00, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a40b297f324c55e1060ff06c611af3d17581cf2c25ef3b2d168e5f1bef11589"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-fusion: future-fusion: 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":"275bac45484cb7842d5165480002101c668943aef39e4190fd82a871ed14ceaf"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-remote-protocol: future-remote-protocol: 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":"b6b1621c75ba495f0e42ebd42d0b5137d24365257bebcbe68629bfd8c03118d6"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-app-workspaces: future-app-workspaces: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"87a515251e903a5d84f5e7f43d1d94afee77d2ca8039d77ec2a895eb611ba52a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: future-tasks: future-tasks: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ee3c5bf3e6228be98912264bb90a9039cae02c2f1f6ede6e1abc4923ae2ae2af"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Raw (LCOM4 6): Raw\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":"cli/src/prompt.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4849a70940926b946459a7c8b89a8ae361c0d7c3c2d49b9e140c0914f6aaf1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WhatsappConfig (LCOM4 5): WhatsappConfig\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":"channels/src/providers/whatsapp.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a97fc77708166ffb96948f3bf002ee4ce7136e7660c17034375a5c8acbcb6e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LinqConfig (LCOM4 4): LinqConfig\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":"channels/src/providers/linq.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"afa07cfd7ba1515e91da26091ffb3e85ef625a3fdde744bf54936104aee4eac7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WecomConfig (LCOM4 4): WecomConfig\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":"channels/src/providers/wecom.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6843f2ddd62282d27d81400a546992487b0bc15ae846be54f419c606393adfd7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExecutionReport (LCOM4 4): ExecutionReport\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":"orchestration/fusion/src/resilience.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0f11fd107348df1a2155833f2b50afc86c4b4fdca275158368b3c3cb2e26f9"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: accepts full nightly, test, and plain release versions: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tests/updater-signature.test.mjs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e4bee2f8911ea33bc248189389f0bbcd7ad1f38cbfdbf73fbbff3288e318b5"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: measures authenticated record roundtrips for %i-byte payloads: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-crypto/tests/secureChannel.perf.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c72388b2cdd1d1a4bd4505f1339d7e71c272db9647eba22f87d8a15775eca7"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: does not report an unobserved rejection when nothing awaits the catalogue: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/integrations/skills/skillsClient.test.ts"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"950bc35fc13d8f7943981874202f897feef66b19acab16ca80844271a60fc12b"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: prefetch and revalidate tolerate nulls and swallow rejections: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/integrations/agent/agentStateCache.test.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef6ba7753abe26212d3dd9c588a3c2faea58ba7c38dfc48de19d310fcc894ed"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ignores malformed payloads: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/integrations/agent/agentStateCache.test.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3edb69163ecd238f424c5e7ea1e652eb61257412ae9b60a03a21de21d775fad"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: clears pending cooldown and render work on unmount: This method\u0027s body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure*, in the test body and in the helpers it calls in the test and test-support code (a helper there that throws when its check fails counts as an assertion) \u2014 so verification routed through a callback object whose members hold the assertions, or through a harness in production code that fails by throwing, is not visible to this check and is not counted here. Read it as \u0027no assertion this check knows how to see\u0027, and if that is right, add one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/useMessagePagingHook.test.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fdf40058df306b4ee08d0e0bf6e7cd28e66b3d86595355d1e0eba8757a1c30"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: foreground attempts immediately, then retries at 1s, 2s, 4s without network events: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 1 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0dd5139de65b2f8c9431f2b5eb1f993259c51f96685a591997912ccb51d453"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: network-restored accelerates backoff and does not leave a duplicate retry: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b537d2617ed20c444bbb85ab9299910cc98267ebb87ab54507f8f78925170a9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: network notifications during a pending retry share the same connection attempt: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64cd636f0d943d50b7b9302490586dbb7f815b6e8330a0d778729f44a184119"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: revoked credentials stop foreground retries and ignore later network recovery: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb28098d7f181dbb9421b04759fd93338e305dbda2a6669ea10d9bbd060a11f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: initial timeout rejects a late credential result: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"e134e367440d089488deb696a4e9671431d4ce2679ab6c7c03fcba42a0426bbd"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: credential refresh pending does not retire the serving event subscription: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"231fa78ffaaaa0434a6b6417f0144f54854490e5a0306b499890b7dbcda11239"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: changing the visible session reinstalls only a selective subscription: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"279371fe5c3de3ae749cf0a2af87cc34ec3fcddf0bb8cbad8b0ea08bb2d01744"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a live subscription that dies while a replacement is opening is not retried twice: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8153b3a991717c60599c3c15e233c702cb8c4c88b09477270180653f72adce"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a pairing revoked while the replacement was activating is never published: This test sets up 4 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 3 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"03def4e68d4bcec2f4f7dbfeb4794793bb7db0a4d5c07241ba83ff2e2882bc76"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: an authorization failure on the status stream is recorded and ends the loop: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb7679a0eb0d55066b5724c67c9f085dff802c08069a5d3a55fde32fd4707cf"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a protocol failure on the status stream retires the generation: This test sets up 4 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5e1cfd90f71b348f862c86816f261199c0fa9a57288176df40a060994c4b08"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a revoked pairing is not rotated again by the refresh timer: This test sets up 4 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5175e178b47e3362d972806999440f6c997f71b26f846fb2b71d002047d52d96"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a reconnect whose handshake fails retires that generation instead of claiming ready: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1590}}}],"partialFingerprints":{"codehealthFindingId/v1":"70216097e7d9b5f3edbc75f57f1d26d5da328d290f0f3ec9f3519d01c159911d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a presence callback that tears the client down during handshaking cancels the ready announcement: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f399b94714665d0efa0db23b06f1861b79b5bac2318d6995536d185e64f57e3"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: an expired-JWT broker error rotates the token instead of giving up: This test sets up 4 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1649}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac306d8476dccde70c0d4a52c43e0b7434cd1c02a7b072a89c3b32f842622b3b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a revoked refresh token stops the client and asks the user to re-pair: This test sets up 4 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 2 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1663}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6315970e6e502548971fa829dd92a3b22320ae406830a9243bf1c2393cd2ae"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a retryable refresh failure backs off instead of spinning on the old token: This test sets up 4 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1679}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd694d2d5f53c938e6ef0ccef86428a0fa41413a3b7011a3487cd8ec6d306930"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a token rotation that does not help turns into a terminal service failure: This test sets up 4 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"550ff40e9b13854c4059bea81f1202c00a37215a1a48467a47a7277416f2db80"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a presence frame from another bridge forces a fresh handshake: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"857dd3f0e83551eabd410844e099b4ba767e7b9d01838f9693ec24ebcacc84d6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a presence frame with an unreadable payload is ignored, not fatal: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1913}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dafe0d8cbaa5cfffe79e6abaeaaaed4e0d980567e0c1be1124b857ab238dae"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: rotated credentials are persisted before the socket is used: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"5881c9d854b282ecc6a5e035e757a559c3cb95610fd7f2f9cce2801c7286b384"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a revoked device is reported as revoked and stops dialling: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e0de68106197c008f6ae65d338fb25d89ff4269a9df2e21deb9186d6b76f08"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a misconfigured service is fatal and stops every timer: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":1976}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90efb221c428b5dea6332b63652fe7d84362fb4df113eec08f7f62f3769e137"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a socket that outlives its attempt is closed instead of being installed: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":2001}}}],"partialFingerprints":{"codehealthFindingId/v1":"26edd3eed11ba8b69568daa18aaf94006dd2f97178910898ebbfa82362c862e6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a token refused before this pairing ever served traffic fails the client instead of retrying: This test sets up 5 test doubles (for example \u0060jest.spyOn\u0060) against 2 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":2147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7dceebb9c2a4aeb671a9144013eec0c90f2807e6ebbb0316ecc9218cd19db65"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a server URL that cannot be parsed is still labelled, never blank: This test sets up 12 test doubles (for example \u0060jest.fn\u0060) against 2 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5ae6ee50ad5ebc35c598a2d0d8ee573543f6385dacc7d4835da6538bdd23109"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a handshake failure drops its socket even when the teardown itself fails: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 2 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc424bb0bfb391c353db65f889be3cb6d2bf2c34ae0105209cbc6b81d329519b"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a cancelled attempt drops its half-built socket even when the teardown fails: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/client.test.ts"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6b36c018270e964a9b80db321f0fd984dff1a270b6bad0eec3aa55e785798e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: an expired status refreshes credentials: %s: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/connectionState.test.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2fc4280b56b28f167f7bb665608da46fb0b2da54cf4fff1ecec413f41c81a9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: %s validates a healthy socket without replacing it: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/tests/connectionState.test.ts"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbea07cc7b1b5e6303098677e148d2c51a8c49f79a5560f28d7872f27c93e73"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: manual entry submits from the keyboard without adding another confirmation step: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/__tests__/PairingScreen.test.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82eb627a76b54e0006f96fd4b10923f70c6a71fdab6a40def8fa10310c0a352"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: scanning a code pairs, and a second frame cannot start a parallel pairing: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/__tests__/PairingScreen.test.ts"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c53378023b97ecb8907f29e09f78e09afd332420f4e0464e8e950e299241085"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a screen with no back handler registers no hardware-back listener: This test sets up 4 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/__tests__/PairingScreen.test.ts"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0d22e7e85405201d9844389016c8e872ac15a0cf5a7af86eed4bf486362aa6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opens the privacy policy from the pairing screen: This test sets up 4 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/__tests__/PairingScreen.test.ts"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3ecc6cfafe2e63bb0675d5860e807cd12730a0ccba32dc5c92a5ecc9855d5ab"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a merged row from another desktop is opened on that desktop: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/__tests__/SessionList.test.ts"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"59262c10585ffc7bf0c69fd8ffb024b9cfa4802cda49a7c629636ea3e3f6110a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a peer\u0027s takeover in the device sheet reaches that peer: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/__tests__/SessionsScreen.test.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a60b0e36ac03fc31720422acf1999a7166b296fa8b2bab2b54d19441066cc9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: the Android new-conversation dialog defers the start until the sheet is gone: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/__tests__/SessionsScreen.test.ts"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"890bf0190fc0d7abfe1646baf082953eab906c83eced2efe42a89f7a2b900377"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: Android\u0027s dismissal event is not a second flush point: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/__tests__/SessionsScreen.test.ts"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"55834a6b99327edb4d43b40685dc7604ac492e468bcbd6e50165d0aea51f94a5"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a conversation started while another machine is named is created on it: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/__tests__/SessionsScreen.test.ts"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"96352e46dde86ab772f1339e43ecc75aba29066cb21ca75bc2c209bbd9cceb62"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: foreground recovery happens even when the network hint stays offline: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useAppLifecycle.test.ts"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"8022508ea94222120b02d5d0102e4bff7f6b00451c3a46c5effb3dd7cc6088d9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: offline hints do not tear anything down or add a polling loop: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useAppLifecycle.test.ts"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d51458b855235383578fceb669097e7a70b11c8bff48de758e32f292595519d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a late foreground network snapshot does not start another recovery after %s: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useAppLifecycle.test.ts"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5fd08143020354bff19b77cd1f17df633b1f410655b922764334d67a2be253"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: network refresh failure logs a warning and falls back: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useAppLifecycle.test.ts"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"984b0cfcf1463d0b23088ae4f216bfbdb4de6e2b5de3f37c568fba1d46e91234"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a recovery whose socket is replaced mid-probe does not refresh the new one: This test sets up 4 test doubles (for example \u0060jest.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useDesktopConnection.test.ts"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"db567bf9997c960a5b9c51f7c8dd536b01e70fa55fc9ad2fe64213ff6a6832e4"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: an ordinary stream event reaches settings, the run observer and the timeline: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useDesktopRuntime.test.ts"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98ca0a1de154a7415634488f75c95cfeb9e22c855b91f6461d66215d2193528"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reconciles a prompt while an existing conversation and draft are active: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/usePromptOutbox.test.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"750189c8fb1483204525b28121e9ec106ded62c8fa9059c88644e803ead48610"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: state reads refresh the selected model after reconnect without replaying settings as chat: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useTimelineController.test.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ec64daa36c9f508c28af819d0cecf6913dd01c85523af775aae3823f2e3bf0"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a state request started before a live settings event cannot overwrite it: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useTimelineController.test.ts"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0c42890e0a2e21ab3887986ed7fac34f387d98df0019cb0ca66f5a1f37a2e8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: %s refreshes models without reconciling a global timeline: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useTimelineController.test.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7df1b053eb3e601412ace8f2a860654b7eea3279d6df2230338c18fe0f7967c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: history from a replaced client is rejected before replay: This test sets up 3 test doubles (for example \u0060jest\n        .spyOn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useTimelineController.test.ts"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed63383beb0eb7de75a55215467ef0b85e376be4c7d1c58455009d35e7aeb061"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a runtime recovery that fails is logged, and the sync still restarts: This test sets up 4 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useTimelineController.test.ts"},"region":{"startLine":2564}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8c8fff13a2f21bd0db9196fb2302edc4af46dd0fe572eda4abff0b545f4d07"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a replay asked for without a client fails as not connected: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/__tests__/useTimelineController.test.ts"},"region":{"startLine":3227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbbd785ca12a3f32b21ddfd7f52342cc14a3d1138742f6510d9e107e2afcb18"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: copy hands the whole prompt to the clipboard: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/components/__tests__/PromptReader.test.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c55dff1e1acf97745698f365806c8588ac1e55fd41ee4b0c80c9b7c9a0547f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: an edit that empties the row is not a message, so nothing is sent: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/ChatScreen.test.ts"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c8e59afc8db6119b0fb374ac2f7a37eac2907046377435bb3334a47cf6bc68"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: an older desktop is edited by cancelling the row and sending it again: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 1 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/ChatScreen.test.ts"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9a2461c0b06475d6f392e44d4f7dca2a6b314ebe9638fe4cf2f9cbd7d16647"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a row carrying only files keeps the last one instead of vanishing with it: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/ChatScreen.test.ts"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dfa38907eeb30d42cdfe81ed71fc96425063fb8b678a975ce8e4fefd6184b9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a refused cancel is told to the reader instead of silently keeping the row: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/ChatScreen.test.ts"},"region":{"startLine":1828}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d323aac7223a26f3a3699212b17a78c6c87d4fe0279d2967ae63985ddc058a7"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: opening does not generate; click fills the draft without saving: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/RenameModal.test.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc1cd898a6ee73bfd0a2e9c590b0e426980574488228c9a5ff15d94dec5b1ce"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: sharing uses the actual named file and MIME without a VIEW query: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"640d1a51db71d71e41cd98c72ef5d8c35359081177bea346d94aa6adb19ee351"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: saving uses SAF without a VIEW query or share sheet: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8461438e179345801604739f0ade3fbcd1e003763befb288cd033922dd4679"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: sharing from a preview requests the original, not rendered/truncated bytes: This test sets up 4 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbd54a775efc04d89646bc50dabf994a4f1f91399298481581f38df14bf116f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: sharing a just-picked local file does not request a desktop transfer: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"383a608da085f8683f7a2989f3acdbbe4cd9f4bdf729a27eafa2b036f4755e35"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancelled downloads never launch a late share: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db3b95eaf76cb5a5390e224ff1bb9bee448e9674a6cf3de039bf63403a39c24"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a cancelled %s preparation releases the download lane: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b5d97c4ee5a0dde1d1f08c0fb0e4ab8f32cf322524d2e3ec5d00575942eed7"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a file the desktop refuses for its size says so, not \u0027desktop unreachable\u0027: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d93026c557d4b916e94e789e5dd9925a64a3e72b53785f434bbb05e621f79b6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a failed preparation reports the failure instead of leaving a dead screen: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"57773ec676f3aa0a2431ff91e261178caf7aca6eec3f52712aa4267d95ec9ab8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancelling while the large-file confirmation is up abandons the transfer: This test sets up 6 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdeca2578055820f06f5826e0b3811e527364d18a3342abdaecf20c887cec41"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: an action sheet transfer cancelled while the warning is pending never reaches the file: This test sets up 6 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8a1c955d45d81a6a93651a81c960f9248e23cb656ae5c5f8ebcb042c5effc6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: an action sheet transfer cancelled while the confirmation is up never reaches the file: This test sets up 6 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"532d5cfdca2f5879b9845639296fa5b1ebb061144c20ab3d9351665ea0fd2016"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancelling a save while the desktop prepares it never opens the SAF picker: This test sets up 4 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfe61bc5db82e055070051c636850a8b1e41a0dda99a019d73e6fb1f8e15563"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancelling while the system MIME lookup is pending keeps the file unopened: This test sets up 3 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8ed18f5451930517fc6b955f08c5fc202edc9b811096b02479ecb53068e585"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: cancelling during the bytes stops before the native handoff: This test sets up 3 test doubles (for example \u0060vi.mock/jest.mock of an imported module\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":1567}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ab7e03c0d23dd6e61e07d50c2f09de29b3aa7a39769b1c8cf7c9cf3d8c3d58"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a text link that cannot be decoded after download fails loudly: This test sets up 4 test doubles (for example \u0060jest.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac044a54e2e423a980f1151c05fe03527cd00e217b91df4c57df8d481fd0e3a"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a superseded dismissal cannot fire the action it replaced: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dba7652bfa62cffb4f123dd9cb5ef5dd591bfe5233a8054c21f39821a5f6b2e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: pending manual compaction blocks send, retry and continue without consuming drafts: This test sets up 5 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useSendMessage.compaction.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09f7a3d487aa515d8920ef09a0de16aa5d8fe64792db9cd827078f2c779be36"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a text send clears the composer and reports progress as the transfer advances: This test sets up 4 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 6 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useSendMessage.test.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"163f0bba6955dac2ab25a82b4044b85a17e357e1d5c7b67d48b13cd2499ff2d7"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a failed send reports %s and hands the draft back: This test sets up 4 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useSendMessage.test.ts"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e474a3f50b367f19aac60de5386222b165c4fe2127c3b0c025da494c184f23"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a lag sample older than the two-second window is dropped, not carried forward: This test sets up 4 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/__tests__/useStopRequest.test.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bf1c49c41e35be2dad0a2438adb55dc860d4ecee067473acd776aa2c691e1c1"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a link\u0027s picture opens its link, not the viewer: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/components/__tests__/MarkdownImage.test.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cba104425fe9ea31515443390724bebb64a9d95fd9942f67dfa7dc0804125e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: a picture the reply drew full screen on a tap, without another transfer: This test sets up 3 test doubles (for example \u0060jest.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/components/__tests__/MarkdownImage.test.ts"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"947c7e0ffedd0ae27ddf5621318f61695f7b32637a0c3a798ac17ed2c6da122e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: only newly appended blocks fade, not every update to their text: This test sets up 5 test doubles (for example \u0060jest.spyOn\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/components/__tests__/MarkdownText.test.ts"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9eca94cbf36d5d80d1a4ebfce524852dccf3fa147088d3de445f9e88f50ff47"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: starts a window drag from a plain area, clearing the text selection first: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 4 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/lib/windowDrag.test.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f491a94070803b0460fb3075a52d05f9a9a51328bfa88f7575fc05e5c5ddb69"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: leaves a remote panel alone when this app\u0027s own tasks change: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/useTasks.test.tsx"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2adeaf1c8fdd909ac95ae7b10e5bcb8ac217e867b9fb768bf0d51cafe29c75e"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: offers a parked row a start, because the Agent will not run it alone: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/AgentThread.test.tsx"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeca60d67246c0a76d674bd45ce238c080ccd3954e53770dc8b22e3643f009c8"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: installs the skill with no separating space when the draft is empty: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/Composer.panels.test.tsx"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f121fdbec8955ec796f8a1205ba6eb2198b35001a15ff73c5fc51b1ecd016f13"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: separates an installed skill from an existing draft with one space: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/Composer.panels.test.tsx"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c4959dba4f3b13d336ed4b6f8d093ec5dc863f8371e3b4e46a113cc15c3c49"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: sends the draft unchanged when the card is dismissed: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/Composer.panels.test.tsx"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"affa372e51967513202d716f2423ea0526aa0f6589fc8c598000ac06c8f4c140"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: clears stale highlights synchronously when the query changes: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 3 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/ThreadSearch.test.tsx"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"07342da0c7934a53367f3bdd824607ee6a25c2cacbc8804dff4fc191ff55b1b2"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: marks the run failed when the stream closes incomplete and the row is still active: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/sendPipeline.test.ts"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"0386ca817b052f216961ad33cfd0bbcdc6c9a17ea50d32bdc1c147afc2e58651"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: skips the status write in the failure path when the run already settled: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/sendPipeline.test.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7184dc08a3cb8a10c97fda5809194b6f937dcfe0cbcb95b40e0745ca362eef9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: writes the failure when the run row is gone mid-flight: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/sendPipeline.test.ts"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"762e775f95be1533f3b1f492ddec895fd72badb8faa372d1ae0183e4d4ff6d73"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: hands the queued run to the re-attach path without a final render: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/sendPipeline.test.ts"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2c81a555058526314e6eaed34dd7612ed734f07f4861f8dfa31930d5ad4e8c"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: aborts the run this view is attached to and reconciles: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/useAgentThreadState.abort.test.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a579b9889515709de4c4f9f6b6a50330634ee4bfb303adc5dbe7ff24c03d371"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does nothing when nothing is running: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/useAgentThreadState.abort.test.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f6c2350823141abd7309d952160d5b0685095582d7290e98e55db05983d597"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: still reconciles when the backend refuses the abort: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/useAgentThreadState.abort.test.tsx"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a8579b8a1a2a2982efd433b1c8f0f934a5180a1cccece96aeb32a2008eee9d"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: aborting with no conversation open is a no-op: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/useAgentThreadState.abort.test.tsx"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f88cdd24e249220730ba1b0b80b4e23e968aa7dd7822020ba75639968d55d7"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not submit a staged prompt again when remounted before acceptance: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/useAgentThreadState.lifecycle.test.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d742d35377b1766969f557feef9185bd9af0e15f9bbccdcb51c42ee7d474885"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: waits for the thread a staged prompt was composed for: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/useAgentThreadState.lifecycle.test.tsx"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb8f4c06f31d5108605bd4a72aa8e1d240708e3d3c49e843685a85e84f35e13"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: ticks a host\u0027s row when the row itself is activated in selection mode: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 2 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/MergedRows.test.tsx"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"006e433651f34b066709400d228e4b42564f132362b33847768b0bd1ca6097a6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: closes on a pointerdown outside the layer: This test sets up 4 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/railMenus.test.tsx"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"2532743907cd354f2e3a0efbfb0780b5bc6b553d9ab73cf0856dfeb94075e481"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: persists a model change with its default thinking level and refreshes the thread: This test sets up 3 test doubles (for example \u0060a double assigned in a shared setup\u0060) against 0 real object(s) of its own, and its only verification is 5 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/hooks/useModelSelection.actions.test.ts"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b88c99170b9228a7b7845d2f19c4d025f8413141067f45c299d7a34edbb79b6"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: does not pin when the flow was not asked to, and never asks twice: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 3 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/hooks/useNewConversation.test.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aeb2bb7da2339722d5e42761144ab08a593eb9680b7e1e74414f46123843796"}},{"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":"101e43304547a92f3150134bd0829228ecde3c38f587672a5ee7c6f9f66c18e6"},"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":"3b09846002dabe723c726e6db654eb4567346dd73ac2a0b8b07ec0c7650219d0"},"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: desktop/src/components/layout/ActivityRail.tsx: desktop/src/components/layout/ActivityRail.tsx changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 290 in ActivityRail.ActivityRail at line 276. 27 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/ActivityRail.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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d423bd3f4d4d76f86145d157ad8e31d7ba8ecf9801d892ef6d8f91476130bb2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/AppShell.tsx: desktop/src/components/layout/AppShell.tsx changed 91 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 164 in AppShell.ReadyAppShell at line 152. 30 of those changes were fix/bug commits, and the other 61 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/AppShell.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":"desktop/src/components/layout/AppShell.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"1083431f2d2b45703a6730f6d20914b2b223e2cd99266d7f7a7374e0475f536f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/screens/SessionList.tsx: mobile/src/screens/SessionList.tsx changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 227 in SessionList.SessionList at line 182. 26 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/screens/SessionList.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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81daa67c85896b7bfd45b7d203b95c8de79bb8ebb5d59788b303d4910d5fe04"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/ChatScreen.tsx: mobile/src/features/chat/ChatScreen.tsx changed 72 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in ChatScreen.ChatScreen at line 72. 27 of those changes were fix/bug commits, and the other 45 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/ChatScreen.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":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe573346cd9fc6a8ea80a7e9e615787acae08bdd8bea88ba6d64e4031f02df9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/screens/SessionsScreen.tsx: mobile/src/screens/SessionsScreen.tsx changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 147 in SessionsScreen.SessionsScreen at line 98. 23 of those changes were fix/bug commits, and the other 35 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/screens/SessionsScreen.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":"mobile/src/screens/SessionsScreen.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2c60d8fb6e26781c9156d56c13126d556d5ea41c199233a7cb4613dad03850"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/agent/run_loop.rs: agent/src/agent/run_loop.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 163 in Loop::run_streaming_inner at line 248. 18 of those changes were fix/bug commits, and the other 21 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/agent/run_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":"agent/src/agent/run_loop.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41273cbe597a3773ab0b37358d052b4c0035a99ad5b8cc1b576bffbb455a151"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/rpc/session_prompt.rs: agent/src/rpc/session_prompt.rs changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in ServerSession::prompt_internal at line 796. 23 of those changes were fix/bug commits, and the other 34 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/session_prompt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/session_prompt.rs"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"5214faab3e39f36e1cb0ec7463743c248f9f4a62ff368276eacd34bafd1fe7bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/RemoteComposer.tsx: desktop/src/features/remote-peer/RemoteComposer.tsx changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 154 in RemoteComposer.RemoteComposer at line 230. 16 of those changes were fix/bug commits, and the other 19 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/RemoteComposer.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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c80344e12b7a8e72c971e5de8b631c4ac1932add448018b52b2d8227e57985"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/workbench/mod.rs: tui/src/workbench/mod.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in Workbench::handle_overlay_key at line 2475. 15 of those changes were fix/bug commits, and the other 38 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/workbench/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":"tui/src/workbench/mod.rs"},"region":{"startLine":2475}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a8d39edea2997d335beaecbfbfdf2af95c213caf4f35cdd2458305961a957d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/Composer.tsx: desktop/src/features/agent/Composer.tsx changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 130 in Composer.ComposerImpl at line 233. 16 of those changes were fix/bug commits, and the other 22 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/Composer.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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0d19a8d7e9c432550f466c40bea79db6e76929e4d3a0ace0611393818a72a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: orchestration/goal/src/console.rs: orchestration/goal/src/console.rs changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in future_goal::console::todo_add 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- orchestration/goal/src/console.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"orchestration/goal/src/console.rs"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7c511f1e1b0de529cd959427bfa2a9f1198ed2d84ee92f0ffdf91e12054813"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/rpc/commands/mod.rs: agent/src/rpc/commands/mod.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in future_agent::rpc::commands::handle_command_internal at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/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":"agent/src/rpc/commands/mod.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cda14187a9af068b09859010593498264acdf9c230d8a34d7b21fa71bee442"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/remote/RemoteContext.tsx: mobile/src/remote/RemoteContext.tsx changed 69 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in RemoteContext.RemoteProvider at line 723. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/RemoteContext.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":"mobile/src/remote/RemoteContext.tsx"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d7ba1a02acae89256ccfe623fe256b5d9197a8039a89966d0034057439a2a1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/shot/mock/RemoteContext.tsx: mobile/shot/mock/RemoteContext.tsx changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in RemoteContext.RemoteProvider at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/shot/mock/RemoteContext.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":"mobile/shot/mock/RemoteContext.tsx"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"022d3c5e5149c7e3b28cb526ac502fc32599b6aead3f5de49ed51aed9a0032ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/components/ComposerDock.tsx: mobile/src/features/chat/components/ComposerDock.tsx changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in ComposerDock.ComposerDockView at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/components/ComposerDock.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":"mobile/src/features/chat/components/ComposerDock.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ce465219b3763430f84dd7a54d2274229ce53e986f7f509304e317889b302c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/workbench/run.rs: tui/src/workbench/run.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 82 in future_tui::workbench::run::quit at line 911. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/workbench/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":"tui/src/workbench/run.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"879ba2201272ad991831a88a8b5ff367696134c8f2ead4362344b148e41c29bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/AgentThread.tsx: desktop/src/features/agent/AgentThread.tsx changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in AgentThread.AgentThread 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/AgentThread.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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6da32fbeb3c24ea389c5ab7beef295443a053e3246cc1f931afdf8098e453c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/MentionEditor.tsx: desktop/src/features/agent/MentionEditor.tsx changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 144 in MentionEditor.MentionEditor at line 192. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/MentionEditor.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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b3a31ebb2e582ccc68264d1e11ed7a20f66ae1e330c4a8777172fd9232e732"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/settings/SettingsScreen.tsx: mobile/src/features/settings/SettingsScreen.tsx changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 98 in SettingsScreen.SettingsScreen at line 105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/settings/SettingsScreen.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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41bc560850f011e7354502c02bb406ede7107ba9876afa390bc8fe021c31e9c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/workbench/live.rs: tui/src/workbench/live.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in Live::command at line 2414. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/workbench/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":"tui/src/workbench/live.rs"},"region":{"startLine":2414}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd5467a55ac233d05cddbcf5dae4b57d024ccf1a27a67d38c05b8a38ec32570"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/lib.rs: cli/src/lib.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in future_cli::dispatch at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- 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":"cli/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd6b7da70f02d32b7517793b3839817fe278fc23c341bfbcef6f2e5a78426bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/MessageBlock.tsx: desktop/src/features/agent/MessageBlock.tsx changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in MessageBlock.MessageBlockImpl at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/MessageBlock.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":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1d9969ed7a9cfdb5f6d0efa6a032df387e41113bc35fd0b3af912d5c5dd7cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/thread-projection/src/liveApply.ts: packages/thread-projection/src/liveApply.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 125 in liveApply.createProjector.processEvent at line 225. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/thread-projection/src/liveApply.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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dab59e2501a99cc9eead2da3bf6b4997e23f54a46fc7f77a9b75085a636313"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/rpc.rs: cli/src/rpc.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in RunClient::run at line 1197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/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":"cli/src/rpc.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3038a3cb8ea2778acaeec215e604e3dd011a4f120f78469137552ca1c563a276"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: orchestration/goal/src/store.rs: orchestration/goal/src/store.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in future_goal::store::apply at line 1897. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- orchestration/goal/src/store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"orchestration/goal/src/store.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c5c81052c0eb84211194596fb6298532accfef7b4c7f9d137f906d31690958"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/workbench/screen.rs: tui/src/workbench/screen.rs changed 45 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in future_tui::workbench::screen::compose at line 25. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/workbench/screen.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/screen.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a5d7f79d6b2b3660666017168faaec7d7083fff5232f89ac735a5ec91c47d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/remote/useTimelineController.ts: mobile/src/remote/useTimelineController.ts changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in useTimelineController.useTimelineController at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/useTimelineController.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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b304852d25543305674723d099a0d00e3f4f11b1343ae3111eb1f7a0c37ee9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/commands/session.rs: cli/src/commands/session.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in future_cli::commands::session::set_session_command at line 1303. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/src/commands/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":"cli/src/commands/session.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eee03dffff4119b6543aca42544c82ca65a678182a8e196e1b4ba84ef559ec5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/settings/TasksSettingsPage.tsx: mobile/src/features/settings/TasksSettingsPage.tsx changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in TasksSettingsPage.TaskForm at line 664. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/settings/TasksSettingsPage.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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa32d418146a9cb9bf658bf838019c002417e5b16499ac5368aca5cb5d6dc80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/useRemoteTimeline.ts: desktop/src/features/remote-peer/useRemoteTimeline.ts changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in useRemoteTimeline.useRemoteTimeline at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/useRemoteTimeline.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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1a10bc848e654a467a1826f959bcf26ef9f17cce610b91bf93c40fba0e59bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/messages/TimelineCard.tsx: mobile/src/features/chat/messages/TimelineCard.tsx changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in TimelineCard.TimelineCardView at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/messages/TimelineCard.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":"mobile/src/features/chat/messages/TimelineCard.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c68f0d4db22801ea831abe2f32bd6e1f0dc1844b59577becd1056a729a8c3b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/rpc/session.rs: agent/src/rpc/session.rs changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in ServerSession::compact_with_policy at line 1260. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/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":"agent/src/rpc/session.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d6a4e600bb6314540dd7a856e8ac716b73692fbc754c6255e73eb93c998a7f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-client/src/syncEngine.ts: packages/remote-client/src/syncEngine.ts changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in SyncEngine.runReconcile at line 571. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-client/src/syncEngine.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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e7ab606fe621d1bdc327c08b06e6ec162f8de6c505993218634b408f3d584e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote/RemoteView.tsx: desktop/src/features/remote/RemoteView.tsx changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in RemoteView.RemoteHostSection 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote/RemoteView.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":"desktop/src/features/remote/RemoteView.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a98cae3a35ce9bb729582fe270fc3aa42f29d2cd21263d72e6b379cbef87a06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/rpc/grpc_client.rs: tui/src/rpc/grpc_client.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in future_tui::rpc::grpc_client::subscribe_stream at line 1713. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/rpc/grpc_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":"tui/src/rpc/grpc_client.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b99f66b8e38f4f087418b582b074a890392ecf0386abdaf07411d398d9617fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/RemoteConversationView.tsx: desktop/src/features/remote-peer/RemoteConversationView.tsx changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in RemoteConversationView.RemoteConversationView at line 81. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/RemoteConversationView.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":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1013cdea3cb8f5513580b550d8baa7c6b0de76f61a76945e45f2eca2df6d78fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/rpc/commands/session_lifecycle.rs: agent/src/rpc/commands/session_lifecycle.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in future_agent::rpc::commands::session_lifecycle::cmd_new_session at line 696. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/commands/session_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":"agent/src/rpc/commands/session_lifecycle.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b4b797ea37647e44b484b6ed306ada464be1adb626235457c3a8fd075a60aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/headless/mod.rs: cli/src/headless/mod.rs changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in future_cli::headless::session at line 333. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/src/headless/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":"cli/src/headless/mod.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0307cc22ca6098a8b967ff415cf6ba4105365a049ded5d7d9aa4a197c5d809b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/MergedRows.tsx: desktop/src/components/layout/MergedRows.tsx changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in MergedRows.MergedRows 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/MergedRows.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":"desktop/src/components/layout/MergedRows.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b42d1804b63e517b4c5a5469f540c63326c393399edb83b3ad0e52a9c33404"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-client/src/projection.ts: packages/remote-client/src/projection.ts changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in projection.applyEvent at line 516. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-client/src/projection.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":"packages/remote-client/src/projection.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"378805678c11edf6ae2255c1167110d33f22df6cf368a6933a977abda05bb058"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/tasks/TasksView.tsx: desktop/src/features/tasks/TasksView.tsx changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in TasksView.TasksView at line 229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/tasks/TasksView.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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f56f250f5691f7c024e6da98588fcb25c31a595b3173c42fda0a221b08e4f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/agent_bridge/observer.rs: host/src/agent_bridge/observer.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in future_host::agent_bridge::observer::handle_event_from at line 1089. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/agent_bridge/observer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/observer.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"76da0a4c7b228d81f43f7f45c9e0afc3deba76a7cfee2522556afba3603500be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/llm/mod.rs: agent/src/llm/mod.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in Client::stream_model 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/llm/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":"agent/src/llm/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"8359854692bc3b951e77bef28b4a042e6dae0344fa04070d791b3bd15e220b26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/grpc/mod.rs: agent/src/grpc/mod.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in FutureAgentService::stream_events at line 601. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/grpc/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":"agent/src/grpc/mod.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e69d3c274e99417e40ba63fb8958120a7c946223846b2ba99923dd5aca8357"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/lib/run.mjs: harness/lib/run.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 131 in run.runCase 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- harness/lib/run.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":"harness/lib/run.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3117f2d1ba1a648dd124645f5f0b88163a1db8a33667eed8cb346b88c14ce3c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/index.rs: tui/src/index.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in future_tui::index::parse_args at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/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":"tui/src/index.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d2851f8a973affca4da8153e0fd86ee3c0377c1b7a8d859ab493fed1665b07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/remote_host/business/history.rs: host/src/remote_host/business/history.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in future_host::remote_host::business::history::execute at line 108. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/remote_host/business/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":"host/src/remote_host/business/history.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6154326b977d7db0db5890f37a1af4b75e800df5a91f9bcaf7ba8b1713fa26d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/remotePeerClient.ts: desktop/src/features/remote-peer/remotePeerClient.ts changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in remotePeerClient.normalizeRemoteSessionRows at line 293. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/remotePeerClient.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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3643a08db019b85483508859b391f3568ae80bc2cf1ccc5227822b692e36bd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/vibe/VibeStage.tsx: desktop/src/features/vibe/VibeStage.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 143 in VibeStage.VibeStage at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/vibe/VibeStage.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":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc53d97bf1f8fb61aec5e89c247a1c22d7552094706afa0fff995ad0b3cea72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/sendPipeline.ts: desktop/src/features/agent/sendPipeline.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in sendPipeline.runSendPipeline 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/sendPipeline.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":"desktop/src/features/agent/sendPipeline.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8db169648bcb759fb2ba3b91733eac0e3bc2a302c630f5bed79aea265e2431"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/composer/ComposerControls.tsx: desktop/src/features/agent/composer/ComposerControls.tsx changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 73 in ComposerControls.ComposerControls at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/composer/ComposerControls.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":"desktop/src/features/agent/composer/ComposerControls.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bdc7b5874cc8666ca8026d8e9c5e5805842e2bcffab4df1376dcea3009ca614"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/remote_host/business/tasks.rs: host/src/remote_host/business/tasks.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in future_host::remote_host::business::tasks::execute at line 322. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/remote_host/business/tasks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/tasks.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"250981fb015a9951ae9d6500df3a44e2f313af06e4b98162af70b524668e500f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/commands/run.rs: cli/src/commands/run.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in future_cli::commands::run::parse_run_args at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/src/commands/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":"cli/src/commands/run.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"25df9ffd4a2aeaab0b9bd829cc4a5827b763dde61048bec03d324dcad1f9596e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/hooks/useRemotePeers.ts: desktop/src/components/layout/hooks/useRemotePeers.ts changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in useRemotePeers.useRemotePeers at line 111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/hooks/useRemotePeers.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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"24865ae879872a3bb79f462ec8549fb12c8c1c901e79b6f114455066daf5fdf6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/commands/task.rs: cli/src/commands/task.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in future_cli::commands::task::edit at line 1055. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/src/commands/task.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/task.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc7984b70ebb5597eeabac1c7a0376db002d8cbaaf6f1d206eb29884cf26bb9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/remote_host/business/catalog.rs: host/src/remote_host/business/catalog.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in future_host::remote_host::business::catalog::execute 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/remote_host/business/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":"host/src/remote_host/business/catalog.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0909b60f1d88654fe319eeb42718412687ef01190e395c3e40fccea612d73b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/ContextPanel.tsx: desktop/src/components/layout/ContextPanel.tsx changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in ContextPanel.ContextPanel at line 91. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/ContextPanel.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":"desktop/src/components/layout/ContextPanel.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f47ffdfc545a1c64aa332f1f051386b2b027951c3f26bfcaf4ec3bc56fc28d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/components/chat_area.rs: tui/src/components/chat_area.rs changed 39 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ChatArea::fold_reply_segment at line 2429. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/components/chat_area.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/chat_area.rs"},"region":{"startLine":2429}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef01552af65cdc94768f8fdc059aca3e144ad29dc77e1f163fb226178d598af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: orchestration/goal/src/agent_client.rs: orchestration/goal/src/agent_client.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in future_goal::agent_client::consume_run_stream at line 902. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- orchestration/goal/src/agent_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":"orchestration/goal/src/agent_client.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"addd38b00fac4d8cdd4a249af2747b6dff5ade2cad49038516b27daf03a56ea9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/components/MarkdownText.tsx: mobile/src/components/MarkdownText.tsx changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in MarkdownText.renderBlock at line 306. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/components/MarkdownText.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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ed257d7b8cddfb190e44410842c98cdf18dc75001109c1dfcff60790fd7ff2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/lib/fixture-server.mjs: harness/lib/fixture-server.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in fixture-server.createFixtureServer at line 244. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- harness/lib/fixture-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":"harness/lib/fixture-server.mjs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1def4672d4529e6524367240742daa1c89b498693de1132c806db8ac795777"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/settings/CustomProviderDialog.tsx: desktop/src/features/settings/CustomProviderDialog.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in CustomProviderDialog.CustomProviderDialog at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/settings/CustomProviderDialog.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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b59cb2194302d106d9fe68340267d88d13b5a3272ed97899b3317e129aa176"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-server/src/commands.rs: packages/remote-server/src/commands.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in future_remote_server::commands::command_loop_with_ready at line 458. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-server/src/commands.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/commands.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0564dcce443f3ed46bbf9ca562a8a46fa8b2640fe502fb50ca2ff3338f5c2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/agent/mod.rs: agent/src/agent/mod.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Loop::execute_tools_sequential at line 308. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/agent/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":"agent/src/agent/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5208f647e64d998b9a825827e90099cd55d8215527a3edd845442557b35b86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/RemotePeerSettings.tsx: desktop/src/features/remote-peer/RemotePeerSettings.tsx changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in RemotePeerSettings.RemotePeerSettings 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/RemotePeerSettings.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":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"79baa8c508687e76b914749c9036a1b46787575dcb844080422eea2bb7e3b336"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/useSendMessage.ts: mobile/src/features/chat/useSendMessage.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in useSendMessage.useSendMessage 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/useSendMessage.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":"mobile/src/features/chat/useSendMessage.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a90272d5da5a4357026935d443f8b6046e4bb25e4829e8bdabf3970a9af479c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/remote_host/business/settings.rs: host/src/remote_host/business/settings.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in future_host::remote_host::business::settings::execute 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/remote_host/business/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":"host/src/remote_host/business/settings.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"271b02fee0ff193ddcfd98ae33f0012cad1f31fee8504fcf65f5e2018be607e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/mergeConversations.ts: desktop/src/features/remote-peer/mergeConversations.ts changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in mergeConversations.groupMergedRows at line 828. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/mergeConversations.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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c765c11a1c9a8a86d1508ad27233beaa263a33aecc67a119c14ab825219f80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/cli.rs: agent/src/cli.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in future_agent::cli::run_from_args at line 202. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/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":"agent/src/cli.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"a127c413139ad7ab3dc26387f51bca191a170b9cbb50976b439ebcfa88fc4192"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/terminal.rs: tui/src/terminal.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in Terminal::start at line 442. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/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":"tui/src/terminal.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"8463faa0b9ad737d16b126c0abdf3e4637bb27353517f177f12b9d0609a1445a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/RemotePeersView.tsx: desktop/src/features/remote-peer/RemotePeersView.tsx changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in RemotePeersView.RemoteClientSection 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/RemotePeersView.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":"desktop/src/features/remote-peer/RemotePeersView.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb54be349408899532afd33d61a64a5f0ed7b509dbfc489a4fba5de51db79e2d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/remote/usePromptOutbox.ts: mobile/src/remote/usePromptOutbox.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in usePromptOutbox.usePromptOutbox.sendMessage at line 272. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/usePromptOutbox.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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a004b9282b7fb3a82c4de124b23b43c0b6d5800985f588937b8e251b90a384e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/settings/SettingsDialog.tsx: desktop/src/features/settings/SettingsDialog.tsx changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in SettingsDialog.SettingsDialog at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/settings/SettingsDialog.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":"desktop/src/features/settings/SettingsDialog.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c4f856a452b3931c30c6934b3662104765db0859252cf1e1ed035590f451c8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/legacy_import.rs: agent/src/session/legacy_import.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in future_agent::session::legacy_import::parse_sources at line 446. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/legacy_import.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/legacy_import.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"36926c9feccfc1fc6142a35f7ae2eeac2c0a59937910de20c13c261d9e02cb50"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/agent_bridge/import.rs: host/src/agent_bridge/import.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in future_host::agent_bridge::import::import_one 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/agent_bridge/import.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/import.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fef2588d412efb97d098f362c19a7b7c5283cb65b3c8c66f3fa598a1c97851d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/ApprovalPrompt.tsx: desktop/src/features/agent/ApprovalPrompt.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in ApprovalPrompt.ApprovalPrompt at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/ApprovalPrompt.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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d21398701b9eb3e7def9e189220784a1a30d1bac55868c31d1c7b560ed21c8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/agent_bridge/stream.rs: host/src/agent_bridge/stream.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in future_host::agent_bridge::stream::collect_agent_response at line 181. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/agent_bridge/stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/stream.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc08e5c16295a512483a7ef55f38c4b49a4fe57b7f3c05f4d54802a1f1461b08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/markdown/src/parseFutureMarkdown.ts: packages/markdown/src/parseFutureMarkdown.ts changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in parseFutureMarkdown.blockToFutureNode at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/markdown/src/parseFutureMarkdown.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":"packages/markdown/src/parseFutureMarkdown.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e63f44c9d90866154696c37041818d19bed267548cc93dcc0215fcc593517635"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/remote/useSessionCatalog.ts: mobile/src/remote/useSessionCatalog.ts changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in useSessionCatalog.useSessionCatalog.observeRunEvent at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/useSessionCatalog.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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a402ebc513d57072e2e11e416b2fc58b0befe30ef36bfb2b308d67c74fbb0d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/screenshots/capture.py: scripts/screenshots/capture.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in capture.run_scenario at line 800. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- scripts/screenshots/capture.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/screenshots/capture.py"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"6167e18cd6978524ceff26c14af0f43066ab9d90f5a91ca576c5690ca7237ff0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/settings/UpdatePage.tsx: desktop/src/features/settings/UpdatePage.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in UpdatePage.UpdatePage at line 28. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/settings/UpdatePage.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":"desktop/src/features/settings/UpdatePage.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b46790c0f22ab04c15e8d59263ae4587567e3f5647dba9ba33bc6c2207cadb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/thread-projection/src/projection.ts: packages/thread-projection/src/projection.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in projection.turnFromAcc at line 325. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/thread-projection/src/projection.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":"packages/thread-projection/src/projection.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb95a9ea0d07c3a8dd7a1ece4e842da38ea809de97ea8a16760ad7fc995cd32"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/components/PreviewModal.tsx: mobile/src/features/chat/components/PreviewModal.tsx changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PreviewModal.PreviewLayer at line 135. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/components/PreviewModal.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":"mobile/src/features/chat/components/PreviewModal.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc79bdc0f96fb3662804391aa89fee4ddf649064bed8023aae149c4681f6fd7e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/persistence.rs: agent/src/session/persistence.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in future_agent::session::persistence::execute at line 638. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/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":"agent/src/session/persistence.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d045af9aef2bb8e1e6b452299eb2de3e66f9d81bf0254e11d0faa436baa134"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/sqlite_store/transcript.rs: agent/src/session/sqlite_store/transcript.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in future_agent::session::sqlite_store::transcript::insert_transcript_entries at line 291. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/sqlite_store/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":"agent/src/session/sqlite_store/transcript.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"10430e9da7653ff1257f9a34edbd92044c4bcf8aa99f4db8650f2f398a9f7594"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/commands/remote.rs: cli/src/commands/remote.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in future_cli::commands::remote::list at line 739. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/src/commands/remote.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/remote.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce260138de0dc094550637ec84bcd6ae9bcee49be9d92fec4d97a00232bb9c64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/rpc/prompt_helpers.rs: agent/src/rpc/prompt_helpers.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in future_agent::rpc::prompt_helpers::run_event_to_sse 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/prompt_helpers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/prompt_helpers.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ebc373c5af15dbf9cf4a6e1999522601eb6fd8ff227184b4d2cae64e371924d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/terminal/TerminalView.tsx: desktop/src/features/terminal/TerminalView.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in TerminalView.TerminalView 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/terminal/TerminalView.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":"desktop/src/features/terminal/TerminalView.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5ca82e859fe37c3e3e10464659f6792f971e248ed3cbea092eb01dd179910d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/screens/DesktopPicker.tsx: mobile/src/screens/DesktopPicker.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in DesktopPicker.DesktopPicker at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/screens/DesktopPicker.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":"mobile/src/screens/DesktopPicker.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"890fe3a8dd82947aff64adc62ce300f485e247a1e30143fbe7a26dce42519928"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/remote/useDesktopConnection.ts: mobile/src/remote/useDesktopConnection.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in useDesktopConnection.useDesktopConnection.connect at line 387. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/useDesktopConnection.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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"8954b2373968229399baad9930dcfaf35592a948ced0d888b82d61154ec2e54e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/compaction/semantic.rs: agent/src/compaction/semantic.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in future_agent::compaction::semantic::call_summary_request at line 601. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/compaction/semantic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/compaction/semantic.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aab68d699e4b06e74c5802e2b01d1a507db55068c118ec152c31350e16e90ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/agent_bridge/queries.rs: host/src/agent_bridge/queries.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in future_host::agent_bridge::queries::read_events_since at line 45. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/agent_bridge/queries.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/queries.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"08365f127721c7ccc14296f98885517e4eb5b383cc96b969b82e673b58f66918"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/models/mod.rs: agent/src/models/mod.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in future_agent::models::enrich_user_models at line 892. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/models/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":"agent/src/models/mod.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"921e6d8badac86fce509b4251606759bbfe8e66f4eec416877226519c17c2801"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/llm/adapters/openai_responses.rs: agent/src/llm/adapters/openai_responses.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in OpenAiResponsesAdapter::decode_frame at line 144. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/llm/adapters/openai_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":"agent/src/llm/adapters/openai_responses.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b27e2262e3bdbccee0d75e12969b01cc4e829b07585213c783e9d8748ab815"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/components/input.rs: tui/src/components/input.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in Input::handle_key at line 522. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/components/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":"tui/src/components/input.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"700be242747248ff0e20aca50ed5213c3bbd6c6851fb751bb5d4a3e58eb07b12"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/workbench/picker.rs: tui/src/workbench/picker.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in future_tui::workbench::picker::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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/workbench/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":"tui/src/workbench/picker.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acfb837a367b653f946db6a6f18d2abba9382283d609274d43bc1a1b6ff6d57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/screens/PairingScreen.tsx: mobile/src/screens/PairingScreen.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in PairingScreen.PairingScreen 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/screens/PairingScreen.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":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e52cbfd9e6d39a376e239dc94a78c4d7adfc90bd7f2f4a96495cdd1fbd62a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/agent_bridge/prompt.rs: host/src/agent_bridge/prompt.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in future_host::agent_bridge::prompt::agent_prompt_inner at line 230. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/agent_bridge/prompt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/prompt.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"e255a6b19f1f8e70967f5fd773e0a8addb089d2a0532ec630df85a079f6f2029"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/screens/DesktopsScreen.tsx: mobile/src/screens/DesktopsScreen.tsx changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in DesktopsScreen.DesktopsScreen 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/screens/DesktopsScreen.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":"mobile/src/screens/DesktopsScreen.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eae1d10dc5ecf667f71ac77685a012d2235458f7335c51e2588c75d7b61bcdb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/RemoteFilesPanel.tsx: desktop/src/features/remote-peer/RemoteFilesPanel.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in RemoteFilesPanel.RemoteFilesPanel at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/RemoteFilesPanel.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":"desktop/src/features/remote-peer/RemoteFilesPanel.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab97b1350e0df4bae3aac8e524b6bf462ff88fc9db7f86051e0d025655f4e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/cli.mjs: harness/cli.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in cli.main at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- harness/cli.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":"harness/cli.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b4ed0e59cb9b4ce1ff57b089791dcb918221ecd893855174b08a9527c32fe9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/llm/adapters/openai_chat.rs: agent/src/llm/adapters/openai_chat.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in OpenAiChatAdapter::decode_frame 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/llm/adapters/openai_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":"agent/src/llm/adapters/openai_chat.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5ef3e351a20bd5f04b7650b1a7fecc9da163d97c1d4fe79c81a1fbe8c82a96"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-client/src/runtime.rs: packages/remote-client/src/runtime.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Client::spawn_event_stream_capped at line 2520. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-client/src/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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":2520}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1e5f145a89d8a3f7920cd82b7ff70f0aea56e7850a63a47f4b6bbb416322ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/journal_reclaim.rs: agent/src/session/journal_reclaim.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in SqliteStore::reclaim_settled_journals 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/journal_reclaim.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/journal_reclaim.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"57215020d8927e083ef1be929d2703afaa228fc854bf2b5113d48c64b6e0e219"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/tools/mod.rs: agent/src/tools/mod.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in future_agent::tools::is_protected_rm_target 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/tools/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":"agent/src/tools/mod.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c30094c332b92a2380f527949abf86fa47b38f18df286e9b8e4922ad4db5e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/docs/check-docs.py: scripts/docs/check-docs.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in check-docs.main at line 418. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- scripts/docs/check-docs.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/docs/check-docs.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"914a7dba18540e8840fb77797475bd1885527bd582fc6852aeb5cfa13b673588"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/screens/sessionTree.ts: mobile/src/screens/sessionTree.ts changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in sessionTree.catalogRows at line 603. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/screens/sessionTree.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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"720dd1a4f321f420bbf2b6bd6e5a41693300b3d09450982bdef25f86f95ca719"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/terminal/TerminalPanel.tsx: desktop/src/features/terminal/TerminalPanel.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in TerminalPanel.TerminalPanelShell at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/terminal/TerminalPanel.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":"desktop/src/features/terminal/TerminalPanel.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3ac10639bb38f40499b8475c105813cc3964635dd5848e738d156f19ba5f1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/settings/CustomProviderPage.tsx: mobile/src/features/settings/CustomProviderPage.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in CustomProviderPage.CustomProviderPage at line 152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/settings/CustomProviderPage.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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"703e0dcdcdc855ea7fadcb53e5e2c17937becf64b60ee66fd6ab1dedebcd9b89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/config/providers.rs: agent/src/config/providers.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in future_agent::config::providers::validate_provider_upsert 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/config/providers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/config/providers.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8835ff49f8c412dfecd4d4341e22b037f19fd1b114dc395835a94f4395db4282"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/settings/GeneralPage.tsx: desktop/src/features/settings/GeneralPage.tsx changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in GeneralPage.GeneralPage 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/settings/GeneralPage.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":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6e7bc33ccceeffb2ca0a6df846c5c9198208b4c863f9f721ab40955e284392"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/workbench/panels.rs: tui/src/workbench/panels.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in future_tui::workbench::panels::render_with 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/workbench/panels.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/panels.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c782637a9532f6e43f8efea4740131510a1fc4571fd31244d6d49ba8bd58756d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/agent_host.rs: host/src/agent_host.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in AgentHost::start_agent 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/agent_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":"host/src/agent_host.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"049bf6f60d4e69ca639b8b08daff7defd51111fb6f5e81df00f3c0aa40b211de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/fork.rs: agent/src/session/fork.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in future_agent::session::fork::build_fork_session_with_mapping at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/fork.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/fork.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"403769ea75ff85a2ec19c9cec09f6da612fcb4eaa174b02b39594aaa005a1883"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/history/paging.rs: agent/src/session/history/paging.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in future_agent::session::history::paging::materialize_display_page at line 369. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/history/paging.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/history/paging.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcff6308097529197ccf597155725344254bfbe146cce11293a507a79efeb109"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/composer/ComposerToolbar.tsx: mobile/src/features/chat/composer/ComposerToolbar.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in ComposerToolbar.ComposerToolbar at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/composer/ComposerToolbar.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":"mobile/src/features/chat/composer/ComposerToolbar.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcf2980ad386bb034f57564194b2fda6401edbd8750efd4b16bf68eb4acf95a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/filepreview/ImagePreview.tsx: desktop/src/features/filepreview/ImagePreview.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in ImagePreview.ImagePreview at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/filepreview/ImagePreview.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":"desktop/src/features/filepreview/ImagePreview.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ea30ade7c23f16ec96f892ab5412d3ccba64037b25fcb4b2320e76f919032d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src-tauri/src/terminal/server.rs: desktop/src-tauri/src/terminal/server.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in TerminalServer::pump at line 445. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src-tauri/src/terminal/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":"desktop/src-tauri/src/terminal/server.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc38ff2e93f85e37be182524fc741e4ca884fc1a45a4dbb08a34ed08728666cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/remote_host/business/prompt.rs: host/src/remote_host/business/prompt.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in future_host::remote_host::business::prompt::execute 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/remote_host/business/prompt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote_host/business/prompt.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fb26792b5768751903cd88cc4ef7fac559a11c2b88c1b2aad11b1e6f11ee0a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/rpc/approval.rs: agent/src/rpc/approval.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ApprovalGate::request at line 119. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/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":"agent/src/rpc/approval.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ec0b4050ec40ec1ec53def0890217521bc98b1ea855e3bb85a7e4a3fdbf12f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/useThreadMessages.ts: desktop/src/features/agent/useThreadMessages.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in useThreadMessages.useThreadMessages 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/useThreadMessages.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":"desktop/src/features/agent/useThreadMessages.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"60acf0a4d06169a041e1c0553a0ee9ca4ff178956abc0dc5cf63bb7df205276f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/hooks/useThreadStore.ts: desktop/src/components/layout/hooks/useThreadStore.ts changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in useThreadStore.useThreadStore.refreshStore at line 646. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/hooks/useThreadStore.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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc798c21946ecbe793127e6775bfdcf555f8735c2321b5a018a48872174ed04e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/filetree/FileTreePanel.tsx: desktop/src/features/filetree/FileTreePanel.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in FileTreePanel.FileTreePanel at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/filetree/FileTreePanel.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":"desktop/src/features/filetree/FileTreePanel.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"135ef1967907ca979f7b05e560e2f4ceacdaa48778c44dc7dda55190050971c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/llm/schema.rs: agent/src/llm/schema.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in future_agent::llm::schema::parse_chat_config at line 1105. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/llm/schema.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/llm/schema.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7eeb9480bf613722d4865cc5d9ab43821016630e2e6ee4d8248f3885bea53c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/remote/useDesktopRuntime.ts: mobile/src/remote/useDesktopRuntime.ts changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in useDesktopRuntime.useDesktopRuntime at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/useDesktopRuntime.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":"mobile/src/remote/useDesktopRuntime.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a27dade4eaad7a6263d12877729f2a480cf14a73b348f65173dc6d8c4fa589d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: channels/src/feishu/bridge.rs: channels/src/feishu/bridge.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Bridge::handle_slash_command at line 525. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- channels/src/feishu/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":"channels/src/feishu/bridge.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb1f0b842572def71cb82f73263c7c2ac1939f85e1072d48a8438842374bf45"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-server/src/supervisor/start.rs: packages/remote-server/src/supervisor/start.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Supervisor::start_generation 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-server/src/supervisor/start.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/supervisor/start.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"611ba1aac1044f0bd6f0dbea9226bf9dee3bc6aca380c963187ff8d92e21f073"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/journal_compaction.rs: agent/src/session/journal_compaction.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in SqliteStore::compact_run_cancellable at line 566. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/journal_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":"agent/src/session/journal_compaction.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4021a05397c213e282cfca6587b95df8ecd8f430fca54cee4f29bba2948123"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/lib/analyze.mjs: harness/lib/analyze.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in analyze.analyzeRun at line 850. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- harness/lib/analyze.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":"harness/lib/analyze.mjs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"a850cf9b182918e847f2051435e3b46b254425c470446f79c007d9f60afcda48"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/workbench/launchpad.rs: tui/src/workbench/launchpad.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in future_tui::workbench::launchpad::render 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/workbench/launchpad.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/launchpad.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4510c457e2b161e954a3924bd6e54b925ef3068d8b8044227eac2dfa23ed99ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/rpc/broadcaster/mod.rs: agent/src/rpc/broadcaster/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in SseBroadcaster::broadcast_stamped at line 314. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/broadcaster/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":"agent/src/rpc/broadcaster/mod.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1634db789133ff14b7211ca4b913ff631956ef1df6257141116a8fc18310838"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/artifacts/ArtifactDetailPanel.tsx: desktop/src/features/artifacts/ArtifactDetailPanel.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in ArtifactDetailPanel.ArtifactDetailPanel at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/artifacts/ArtifactDetailPanel.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":"desktop/src/features/artifacts/ArtifactDetailPanel.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"89577aba4a83b45914b1b61596a50fd67032146aa20fdeb74068b85c63ed37f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/rpc/broadcaster/journal_writer.rs: agent/src/rpc/broadcaster/journal_writer.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in future_agent::rpc::broadcaster::journal_writer::flush_event_batch at line 632. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/broadcaster/journal_writer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/broadcaster/journal_writer.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a0965c784c2246fc0d4ee529c23faaa2bc1871e003d83522e41679b93e1179"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/ThreadListItem.tsx: desktop/src/components/layout/ThreadListItem.tsx changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ThreadListItem.ThreadListItemImpl 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/ThreadListItem.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":"desktop/src/components/layout/ThreadListItem.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a2354c8ad5151dbdf260f827a752bc9f0e90ec1a2fc0746f482df64b4fe99e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote/remoteClient.ts: desktop/src/features/remote/remoteClient.ts changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in remoteClient.remoteConnectionPresentation at line 281. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote/remoteClient.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":"desktop/src/features/remote/remoteClient.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39c0a587cf227f0f145a1d34ae642a5e150b299d20cf96fb6770670eedc0016"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/DeviceSelector.tsx: desktop/src/components/layout/DeviceSelector.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DeviceSelector.DeviceSelector at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/DeviceSelector.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":"desktop/src/components/layout/DeviceSelector.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d951f4caa2cc932aee9590ba694e2f3bb8ea36eb78a3323541fcb9430c9ac79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/markdown/MarkdownContent.tsx: desktop/src/features/markdown/MarkdownContent.tsx changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in MarkdownContent.renderBlock at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/markdown/MarkdownContent.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":"desktop/src/features/markdown/MarkdownContent.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"82590446da745cf1ee821f06054f0f05ae5081d5fd68c6b8767509f253112b8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/settings/SkillsSettingsPage.tsx: mobile/src/features/settings/SkillsSettingsPage.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in SkillsSettingsPage.SkillsSettingsPage at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/settings/SkillsSettingsPage.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":"mobile/src/features/settings/SkillsSettingsPage.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7df497ea90a6087ebe824b40af860eb1609c5f061542f3f8a176d599df08f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-server/src/supervisor/transport.rs: packages/remote-server/src/supervisor/transport.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in Supervisor::spawn_credential_refresh at line 147. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-server/src/supervisor/transport.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/supervisor/transport.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f8a5bea913d3c4263f7978c67596b32a7f87c7769d43104c05b5f474001f1a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/lib/cli-driver.mjs: harness/lib/cli-driver.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in cli-driver.runCliCase at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- harness/lib/cli-driver.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":"harness/lib/cli-driver.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddbdec12c4d989a91e6fde9beacd739783a003c570804e50b917c86331a9b5b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/tui/driver.py: harness/tui/driver.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in driver.main at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- harness/tui/driver.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":"harness/tui/driver.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a319cd31dad20747ca104865c9d2bda16b95372600b3dfa652c229d6736e1b77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/content/reader.rs: agent/src/session/content/reader.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Snapshot::page_impl 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/content/reader.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/reader.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed8a1e43e0fc68bff9ebd01908a0604d8209f37de250e905f5979532ca54be8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/commands/browser_tools.rs: cli/src/commands/browser_tools.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in future_cli::commands::browser_tools::browser_start at line 257. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/src/commands/browser_tools.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/browser_tools.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"7984f8a81d10a6aeeec4605c9ab1b2c5397fc6ab090b8494f501df3d8343b8c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/share/ShareIntakeMenu.tsx: mobile/src/share/ShareIntakeMenu.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in ShareIntakeMenu.ShareIntakeMenu 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/share/ShareIntakeMenu.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":"mobile/src/share/ShareIntakeMenu.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1e1c16c98aaa1bbeda05b5e3f17dc29db1429ace6444501d7c187e3f94ed43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: orchestration/goal/src/compat.rs: orchestration/goal/src/compat.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in future_goal::compat::todo_line at line 533. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- orchestration/goal/src/compat.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"orchestration/goal/src/compat.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfec0dd349683335384665a1bc21756626706c331078b8ea6a5126d58b27e2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/ThinkingBlock.tsx: desktop/src/features/agent/ThinkingBlock.tsx changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ThinkingBlock.ThinkingBlock at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/ThinkingBlock.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":"desktop/src/features/agent/ThinkingBlock.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"627ea0ec3dea845eb008ea16301848fe2a89a2401a7c4e56a3e799da8f372d1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/agent_providers/validate.rs: host/src/agent_providers/validate.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in future_host::agent_providers::validate::validate_custom_provider at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/agent_providers/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":"host/src/agent_providers/validate.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b31cca7b69d20d51aed57ba12c5c6ad44dc3f7515dfac873fcf76d95c09c53d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/entry_records.rs: agent/src/session/entry_records.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in future_agent::session::entry_records::insert_entry_record at line 118. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/entry_records.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/entry_records.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d96f6097f1f9d9a30c1fddc1b849ae69cff3ba25a1b73cb09e8c1ed204b66e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-server/src/supervisor/publisher.rs: packages/remote-server/src/supervisor/publisher.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Supervisor::catalog_loop at line 363. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-server/src/supervisor/publisher.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/supervisor/publisher.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c8400ae073288e5c8cd1043609782ea8a91709114ea934fd6dc3ef4af25177"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/components/SendQueuePanel.tsx: mobile/src/features/chat/components/SendQueuePanel.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in SendQueuePanel.SendQueuePanel at line 99. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/components/SendQueuePanel.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":"mobile/src/features/chat/components/SendQueuePanel.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b3e622970f95eeabaaadb00a175157ad9922ffec49c257e11fdb7f3ca9bb24"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/useRemoteConversationSettings.ts: desktop/src/features/remote-peer/useRemoteConversationSettings.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in useRemoteConversationSettings.useRemoteConversationSettings 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/useRemoteConversationSettings.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":"desktop/src/features/remote-peer/useRemoteConversationSettings.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6d6dcdc6699aa6880ad0ed0c33695555151803e15643085059fa63d8ca83a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/components/RenameModal.tsx: mobile/src/features/chat/components/RenameModal.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in RenameModal.RenameModal 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/components/RenameModal.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":"mobile/src/features/chat/components/RenameModal.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe358e6648e299d5809eebc6663904330724897b9eedc2353c43804c7b07ffe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/SendQueuePanel.tsx: desktop/src/features/agent/SendQueuePanel.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in SendQueuePanel.SendQueuePanel at line 111. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/SendQueuePanel.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":"desktop/src/features/agent/SendQueuePanel.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46127c3d3e4ed13d0cebae17d40d8722379571fec43c68f52934b338c3bf006"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/database/connection.rs: agent/src/session/database/connection.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in future_agent::session::database::connection::initialize_connection at line 62. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/database/connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/database/connection.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"656d3f64482f770010aeb2cea032e7f19138e74ffa3fb64222d475da9f4e6c2a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/settings.rs: tui/src/settings.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in TuiSettings::to_json 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/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":"tui/src/settings.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d859a4c368c20eebd8a3b038e8c7d25e4963b56f71e7ddbfcebc24d42f9a9ede"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/settings/ProvidersPage.tsx: desktop/src/features/settings/ProvidersPage.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in ProvidersPage.ProvidersPage at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/settings/ProvidersPage.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":"desktop/src/features/settings/ProvidersPage.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46288682264db4ae58a97c4521dc218cbe8990321c31d290a81d9d03f1150da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/skills/manager.rs: agent/src/skills/manager.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SkillManager::install_locked at line 504. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/skills/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":"agent/src/skills/manager.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"a151378b68fe70afb9f4360344cc4105921fe21bae3b0b5d0ec6bc9cf1febac9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/tasks.rs: host/src/tasks.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in future_host::tasks::execute 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/tasks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/tasks.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7294e9d0a4cd8f169914394515b02d31883fcf905ca864d08c066381e67531f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/remote/storage.ts: mobile/src/remote/storage.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in storage.readRegistry at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/storage.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":"mobile/src/remote/storage.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9baa95a5b900a5ee35e99157f7668eb01194399906a91d7aad4d238e3df5202"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/fusion.rs: host/src/fusion.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in future_host::fusion::execute 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/fusion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/fusion.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e736a6c45733b5229cb581ad3ab5137fc064b3714a0e80bfcb63a242088272"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/useMessagePaging.ts: desktop/src/features/agent/useMessagePaging.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in useMessagePaging.useMessagePaging at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/useMessagePaging.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":"desktop/src/features/agent/useMessagePaging.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8509f1ce555032ca0b9589158fc81613d59e85a99cae1b9a30e7692973a3aee2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/AgentStatusGate.tsx: desktop/src/components/layout/AgentStatusGate.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in AgentStatusGate.AgentStatusGate 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/AgentStatusGate.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":"desktop/src/components/layout/AgentStatusGate.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74983d59757a4f43b42d79f31fd49f3e692c2c17c19354f39af624974155ff0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/content/recovery.rs: agent/src/session/content/recovery.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in SqliteStore::recover_segmented_run 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/content/recovery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/recovery.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7040f34a599f5845e219832e98715fe065f8ac789928a8530ac90cd9edcdd5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/NewConversation.tsx: desktop/src/features/agent/NewConversation.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in NewConversation.NewConversation 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/NewConversation.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":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e3bcbf1fe73a2c139ba5d7a23d63b32e0cf055f42538278c1e5e16b0167637"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/runs/RunsPanel.tsx: desktop/src/features/runs/RunsPanel.tsx changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in RunsPanel.ToolRow 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/runs/RunsPanel.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":"desktop/src/features/runs/RunsPanel.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"648823ee2b983f557b0a830ae103b1f92b35225e6efc1791bb87a0acab217398"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/messages/ToolRow.tsx: mobile/src/features/chat/messages/ToolRow.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in ToolRow.StandardToolRow at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/messages/ToolRow.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":"mobile/src/features/chat/messages/ToolRow.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"084e6ce0acedc1d52a56b385f1a4a68b70309b95c9b936f475471fe8930f1703"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/components/SessionFilesPanel.tsx: mobile/src/features/chat/components/SessionFilesPanel.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in SessionFilesPanel.SessionFilesPanel 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/components/SessionFilesPanel.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":"mobile/src/features/chat/components/SessionFilesPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f5d527bfd998b4995124fc04faae4d56b836ee12ae83b2f8405dd27a9f6276"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/integrations/agent/agentStateCache.ts: desktop/src/integrations/agent/agentStateCache.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in agentStateCache.installAgentEventListener at line 326. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/integrations/agent/agentStateCache.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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9367fe694ea70b94429b98150892fd5b9ddcfedd3c8ebd4edc674bafcce552d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: harness/lib/report.mjs: harness/lib/report.mjs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in report.writeReport at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- harness/lib/report.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":"harness/lib/report.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48c673b2abeaf36eae611fbf4f7eb5b584c29570c8b662016b1ed04493d0bc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/thread-projection/src/format.ts: packages/thread-projection/src/format.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in format.classifyAgentError 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/thread-projection/src/format.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":"packages/thread-projection/src/format.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2599bb5fea93e07f07f733c654d3bb07eff1f6462bbf10dec2b84dc2dd001fc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/components/ChatTimeline.tsx: mobile/src/features/chat/components/ChatTimeline.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ChatTimeline.ChatTimeline at line 42. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/components/ChatTimeline.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":"mobile/src/features/chat/components/ChatTimeline.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc8827f0562b00fe9bf208d00a8aa33a68994fdcb78d209936e5aadb0916634"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/application/threads.rs: host/src/application/threads.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in future_host::application::threads::read_thread_history 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/application/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":"host/src/application/threads.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a80d9c41e4b6ab4c51b71e03e1e64af318d37d984987e8b98d737d5b106267"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/projection.rs: agent/src/session/projection.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in future_agent::session::projection::entries_to_agent_messages 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/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":"agent/src/session/projection.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d71d05ace144c78dc03f03497e744ec6d31de65b937505bb0bd3eaa398ce4c4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/useSkillRecommendation.ts: desktop/src/features/agent/useSkillRecommendation.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in useSkillRecommendation.useSkillRecommendation.evaluate at line 284. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/useSkillRecommendation.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":"desktop/src/features/agent/useSkillRecommendation.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdb01eef66e5d5821b02fe40304eab9f1b75c84d3dab255f0ff1fe3b8a56886"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/components/markdown.rs: tui/src/components/markdown.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in MarkdownRenderer::render_block at line 1340. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/components/markdown.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/components/markdown.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d70e42bed554e81d0592c78896d27421dae338e0cdba1e55c951c140b56f74f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: channels/src/dingtalk/bridge.rs: channels/src/dingtalk/bridge.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in DingtalkBridge::handle_slash_command 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- channels/src/dingtalk/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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"512e00a06574cee11321d3037ea5b097490ae9111ed927fb88d0b900aceb54a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/service/startup.rs: agent/src/service/startup.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in future_agent::service::startup::initialize 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/service/startup.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/service/startup.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"20997330dbbf834f04513fc50a42b4e54e53745f4ad4f67734a42d5919af9ab6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/composer/useComposerSubmission.ts: mobile/src/features/chat/composer/useComposerSubmission.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in useComposerSubmission.useComposerSubmission at line 37. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/composer/useComposerSubmission.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":"mobile/src/features/chat/composer/useComposerSubmission.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"df874ef4621ab764e7a198aa3139886c159c5e04ed4bdb09caee9058f47471d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/service/shutdown.rs: agent/src/service/shutdown.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in AgentHandle::drain at line 242. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/service/shutdown.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/service/shutdown.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfad6f95af8254b46b4baf6a8e701090c83ca67367c85e70596f375070fdc8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/runtime/liveRunProjection.ts: desktop/src/features/agent/runtime/liveRunProjection.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in liveRunProjection.projectRunForLivePreview at line 255. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/runtime/liveRunProjection.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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6dd1fc8b499ad428c0738d45ca05957fef3991ab9969537d1af0d924751625"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/measure/measure-lean-history.py: scripts/measure/measure-lean-history.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in measure-lean-history.main at line 160. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- scripts/measure/measure-lean-history.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/measure/measure-lean-history.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"669a2d94185e6a8d2a5fd8350625ce32f3820c90692aaf61353c7399015d3880"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/messages/FusionToolRow.tsx: mobile/src/features/chat/messages/FusionToolRow.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in FusionToolRow.FusionToolRow 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/messages/FusionToolRow.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":"mobile/src/features/chat/messages/FusionToolRow.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd10083a8a99dabdd97d7d0167347842d710c36c3466901ec52fd60c7691c983"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/history/display_projection.rs: agent/src/session/history/display_projection.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in future_agent::session::history::display_projection::project_entries at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/history/display_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":"agent/src/session/history/display_projection.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"4084447372d59f7084104e40e708d248ada60aae1bf740a92b6c2ed7b9edff02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/settings/AccountPage.tsx: desktop/src/features/settings/AccountPage.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in AccountPage.AccountPage at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/settings/AccountPage.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":"desktop/src/features/settings/AccountPage.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a34252bff9fbbf567001ab42c13c7b8a6b81fc14a3d01bb9662000fcb567d9a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/hooks/useAgentStatus.ts: desktop/src/components/layout/hooks/useAgentStatus.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in useAgentStatus.useAgentStatus 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/hooks/useAgentStatus.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":"desktop/src/components/layout/hooks/useAgentStatus.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb22e7b64b6efc68aba9727f3489376126f1706d0b980c9b4a95bc43bc18c3bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/commands/mcp_servers.rs: cli/src/commands/mcp_servers.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in future_cli::commands::mcp_servers::mcp_status at line 232. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/src/commands/mcp_servers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/mcp_servers.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"748db3d10275b2e617d397231ba7a74d735adf56cf0eed29b3c13055a56036c7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/useComposerDraft.ts: mobile/src/features/chat/useComposerDraft.ts changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in useComposerDraft.useComposerDraft at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/useComposerDraft.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":"mobile/src/features/chat/useComposerDraft.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8065ebe2c4ceddd803ec38ebbba60dc5c3512ad2c42db7030eda69401fe542b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/settings/ModelsSettingsPage.tsx: mobile/src/features/settings/ModelsSettingsPage.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ModelsSettingsPage.ModelsSettingsPage 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/settings/ModelsSettingsPage.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":"mobile/src/features/settings/ModelsSettingsPage.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca43e3492ef3092b6e9e8dd2313fe76bcec06ff3e50d3bab85ac1dc9fbaf3eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/AgentActivityList.tsx: desktop/src/features/agent/AgentActivityList.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in AgentActivityList.labelForActivity at line 357. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/AgentActivityList.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":"desktop/src/features/agent/AgentActivityList.tsx"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f743186c95f17581974b30530e9cd3dd23c00f5d09011f4fd6ab68db638ac05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/runs/RunInspectPanel.tsx: desktop/src/features/runs/RunInspectPanel.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in RunInspectPanel.ToolCallDetail at line 332. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/runs/RunInspectPanel.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":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e00fc1972c4e6362783c62315c5f7c7e9caff0e1faeb1f37539f927b6b44079"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: orchestration/goal/src/decision/mod.rs: orchestration/goal/src/decision/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in future_goal::decision::packet at line 482. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- orchestration/goal/src/decision/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":"orchestration/goal/src/decision/mod.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fba378e5f749e501c857782b7c497cde0f7af26c37972dd6e5a7a917ad313e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/history/loadThreadHistory.ts: desktop/src/features/agent/history/loadThreadHistory.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in loadThreadHistory.loadThreadHistory at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/history/loadThreadHistory.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":"desktop/src/features/agent/history/loadThreadHistory.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3304707d078ace02167e250e960edab0a970e062c81e36c60fc040c2b8804ad8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/OnboardingGate.tsx: desktop/src/components/layout/OnboardingGate.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in OnboardingGate.OnboardingGate 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/OnboardingGate.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":"desktop/src/components/layout/OnboardingGate.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2747e8b49542904da33ffc779124c0e48683dc9dc8bc39d7ae54dcd149cbf66"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/FusionActivity.tsx: desktop/src/features/agent/FusionActivity.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in FusionActivity.FusionActivity at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/FusionActivity.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":"desktop/src/features/agent/FusionActivity.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"867d3feb5f024f44dc534152398fe2c146b224598a9c507353081ac22b4ba48c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/useRunReattach.ts: desktop/src/features/agent/useRunReattach.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in useRunReattach.useRunReattach at line 39. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/useRunReattach.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":"desktop/src/features/agent/useRunReattach.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc6e226457441138fd0728f428b1409101b62a7d5b51bc01005a9baac96d930"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: orchestration/goal/src/agents/supervision.rs: orchestration/goal/src/agents/supervision.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in future_goal::agents::supervision::flush 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- orchestration/goal/src/agents/supervision.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"orchestration/goal/src/agents/supervision.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b15f6be5a172572469a391133f0ad29f9fa16b9bd25c789c088530a4737c2fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/review/ReviewPanel.tsx: desktop/src/features/review/ReviewPanel.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in ReviewPanel.ReviewPanel at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/review/ReviewPanel.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":"desktop/src/features/review/ReviewPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b039349d8ebb25ef5d6587f510a583fa96b30601ecfded1a211b235c7018414c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/components/ActionMenu.tsx: mobile/src/components/ActionMenu.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in ActionMenu.ActionMenu at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/components/ActionMenu.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":"mobile/src/components/ActionMenu.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"90578fbc842f14d12f4da0ee8918039d67fae6baf257a02e0c65f234ac7a929f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/share/useShareIntake.ts: mobile/src/share/useShareIntake.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in useShareIntake.useShareIntake.chooseDestination 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/share/useShareIntake.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":"mobile/src/share/useShareIntake.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6b10d2ff8c9e653cb43bd6fc8f993e4367123d64e867e0bbff09f62ece5556"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/workbench/git_panel.rs: tui/src/workbench/git_panel.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in future_tui::workbench::git_panel::draw at line 312. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/workbench/git_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":"tui/src/workbench/git_panel.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a21c34a94f4522a081ee3a6c2364b102aec39661bd0cf88fe7524b850df17b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/components/MarkdownImage.tsx: mobile/src/components/MarkdownImage.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in MarkdownImage.LocalImage 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/components/MarkdownImage.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":"mobile/src/components/MarkdownImage.tsx"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ee576ce18cddd4cef74e59a24bc22b15ad4fb45e882603596f17c2428c4351"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/remote/draftStorage.ts: mobile/src/remote/draftStorage.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in draftStorage.loadSessionDraftDirect at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/draftStorage.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":"mobile/src/remote/draftStorage.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fc48d48dcf657758455b4f07a79ac3523a876c0957c476619a90b9ea772fcd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/components/SkillPicker.tsx: mobile/src/features/chat/components/SkillPicker.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SkillPicker.SkillPicker at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/components/SkillPicker.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":"mobile/src/features/chat/components/SkillPicker.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"32575a0fc43ef06592537f83a95403c5b7d22594a7e75b5a05b49579c04881fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: host/src/agent_bridge/delete_outbox.rs: host/src/agent_bridge/delete_outbox.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in future_host::agent_bridge::delete_outbox::reconcile_delete_outbox at line 5. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/agent_bridge/delete_outbox.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/agent_bridge/delete_outbox.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c48974ac05eaf02d4daed8d88e3737bf29c24ee693eecd0a5e45d95b349cb55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/rpc/src/history.rs: packages/rpc/src/history.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in future_rpc::history::read_page_with at line 247. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/rpc/src/history.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rpc/src/history.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b5803e4f8e9edd070a4249b790ab04f14d6086968f14b75850d4f3c26ae570"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/commands/session_journal.rs: cli/src/commands/session_journal.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in future_cli::commands::session_journal::run at line 290. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/src/commands/session_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":"cli/src/commands/session_journal.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"73472a38abaec2a80996bfe4679c3c66167201acef16ca64bbbaf72e2941286e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/messages/ThinkingRow.tsx: mobile/src/features/chat/messages/ThinkingRow.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in ThinkingRow.ThinkingRow at line 43. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/messages/ThinkingRow.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":"mobile/src/features/chat/messages/ThinkingRow.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfa2512585c1d974881f0a5c63301cdfbadc3b60aacbc13c791fd45a2af6811"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/repair.rs: agent/src/session/repair.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in future_agent::session::repair::repair_dangling_tool_calls 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/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":"agent/src/session/repair.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d362b5b1d1762bec864026121d49aa67c9d3329f5bfd9b1f571393595e08c43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/markdown/useStreamingMarkdownBlocks.ts: desktop/src/features/markdown/useStreamingMarkdownBlocks.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in useStreamingMarkdownBlocks.useStreamingMarkdownBlocks 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/markdown/useStreamingMarkdownBlocks.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":"desktop/src/features/markdown/useStreamingMarkdownBlocks.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2248ab7053c4e8dab4df1461d5b09dfa20f004c8601df0df5dc60cc5d48570a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/screenshots/tui_capture.py: scripts/screenshots/tui_capture.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in tui_capture.run 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- scripts/screenshots/tui_capture.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/screenshots/tui_capture.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc53099b7b03a778bba35f05adb55352639145dd58cda4def32b9fc6641c059"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/thread-projection/src/approval.ts: packages/thread-projection/src/approval.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in approval.parseAction at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/thread-projection/src/approval.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":"packages/thread-projection/src/approval.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"6557b4acb6eaca55d1af7722524c71b804396b8016d2c6d14929bf28d2528404"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/AppShellDialogs.tsx: desktop/src/components/layout/AppShellDialogs.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in AppShellDialogs.AppShellDialogs 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/AppShellDialogs.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":"desktop/src/components/layout/AppShellDialogs.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb964b4f1bda7c38cc64e2612163667633bea143e15a7236fcceac0ce01838ac"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/commands/session_status.rs: cli/src/commands/session_status.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in future_cli::commands::session_status::format_status at line 156. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/src/commands/session_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":"cli/src/commands/session_status.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9967b073896749fb5b0c6625fb9cdef0c5b933f004c79918556572928d5daf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/messages/PendingApprovalCard.tsx: mobile/src/features/chat/messages/PendingApprovalCard.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in PendingApprovalCard.PendingApprovalCard at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/messages/PendingApprovalCard.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":"mobile/src/features/chat/messages/PendingApprovalCard.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a99aee35b44c14629869d8b5489ec7fe0576c234ea1c6326fdc724e5a975b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ci/check-headless-artifact.py: scripts/ci/check-headless-artifact.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in check-headless-artifact.main at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- scripts/ci/check-headless-artifact.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/ci/check-headless-artifact.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dee01d52a36a879b1e5d1f681a688e18fa6a4f88e5a1a3b7e24793a397a82a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/measure/verify-e2e-bytes.py: scripts/measure/verify-e2e-bytes.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in verify-e2e-bytes.main at line 272. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- scripts/measure/verify-e2e-bytes.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/measure/verify-e2e-bytes.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9262a9e6709bc7947455c35a5657126833bf1a67fa4835e00c101d15849a2745"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/components/GitGraphPanel.tsx: mobile/src/features/chat/components/GitGraphPanel.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in GitGraphPanel.GitGraphPanel at line 71. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/components/GitGraphPanel.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":"mobile/src/features/chat/components/GitGraphPanel.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"018c3ed65b874b450ac589bd146df840a5ab1db2ed045c01dc5550a485fcf48a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/fusion/FusionStepBody.tsx: desktop/src/features/fusion/FusionStepBody.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in FusionStepBody.StepResponse at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/fusion/FusionStepBody.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":"desktop/src/features/fusion/FusionStepBody.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc31c7fce337e0bc184aabc8ece52a4bc07c844338a403d7b6314486b25232b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/RailViewSwitch.tsx: desktop/src/components/layout/RailViewSwitch.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in RailViewSwitch.RailViewSwitch at line 41. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/RailViewSwitch.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":"desktop/src/components/layout/RailViewSwitch.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb382f5c2acbc84f87b71fc00e90e0e3e6cb0386eea2f725cf7f3ebf70ca8229"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/useSkillRecommendation.ts: mobile/src/features/chat/useSkillRecommendation.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in useSkillRecommendation.useSkillRecommendation at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/useSkillRecommendation.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":"mobile/src/features/chat/useSkillRecommendation.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"477c1a4ea395a283bfc4b1ec94163240dc882b4501f67d3045841e54ff4a9802"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tui/src/session_rows.rs: tui/src/session_rows.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in future_tui::session_rows::rows_to_messages 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- tui/src/session_rows.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/session_rows.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"b080d6aff32f103643e0172c0934c7bc67984e90ba4a4a5501224c738e185119"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-client/src/readPages.ts: packages/remote-client/src/readPages.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in readPages.requestReadPage 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-client/src/readPages.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":"packages/remote-client/src/readPages.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"64053f74b9fdb6b82dcb18c3c2de04ae98c2614bb9be1b994671e5250d404ad6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-client/src/connectionState.ts: packages/remote-client/src/connectionState.ts changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in connectionState.classifyError at line 100. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-client/src/connectionState.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":"packages/remote-client/src/connectionState.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bad987df1464e3ff471426b4dc732c5e731baccb2f3b1abea0911616af1bda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/skills/SkillsView.tsx: desktop/src/features/skills/SkillsView.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SkillsView.AllTab at line 495. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/skills/SkillsView.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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06dc487f39303ca8fe215c809687480a37e73dc9b909b49f649e4c47334f310"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: benchmark/fusion/future_runner.py: benchmark/fusion/future_runner.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Future.run_case at line 143. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- benchmark/fusion/future_runner.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":"benchmark/fusion/future_runner.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"294dbf029047fdfac2f4919a75154e8d5f443841ae10758ba193aa3a34b466d8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/ui/SelectMenu.tsx: desktop/src/components/ui/SelectMenu.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in SelectMenu.SelectMenu at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/ui/SelectMenu.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":"desktop/src/components/ui/SelectMenu.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"394ef633e4ca95f9bf6eea37e017b2158fce67d84585ac6045f565e145e04f6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: cli/src/commands/models.rs: cli/src/commands/models.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in future_cli::commands::models::models at line 109. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- cli/src/commands/models.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/models.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce998dfc02952f069ab3305d6add7e645bf87f762379e23f6c3569e725a01c8e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/content/entries.rs: agent/src/session/content/entries.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in future_agent::session::content::entries::stage_named 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/content/entries.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/entries.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fad11442a5145ae45268779d9dd52fba0ee9c6ecd6c39a997ef00421af1ebb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/features/chat/useAttachmentPicker.tsx: mobile/src/features/chat/useAttachmentPicker.tsx changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in useAttachmentPicker.useAttachmentPicker.chooseFromAlbum at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/useAttachmentPicker.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":"mobile/src/features/chat/useAttachmentPicker.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cab165d7514926e831dad9db4b2687eb292407b1c695c1d099195b4a65977b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/shot/terminal-server.mjs: desktop/shot/terminal-server.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in terminal-server.server at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/shot/terminal-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":"desktop/shot/terminal-server.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"07fcdfff5d40455aea499b7fb9d846c4c2c72a4caba374dd917f62571eae3ca1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/rpc/commands/session_reset.rs: agent/src/rpc/commands/session_reset.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in future_agent::rpc::commands::session_reset::handle_reset_session_history at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/commands/session_reset.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/session_reset.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"266dcb864d17e6d7cd9a6314e5343bdd61b1c2c6e40acd672a3a97ee6ef50ffb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/DeviceChoiceDialog.tsx: desktop/src/features/remote-peer/DeviceChoiceDialog.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DeviceChoiceDialog.DeviceChoiceDialog at line 31. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/DeviceChoiceDialog.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":"desktop/src/features/remote-peer/DeviceChoiceDialog.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4876229fcc0e5b836734f4d8e9c9759ba0125bea49328626f7938a3f0bf3ab5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/agent/composer/mentionDom.ts: desktop/src/features/agent/composer/mentionDom.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in mentionDom.serialize 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/composer/mentionDom.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":"desktop/src/features/agent/composer/mentionDom.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a72c318a6958826c66c1070c11ebe9f3cebf7499789483f3025cd283d4988c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-server/src/health.rs: packages/remote-server/src/health.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in NatsHealth::handle_event 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-server/src/health.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/health.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"acff5a1b69ce2e6b34c9a2b9d7fca906fcc1ec8e1a18af653439a59b050661b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/remote-peer/remotePeerError.ts: desktop/src/features/remote-peer/remotePeerError.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in remotePeerError.remotePeerErrorKind at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/remotePeerError.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":"desktop/src/features/remote-peer/remotePeerError.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea30f2ab9322fc74297cd370477443323dd5c8868dd98a5a5141af7bd0e949de"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/hooks/useContextData.ts: desktop/src/components/layout/hooks/useContextData.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in useContextData.useContextData.refreshContext 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/hooks/useContextData.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":"desktop/src/components/layout/hooks/useContextData.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"9abdd80a27f761bbc4b88f308b114a6481167ae199ac073cb6ae4d8913cd1f44"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/screenshots/fixtures/fusion-progress.ts: scripts/screenshots/fixtures/fusion-progress.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in fusion-progress.fusionProgressFixture at line 4. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- scripts/screenshots/fixtures/fusion-progress.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":"scripts/screenshots/fixtures/fusion-progress.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2077d5036c8cc8e972a090bd6da58a1c4e0dc864a087e7105dc860f409e29d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: packages/remote-server/src/transfer.rs: packages/remote-server/src/transfer.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in TransferLoop::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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- packages/remote-server/src/transfer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-server/src/transfer.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e570a1799d81a85b647b8469496383276bbb9fa1e46ee560455e189e626055a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/features/settings/ModelsPage.tsx: desktop/src/features/settings/ModelsPage.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ModelsPage.ModelsPage 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/settings/ModelsPage.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":"desktop/src/features/settings/ModelsPage.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae888f061a829b1fb58c878f3cf961d8045c974f9c8bba4105e7c7fa58a992a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: desktop/src/components/layout/hooks/useHasProviders.ts: desktop/src/components/layout/hooks/useHasProviders.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in useHasProviders.useHasProviders 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/hooks/useHasProviders.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":"desktop/src/components/layout/hooks/useHasProviders.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0740f351348ba3e6c475d6966eea438ada4a2d3bb89e355ffa8ca760073a75d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/skill_reco/bench/decider-run.mjs: scripts/skill_reco/bench/decider-run.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in decider-run.run at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- scripts/skill_reco/bench/decider-run.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/skill_reco/bench/decider-run.mjs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"085ecd5980f0143f43b880877a8680e7b43960fceb8c4804c64085c5db357a67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/content/metadata.rs: agent/src/session/content/metadata.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SqliteStore::publish_segmented_metadata at line 129. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/content/metadata.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/content/metadata.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"06606aca640ccb238402d47fffedaaaeca026c1074f93284f64e35682abb151e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/compaction/semantic/evidence.rs: agent/src/compaction/semantic/evidence.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in future_agent::compaction::semantic::evidence::prepare_with_handoff_summary 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/compaction/semantic/evidence.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/compaction/semantic/evidence.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"691cc0928d4de42d5268d82a64a2d0baa03ee3ac08f9781ee19ee0659558d300"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mobile/src/remote/connectionPresentation.ts: mobile/src/remote/connectionPresentation.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in connectionPresentation.connectionPresentation at line 69. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/connectionPresentation.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":"mobile/src/remote/connectionPresentation.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e8dfdb1ab2332d3b213b4e914771c1c3b600e535f6a1a37f77a1bc791fc7b2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: agent/src/session/history/recall.rs: agent/src/session/history/recall.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Manager::read_history_entry 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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/history/recall.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/session/history/recall.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbac2dd38c1095f47ffaacd88b51698adcbe051b9282279a82c40f2baa13953"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src-tauri/src/commands/threads.rs: desktop/src-tauri/src/commands/threads.rs changed 29 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 1 (its worst body is futureos::commands::threads::close_thread_terminals at line 3), 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(desktop,mobile,host): queued-reply order, approval tier switching, and mobile list/batch defects (#1582)\u201D; \u201Cfix: prevent storage waits from freezing conversations (#1483)\u201D; \u201Ctest(tui,host,cli,desktop,mobile,shell): coverage waves 1-12; remote and agent liveness fixes (#1452)\u201D; \u201Cfix: persist sessions before use and complete missing-session deletions (#1206)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src-tauri/src/commands/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":"desktop/src-tauri/src/commands/threads.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"204bca9d27c01068ba2f69dd66baf80c332a6f209454a624d544ee654103a7fa"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/integrations/agent/agentClient.ts: desktop/src/integrations/agent/agentClient.ts changed 19 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is agentClient.resolveInitialModelId at line 329), 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(desktop,mobile,host): queued-reply order, approval tier switching, and mobile list/batch defects (#1582)\u201D; \u201Cfix(remote): one clock per decision, honest locks; CLI doctor, goal supervision, thinking levels (#1299)\u201D; \u201Cfix(desktop): keep a run the Agent queued alive instead of failing it (#1093)\u201D; \u201Cfix(thinking): default to medium everywhere, and a task\u0027s level follows its model (#942)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/integrations/agent/agentClient.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":"desktop/src/integrations/agent/agentClient.ts"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d381f9cffd70374fb949a0251a96534058e1815c820c564e9455a2583ca36d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/features/agent/useAgentThreadState.ts: desktop/src/features/agent/useAgentThreadState.ts changed 14 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is useAgentThreadState.useAgentThreadState at line 53), 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(desktop,host,mobile): queued sends stream, and the archived list counts what it draws (#1566)\u201D; \u201Cfix(desktop): an uncreated folder reads as empty; a rejected first message returns to its draft (#1568)\u201D; \u201Cfix(desktop): latch a rejected first message instead of retrying it (#1218)\u201D; \u201Cfix: persist new sessions before first prompt admission (#1204)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/useAgentThreadState.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":"desktop/src/features/agent/useAgentThreadState.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47ac74e3bca4d6f23dac9c601335b99ed12a177a0b9afe5418a40a1480d8f71"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src-tauri/src/commands/files.rs: desktop/src-tauri/src/commands/files.rs changed 17 times in last 90 days and 9 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is futureos::commands::files::open_external_url_with at line 165), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Ctest(tui,host,cli,desktop,mobile,shell): coverage waves 1-12; remote and agent liveness fixes (#1452)\u201D; \u201Cfix(desktop): attach a clipboard image pasted in the Linux WebView (#1405)\u201D; \u201Cfix(desktop): harden embedded Agent ownership and update recovery (#1108)\u201D; \u201Cfix(agent): make session forks atomic and durable (#737)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src-tauri/src/commands/files.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src-tauri/src/commands/files.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"338a24bcca8407d213c4ae1516dc03bccf7691dd392f3cf057fa5d1ae242e3e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agent/src/rpc/commands/run_control.rs: agent/src/rpc/commands/run_control.rs changed 13 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is future_agent::rpc::commands::run_control::handle_prompt at line 10), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent,host,desktop,mobile): a queued edit keeps its place; host-remote store init retries (#1604)\u201D; \u201Cfix(agent): heal from a transient journal failure; judge harness findings against the fixture (#1551)\u201D; \u201Cfix: preserve historical databases and make session recovery resumable (#1186)\u201D; \u201Cfix: preserve legacy history and recover failed sessions and forced exits (#1176)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/commands/run_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":"agent/src/rpc/commands/run_control.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca05475424cc2eaa92a11377f2d4c830d2079ca723d459e0e750e1b22907d5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agent/src/skills/mod.rs: agent/src/skills/mod.rs changed 13 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is future_agent::skills::extract_metadata_version at line 323), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent): key the skills cache on the resolved skill directories (#1605)\u201D; \u201Cfix(agent): decouple readiness from skill discovery (#820)\u201D; \u201Cfix(skills): fall back to metadata package version (#812)\u201D; \u201Cfix: remediate verified bughunt findings across agent, clients and loop (#557)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/skills/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":"agent/src/skills/mod.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"af710080099347aaf590086e02e3cc236f1c2591e35fdd0c424ab3c2ba933289"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agent/src/compaction/mod.rs: agent/src/compaction/mod.rs changed 11 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 7 (its worst body is future_agent::compaction::project_prompt_context at line 360), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent,remote): repair paged hydration and replay; bound sessions; name a build and sync stage (#1401)\u201D; \u201Cfix(agent): admit summaries by projection budget and report fallback outcomes (#718)\u201D; \u201Cfix: remediate verified bughunt findings across agent, clients and loop (#557)\u201D; \u201Cfix: harden runtime reliability and previews (#369)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/compaction/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":"agent/src/compaction/mod.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28a8bd115e254911409d46e23bd4c3dfe51d06575744e3685430c7ce1fe1d17"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agent/src/service/mod.rs: agent/src/service/mod.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 RunningAgent::serve at line 432), 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(desktop,mobile,host): queued-reply order, approval tier switching, and mobile list/batch defects (#1582)\u201D; \u201Cfix(agent): make storage upgrades resilient and isolate failed recovery (#1411)\u201D; \u201Cfix(agent): report startup progress and stop reconnecting during shutdown (#1396)\u201D; \u201Cfix: recover Agent service safely and prevent IME Enter misfire (#1313)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/service/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":"agent/src/service/mod.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"343a2967cbb6ff7858ea9d84044aa31e44189fc1bfcd3aaf14252ffc82dea8e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/features/markdown/streamingMarkdownBlocks.ts: desktop/src/features/markdown/streamingMarkdownBlocks.ts changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is streamingMarkdownBlocks.createStreamingMarkdownProjector at line 114), 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(markdown): recover a link whose angle destination is missing its \u0060\u003E\u0060 (#914)\u201D; \u201Cfix(markdown): keep a \u0060$$\u0060 block that shares its lines with the formula (#900)\u201D; \u201Cfix(markdown): end a bare URL where the sentence ends, not at the next space (#815)\u201D; \u201Cfix(markdown): render CJK emphasis next to punctuation (#675)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/markdown/streamingMarkdownBlocks.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":"desktop/src/features/markdown/streamingMarkdownBlocks.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6508609e8c82dd4e2fb68810594f38f21dff9fd80c8bd35f768149e7113e00"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mobile/src/features/chat/useQuestionNav.ts: mobile/src/features/chat/useQuestionNav.ts changed 9 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is useQuestionNav.useQuestionNav at line 132), 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(mobile): walk back to prompts with \u2191, and land the last reply at its top (#1057)\u201D; \u201Cfix(mobile): land a reply jump on the answer\u0027s last output, not its first (#1055)\u201D; \u201Cfix(mobile): land a question jump on the answer\u0027s top, not its end (#1034)\u201D; \u201Cfix(mobile): land question jumps where the answer ends, and step on every press (#1025)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/useQuestionNav.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":"mobile/src/features/chat/useQuestionNav.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"668246fbc766d0abc7e3da6bb12733c0b155c619e180033485a00925cfb9fad7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agent/src/rpc/commands/session_title.rs: agent/src/rpc/commands/session_title.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 10 (its worst body is future_agent::rpc::commands::session_title::first_exchanges at line 20), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent): write generated titles in the interface\u0027s language (#1549)\u201D; \u201Ctest(tui,host,cli,desktop,mobile,shell): coverage waves 1-12; remote and agent liveness fixes (#1452)\u201D; \u201Cfix(agent): make storage upgrades resilient and isolate failed recovery (#1411)\u201D; \u201Cfix(session-titles): keep a chosen name, and keep a truncated title response (#1120)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/rpc/commands/session_title.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/rpc/commands/session_title.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8447c5f83922a55c4268af9a2a5e3310f0cfc50114b11325711c53a1982999"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agent/src/session/queued_receipts.rs: agent/src/session/queued_receipts.rs changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is SqliteStore::recover_queued_receipts_cancellable at line 171), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent,host,desktop,mobile): a queued edit keeps its place; host-remote store init retries (#1604)\u201D; \u201Cfix(desktop,host,mobile): queued sends stream, and the archived list counts what it draws (#1566)\u201D; \u201Cfix: prevent storage waits from freezing conversations (#1483)\u201D; \u201Cfix(agent): make storage upgrades resilient and isolate failed recovery (#1411)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/queued_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":"agent/src/session/queued_receipts.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"20007214ceb3c4a74b8f65ba7bd61e4173a587c9f648128a4303a120b0b824f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mobile/src/remote/desktopStatus.ts: mobile/src/remote/desktopStatus.ts 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 5 (its worst body is desktopStatus.peerMachineStatus 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(desktop,mobile): never display a device name the wire mangled (#1589)\u201D; \u201Cfix(host): bound startup waits, relay per launch\uFF1Bmobile drops a taken-over machine\u0027s chats (#1267)\u201D; \u201Cfix(mobile): a desktop in standby turns the status dot yellow (#1229)\u201D; \u201Cfix(mobile): let one answering desktop keep the phone out of \u0022no connection\u0022 (#1062)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/desktopStatus.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":"mobile/src/remote/desktopStatus.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb19bd3b79fd556afced36f59c947308194b55c7a8abe5a9529432c095e60340"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/features/agent/useSendMessage.ts: desktop/src/features/agent/useSendMessage.ts changed 6 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is useSendMessage.useSendMessage.handleSend at line 135), 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(desktop): clean up thread layout and async lifecycles (#962)\u201D; \u201Cfix(desktop): release a send the watchdog abandons (#882)\u201D; \u201Cfix: harden main conversation flows and desktop streaming (#651)\u201D; \u201Cfix(desktop): reconcile streaming lifecycle and parse table updates incrementally (#570)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/useSendMessage.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":"desktop/src/features/agent/useSendMessage.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f107e9045109fb614f715d212e889be74aeeed735f2a199c59a1f0a7453951b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mobile/src/features/chat/questionNav.ts: mobile/src/features/chat/questionNav.ts 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 4 (its worst body is questionNav.previousQuestion at line 36), 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(mobile): walk back to prompts with \u2191, and land the last reply at its top (#1057)\u201D; \u201Cfix(mobile): land a reply jump on the answer\u0027s last output, not its first (#1055)\u201D; \u201Cfix(mobile): land a question jump on the answer\u0027s top, not its end (#1034)\u201D; \u201Cfix(mobile): land question jumps where the answer ends, and step on every press (#1025)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/questionNav.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":"mobile/src/features/chat/questionNav.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f062e86ce237bf36b43565ad7240a9b576b044f66de7309c5ce41a1d64afa735"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/components/layout/RailRow.tsx: desktop/src/components/layout/RailRow.tsx 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 9 (its worst body is RailRow.RunIndicator at line 272), 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(desktop,mobile,tasks): make empty states, notices and task names say what they mean (#1550)\u201D; \u201Cfix(desktop,mobile,docs): legible rail type scale; drop the stale one-phone pairing note (#1317)\u201D; \u201Cfix(remote): a group\u0027s own place, the host\u0027s forks, and the transcript\u0027s inset (#1002)\u201D; \u201Cfix(remote): make a remote conversation look like this app\u0027s own (#997)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/RailRow.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":"desktop/src/components/layout/RailRow.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde952673486ed050656dc839d4a8434cd7482615e1689742fc0a5e1819423b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/integrations/agent/agentStatus.ts: desktop/src/integrations/agent/agentStatus.ts 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 1 (its worst body is agentStatus.subscribeShutdownProgress at line 26), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(agent): report startup progress and stop reconnecting during shutdown (#1396)\u201D; \u201Cfix: recover Agent service safely and prevent IME Enter misfire (#1313)\u201D; \u201Cfix(desktop): harden embedded Agent ownership and update recovery (#1108)\u201D; \u201Cfix(desktop): recover owned agent once (#725)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/integrations/agent/agentStatus.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":"desktop/src/integrations/agent/agentStatus.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6b71287499f37262eaa94fff58baca6d12bdf0d09c32267ba1ce32d88aafc4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: host/src/fusion/resilience.rs: host/src/fusion/resilience.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 7 (its worst body is Runtime::observe_failure at line 163), 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(fusion): bound waiting for remaining panelists (#1579)\u201D; \u201Cfix(fusion): harden deliberation and add reasoning benchmarks (#1494)\u201D; \u201Cfix(fusion): stabilize report generation, validation and discussion details (#1465)\u201D; \u201Cfix(fusion): preserve independent review and budget context; repair Linux smoke checks (#1462)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/fusion/resilience.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/fusion/resilience.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40b17445cad371be365505edcb67ce5f5427219bcfdbf764732d80bf24d9a70"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: orchestration/fusion/src/resilience.rs: orchestration/fusion/src/resilience.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 14 (its worst body is FailureKind::classify at line 28), 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(fusion): bound waiting for remaining panelists (#1579)\u201D; \u201Cfix(fusion): harden deliberation and add reasoning benchmarks (#1494)\u201D; \u201Cfix(fusion): stabilize report generation, validation and discussion details (#1465)\u201D; \u201Cfix(fusion): preserve independent review and budget context; repair Linux smoke checks (#1462)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- orchestration/fusion/src/resilience.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"orchestration/fusion/src/resilience.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f79431278b88c1d231bd1470c0dafde0122af5a554b8149a66ad105bd18d46d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/integrations/storage/files.ts: desktop/src/integrations/storage/files.ts 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 2 (its worst body is files.prepareImagePreviewUrl at line 104), 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(desktop): attach a clipboard image pasted in the Linux WebView (#1405)\u201D; \u201Cfix(agent): make session forks atomic and durable (#737)\u201D; \u201Cfix: preserve native clipboard file paths (#523)\u201D; \u201Cfix: harden runtime reliability and previews (#369)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/integrations/storage/files.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":"desktop/src/integrations/storage/files.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8ba41d2f64093a105f12c724243017b7fe3f4f785ac5f2c989e7d6318bb0cb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/components/layout/RailChrome.tsx: desktop/src/components/layout/RailChrome.tsx 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 4 (its worst body is RailChrome.RailGroupHeader at line 149), 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(desktop,mobile,docs): legible rail type scale; drop the stale one-phone pairing note (#1317)\u201D; \u201Cfix(desktop): reveal a workspace heading\u0027s controls with that heading (#1047)\u201D; \u201Cfix(remote): make a remote conversation look like this app\u0027s own (#997)\u201D; \u201Cfix(remote): a reply you can watch, a pin in the right place, and a rename (#996)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/RailChrome.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":"desktop/src/components/layout/RailChrome.tsx"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f8ff85dc0288e81c0f01992e1139780cacd5d738ca0d098c15c7c83f12ed55"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/components/layout/hooks/useRailSelection.ts: desktop/src/components/layout/hooks/useRailSelection.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 8 (its worst body is useRailSelection.useRailSelection at line 38), 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(desktop,host,mobile): queued sends stream, and the archived list counts what it draws (#1566)\u201D; \u201Cfix(remote): open on the newest page, and make the list\u0027s controls work (#994)\u201D; \u201Cfix(desktop,mobile): keep pinned conversations out of batch selection (#691)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/hooks/useRailSelection.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":"desktop/src/components/layout/hooks/useRailSelection.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a889be89e24752c339ce031860e54c5dfde742c7225ee7e29021bfef6e0f8db"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx: desktop/src/features/remote-peer/RemoteWorkspaceMenu.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 14 (its worst body is RemoteWorkspaceMenu.RemoteWorkspaceMenu 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(desktop): reveal a workspace heading\u0027s controls with that heading (#1047)\u201D; \u201Cfix(remote): a reply you can watch, a pin in the right place, and a rename (#996)\u201D; \u201Cfix(remote): open on the newest page, and make the list\u0027s controls work (#994)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/remote-peer/RemoteWorkspaceMenu.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":"desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a11dc5e4e59bb51fa770300a04cca5d01be30030176bf25be42454475b38f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: orchestration/fusion/src/store.rs: orchestration/fusion/src/store.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is Store::record_issues at line 404), 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(fusion): harden deliberation and add reasoning benchmarks (#1494)\u201D; \u201Cfix(fusion): stabilize report generation, validation and discussion details (#1465)\u201D; \u201Cfix(fusion): preserve independent review and budget context; repair Linux smoke checks (#1462)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- orchestration/fusion/src/store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"orchestration/fusion/src/store.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edcc013ac6d7b1439682c635ba900966a0db064720741296cc715d14dda9e58"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: host/src/agent_client.rs: host/src/agent_client.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is AgentClient::execute_command at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: prevent storage waits from freezing conversations (#1483)\u201D; \u201Ctest(tui,host,cli,desktop,mobile,shell): coverage waves 1-12; remote and agent liveness fixes (#1452)\u201D; \u201Cfix(host,tui): an idempotent Agent channel runtime; one row per keypress (#1366)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/agent_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":"host/src/agent_client.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b86e4d926683ab51b77e9abc256951ef142349eea60305368b5cfa86579550"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: channels/src/dingtalk/mod.rs: channels/src/dingtalk/mod.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 12 (its worst body is DingtalkChannel::run_with_data_dir at line 54), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(channels,mobile,tasks): keep chunked replies, queued sends and schedules alive (#1473)\u201D; \u201Cfix: remediate verified bughunt findings across agent, clients and loop (#557)\u201D; \u201Cfix(channel): retry agent connection every 20 seconds (#458)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- channels/src/dingtalk/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":"channels/src/dingtalk/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b385f775660b7c5007d7610ffbeb69167a22306e43dcd85806f7baabb8fa2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: host/src/tasks/service.rs: host/src/tasks/service.rs changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is future_host::tasks::service::update_task at line 271), 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(channels,mobile,tasks): keep chunked replies, queued sends and schedules alive (#1473)\u201D; \u201Ctest(tui,host,cli,desktop,mobile,shell): coverage waves 1-12; remote and agent liveness fixes (#1452)\u201D; \u201Cfix(mobile,host): report a refused pin; read each task\u0027s due date in its own zone (#1338)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/tasks/service.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/tasks/service.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc5eb8478e7fec5f858c0fcc8a00537893bf26005066f24686b9879d77f1a22"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mobile/src/components/useAppDialog.tsx: mobile/src/components/useAppDialog.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 8 (its worst body is useAppDialog.useAppDialog at line 20), 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(mobile): keep dialog actions visible and menu headers compact (#696)\u201D; \u201Cfix(mobile): polish dialogs and reduce small-download interruptions (#636)\u201D; \u201Cfix(mobile): allow repeat Android sharing and unify error dialogs (#624)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/components/useAppDialog.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":"mobile/src/components/useAppDialog.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3954f58e4b4d7f7ebec839eac4e3090f23ee75b1d5e69b286b67e500aa28a430"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/components/layout/hooks/useFutureAccount.ts: desktop/src/components/layout/hooks/useFutureAccount.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 10 (its worst body is useFutureAccount.useFutureAccount.refreshAuth at line 42), 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(desktop): report a signed-out Remote as an account fault, not a device one (#1111)\u201D; \u201Cfix(desktop): gate startup on Agent readiness (#724)\u201D; \u201Cfix(desktop): unify FutureOS account session state (#646)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/components/layout/hooks/useFutureAccount.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":"desktop/src/components/layout/hooks/useFutureAccount.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc478aa2975a835b7e6c2b31345ed8642fbf14cd2ccfbf2c8cac733a28f70069"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mobile/src/remote/pendingContinuationStorage.ts: mobile/src/remote/pendingContinuationStorage.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 15 (its worst body is pendingContinuationStorage.loadPendingContinuationDirect 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: harden agent desktop and mobile reliability (#637)\u201D; \u201CFix mobile outbox cleanup races (#443)\u201D; \u201Cfix(history): harden typed session recovery across clients (#414)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/remote/pendingContinuationStorage.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":"mobile/src/remote/pendingContinuationStorage.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25a94a37775ddcd2c86a9d92054e9d9b4f23d141f7b9397fa37455ff0225a84"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mobile/src/features/chat/useTimelinePaging.ts: mobile/src/features/chat/useTimelinePaging.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 7 (its worst body is useTimelinePaging.useTimelinePaging.loadOlder at line 105), 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(mobile): refine startup and chat loading UX (#632)\u201D; \u201Cfix(mobile): harden timeline paging and notification permissions (#629)\u201D; \u201Cfix(mobile): keep older history reachable and restore catalog scroll (#593)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/useTimelinePaging.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":"mobile/src/features/chat/useTimelinePaging.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d6dab991eb016e359209c86d5f0b8a710ec56bb76dacc03dcc6ac4fd83aaf9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mobile/src/update/prompt.ts: mobile/src/update/prompt.ts 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 5 (its worst body is prompt.promptUpgrade at line 16), 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(mobile): a dismissed update stays dismissed across launches (#1569)\u201D; \u201Cfix(mobile): polish dialogs and reduce small-download interruptions (#636)\u201D; \u201Cfix(mobile): allow repeat Android sharing and unify error dialogs (#624)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/update/prompt.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":"mobile/src/update/prompt.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cf90a5d1030c58db4c183d582a29f7b0251b7c82a1f59e470f8fcc1e8f166e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agent/src/fusion.rs: agent/src/fusion.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 13 (its worst body is future_agent::fusion::invoke at line 126), 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(fusion): harden deliberation and add reasoning benchmarks (#1494)\u201D; \u201Cfix(fusion): stabilize report generation, validation and discussion details (#1465)\u201D; \u201Cfix(fusion): preserve independent review and budget context; repair Linux smoke checks (#1462)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/fusion.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/fusion.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3781fe37b46c9605ff6b1343ede45ab231193319069cdbaf0323dfb6a14cad0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: orchestration/fusion/src/types.rs: orchestration/fusion/src/types.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 future_fusion::types::fusion_prompt 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(fusion): harden deliberation and add reasoning benchmarks (#1494)\u201D; \u201Cfix(fusion): stabilize report generation, validation and discussion details (#1465)\u201D; \u201Cfix(fusion): preserve independent review and budget context; repair Linux smoke checks (#1462)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- orchestration/fusion/src/types.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"orchestration/fusion/src/types.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de8d7fce5084240dca10c9562e18f51e34f684c1cfadf931a41a3b70cd3bac1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: host/src/events.rs: host/src/events.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 future_host::events::publish_to_gui at line 68), 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: \u201Ctest(tui,host,cli,desktop,mobile,shell): coverage waves 1-12; remote and agent liveness fixes (#1452)\u201D; \u201Cfix(apps): reported desktop and mobile defects; accountless host, build id, session ranking (#1300)\u201D; \u201Cfix(remote): truthful lock diagnostics, asker-clock request aging, takeover window activation (#1298)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- host/src/events.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/events.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff975366d73a855f256db4ab08ecfc8a096a18fee22ea4defd3dc1ef8d47ec9"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: mobile/src/features/chat/useMarkdownImageLoader.ts: mobile/src/features/chat/useMarkdownImageLoader.ts 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 14 (its worst body is useMarkdownImageLoader.useMarkdownImageLoader 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(mobile): one rail for step rows, revealed file names, self-loading inline images (#660)\u201D; \u201Cfix: harden agent desktop and mobile reliability (#637)\u201D; \u201Cfix(mobile): polish dialogs and reduce small-download interruptions (#636)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- mobile/src/features/chat/useMarkdownImageLoader.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":"mobile/src/features/chat/useMarkdownImageLoader.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"435caec87b11e9bcb7748e129144ddfbd0509fe3e5f3459e3ba3b58259072ff0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/vite.config.ts: desktop/vite.config.ts 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 5 (its worst body is (anonymous) at line 24), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix: \u5347\u7EA7\u517C\u5BB9 npm \u4F9D\u8D56\u3001\u6E05\u7406 ESLint \u5E76\u4FEE\u590D TUI \u6D41\u5F0F\u751F\u547D\u5468\u671F\u7ADE\u6001 (#1284)\u201D; \u201Cfix(desktop): avoid false CSS warnings during install builds (#587)\u201D; \u201Cfix(desktop): restore Markdown workers and prevent streaming parse starvation (#564)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/vite.config.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":"desktop/vite.config.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c308e2760c6856905d802486447124eb769fa59653d9348e75250911bc9d2c83"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agent/src/sandbox/backend.rs: agent/src/sandbox/backend.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 14 (its worst body is PreparedShell::into_command_with_report at line 54), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(windows): restore GUI startup and isolate background process input (#1220)\u201D; \u201Cfix(windows): show Desktop on launch and hide shell consoles (#1150)\u201D; \u201Cfix(tests): green the Windows test suite across agent, loop, channels, tui and cli (#576)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/sandbox/backend.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/sandbox/backend.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70eda65c8ec12d557e730056c7d1109c4bfe54b414fb3eaa109be67447fa429"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: agent/src/session/run_journal.rs: agent/src/session/run_journal.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is future_agent::session::run_journal::find_unterminated_run at line 50), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201Cfix(desktop,host,mobile): queued sends stream, and the archived list counts what it draws (#1566)\u201D; \u201Cfix: recover Agent service safely and prevent IME Enter misfire (#1313)\u201D; \u201Cfix: preserve historical databases and make session recovery resumable (#1186)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- agent/src/session/run_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":"agent/src/session/run_journal.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"028b53ec538f228a6b0e52b97888b238579e6c7e9f3c2cea22b07a1c08682e8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: orchestration/fusion/src/config.rs: orchestration/fusion/src/config.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is future_fusion::config::settings_patch_from_args at line 155), 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(fusion): harden deliberation and add reasoning benchmarks (#1494)\u201D; \u201Cfix(fusion): stabilize report generation, validation and discussion details (#1465)\u201D; \u201Cfix(fusion): preserve independent review and budget context; repair Linux smoke checks (#1462)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- orchestration/fusion/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":"orchestration/fusion/src/config.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae922450eab514098cacb87bb7ea5fb40e6658d994dc993b5bf5d46f4839939"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: channels/src/delivery.rs: channels/src/delivery.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is DeliveryQueue::load at line 141), 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(ci): \u4FEE\u590D Channel \u5E76\u53D1\u6301\u4E45\u5316\u4E0E\u4E3B\u5E72\u6D4B\u8BD5\u7ADE\u6001 (#1316)\u201D; \u201Cfix: honor FUTURE_HOME in CLI/TUI/channels; isolate desktop update tests; bump skills (#1305)\u201D; \u201Cfix(channels): let a provider\u0027s own error classification reach the queue (#783)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- channels/src/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":"channels/src/delivery.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"607058b282b32ec86d52884023bebed69e29a8df4d8078aadb82ccf502af0683"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: desktop/src/features/agent/threadAttachments.ts: desktop/src/features/agent/threadAttachments.ts changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is threadAttachments.persistImageAttachments at line 38), 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(desktop): open remote attachments from the host, and say when a copy fails (#1190)\u201D; \u201Cfix: preserve native clipboard file paths (#523)\u201D; \u201CFix attachment queue snapshots (#345)\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-19..2026-11-17, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-19 00:43:02 \u002B08:00\u0027 --until=\u00272026-11-17 00:43:02 \u002B08:00\u0027 --full-history --no-merges -- desktop/src/features/agent/threadAttachments.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":"desktop/src/features/agent/threadAttachments.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2accf558e4c822031577ee955d09d685058d5d01afab81b59e234c842c5449ce"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 254 significant file(s) lose their only recent owner: orchestration/goal/src/console.rs, host/src/remote/tests.rs, cli/src/commands/browser_tools.rs, cli/src/commands/session.rs, cli/src/commands/task.rs, tui/src/components/markdown.rs, cli/src/commands/mcp_servers.rs, host/src/remote/verify_e2e.rs (\u002B246 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"085ab7e706b66ef069e511aceec6715a40bf4616989dfc00c2fb217b2c51b98e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 38 significant file(s) lose their only recent owner: host/src/agent_bridge/persist.rs, agent/src/tools/shell/execution.rs, agent/src/approval_review/evidence.rs, desktop/src/features/runs/RunInspectPanel.tsx, desktop/src/components/layout/OnboardingGate.tsx, host/src/store/artifacts.rs, desktop/src/features/settings/ProvidersPage.tsx, host/src/store/approvals.rs (\u002B30 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1fdfa17b2dc7b7b2a82fcde65980f7105fa37050ed2a56329328d14b3a45c39b"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (294 single-owned of 1339 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 1339 of the 1720 production source files in this repository met that bar). They are anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: channels/src/dingtalk/dingtalk_ws.rs, desktop/src/features/terminal/client.ts."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060toJSON\u0060 spells \u0060JSON\u0060 where 17 names in the project spell it \u0060Json\u0060: 17 of 18 names in project future-os spell the token \u0060Json\u0060 (17 of 18; unit: names in project future-os containing \u0060Json\u0060). Peers: JsonPreview.VirtualJsonLines (desktop/src/features/filepreview/JsonPreview.tsx:90); useRemoteApprovals.readJson (desktop/src/features/remote-peer/useRemoteApprovals.ts:153); useRemoteTimeline.readJson (desktop/src/features/remote-peer/useRemoteTimeline.ts:995); pairing.responseJson (mobile/src/remote/pairing.ts:46); packages.json-preview.src.FormattedJsonPreview (packages/json-preview/src/index.ts:11). Rename to \u0060toJson\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/shot/mock/core.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef524a6bc2a6f2112672474664efc4851aa3f1d6db1d9475b3bcfba9733ae28"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060agent\u0060 (145083 LoC, 404 module-visible types across 37 directories) overshoots its size bounds. 8 of 32 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aabf87f0ed2a61a7cddc314284a812c01479354d83f7efcad2c36a1e0260462"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060host\u0060 (126843 LoC, 332 module-visible types across 18 directories) overshoots its size bounds. 8 of 32 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"839621b22cf5c2c42b9397ba2dbf511b1d3ffa0a131f4d8f5835d519a4714d7b"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060tui\u0060 (103756 LoC, 248 module-visible types across 4 directories) overshoots its size bounds. 8 of 32 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2b0e86db703359a8c36d33bd55cef5cb33185e5d9aad2ebc5aa7c787beb254"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060cli\u0060 (85937 LoC, 183 module-visible types across 9 directories) overshoots its size bounds. 8 of 32 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91f6073060130f000718a91911da96014113bb53f08b2b3f4b1391a5852c727"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060desktop\u0060 (83785 LoC, 825 module-visible types across 40 directories) overshoots its size bounds. 8 of 32 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eef6420222f8e36e8295ff2a3895e5f74513e99ebd5f5c2f7ad333124d9a668"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060mobile\u0060 (45864 LoC, 339 module-visible types across 21 directories) overshoots its size bounds. 8 of 32 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84da6ac64387f3300252fa339e7ad793e1b796faf53ad89be135b0c54912e05"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060channels\u0060 (39695 LoC, 182 module-visible types across 6 directories) overshoots its size bounds. 8 of 32 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3993426f3d7e089b5aaa0738b483d6a84c8a26f1a669ddbbf5c926b2ce1a9880"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (33890 LoC, 170 module-visible types across 23 directories) overshoots its size bounds. 8 of 32 build unit(s) (Cargo, Gradle, npm) overshoot their size bounds, lowering Project Cohesion to 5.0/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"package.json"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2d5244dbb9040f0ef9a41721fc246c38399605a5b233c47266a2093207fec1"}},{"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":"e948c989823c07e63ef6832ebc2a72ef1ab9d95879c79546db2c99b205436944"},"properties":{"commitSha":"9f928e1a97382d85b6c4741ef400461c2197058a"}},{"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":"bbb388b8ca5c5d15024110a3007b4daac7a083dfe9ecd8a92c98eccf315de77e"},"properties":{"commitSha":"9f928e1a97382d85b6c4741ef400461c2197058a"}},{"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":"5c35d34f5cc997b5ce3e2b5a3d6fb5794c70d68f57571518eda347f1df2417e2"},"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":"d2a067df596c583d751a54533fb6ef7ccf7f77a35ad9077dcac7ac02a87b43d8"},"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":"2969be492ac7e48848ff0bb1e22e2435a24c6f620d90246974d46eb9dbf79b57"},"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":"c36d103fc494d0d71812a2123a74706ffef07a6330f3dbebb421afd707702ca2"},"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":"4f0c800141dfb83441f4dced7b8a75a139a23676b48ccc56fa271baae4f8c17c"},"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":"e32c098127776558789c574d14b68eeeb2d7f88dd6af479315988db0f230b311"},"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":"3a7cd6517a31eec5bb05f94fcb6ecd9ea13c34b109cea7026168b21ab4617548"},"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":"0ec1d4982dd73b64de6fafe9f6d7eb22500d764ccfc1eda9d2016cd4f4606b39"},"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":"7ccc48d2a9438e2ba0dce271908fdea65a9cfbdb794b5d6d28476848ed5e22dc"},"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":"9c26500767ae9e048cce5278af3a386a6b4925302926ac25a540f3410f5f362b"},"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":"1fbddb78cdfa4c111b98727079ac8e518d15d1238e15864b92e64ca781618888"},"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":"0ca4ef27642d6ee1e8ac1c71d4ba828a834a207d4065612aa4a5fd2d10db484b"},"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":"9dfbf9e64a1400e8b948de972a8ec43a44cac2eccabd73c324e743304c9d4748"},"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":"f9942ea9cdd33caab25ba6870961da1d972aaccfe882286540819c2e0324f2f3"},"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":"e4f01cc3207dda39bbae2b32f2161cb2823f591096346c8010b8a3de9af1d24e"},"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":"3f8f6ba5d595fb7b653d710a47b0b51f04df58302679c7d40f295afe59b1071b"},"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":"328051de4829aa2563bd40d2c1dac17b468ed1d41fb12b0c1cf852ee238f4e75"},"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":"77c5b160ec24e9b8e384fadc547aab5030fc836cae6112a873f3316edf4e84df"},"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":"bfa7b5209c554a7fdb4b9f407a812a0183adbf32afe728680c8b80d105ee80d2"},"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":"1ca74a6602c8b130252b0d980ac7dde10c59a9781ec048dfc12b4436c034577b"},"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":"24c3cb02547f0ecb9b2b498ec0ebee90624a47bb4358ce3b492435a4f9215003"},"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":"03ecb6c6c291450b321940abee5d4a3ee51d56fe1694cdff138c364b987e8456"},"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":"6070cae5b6683211ff96a8abaf76f0ef5aa0d3fb7da3f6fe51323afa005a6a0c"},"taxa":[{"id":"CWE-494","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":"054510968710c4fb2677f3d4ea72df1f81e59b3a454a2c821f7ca1a40e649ca6"},"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":"e3dca65b3e746df3d677d03ab371b068bc794e0443e9baa88b2839f7dd6bd072"},"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":"d28f89de575395b2c0ba4831431239e8dba82c82d7b7d4d114470ca50e3d522c"},"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":"567b005970c74bf4d2e12d076b96cc89c45866c58bdedfafce981535b739a1d2"},"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":"1a4cba461b2514b3e62ec5de57bb69080886fd613c18d48f725946482ed72dbb"},"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":"74e4d9d0be6b8e3d81f682a38fbea383bbb915e487a9f94dfff6f7f8d18c5700"},"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":"617424ee4a63a7fc83c304db45c2f12e810ec69a9499e071ed32134759094cb9"},"taxa":[{"id":"CWE-250","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b0aa4d4180cad5af72625349315978d60175b86e37b2da6236bf45f076f865d"},"taxa":[{"id":"CWE-250","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"880da0afd50bed9fe1a7ad3ae25e6e1b329eba08382d2104da7234593830184c"},"taxa":[{"id":"CWE-250","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6833df72680a4870ea2fad75266eb15cb64dd27d7354c803291c37831892f5e4"},"taxa":[{"id":"CWE-250","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"73d02c51c782ace5618c127ca542f9db5c36f460d13ce319a994ca961f1faf16"},"taxa":[{"id":"CWE-250","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63971014418d75eef7a8e55f7f272933c4622a893210d5a7fcc7a42b6eb9ba96"},"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":"f2072197baebeed29f75b81493d93207cafebaa947ff28224c11397ab3cf460c"},"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":"3b20c9e3f5f07cd9ed7d38e1ad9e3677b956fa28fa72534ce39bdba4769b42e6"},"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":"f3c5d3262642571eb86fb6dc739cbea7d01bb98f44e21f0cc3f4e745944454d2"},"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":"9fdace52517967069682f4d541cf1db103d249850b9ff9e28bca1b7ce09cb58b"},"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":"7c30eadcccbceed0e0d7a888424133243f0a80f7e1c7cb21212f7f3b62f298cd"},"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":"5c305678eede709e82d752ecfb9078a6305854739b608c2449c49179f10f5924"},"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":"c8381cdd9539330ccdf5f2819fb2f0ec8e0d20d645b1467a3e5e48700a37b69b"},"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":"ebac61d292e4757946ff83f15293e2fa751db1ae0044345ec1ca160a7804b230"},"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":"a6a6d49203805cdb679d421a8043ac39e7b032144f8312d45a17e6946daaafca"},"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":"17c766048720a8335fe9cee4b5c94d175d687786ce4fe5ac15a7d88cc7deda62"},"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":"d20d5484e3d8277d58c5e682057bd6b1904f0e084c9ee1d8b57c31e441c0f02f"},"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":"2707576ea44808c3002371e0f9b80e81be9cb8818ec8e763fa7af54d6e9f2b5d"},"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":"f11ed71fe32502588b7649bb6c6b68ef1edb5cda3d427c7ffb9178f4a728bdc8"},"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":"65fd32a1f6c79642119d544085eb30742f45ce0614942c73783df4c9120cc9e6"},"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":"e1e0e7543f5e78350ed1d0f545cb51279f0ec1bd639d87a9df9927cc76f271db"},"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":"a0a0beaf256391ccab53c83e0d347b6cf6cf82ee9a03fec0e65dc022f5f0bd50"},"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":"3a4b6a55af552818fb3c880b7a87b80fc02cc472fb1535b751b0cdaab10110e5"},"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":"e5ad420c720cc27c080c45ac1f65c63f513340d140f2ef3865b379ab069c5108"},"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":"4df8caf5cadf2cf8432ad603a8ff01e580b6b473fc4585bd5575c369c335e18e"},"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":"cfbed2d2c81e7fa0beb6bc19fc04fea861adae62b1a27f2d91bfcd6dd96398dd"},"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":"48cbc1a3a6555bbecf0288a11bf8d4618bd26d1f1f1d04f7f8bbcf39c5b3d3e9"},"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":"53c6c71740715ea9061ca586f02dfb0bf36c30a37f64ad68aa01e3f04dd4b0b3"},"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":"1b4c4265c005d012569b06af9cfed4548ef72701b99934d810c50eaa9f5f0ab3"},"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":"0ef7598dc538d2db51c492f10d00347037cd90745e4981f27c9a10ee376528b8"},"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":"36874b611af1fa919b3ea9bf7ccfda93ff0a0701a82a7aa589f220d89600ef64"},"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":"b9130aa9ba683210c353d5b26e4d4cf91cfa73a52cd0db6a33e6bc6b242153a8"},"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":"8f7254187f0e594d6d02072fbca04e93e0b67564fa6eebf9a3fd580a74ee5040"},"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":"2eaccdf808f3fe8229591c84de8999c4eb734869846184ef9d952e3f2fc61183"},"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":"af8bf10dd25693c0f3dc12e0f55e038f425a88749ece3599378b3badb122d2e0"},"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":"035f22d0b1bfb53f252f532fefe7a300a4e275274d5054ec59928daf011b28dd"},"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":"08020f8ec8bc06059bc19380a68365d3473be85433885d053efa3bd12c079540"},"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":"4f598ee2b4d482361211ae1c2c35ab8838afe8759085f5b402d1b87e88173281"},"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":"7ee6a49488a9d4989114921794ebb0a21e8c65d2f8f3d0e8a1b8c183b4097446"},"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":"3880aec8cd8388910378ab5f0750c862845a224938ff16722865de8cbe64aec2"},"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":"bb84c243a6dd5e9f12caf7fb510b94c10adb15bf1400f730a8a3f274f8c8c7e5"},"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":"0f198a24fcd00c1211d1bfe03fefab6219730dd581bf678e7a73974958cbab29"},"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":"307c4ed652139122ae957a152f47ae5fb6b6cc317fb108962811811e35bb3f84"},"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":"30960e6380cab3968a3a48e212d102000820f784ffb15942d00a9d1ce2f9dd84"},"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":"056e3ee5eea82677255e82f6fdf8ad6dc846e83e8ef1fa579b5d364521848c9c"},"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":"b89b08526a4af545b9dd4f1accf6f4bf98efa33d40b472be83b872ba14eafbef"},"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":"694656c8e5f686f1c8ea657254cf2efd01482876976d2dcf60e2383db125e385"},"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":"538e49c1638e4f3afcab833f5d7d3a97d70f63c03761ab893708c2944d9ece87"},"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":"5be03ab325ce0dd57044d4e411f1428508ecf7870bea56774afff406be2e7ce3"},"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":"a4fa3a3025b7a9052cbd7b0d8a17b7d24287898600c95850a4b97997b4072afa"},"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":"fd34071f0a37397b22950926e6e7d533f19a1ab2e35c80a3ec230eef7195ce4c"},"taxa":[{"id":"CWE-250","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a5a94de598d5f66dcc4ccfd4adeb9bbd82d59e61120ddfa86a1354ef816f7094"},"taxa":[{"id":"CWE-250","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94112b1d706b2f9d9118c577518290919c2d702aa0b944fa06a5bcbb51101185"},"taxa":[{"id":"CWE-250","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5cd6ba725d4cfdefa0b9a1fc9a630396a4a700aff93699a8233f4a088607d6d7"},"taxa":[{"id":"CWE-250","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a77a628c056f00bc475a03de6d7c923f8e07a855e9b4fc652986cc61cd3be665"},"taxa":[{"id":"CWE-250","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"75369c09bb288495c1ec96550eb2aa9585bb73f2d0abcdd876376a94900b52cc"},"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":"64aee044c1f4dd4bb7a77441c8cfb2ad1960dbe2c5bbb6dcc4a3af1fa08e7b62"},"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":"957b150e90b8de065e3fab913d6db8aa84cc38085b4826b482eaabde0c4cf347"},"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":"ec9037c0c3f88b4ded9e5f6c47bd0816294fd21a1234d8e803c770af4f9c9cef"},"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":"96f1432c32eedfd9348f5071bc4bc62cc62e6c78f90718bcf92da382fe7f1574"},"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":"361a6c59a85391ad1060ba0e75d261a8bcfd11240a40efa3b5063018e4a1c540"},"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":"a20046b295a7fadd7e65b19aa716fb40e5f1a799340e33821beda814439efce8"},"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":"6958f2162bc90fad65ffe0e8eb8f5440b68e63051c60731e99024a56690eed59"},"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":"4d31185dadf7044d40883ae05234d59a8718741b95f6bbafc4d00eee35998477"},"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":"a34de518d1cf36487ef2f2a5cff5fa41f3140c316a6bf053508762938ea64b8a"},"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":"24372aedf2058e33d3dad4e86eaeb89cdeebcb5384c75a21d71570d054d3dfc5"},"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":"f88296ed10313bbaa0341b3e3dab791ee6c4eb21d126a97b57e67aba5af96294"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2bf30de3d507451bf92ed2975d1de4ea97e0929c9a15acf51959b849704a08e3"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c21f9d6adf642d1a94949d9cfced5abae9445222dabce91e92911eb6d5f1440"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f896136046c939b340bf27a3e1d94b16bb747e70fa5f73d8d34d141a7c463f92"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d6b5ebc04214beb364ec6884b6e438609cb362c5dac7d62b0c8d4ffbce145e2"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9eed4c593f1a965d60c97f51349470d46c5dc662694ff7605ca970d5d543cd1"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"12fe752887d0a6d30baf3eab77449646ae6f13e508eebb097db9ffd6c7e2e27a"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddbd366ca2bad6d74abeb4bac5d4b1a1952ff5c16223386c08825937936ced54"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"52807b8133ba940d304b32a473172924250a5c444a8c2dfc60831b18fe370157"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4335baacec0e3edac501962ebaff7039064b3039bb260d2e681158dd8dcd6f2b"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47b2a90d0ab59490af70aa8c82a22369d6e56e0860d8fb8a17fc3b481f7eb9be"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a52a2726d094bfaf48fd312245b9a36de7e0e1401d20c7bbcaa06b001ef2fea8"},"taxa":[{"id":"CWE-95","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":"5e61a0fd7d76a1e6c87dfecd4f4b5c49c5312a9c05dc77a2b0d489c9da04f253"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"beae0173fdae3ef9bfb3bf6e2e86b29bb6c6861af0472d5f4e5bdf360a81c058"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"04a5173d0e29f1c80d7175343244f45fdc4759cf8018fa576acd0110df84074c"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af073528e891773a33eb1dbf6f21213d17f8f91a627583af2c82720800d59c77"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e16728bdb211d1a3ae62237abfa71e89745749d56cac73f8debdb203a9437bbf"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7698f33164eae9334fd6cc6ecb5231de2bbebad94d1cca1b082955dd0db47d28"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8c6dd2d789690b7c638f0e47e10dbbf4cb201348f512cba801a82ee1eaf43188"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e953b7763eaa3023222469c7b729aa09acbec1a396446cde2c140588a7b0a862"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4dcf0ce002c297a6e6050bcfa80d4f5790dff4f9ad4059fd4f6998e8d1080886"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"76a712015d633554e6445bda675c44f2e5a85ea43ec793b2d07d928b41c52545"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0a5bf8e0ddd47ae7318175c34a2339b72758e4e4629bb6c9f1de52a48eefc755"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af89e30cc6e5e6af11a77283b5e2312dc6abf421c9d89485e27b1286ed7b3052"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cf07b66f0070815b6bb95ce6f2b286fbd8aae367c317d30a2407f5a4aa75a38d"},"taxa":[{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"cc5dd1128f843588c74c41a67f680af2827ca3f07f19ee96093b9909c7a0e502"},"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":"8e8aa11218625cac6725e47e402208fac1d71c32ee69416b6dae8a136a93461f"},"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":"1768df3d2942cd56c0145d8155621257a233db153b122230238ffb40341e9cbc"},"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":"9a9f86b64fc8eb624daec99159cddd4ca8486444cb26874d40eb7f2f96555c99"},"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":"cb327361b75836382d91207f3612bf477d0f33a67bf8553c4168e5f29fd54b9a"},"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":"a1161d550cbf8c2e129cce22ef1ee4dc50dae1b2f54d305bef614124d60caf88"},"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":"704f21fae40f4ee16ece9dcb6f08932b280d877e8a9eb9431b44026ca397100d"},"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":"4c0f16cddb372caefcd276ddb58926a689317ad956b3002ace6f6295d288a102"},"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":"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":"7a05d957a5a3a8e1d2577a963b4a13af66caf063d2d83dffcc66166bf4c29ac1"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1092cdc16bab90e26caa98781415518f2a1a0fec9b43d183894264e01dcc42b6"},"properties":{"dependency":{"package":"event-listener","version":"5.4.1","advisory":"RUSTSEC-2026-0221","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":"02807c2340c313bd085553cef2aa54725b58db377d04241d3195bea3a23b7783"},"properties":{"dependency":{"package":"glib","version":"0.18.5","advisory":"[GHSA redacted]","aliases":["RUSTSEC-2024-0429"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.4.15","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.38.1","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"95686d8e64236c3c2c566e482859faf67a5bbd9dbeebb6f4df8aab56c3496281"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-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":"64363d74ce1f052fae524dc374bd082dc62972fb05982f1a96c21eb7c322e135"},"properties":{"dependency":{"package":"pulldown-cmark","version":"0.13.4","advisory":"RUSTSEC-2026-0414","aliases":["RUSTSEC-2026-0433"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.26.0","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.6","advisory":"RUSTSEC-2026-0383","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","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":"5.13.1","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":"5.13.1","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":"b57bd94a9054ab1a78280337953ab23bcb5d2500ea7f4b4abe8dc82a1ef1d633"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"e48ac159ff7e45e7e8caf46fd08634e372e75c9d630e99e5dd84a5fa49a5f3b3"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"d0d8aed9c3d034d9452ccf6f05e2932426db83f352ddba7cc502b2ee7926dd35"},"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":"error","message":{"text":"Boundary-crossing change coupling: TasksView.tsx \u2194 taskTypes.ts: \u0060desktop/src/features/tasks/TasksView.tsx\u0060 (context desktop) and \u0060mobile/src/remote/taskTypes.ts\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 100% of the time (10 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006022ad7180\u0060 refactor!: remove task dependencies (#1109); \u0060135c0856\u0060 feat(tasks): keep the prompt-version history out of the app UIs (#1058); \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5927760e22709e6f6de47d6096a4004d9101afb6fd4ad12e5677128a44176d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: useTasks.ts \u2194 taskTypes.ts: \u0060desktop/src/features/tasks/useTasks.ts\u0060 (context desktop) and \u0060mobile/src/remote/taskTypes.ts\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 100% of the time (10 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006022ad7180\u0060 refactor!: remove task dependencies (#1109); \u0060135c0856\u0060 feat(tasks): keep the prompt-version history out of the app UIs (#1058); \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/useTasks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4429e3281eae965f0fdec5b0c8471820e0875bfd69f871bf603b29ddea97c4d1"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: useTasks.ts \u2194 locales.ts: \u0060desktop/src/features/tasks/useTasks.ts\u0060 (context desktop) and \u0060mobile/src/i18n/locales.ts\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 93% of the time (13 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060e7365a9c\u0060 feat(tasks): trim run-now paths, confirm deletes, and date pickers (#\u2026; \u006022ad7180\u0060 refactor!: remove task dependencies (#1109); \u0060135c0856\u0060 feat(tasks): keep the prompt-version history out of the app UIs (#1058) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/useTasks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcc52f12126b037e7548f1a3b53b8f79943c71aefa1957b63dfef906258572a"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: useTasks.ts \u2194 TasksSettingsPage.tsx: \u0060desktop/src/features/tasks/useTasks.ts\u0060 (context desktop) and \u0060mobile/src/features/settings/TasksSettingsPage.tsx\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 93% of the time (13 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060e7365a9c\u0060 feat(tasks): trim run-now paths, confirm deletes, and date pickers (#\u2026; \u006022ad7180\u0060 refactor!: remove task dependencies (#1109); \u0060135c0856\u0060 feat(tasks): keep the prompt-version history out of the app UIs (#1058) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/useTasks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"078ea96f6ac5b02eec555a7d12acca23339394a9482273e8af607dbc24392c6c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: data.ts \u2194 taskTypes.ts: \u0060desktop/shot/mock/data.ts\u0060 (context desktop) and \u0060mobile/src/remote/taskTypes.ts\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 90% of the time (9 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060135c0856\u0060 feat(tasks): keep the prompt-version history out of the app UIs (#1058); \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026; \u006067b9bd01\u0060 refactor(tasks): remove the prompt-suggestion pass (#932) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/shot/mock/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81c9f1c713ab4bd850fd187a0dcb1c53d9e68da57e2c01270c74d984bc0c699"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: TasksView.tsx \u2194 TasksSettingsPage.tsx: \u0060desktop/src/features/tasks/TasksView.tsx\u0060 (context desktop) and \u0060mobile/src/features/settings/TasksSettingsPage.tsx\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 89% of the time (17 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are \u0060d1f253e7\u0060 feat(tasks): name the model\u0027s vendor in the picker on both ends (#1275); \u0060e7365a9c\u0060 feat(tasks): trim run-now paths, confirm deletes, and date pickers (#\u2026; \u006022ad7180\u0060 refactor!: remove task dependencies (#1109) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"900f6ca41f11bb151c1404aed630d71efbfe72e27da16ab0a01fdb2784187d26"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: tasks.rs \u2194 kernel.rs: \u0060desktop/src-tauri/src/commands/tasks.rs\u0060 (context desktop) and \u0060orchestration/tasks/src/kernel.rs\u0060 (context orchestration) sit in DIFFERENT parts of the tree yet change together 82% of the time (9 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006022ad7180\u0060 refactor!: remove task dependencies (#1109); \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026; \u006067b9bd01\u0060 refactor(tasks): remove the prompt-suggestion pass (#932) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src-tauri/src/commands/tasks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e129af3a14c2bc23efddfb54b37135361925fb312d565ec0a7c2a3e940c113"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: backend.ts \u2194 taskTypes.ts: \u0060desktop/shot/mock/backend.ts\u0060 (context desktop) and \u0060mobile/src/remote/taskTypes.ts\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060135c0856\u0060 feat(tasks): keep the prompt-version history out of the app UIs (#1058); \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026; \u006067b9bd01\u0060 refactor(tasks): remove the prompt-suggestion pass (#932) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/shot/mock/backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1c4b924bf2bdc6532d6e8f8143836102a883b1abee1c5a5485127ab6ad8ce6"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: TasksView.tsx \u2194 locales.ts: \u0060desktop/src/features/tasks/TasksView.tsx\u0060 (context desktop) and \u0060mobile/src/i18n/locales.ts\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 74% of the time (17 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 17 shared commits counted here, the most recent 3 are \u006057259b67\u0060 feat(desktop,mobile): thinking levels by their wire value; a failed r\u2026; \u0060e7365a9c\u0060 feat(tasks): trim run-now paths, confirm deletes, and date pickers (#\u2026; \u006022ad7180\u0060 refactor!: remove task dependencies (#1109) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8e64e02ab77401ee057d7e982c1d0875a2af525cd31c07cee2437201ad68b1"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: help.rs \u2194 kernel.rs: \u0060cli/src/help.rs\u0060 (context cli) and \u0060orchestration/tasks/src/kernel.rs\u0060 (context orchestration) sit in DIFFERENT parts of the tree yet change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006022ad7180\u0060 refactor!: remove task dependencies (#1109); \u00603b2f205b\u0060 feat(tasks): a yearly trigger, and the life-journal jobs that need it\u2026; \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9902db6ac34492d99c35e4dff18252f0397e31c36730c5cf7cf089fa6d17401b"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: data.ts \u2194 data.ts: \u0060desktop/shot/mock/data.ts\u0060 (context desktop) and \u0060mobile/shot/mock/data.ts\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060b0e5c476\u0060 feat(choice): mark a card multi when its rows are one job; draw the s\u2026; \u0060135c0856\u0060 feat(tasks): keep the prompt-version history out of the app UIs (#1058); \u006067b9bd01\u0060 refactor(tasks): remove the prompt-suggestion pass (#932) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/shot/mock/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5053f6aa86603db9921c1f8430a2e0d8f05d845d9a2cc98ed64a4db5db63ff1f"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: help.rs \u2194 tasks.rs: \u0060cli/src/help.rs\u0060 (context cli) and \u0060desktop/src-tauri/src/commands/tasks.rs\u0060 (context desktop) sit in DIFFERENT parts of the tree yet change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u006022ad7180\u0060 refactor!: remove task dependencies (#1109); \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026; \u006067b9bd01\u0060 refactor(tasks): remove the prompt-suggestion pass (#932) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/help.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"accae9259a7116cd7e584fa2b9e5da271e5aba10fcb4558a38c7f60056888cd9"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: data.ts \u2194 TasksSettingsPage.tsx: \u0060desktop/shot/mock/data.ts\u0060 (context desktop) and \u0060mobile/src/features/settings/TasksSettingsPage.tsx\u0060 (context mobile) sit in DIFFERENT parts of the tree yet change together 53% of the time (10 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060135c0856\u0060 feat(tasks): keep the prompt-version history out of the app UIs (#1058); \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026; \u006067b9bd01\u0060 refactor(tasks): remove the prompt-suggestion pass (#932) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/shot/mock/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9c1104e3577b744b2dcef6b585c12493cfc22c116ba562f2bfde481913aea0"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: session.rs \u2194 command_policy.rs: \u0060cli/src/commands/session.rs\u0060 (context cli) and \u0060packages/rpc/src/command_policy.rs\u0060 (context rpc) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060eeb47ca9\u0060 feat(agent,cli): reclaim oversized run journals; wait for the remote \u2026; \u00603de3395e\u0060 feat(session): reset a session\u0027s history in place, from the CLI (#1139); \u00609f301312\u0060 feat(session): make the system-prompt append segment persistent, read\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/src/commands/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d4d124d0d11b9398baac05214dd419ec2e8701b8017d2f645cb21574f8d025"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: tasks.rs \u2194 TasksView.tsx: \u0060desktop/src-tauri/src/commands/tasks.rs\u0060 and \u0060desktop/src/features/tasks/TasksView.tsx\u0060 change together 100% of the time (11 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u006022ad7180\u0060 refactor!: remove task dependencies (#1109); \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026; \u006067b9bd01\u0060 refactor(tasks): remove the prompt-suggestion pass (#932) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src-tauri/src/commands/tasks.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54546e7d89d5e487534b4edec47d3933580e7667ea47e1f9337456c7cc82cfa2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: TasksSettingsPage.tsx \u2192 tasks.rs, tasks.rs, tasks.rs, kernel.rs: \u0060mobile/src/features/settings/TasksSettingsPage.tsx\u0060 changes together with 4 other files \u2014 \u0060desktop/src-tauri/src/commands/tasks.rs\u0060, \u0060desktop/src-tauri/src/tasks.rs\u0060, \u0060host/src/remote_host/business/tasks.rs\u0060, \u0060orchestration/tasks/src/kernel.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 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 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc7bc6ee7b234b9cc4127a20b99d952f6a44f45ea455289a39dbf9022049994"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: locales.ts \u2192 tasks.rs, transfer.rs, tasks.rs, ChatScreen.tsx, SettingsScreen.tsx, TasksSettingsPage.tsx, taskTypes.ts, types.ts, DesktopsScreen.tsx, SessionsScreen.tsx, kernel.rs: \u0060mobile/src/i18n/locales.ts\u0060 changes together with 11 other files \u2014 \u0060desktop/src-tauri/src/commands/tasks.rs\u0060, \u0060host/src/remote/transfer.rs\u0060, \u0060host/src/remote_host/business/tasks.rs\u0060, \u0060mobile/src/features/chat/ChatScreen.tsx\u0060, \u0060mobile/src/features/settings/SettingsScreen.tsx\u0060, \u0060mobile/src/features/settings/TasksSettingsPage.tsx\u0060, \u0060mobile/src/remote/taskTypes.ts\u0060, \u0060mobile/src/remote/types.ts\u0060, \u0060mobile/src/screens/DesktopsScreen.tsx\u0060, \u0060mobile/src/screens/SessionsScreen.tsx\u0060, \u0060orchestration/tasks/src/kernel.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 11 separate couplings, not 11 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 11."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/i18n/locales.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e34dd1e5cf81033104cd16ed80eda7f79cc8ade008a7497e7860803721a683"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: lib.rs \u2192 ProvidersPage.tsx, files.ts, threads.ts: \u0060desktop/src-tauri/src/lib.rs\u0060 changes together with 3 other files \u2014 \u0060desktop/src/features/settings/ProvidersPage.tsx\u0060, \u0060desktop/src/integrations/storage/files.ts\u0060, \u0060desktop/src/integrations/storage/threads.ts\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":"desktop/src-tauri/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ce90d79ca0bb5500437d4d4a85492c04f4d1135b43fd47a08f53778feb0dad"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: taskTypes.ts \u2192 task.rs, help.rs, tasks.rs, tasks.rs, tasks.rs, data.ts, kernel.rs: \u0060mobile/src/remote/taskTypes.ts\u0060 changes together with 7 other files \u2014 \u0060cli/src/commands/task.rs\u0060, \u0060cli/src/help.rs\u0060, \u0060desktop/src-tauri/src/commands/tasks.rs\u0060, \u0060desktop/src-tauri/src/tasks.rs\u0060, \u0060host/src/remote_host/business/tasks.rs\u0060, \u0060mobile/shot/mock/data.ts\u0060, \u0060orchestration/tasks/src/kernel.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 7 separate couplings, not 7 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 7."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/taskTypes.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd5f548a9f8b3932c415bab16d80cdc6aca37b18c6e957934ce4edbaa5982f7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: TasksView.tsx \u2194 tasks.rs: \u0060desktop/src/features/tasks/TasksView.tsx\u0060 and \u0060host/src/remote_host/business/tasks.rs\u0060 change together 85% of the time (11 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u006022ad7180\u0060 refactor!: remove task dependencies (#1109) (at that commit the file was still \u0060desktop/src-tauri/src/remote_host/business/tasks.rs\u0060); \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026 (at that commit the file was still \u0060desktop/src-tauri/src/remote_host/business/tasks.rs\u0060); \u006067b9bd01\u0060 refactor(tasks): remove the prompt-suggestion pass (#932) (at that commit the file was still \u0060desktop/src-tauri/src/remote_host/business/tasks.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d44f313269eaa3d28e53754c4ff42333736899de19f2adce85d4432d5514855"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: useTasks.ts \u2192 task.rs, backend.ts, data.ts, tasks.rs, tasks.rs, kernel.rs: \u0060desktop/src/features/tasks/useTasks.ts\u0060 changes together with 6 other files \u2014 \u0060cli/src/commands/task.rs\u0060, \u0060desktop/shot/mock/backend.ts\u0060, \u0060desktop/shot/mock/data.ts\u0060, \u0060desktop/src-tauri/src/tasks.rs\u0060, \u0060host/src/remote_host/business/tasks.rs\u0060, \u0060orchestration/tasks/src/kernel.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 6 separate couplings, not 6 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 6."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/useTasks.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82abfa7103352d556ddf3f6cb2329673f19caca90a3918c726f0f7aa8ac1fc01"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: GeneralPage.tsx \u2194 app_settings.rs: \u0060desktop/src/features/settings/GeneralPage.tsx\u0060 and \u0060host/src/store/app_settings.rs\u0060 change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060442b57fa\u0060 feat(desktop): pull the skill-recommendation toggle from Settings (#791) (at that commit the file was still \u0060desktop/src-tauri/src/store/app_settings.rs\u0060); \u0060834ac2b4\u0060 refactor(desktop): remove the thinking visibility setting (#688) (at that commit the file was still \u0060desktop/src-tauri/src/store/app_settings.rs\u0060); \u0060babaedaa\u0060 fix(desktop): generate first-answer titles instead of compacting cont\u2026 (at that commit the file was still \u0060desktop/src-tauri/src/store/app_settings.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0fec92a353be63c0b618d65a821783106b10efd9f4d89657c4aeaac91a69a9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: RemoteContext.tsx \u2192 transfer.rs, mod.rs, useConversationController.ts: \u0060mobile/src/remote/RemoteContext.tsx\u0060 changes together with 3 other files \u2014 \u0060host/src/remote/transfer.rs\u0060, \u0060host/src/remote_host/business/mod.rs\u0060, \u0060mobile/src/remote/useConversationController.ts\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":"mobile/src/remote/RemoteContext.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7f4cf38f2437ffbe18cf9ac32672d20135bfb0073027ebfb2107b471b1d714"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: data.ts \u2192 tasks.rs, tasks.rs, kernel.rs: \u0060desktop/shot/mock/data.ts\u0060 changes together with 3 other files \u2014 \u0060desktop/src-tauri/src/commands/tasks.rs\u0060, \u0060desktop/src-tauri/src/tasks.rs\u0060, \u0060orchestration/tasks/src/kernel.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":"desktop/shot/mock/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7c9b7746fa704f6fd852cf13f02a5c741411616290d1de5182dac5ac5a6729"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: RemoteConversationView.tsx \u2194 useRemoteTimeline.ts: \u0060desktop/src/features/remote-peer/RemoteConversationView.tsx\u0060 and \u0060desktop/src/features/remote-peer/useRemoteTimeline.ts\u0060 change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 8 shared commits counted here, the most recent 3 are \u0060028fca83\u0060 fix(remote): read older history from the walk, not from a permanent p\u2026; \u0060e2f98dcc\u0060 perf(remote-peer): open a remote conversation in the phone\u0027s three co\u2026; \u00601886164d\u0060 fix(remote): a reply that is already in the transcript, drawn once (#\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b344110acaa92fdd51a14ac9bfc3c7a52f5e7951cd43282f2dad4944f064318"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 transfer.rs: \u0060desktop/src-tauri/src/remote/mod.rs\u0060 and \u0060host/src/remote/transfer.rs\u0060 change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060ca5037cf\u0060 Harden remote connection recovery (#323) (at that commit the file was still \u0060desktop/src-tauri/src/remote/transfer.rs\u0060); \u00601a49f4ac\u0060 Fix remote attachment preview resilience (#312) (at that commit the file was still \u0060desktop/src-tauri/src/remote/transfer.rs\u0060); \u00603b2274f2\u0060 feat: improve mobile remote reliability (#257) (at that commit the file was still \u0060desktop/src-tauri/src/remote/transfer.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src-tauri/src/remote/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6cf59498fa1f649fced26b7aa75962af2f5b34538a87c84628dc293ac3fc3e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: commands.rs \u2194 types.ts: \u0060host/src/remote/commands.rs\u0060 and \u0060mobile/src/remote/types.ts\u0060 change together 59% of the time (29 of the 49 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 29 shared commits counted here, the most recent 3 are \u00607032b19d\u0060 feat(remote): connecting is not taking over (#1179) (at that commit the file was still \u0060desktop/src-tauri/src/remote/commands.rs\u0060); \u00602a9b11e4\u0060 feat(remote): let a host say what connected to it (#970) (at that commit the file was still \u0060desktop/src-tauri/src/remote/commands.rs\u0060); \u0060e9184896\u0060 feat(mobile): create a workspace from the phone (#950) (at that commit the file was still \u0060desktop/src-tauri/src/remote/commands.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bd811095b1757680e6ac729004f548b8c4f6cbb352da2bbb36d09ffad91bb5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: parity.rs \u2194 payloads.rs: \u0060packages/rpc/src/parity.rs\u0060 and \u0060packages/rpc/src/payloads.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 7 shared commits counted here, the most recent 3 are \u00605e8503f6\u0060 feat(mobile,host,agent): show and edit a queued message\u0027s files (#1576); \u00600f83828b\u0060 feat(tui,agent,rpc): order the rail by when a conversation was create\u2026; \u00608449acf6\u0060 fix(agent): keep a session writable after a manual compaction (#1149) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/rpc/src/parity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ed173f1e728f796c05f60c13b770b8bcd5a84f0ce8079cfcb91b8ca2261931"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ChatScreen.tsx \u2194 useConversationController.ts: \u0060mobile/src/features/chat/ChatScreen.tsx\u0060 and \u0060mobile/src/remote/useConversationController.ts\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u006052328e80\u0060 feat(mobile): fork a conversation from a reply, like the desktop (#903); \u00600fe03191\u0060 perf(remote): fetch a lean shell row\u0027s command on tap (#851) (#851); \u0060fb883888\u0060 feat(usage): make the spend entry an icon and read it on open (#730) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dad8a426dce80e66b736c07c518d6e2722e19258dd5a80553f8641c60dd08a4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: MessageBlock.tsx \u2194 attachments.ts: \u0060desktop/src/features/agent/MessageBlock.tsx\u0060 and \u0060desktop/src/features/agent/attachments.ts\u0060 change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 9 shared commits counted here, the most recent 3 are \u006000c5426d\u0060 Harden GUI attachment handling (at that commit the files were still \u0060gui/src/features/agent/MessageBlock.tsx\u0060 and \u0060gui/src/features/agent/attachments.ts\u0060); \u00603f03f89f\u0060 refactor(attachment): generate thumbnails in Rust; SVG as file; drop \u2026 (at that commit the files were still \u0060gui/src/features/agent/MessageBlock.tsx\u0060 and \u0060gui/src/features/agent/attachments.ts\u0060); \u006035aefea9\u0060 feat(attachment): reference local files by path instead of inlining c\u2026 (at that commit the files were still \u0060gui/src/features/agent/MessageBlock.tsx\u0060 and \u0060gui/src/features/agent/attachments.ts\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf88c4e799f70a205e065583aa8520203c922f953369196a4f6f56a30f0258a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: DesktopsScreen.tsx \u2194 SessionsScreen.tsx: \u0060mobile/src/screens/DesktopsScreen.tsx\u0060 and \u0060mobile/src/screens/SessionsScreen.tsx\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 6 shared commits counted here, the most recent 3 are \u00601d8a972c\u0060 feat(tui,mobile,agent): a new-session screen; named and gated desktop\u2026; \u0060bfefdfff\u0060 feat(mobile): give each paired desktop its own settings page (#1041); \u0060c1adb032\u0060 fix(mobile): align dialogs and preserve usable remote connections (#599) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/DesktopsScreen.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c8452429d60edd5124345c09c55153e2db4540a83d093af8ab4157ec369081"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: backend.ts \u2194 tasks.rs: \u0060desktop/shot/mock/backend.ts\u0060 and \u0060host/src/remote_host/business/tasks.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 \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) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060699b049b\u0060 feat(tasks): let a task delete the conversation each run leaves behin\u2026 (at that commit the file was still \u0060desktop/src-tauri/src/remote_host/business/tasks.rs\u0060); \u006067b9bd01\u0060 refactor(tasks): remove the prompt-suggestion pass (#932) (at that commit the file was still \u0060desktop/src-tauri/src/remote_host/business/tasks.rs\u0060); \u006097d1794a\u0060 refactor(tasks): dependency is a trigger choice, not a second section\u2026 (at that commit the file was still \u0060desktop/src-tauri/src/remote_host/business/tasks.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/shot/mock/backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dca3246f3a3ca8c930904b33dbaf1f1f215c463633db8ed204feb6c714ad449"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: commands.rs \u2194 useConversationController.ts: \u0060host/src/remote/commands.rs\u0060 and \u0060mobile/src/remote/useConversationController.ts\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006052328e80\u0060 feat(mobile): fork a conversation from a reply, like the desktop (#903) (at that commit the file was still \u0060desktop/src-tauri/src/remote/commands.rs\u0060); \u00600fe03191\u0060 perf(remote): fetch a lean shell row\u0027s command on tap (#851) (#851) (at that commit the file was still \u0060desktop/src-tauri/src/remote/commands.rs\u0060); \u0060c7c4ebaf\u0060 feat(mobile): trigger manual context compaction from the slash menu (\u2026 (at that commit the file was still \u0060desktop/src-tauri/src/remote/commands.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/src/remote/commands.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96586a10d87807dfbb181e27dc843942f80e6cf1d803c571b026ce722db275cf"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Composer.tsx \u2194 files.ts: \u0060desktop/src/features/agent/Composer.tsx\u0060 and \u0060desktop/src/integrations/storage/files.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 \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 \u006046ae6705\u0060 fix(desktop): attach a clipboard image pasted in the Linux WebView (#\u2026; \u00606b7717e5\u0060 fix: preserve native clipboard file paths (#523); \u006000c5426d\u0060 Harden GUI attachment handling (at that commit the files were still \u0060gui/src/features/agent/Composer.tsx\u0060 and \u0060gui/src/integrations/storage/files.ts\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a010aab829b690107248812bdd93713d560f3ffffaa47a92bcc66252b43bd637"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: AppShell.tsx \u2194 GeneralPage.tsx: \u0060desktop/src/components/layout/AppShell.tsx\u0060 and \u0060desktop/src/features/settings/GeneralPage.tsx\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060834ac2b4\u0060 refactor(desktop): remove the thinking visibility setting (#688); \u00605be372e8\u0060 feat(tui,desktop): completion bell when an agent run finishes (#412); \u0060a54da63b\u0060 feat(gui/skills): auto-upgrade setting \u002B manual \u0022Upgrade all\u0022 (at that commit the files were still \u0060gui/src/components/layout/AppShell.tsx\u0060 and \u0060gui/src/features/settings/GeneralPage.tsx\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/AppShell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddd47f67b106f3686c4ed1ed113a60dd28d4c1697b1d5bd81729d3217998757"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: RunInspectPanel.tsx \u2194 RunsPanel.tsx: \u0060desktop/src/features/runs/RunInspectPanel.tsx\u0060 and \u0060desktop/src/features/runs/RunsPanel.tsx\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 \u0060a235f706\u0060 fix(agent): harden responses replay and refine context panels (#430); \u0060fbb0767d\u0060 feat(gui): show runs at tool-call granularity with per-tool detail (at that commit the files were still \u0060gui/src/features/runs/RunInspectPanel.tsx\u0060 and \u0060gui/src/features/runs/RunsPanel.tsx\u0060); \u00607e77d480\u0060 refactor(gui): M-4 \u2014 share tool-input JSON parsing across runs/markdown (at that commit the files were still \u0060gui/src/features/runs/RunInspectPanel.tsx\u0060 and \u0060gui/src/features/runs/RunsPanel.tsx\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ce3653db3b31e1a41c8a8d935752be3dcfe3f7dd8afe169f8ba1699301b297"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"597f316379ff68b24ca4a929ebcaee280343780ec28d48f8a7a1343984719769"}},{"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":"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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","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":"desktop/src/features/artifacts/PdfPreview.tsx"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bcb19921a088c9d1ca4269647ed98fc9800844ba89c3030009d74f646e2b98"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/OnboardingGate.tsx"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"62240d5d256565aa3a42a24cb956e52d391e6f06b8f9de7e5575bdfdf79fd2b7"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/OnboardingGate.tsx"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da8161cbfbdc024b044176db1bfb1366e74fa2b8c05150a10f970346123126b"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5dba0bc9946579f32df8f5d087cdd1290cfd999274fe070e3cd9f4761cd84d"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/NewConversationWorkspaceForm.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb79519322db15d5e724f0f3396db33cbbacb64b176120ef69d67108b1f96ab"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/artifacts/ArtifactsPanel.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e47c4ebcc079a4d6cbcdb8671c38c7b5972dc4974a25ce40814fd6206c3559a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\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":"desktop/src/features/markdown/MarkdownContent.tsx"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3d91da101de19d7e8043bc919b6bf74a4dde95c20978bad4b216792d433192"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/EnvironmentPage.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b4f606da4fcb1a016b452a1945a7c85ee66f08b050cb64303247c134b116a1"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fd100c0f49cc00ae4458e499589b5d9844efb2b0a58c6e5b99bcb9d4afa1b4"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c33d5b6df1cf259980a5c7f18742560cb7654f3a48b54a32502da67242c07c"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8a724281dba190a5dd966807e6631952be6ab5a89c81e4068fe4829d9482f6"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c7df5491de9cb6dff885b5c40425b0098cef59a3570fb00d5dec078573e31a"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e2861e0c754c935e0c9b1ddc6b84f5a285002f118691d6a34d0ff524ed0394"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ModelsPage.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde8ba0440ae8761b91a6bf466b3af30bc0db1fb99ed795cbcf43b0b8184b20d"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a496ae903fea266bda53f8e241a39bbf53636e6eec64961823f69f01e7442de"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id alone, wherever it is set, names nothing until a label points at it). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b10c327e4ab4cfa64412b03caabda144d652c2875ecf92b24875faba17a999"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/AddToVibeDialog.tsx"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d74a37c97fd44a77ae2cdb0e953c3b3d8db57c00f89645a76b056ceceea73f"}},{"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":"host/web/index.html"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"324c6d236a34c1bbd9803c32bc57fe61eb67a87fd496bd14a7b12dd4ad32131f"}},{"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":"host/web/index.html"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9748fbd9936c94e839d63bc41244ce54371c62f8c46103f10844c1ee121e04"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/components/ActionMenu.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6de6cd09337d3dc77e41a7af33f25118ff43daf5f38d6ae3073745b8a34ffd"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/components/SelectionSheet.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2100c096f671eb9a96e8bfe41634cb0410e928b88ac4e1254f918733fc3afcd"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/components/ComposerDock.tsx"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7dca4d17637291e1bd183521646a8156702ac4d528af50e71c00b205bda4e8"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/components/RenameModal.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3faff51f0040aca5736eef1f65919d0c2214d307b93d0afc63704c1a5922320"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id at this call site, and nothing written inside it here carries one either (a name prop is the form-submission key, not a label; an id, even one the component sets on what it renders, names nothing until a label points at it) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/components/SendQueuePanel.tsx"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b7052d71a443b6ac28962c47a0145695fc10dbb1c08d53d3fd521fdfc69f8c"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/settings/TimezoneField.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"39282d048642ddd9f5be6d73aad98ba0af824c8b799f84c470369b741468ea23"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/DesktopLabelDialog.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b0dc64a7ba7ef74fddc7dbfaab3e2e66fe92480e9b2ab5886d8f4cfd97491d"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd5e5b62e0c218043a90802451605590e4c8264f214dd0caf257630b08e2211"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ea8d3071010865c38e810183f7d034b67ce55a4fa15c3923ed68d6672c92a3"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/SessionsScreen.tsx"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c9df68acce124d3fbb9f0e5972f60fe976500c73f9b4315c73b06e0492772e"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextInput\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/SessionsScreen.tsx"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"4615b05e23a027def855234693ea682c6864edcf4db98e5b80095f676d3e3d4d"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/scripts/storage-read-benchmark.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"11246a003b47a26772f66c2f009b27612c7a66b5d38aebd36b3f423771566b1a"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/scripts/streaming-markdown-benchmark.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bebb24726dd69fa2ab570d35cb4b73e17de9f9694d74ab1a59fb71ed13cb0d"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/web/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7aed242f37771f26df0428557a5901e2b5f4e3888ea8a35f32e094acd95b9ed"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/AppShell.tsx"},"region":{"startLine":2086}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b3e4ebfb633d7b9dee871069ffb8177c527abd986dbda9df0707104d0383f3"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Csection role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/ui/Dialog.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36145530005a63ddde4937cf5bfb580e1f6d0f8e493b3b7f9d11a26523cdee5"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/composer/ChoicePopover.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7e94bb7a0ddf46b845d3ae853be6dba4b570996989a311d9ea9ce8e34871fc"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cdiv\u003E: This \u003Cdiv\u003E binds mousedown, mouseup, mousemove, wheel and double-click \u2014 pointer gestures with no keyboard form, a double-click among them. No click, no key handler, and no tabIndex={0}, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabIndex={0} \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filepreview/ImagePreview.tsx"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2db28967fdc2c0ef3023e30aeef9d3f761a629c8c226522222f0019c4acfc6d"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Csection role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/CommandPalette.tsx"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"40aca9bca4adea2b35d7d44987624d9c72267c6cf8d71613a66ce90f31b4be99"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Csection role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/ShortcutCheatSheet.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1769fc2701de3060e6b1ce1fe297fa7a90b2ffd6c2eb29dfc580d659b685e7a6"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteUsageDialog.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"355f2dcfaff0c09ae64b7c7b9d6eee374b7b42ab9b2edc0d38db06dfde16718e"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Csection role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/SettingsDialog.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f82e9e70aabfa8fd3b2f0ccbe02125864748763522848aa9aa0a24a99a1a700"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Cdiv role=\u0022dialog\u0022\u003E is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/AddToVibeDialog.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2021e1547bcec5787ae117d1ed58de377179dbb0475d952b87c96b3ba4b85f4"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cheader\u003E: This \u003Cheader\u003E binds double-click and nothing else. No click, no key handler, and no tabIndex={0}, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabIndex={0} \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da814915af0c392b634ce2ea59289afbe3bb3c49c323d1feb92b5c698516492"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cdiv\u003E: This \u003Cdiv\u003E binds double-click and nothing else. No click, no key handler, and no tabIndex={0}, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabIndex={0} \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbd415d6d4fe81e9292ba651afec4003727495e763503458c824ed29b5d7e82"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/ConversationSearch.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"409e804c1e295729d5643d6b71d3571bcd58df64545ad32b3c82420287d7a9d1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cspan\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/RailRow.tsx"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0103bb8bba1f06f86c61a89772f189f58da8bbca18719bca37da4170020dbc08"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cdiv\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"111e25444c62cbcf8bae2f1b63a7415e72c7a672dc4af87897cac88ff2ca38cd"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cspan\u003E moves \u2014 its \u0060animate-ping\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a5cdbf4ce1fc90139db5c933d9dff127077b2cf6b3a80ae40c0ee2dc2c7ad1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/SendQueuePanel.tsx"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fc02b3b08254d0bf34caf1c7d473bec3b68779559ff77e410a522522a04a4a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/search/ThreadSearch.tsx"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f667ddf66b4da9e0daffa8e0264df8d12d2bcc63b69fdb97f72d6c10c0cc97"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Cinput\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/CommandPalette.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f6a761b3259af91ac0b5e7c5b0d7fa2589045d2c2b2f55b2e5dcd5a1a21420"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed inline: \u003Ctextarea\u003E takes keyboard focus, and its outline-none utility removes the focus ring with no focus-state ring, shadow, border or outline utility in its place. Add one (e.g. focus-visible:ring-2)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"d095f220448e63fed8db76525a5a4ca2b62675865c431cf41a29531f1b47e543"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.4:1): \u0060button\u0060 sets color: #fff on background-color: #2b6cff \u2014 4.4:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/web/index.html"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd741c3cb482a7ad7dd96a3dd5cff2a2f65da05e5b004179fd57f6483d67e9f2"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.5:1): \u0060#presenceStatus.offline\u0060 sets color: #9aa4b2 on background-color: #4a4a4a \u2014 3.5:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"host/web/index.html"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"54649a4dee31dd233ae7e165fe3219dc9ca64c5124c1bcca00e140912d33c351"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.9:1): \u0060h3 .num\u0060 sets color: #2b6cff on background-color: #eaf0ff \u2014 3.9:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/screenshots/document.css"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f34614e0b0d1dac1118c158df26cfd3301a16a68f0df1aaf45e45eb84f5c187"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.0:1): \u0060.tag\u0060 sets color: #2b6cff on background-color: #eef3ff \u2014 4.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/screenshots/document.css"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b43a0d3d162c2cc0bfca0d90ba2a5cd55acce35b8248a36cc50b63791adfa3c"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.animate-pop-in\u0060 moves (\u0060animation: pop-in 0.24s ease-out both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/styles/globals.css"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"912ae188a05fe57e0a159de070c75187e8fd488cd0e3488425118c0f290749cd"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 keyboard: \u0060AgentThread\u0060 (slice \u0027agent\u0027) depends on \u0060useCommand\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff46a3513971f45cfb05e190abc235efb7a0cbf29d58f84278624a7f6f27754d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 skills: \u0060AgentThread\u0060 (slice \u0027agent\u0027) depends on \u0060installRecommendedSkill\u0060 from slice \u0027skills\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1592f52215db67e05e18f50c17637d91d85babba68e6920c36379b0ee7cd9e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060AgentThread\u0060 (slice \u0027agent\u0027) depends on \u0060ChoiceCardAnswer\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e8b3697af3dd6a4dcf7cdfc0eaf27ce7b6d9977f7de12a37dcdf1b5470fbf3"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 keyboard: \u0060ComposerImpl\u0060 (slice \u0027agent\u0027) depends on \u0060useCommand\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35b061b20c3f82b55411f9b99afbad1341b55f16244a9501ebcc1a08131f932"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060MessageBlockProps\u0060 (slice \u0027agent\u0027) depends on \u0060ChoiceCardAnswer\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"df27ff0b97037074b993b19be079cf7f740f0a73dee3aafae10231e962370c56"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060MessageBlockImpl\u0060 (slice \u0027agent\u0027) depends on \u0060MarkdownContent\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae84e75e0f593d9683b63485fd80bf480bbca969509528f6bf355d9a1cb8db0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060MessageBlockImpl\u0060 (slice \u0027agent\u0027) depends on \u0060STREAMED_BLOCK_CONTAINMENT\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"91167a7c8de87874ac64b5c70a4c28b4faf107d2bdad5c7029326cfae1c80e10"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060MessageBlockImpl\u0060 (slice \u0027agent\u0027) depends on \u0060StreamingMarkdownContent\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a51eca656bda42322e4415c2a74ba0ad2ebcf17ab0a8b35e06e1bd2ac50925"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060MessageListProps\u0060 (slice \u0027agent\u0027) depends on \u0060ChoiceCardAnswer\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/MessageList.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"740dda33c1282e9b0bf3b1b461856e4408ca0138f4d88bdf2a436d95a8c39a48"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 skills: \u0060NewConversation\u0060 (slice \u0027agent\u0027) depends on \u0060fetchCoachPrompt\u0060 from slice \u0027skills\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e64d6647ba12f2f10ca2853e1d9ceee15cda234a9904c32ac74052e1c88cd31"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 skills: \u0060NewConversation\u0060 (slice \u0027agent\u0027) depends on \u0060installRecommendedSkill\u0060 from slice \u0027skills\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90f113dc10d49745f0b5ae38bbe7581dd50c0f454bfda0b220e41174409cc52"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 skills: \u0060NewConversation\u0060 (slice \u0027agent\u0027) depends on \u0060SkillGuideBanner\u0060 from slice \u0027skills\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c379d6fa28f71b9b68933b04368941dbfa2e0b200bd6be9beb98cd83881945"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060ThinkingBlock\u0060 (slice \u0027agent\u0027) depends on \u0060STREAMED_BLOCK_CONTAINMENT\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/ThinkingBlock.tsx"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"53980a0cb71295b8dc63a1eeacca7ba4e8f4b90e7da2004527d534dcbc2ad99f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060ThinkingBlock\u0060 (slice \u0027agent\u0027) depends on \u0060StreamingMarkdownContent\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/ThinkingBlock.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8974f23d8e78450095f1bee5756718cb29f73ae77d1f95b0f01182e1ca74f099"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 keyboard: \u0060ThreadHeader\u0060 (slice \u0027agent\u0027) depends on \u0060useCommand\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/ThreadHeader.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea0ce892c69e5b030e7b07b0b4d2ee2d753a2c596bd13d27b2716b8f2a3f262"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 runs: \u0060summarizeRunForPrompt\u0060 (slice \u0027agent\u0027) depends on \u0060toolCommand\u0060 from slice \u0027runs\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/buildContinuePrompt.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fa135f97495d1140583ed38d3433c71d9b62b35c24205e029486c0a65623b0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060buildReferenceContext\u0060 (slice \u0027agent\u0027) depends on \u0060parseFutureMarkdown\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/buildReferencePrompt.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a558424a5d4f05f3971a4ec6386ee0dc80642459b6f8356c07b926f359ee18"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060buildReferenceContext\u0060 (slice \u0027agent\u0027) depends on \u0060referenceKey\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/buildReferencePrompt.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"246a84d50bc821a8c833390eff8e681ba2c083cae9e3b46dc4d2ecf05a7caf12"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060buildReferenceContext\u0060 (slice \u0027agent\u0027) depends on \u0060resolveFutureReferences\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/buildReferencePrompt.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c79871f2275f11b3b2576237cb8ef920f0e94ff60b0b02c49334204bbd567b6"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060ChoicePopoverProps\u0060 (slice \u0027agent\u0027) depends on \u0060ChoiceCardMode\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/composer/ChoicePopover.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1941c5eafacf370d1f759b64e3138e6d63935540a4d1c45c71b4e619c3aee582"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060ChoicePopoverProps\u0060 (slice \u0027agent\u0027) depends on \u0060ChoiceCardOption\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/composer/ChoicePopover.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"080d2f55539672dfed1ca9cdf2548612a66fcbe6c898db761e4376d155ca5b7c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 keyboard: \u0060ComposerControls\u0060 (slice \u0027agent\u0027) depends on \u0060useCommand\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/composer/ComposerControls.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe71727793912a2031d8606f1d9f98e5e69ab5c3d137cde39b14a23f1ef6f471"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060ChoiceAnswer\u0060 (slice \u0027agent\u0027) depends on \u0060ChoiceCardMode\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/composer/choiceAnswer.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e82df5afe39e5910f85744482264b9bab806edb7787df7d0e191be86dd6118"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 remote-peer: \u0060AttachmentChip\u0060 (slice \u0027agent\u0027) depends on \u0060useRemoteAttachmentOrigin\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/messages/AttachmentChip.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"699e678f7344fff6feff580b17201c601792b5869403179aeb9a85f9387806ab"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 filepreview: \u0060AttachmentChip\u0060 (slice \u0027agent\u0027) depends on \u0060previewKindForPath\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/messages/AttachmentChip.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3246f87911ad321e03737f98419cd2b120e20396dd707e835ae31e6f9828154"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 remote-peer: \u0060AttachmentChip\u0060 (slice \u0027agent\u0027) depends on \u0060previewRemoteFile\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/messages/AttachmentChip.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d36c0afc3c1822a2bcc9805dd38287a217f462590fc602f383b00eca380c1a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 filepreview: \u0060AttachmentChip\u0060 (slice \u0027agent\u0027) depends on \u0060FilePreviewOverlay\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/messages/AttachmentChip.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9da78b6aaec07728cb0beea9a15b797f40ce033af59d5bb83287002a2f3635"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 keyboard: \u0060ThreadSearch\u0060 (slice \u0027agent\u0027) depends on \u0060useCommand\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/search/ThreadSearch.tsx"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c160d7f524bac6f7d2008ddc5ed97e6a923ea1bc83618df7702c1dfd8a221626"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: agent \u2192 markdown: \u0060mayContainThreadSearch\u0060 (slice \u0027agent\u0027) depends on \u0060parseFutureMarkdown\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/threadSearchCache.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3cb011b404eefeb9cfa75082f57a18a0a6701ab5d75efee29b8511acff9c54"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: filepreview \u2192 markdown: \u0060MarkdownPreview\u0060 (slice \u0027filepreview\u0027) depends on \u0060MarkdownContent\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filepreview/MarkdownPreview.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"2217b70969af6ce22f171c92e11562b0964d86ea87101c5a0cc68e81b8535f84"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: filepreview \u2192 markdown: \u0060TextPreview\u0060 (slice \u0027filepreview\u0027) depends on \u0060useCodeHighlighter\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filepreview/TextPreview.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05a2a00c83e8ad771e415de372391c4126f73083fc52475f25e48a0b169d7af"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: filepreview \u2192 markdown: \u0060TextPreview\u0060 (slice \u0027filepreview\u0027) depends on \u0060MAX_HIGHLIGHTABLE_CODE_LENGTH\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filepreview/TextPreview.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c249a08e2ff0b8c8865841b4016c8ff557f0d7f016191ac73db8d458de823e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: filepreview \u2192 markdown: \u0060TextPreview\u0060 (slice \u0027filepreview\u0027) depends on \u0060HighlightedCode\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filepreview/TextPreview.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7267bb19f6501d018d11cf8484f48f8cf94aa1fb6c89b34b10e6a4d2061a0a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: filetree \u2192 markdown: \u0060FileTreePanel\u0060 (slice \u0027filetree\u0027) depends on \u0060useLinkContextMenu\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filetree/FileTreePanel.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfc9a59208eea2a8d58f7c872e2edcb08b3a4d712c1fba89df392e6da10cda96"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: filetree \u2192 filepreview: \u0060FileTreePanel\u0060 (slice \u0027filetree\u0027) depends on \u0060previewKindForPath\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filetree/FileTreePanel.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54abc367cfe9e23d401fc3166203c1fbb502fbdd0b45d81d40a698169fd053d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: filetree \u2192 markdown: \u0060FileTreePanel\u0060 (slice \u0027filetree\u0027) depends on \u0060LinkMenuItem\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filetree/FileTreePanel.tsx"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2046696cb102d37892a1cf4566652744d42f36ea6626055830c217c57106c5bd"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: filetree \u2192 markdown: \u0060FileTreePanel\u0060 (slice \u0027filetree\u0027) depends on \u0060LinkContextMenu\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filetree/FileTreePanel.tsx"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31dc31dfd4fbb533ebab8b51e254473870502d00bf3465a7aed7a3c3cf3970a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: filetree \u2192 filepreview: \u0060FileTreePanel\u0060 (slice \u0027filetree\u0027) depends on \u0060FilePreviewOverlay\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filetree/FileTreePanel.tsx"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d6ca172596b5106c6a2f8f4b084287bfba089414601e78570e75ad70c74a7f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: filetree \u2192 filepreview: \u0060siblingImages\u0060 (slice \u0027filetree\u0027) depends on \u0060previewKindForPath\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filetree/imageSiblings.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"466be3701c62eb019736e36d258c99c748be62e6e31c380ea17e847b19c71711"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: fusion \u2192 filepreview: \u0060FusionDiscussionPanel\u0060 (slice \u0027fusion\u0027) depends on \u0060usePreviewLoadingGate\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/fusion/FusionDiscussionPanel.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"33b4fac988373f51f30b7565b6e46e4171fb65ecb47be3f30b9b2d2e62d0f2ea"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: fusion \u2192 runs: \u0060FusionDiscussionPanel\u0060 (slice \u0027fusion\u0027) depends on \u0060RunInspectorToolbar\u0060 from slice \u0027runs\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/fusion/FusionDiscussionPanel.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e17c35eadfa5b30ca5955492cc08c48ed5c9677f5cf5b5f24d33e684c6fd7d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: fusion \u2192 filepreview: \u0060FusionStepBody\u0060 (slice \u0027fusion\u0027) depends on \u0060usePreviewLoadingGate\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/fusion/FusionStepBody.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f585374a48c4c00ad63f79d9dc8b914554b5444b6333f5146d4b333346dca227"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: fusion \u2192 markdown: \u0060StepResponse\u0060 (slice \u0027fusion\u0027) depends on \u0060MarkdownContent\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/fusion/FusionStepBody.tsx"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24307a96759016f8fc0f46b743f53d576300e6abf89885311c1ed9ddd62a0b4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: git-history \u2192 remote-peer: \u0060listGitHistory\u0060 (slice \u0027git-history\u0027) depends on \u0060listRemoteGitCommits\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/git-history/gitHistorySource.ts"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f1038d3ab8cefefcb3e4d432cf729fef9ffc3171da31aeee5365072553df98"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: git-history \u2192 remote-peer: \u0060getGitCommit\u0060 (slice \u0027git-history\u0027) depends on \u0060getRemoteGitCommit\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/git-history/gitHistorySource.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9aa61a449ed1b847b9671e2935a75e66def90b41eeb1b1cbd2933184de41da5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: markdown \u2192 filepreview: \u0060FileLink\u0060 (slice \u0027markdown\u0027) depends on \u0060previewKindForPath\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/markdown/renderers/FileLink.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"902c0df1493148bb81fdb150f649588d0e1ae8653926c48f8635049a4d22c40c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: markdown \u2192 filepreview: \u0060FileLink\u0060 (slice \u0027markdown\u0027) depends on \u0060FilePreviewOverlay\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/markdown/renderers/FileLink.tsx"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4203c26db13eaaaabb3c32ff91599a1a1a4555fedb773748d57defa45fc5ba6"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: markdown \u2192 runs: \u0060RunEmbed\u0060 (slice \u0027markdown\u0027) depends on \u0060shortId\u0060 from slice \u0027runs\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/markdown/renderers/RunEmbed.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f5406a30d6d11c1bdbfeef7717bf96bd729b845ff31ebba34134961d57acbb"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: markdown \u2192 runs: \u0060RunEmbed\u0060 (slice \u0027markdown\u0027) depends on \u0060runTone\u0060 from slice \u0027runs\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/markdown/renderers/RunEmbed.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f7f0e9bf0e6e76532ee0f9df0d62c59f10971f6427312d0e5050dc2c4e5de0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: markdown \u2192 runs: \u0060RunEmbed\u0060 (slice \u0027markdown\u0027) depends on \u0060formatRunStatus\u0060 from slice \u0027runs\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/markdown/renderers/RunEmbed.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4601cd1fee622f4eec380277c0abc32d554b08a4befcf0ad2240f516497f291d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060CommandPalette\u0060 (slice \u0027palette\u0027) depends on \u0060CommandCategory\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/CommandPalette.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d4c15c3deab019c2c10ea3e3fc52fdf3bad207c84f8d92e62f4bea7882e5db"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060CommandPalette\u0060 (slice \u0027palette\u0027) depends on \u0060hasCommandHandler\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/CommandPalette.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c673cae612b1f5b0eac4f35155a40c62c37336cde00dd15bdf9d4b30423504"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060CommandPalette\u0060 (slice \u0027palette\u0027) depends on \u0060runCommand\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/CommandPalette.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1f504dfc8205c35b64bbeeafdcb335e880b5d6d8c7bf9c439013fd646c6699"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060ShortcutCheatSheet\u0060 (slice \u0027palette\u0027) depends on \u0060useShortcutOverrides\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/ShortcutCheatSheet.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5143453293c89588f87f5586101d49a24e978349a2fd6d226da9d96b52ee1e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060ShortcutCheatSheet\u0060 (slice \u0027palette\u0027) depends on \u0060SECTIONS\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/ShortcutCheatSheet.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ca07a6f0584b1ebdc77633a903113ed1df7ac0edad2445e7e423185622bd76"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060ShortcutCheatSheet\u0060 (slice \u0027palette\u0027) depends on \u0060sectionCommands\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/ShortcutCheatSheet.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2844e87edd4d899e62fde7f9ad4e0b048d237a0a008514420ecaaee304d65ef9"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060ShortcutCheatSheet\u0060 (slice \u0027palette\u0027) depends on \u0060bindingLabel\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/ShortcutCheatSheet.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cbd3e6f3ddec22dddc35c96b7dda4066373c48c9ab11841bf67133fd4878cc"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060ShortcutCheatSheet\u0060 (slice \u0027palette\u0027) depends on \u0060scopeOf\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/ShortcutCheatSheet.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"de208492f2eb84767ac50ec0b87f5c61a95d6aa5e34b90ab9e733b2aca15d363"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060ShortcutCheatSheet\u0060 (slice \u0027palette\u0027) depends on \u0060hasCommandHandler\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/ShortcutCheatSheet.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bccc45076e0029985628fb74bb0da8f2642c6e71474d0944b0998358e2917c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060ShortcutCheatSheet\u0060 (slice \u0027palette\u0027) depends on \u0060runCommand\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/ShortcutCheatSheet.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"72139fa6549f73064af4a9756d2f5f5ec838f94b653244a1e2cb9b52a90e9a39"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060PaletteCommand\u0060 (slice \u0027palette\u0027) depends on \u0060CommandId\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/paletteItems.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbffb8c733f9843f2b8b347e51be34d6f8498c6ad55bc26798b2f67f7e06b044"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060PaletteCommand\u0060 (slice \u0027palette\u0027) depends on \u0060CommandCategory\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/paletteItems.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6353b10cfedce3e26179b8c40e157a8db31ff0d35dccc9501528c154a0ac9732"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: palette \u2192 keyboard: \u0060isPaletteToggleKey\u0060 (slice \u0027palette\u0027) depends on \u0060resolvedBindingList\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/palette/paletteToggle.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f376e309dea5254ab2008e1b2bc0381a69250aa4fd457d15455766e4c4292e73"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060Props\u0060 (slice \u0027remote-peer\u0027) depends on \u0060ChoiceAnswer\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteChoiceChip.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c630b8c744d56d96a70e1929888ddb8869876192eab25697d8aa8590fa47ccd"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteChoiceChip\u0060 (slice \u0027remote-peer\u0027) depends on \u0060choiceAnswerLabel\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteChoiceChip.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"771ba9e24b00ef61aa71d6a47dcbf06679849cc33f71f92cecc047345dbf02ad"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteComposerHandle\u0060 (slice \u0027remote-peer\u0027) depends on \u0060ChoiceCardQuestion\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d3d9fec88a216607ab8efccfd0cbee5f45c6f929692bf1cccac6abefa5c394"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteComposer\u0060 (slice \u0027remote-peer\u0027) depends on \u0060ChoiceAnswer\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a87ed9a743740edf96cbfb07b12974c87a9e4d5c53bc75116207703a014164"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteComposer\u0060 (slice \u0027remote-peer\u0027) depends on \u0060answerOrNull\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd4f0def4c5a4aa9c6989339613def3657e380f968a64708d60ec377551a55b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteComposer\u0060 (slice \u0027remote-peer\u0027) depends on \u0060answerFromPick\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c25db95e31360a07453661564cd51f1da59cc5adeed6e3d6fd1997bef42aa1f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteComposer\u0060 (slice \u0027remote-peer\u0027) depends on \u0060imageExtensionFromMime\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e87f66fa078822e892e02de34e895261d6e356d30b254e5323c210b86dcd64"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 filepreview: \u0060RemoteComposer\u0060 (slice \u0027remote-peer\u0027) depends on \u0060previewKindForPath\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"18422bda2dd6c21dce84b6ab4af99d74e0865a0bd34a1b684bedf095d875ba25"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteComposer\u0060 (slice \u0027remote-peer\u0027) depends on \u0060choiceAnswerText\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d284fdffb3ac52847a2ddef1c7930e15ba8e151617f2396a9463c0b638dbd88"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteComposer\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SendQueuePanel\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":1361}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9724f48d4e35c8f9f78a43564ed8b8b1654377de0f06e81de1c9ae542d4733"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteComposer\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SkillRecommendCard\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b991d4ce6dfd97bd6d061205d43262d6ac05ce968444d4588340c1ee503e19de"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteComposer\u0060 (slice \u0027remote-peer\u0027) depends on \u0060splitFileName\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db410538057c4b31e7f4bdde1b90cb74261f80a4da8fe6c567167fb24022b30"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 filepreview: \u0060RemoteComposer\u0060 (slice \u0027remote-peer\u0027) depends on \u0060FilePreviewOverlay\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"940fb943563d17b120f0b9a32b33a14f8b616f8c09e63cfa830f1d84efce8ef9"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteConversationView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060ChoiceCardQuestion\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eee7cc5f2db80c8b5e00dbc9aebdd53a8deef64056b0fcd772cb0445a6f94b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteConversationView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060ActivityTargetResolver\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b27668a0af8d9993eacd1e19e81891a34e7cbaefe0ceb381a104bfd40953557"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteConversationView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060useComposerInset\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"429ad6ca708179ff7fa8a318b3b2b306fea3fee37844a41b36962c7878d1c76b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteConversationView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060useStickyAutoScroll\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"82002a24bc31b9c99daa37505cce41bd9dfdb961949b61a92c4074a56af5ff0b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteConversationView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060useQuestionNav\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3cc849c660075e7e55a82d7e904e65d7f6a4c41d93321458c7ca76fb9cbb9fe"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 markdown: \u0060RemoteConversationView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060ChoiceCardAnswer\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c29dc85cff44070e8325b667e1a398e474cc8068e2f0d3c574d979e6f306600"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteConversationView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060MessageBlock\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"1461add235583fc8124ba2e83f4f39918ff8fe1199027e6f80237b11e5e4efbf"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteConversationView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060QuestionNavControl\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5d4457e2bae866d6c0981b82bfbe2fc3498d866de8826ff060eb00478a0a98"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 git-history: \u0060RemoteFilesPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060GitHistorySource\u0060 from slice \u0027git-history\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteFilesPanel.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7eb4542dcb14f970aba82dccc15c308ebeeda51ff5c9a3cd2fc25b1da66c57"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 filepreview: \u0060RemoteFilesPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060previewKindForPath\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteFilesPanel.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"0408b8112bf482419fc6b8c0c3107e33e59b8bb85e1579d7deb1b871fb673c21"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 fusion: \u0060RemoteFilesPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060FusionDiscussionPanel\u0060 from slice \u0027fusion\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteFilesPanel.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9935265e916470a7678dc51253474b1145b4e88664e760bbae7d47298484cbb0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 git-history: \u0060RemoteFilesPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060GitHistoryPanel\u0060 from slice \u0027git-history\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteFilesPanel.tsx"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e9eb8518218de09b0537a6805f56367c70238c82d394d8227522519d95ded7"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 filepreview: \u0060RemoteFilesPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060FilePreviewOverlay\u0060 from slice \u0027filepreview\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteFilesPanel.tsx"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2b5e2e48556ac8d3afbf3dfe0f9a0a845bae63381dde18adf4e31bc3ac6094"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemotePeerSettings\u0060 (slice \u0027remote-peer\u0027) depends on \u0060RemoteFusionSettingsPage\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b31c71c7ef73491e0897bbfddb21157a6ba84cde822c46b190ef561a920b1fc"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemotePeerSettings\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsPage\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea3556e0d6df887e30c68a7e659d47acd5d2ad1160a756f0e7fec16fbe7bc8c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemotePeerSettings\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsSection\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4475d37b5d837d075b682059a7d2a639a519dc92980c34d1a714e26dc76ec5bb"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemotePeerSettings\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsList\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc087b42e33e3a5f4b9b22482b78701aaecdcae36afe5aa786bafc92be5e689e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemotePeerSettings\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsRow\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e706293f4d7c4049e6e23e762d481742f1783349d6a38413f6fe0d41416c66fe"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemotePeerSettings\u0060 (slice \u0027remote-peer\u0027) depends on \u0060Switch\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9af12eeebed9b53054f250efa02a1f999675aae3feecb927120153e847cb6a6"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemotePeerSettings\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsLinkRow\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae53da7b85737d75c4c8b843343bcea547cfe6c4812c9f5cf025b06c85ad1af2"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteProvidersPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060CustomProviderSubmit\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f438c0d12d97e500e7db2ed0f339dc301ccc9e36a3c4517a2f28e2ae166240"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteProvidersPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsSection\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8d22511d229abdf79ed4402166fc588ad675e921b44656768481d1c25317dc"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteProvidersPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsList\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5864d595bed91f2a6e6834865bc3804230bdab42200c1c345645f85bf113614"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteProvidersPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsRow\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4addcd090f8eeafb50619349155cf85c05404853ddc52cee61a13fded5769f0b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteProvidersPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060CustomProviderDialog\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baa5728c8a52ba9bf88304a16e5e889bebbbfa1f3731cb4740e786526847e54"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteProvidersPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060BuiltinProviderKeyDialog\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"2539d827511675ca433880ce9f9c742821beb2e944a67f28fc76d4e5c904200a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteSkillsPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsSection\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteSkillsPanel.tsx"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae511979db45f48d3304e3d0dc42022cc070c34b1ddfc6dd1d08a81118ca564"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteSkillsPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsList\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteSkillsPanel.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ede92b19b045f89f83dd56d228fc36c298f9ee6e354ef00a21db769f6b8a923"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteSkillsPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsRow\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteSkillsPanel.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"09220aa69d9a85e6dd1545ed59f513acd8da324c1e5c25a67cf363a6fd5ee2f7"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 tasks: \u0060RemoteTasksView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060TasksView\u0060 from slice \u0027tasks\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteTasksView.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"623b91c7659f0e54cd05288fd71e8e505b450ccbd4b3061d37700cfd611aea43"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteUsageDialog\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SessionUsageDialog\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteUsageDialog.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"08adf09d808af8c1b9001ebe9ec7fae5c9f118c41bea6ba287710978983e0a06"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteWorkspacesPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsSection\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteWorkspacesPanel.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd9b9e265a2db3139b859424e0f58e5dc51bb190f7151b6e84cb8892083f183"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteWorkspacesPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsList\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteWorkspacesPanel.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"856ee36134f5cdd0ea89ae34b5013dad94c25043ec5b6c04169ea752c6aece3e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 settings: \u0060RemoteWorkspacesPanel\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SettingsRow\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteWorkspacesPanel.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66cbfaf73a9016c0447a18d1e15c0f1af31934c5b14df376e50299635dad8f4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060RemoteComposerDraft\u0060 (slice \u0027remote-peer\u0027) depends on \u0060ChoiceAnswer\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/remoteComposerDraft.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3399e185b701303ad9c6c1f63a00f1808fd0c078f3fcf11da4a6becd1012e78f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 git-history: \u0060listRemoteGitCommits\u0060 (slice \u0027remote-peer\u0027) depends on \u0060GitGraphListing\u0060 from slice \u0027git-history\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a216cac21820f4563cf78b02ba722bf99f7b2da5b0fdf8783fcc01bf8013e5e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 git-history: \u0060getRemoteGitCommit\u0060 (slice \u0027remote-peer\u0027) depends on \u0060GitCommitDetail\u0060 from slice \u0027git-history\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d7755027150aeb6b7fbae1eb89d5d083c006398739116758d98371cbab2abb"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060remoteSkillRecoSource\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SkillRecoSource\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/remoteSkillRecoSource.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af4baad006ad5fc9b51ebc4cf301076b4b7e045da045e7a2280b72cd9735243"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 tasks: \u0060runView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060TaskRunView\u0060 from slice \u0027tasks\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/remoteTaskBackend.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d2cd8a776ebc75335defb8b2496edaa46b5bea3acd88c628b6fabe7747dca8"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 tasks: \u0060taskView\u0060 (slice \u0027remote-peer\u0027) depends on \u0060TaskView\u0060 from slice \u0027tasks\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/remoteTaskBackend.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bc9946ab39833b6e1a41e6d348c43b15f1a01eacbbf4837e7c1869661fd0a1"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 tasks: \u0060taskPayload\u0060 (slice \u0027remote-peer\u0027) depends on \u0060TaskInput\u0060 from slice \u0027tasks\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/remoteTaskBackend.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d453e06e91fa841d115401fad8dbc60d13d27e9e2d1dd1b60786e1775643a98"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 tasks: \u0060remoteTaskBackend\u0060 (slice \u0027remote-peer\u0027) depends on \u0060TaskBackend\u0060 from slice \u0027tasks\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/remoteTaskBackend.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea6e93fac3fd6390bc6c132b9c0874901b15429a7c1c1a097a1f49284ac2ef0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote-peer \u2192 agent: \u0060NOTHING\u0060 (slice \u0027remote-peer\u0027) depends on \u0060SkillCatalogData\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/useRemoteSkillCatalog.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6a6ee143618a3e6897e729ecabaf21761c8fa082be6d919e20a7364b5654f0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote \u2192 remote-peer: \u0060RemoteHubView\u0060 (slice \u0027remote\u0027) depends on \u0060RemotePeer\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote/RemoteHubView.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbc5c6597f3774ecdf04a1eeee03dd99f6c4212820031fea50b636d00bf8133"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote \u2192 remote-peer: \u0060RemoteHubView\u0060 (slice \u0027remote\u0027) depends on \u0060RemoteTasksView\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote/RemoteHubView.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"726460384538316ff4749ce11aa38641aa2cb655920582cc65579c4de6b66394"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote \u2192 remote-peer: \u0060RemoteHubView\u0060 (slice \u0027remote\u0027) depends on \u0060RemotePeerSettings\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote/RemoteHubView.tsx"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf22b65a1df76421c61aaa6e4ea098cb153b8ef5ff5462b38e935e27cebd91d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: remote \u2192 remote-peer: \u0060RemoteHubView\u0060 (slice \u0027remote\u0027) depends on \u0060RemoteClientSection\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote/RemoteHubView.tsx"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8519dad47b1b708d6609ecb2793e8b84ebe5472e05b40e66a8a429a433e59315"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: review \u2192 git-history: \u0060ReviewPanel\u0060 (slice \u0027review\u0027) depends on \u0060GitHistorySource\u0060 from slice \u0027git-history\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/review/ReviewPanel.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a413a6610bfa6f174cbebced816afc907bdc3c6707f55e2b788169ff8616d9"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: review \u2192 git-history: \u0060ReviewPanel\u0060 (slice \u0027review\u0027) depends on \u0060GitHistoryPanel\u0060 from slice \u0027git-history\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/review/ReviewPanel.tsx"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d08e8f96ada33e921ed9f06e3aac46e45cf051b850d8befb4f6ffbd3d8fd72"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 remote-peer: \u0060RemoteFusionSettingsPage\u0060 (slice \u0027settings\u0027) depends on \u0060RemotePeer\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f8f29bd1756d9de0e95169153f7eac37b37520f909b83611f198c9c2fc1319"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 remote-peer: \u0060RemoteFusionSettingsPage\u0060 (slice \u0027settings\u0027) depends on \u0060useHostCatalogueInvalidation\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21313ff3c5a37b97b1e00ed9c7bb5ec3f1a9cad26867497ea93d15415faaf8f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 remote-peer: \u0060RemoteFusionSettingsPage\u0060 (slice \u0027settings\u0027) depends on \u0060requestRemotePeer\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c9d6beef58399fbf8661b259da8df6625a201579125aa0bc3ab64cf16bdae7"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 remote-peer: \u0060RemoteFusionSettingsPage\u0060 (slice \u0027settings\u0027) depends on \u0060listRemoteProviders\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c98d612b0dd56f24712f614662315d34422dab51cc46d1ef7934ede5a49c275"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutRecorder\u0060 (slice \u0027settings\u0027) depends on \u0060CommandId\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutRecorder.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbf871be51b3bbe363bde83f54a341c201e47b6b381ee1958a6a4ea48661306"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutRecorder\u0060 (slice \u0027settings\u0027) depends on \u0060useShortcutOverrides\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutRecorder.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db53c25ac362d22f5a38db15c985587b4203a0bacc5fc7a6724a6f1ff9b7081"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutRecorder\u0060 (slice \u0027settings\u0027) depends on \u0060setCommandBinding\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutRecorder.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c194fb6592086a7db687d1ef344e6c552cedbb1279318936b8b3faf8eb076b5d"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutRecorder\u0060 (slice \u0027settings\u0027) depends on \u0060commandSpec\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutRecorder.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"333ece13aae257867144f90a3e69c9ac9b42bdc5f160ee9fb3f839bc1d822469"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutRecorder\u0060 (slice \u0027settings\u0027) depends on \u0060scopeOf\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutRecorder.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4fdbf06db7c5462e12cf4ef16fbfb4c33ee6352e65c00eb769c05270e0b115"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutRecorder\u0060 (slice \u0027settings\u0027) depends on \u0060resolvedBinding\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutRecorder.tsx"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"213eb63ef5aa9a87c15e4ce8c6c55cb17367f5726aeb2346b74a29553e0816e8"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060useShortcutOverrides\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d04a0dbe09fff40a7d241d5c5f5b2eb16187e0d7a581dee2206e28fa86ec2b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060CommandSectionId\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e163be421a0dffb06bd19cbc9003fa539708efd534b677cf754f7335b367f16"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060SECTIONS\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2595b543a101bc7db2265f324d67e095c29ae678524d4d32054ec6cbeeb876dd"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060COMMANDS\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6800aca026c749ee7a22729972d5eed6f196ab420d51ae110dca338c3dc85091"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060CommandSpec\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"048cb4c1227474e67c282c7a30022dcd1e6ac559cc97c82deff53ef7ce91e47e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060resetCommandBinding\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c331afaf9b4b84c4f22745297ed2327b472aaede088e6314bbcd2d034b358a1"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060isMultiKeyCommand\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"80386af94ea482f48c28ba71c621354b532816355dd756b1453f9c5a66c3a0ea"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060bindingLabel\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba4499f1654d83c736bc41465ae19e7aa4c0689ede014d982b8d010d3d4473c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060aliasBindingTexts\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c1061a7020353c4017a661e90f363ccce25ad4ab6b96f6f48be57729ce71b8"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060resetAllCommandBindings\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d75c5d2c9fe905db61e367df4c4742352d199a10c13bf576c2e211936002b20"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060sectionCommands\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c587af8a09bfeb7a9602b568d65f8d22c4c7e12a78ed7ddcfab645198f242a88"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060scopeOf\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"288cc4b0e067af0d8eb2199307e929f3d0db3512a868a9b785ce829d7d5d4464"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060ShortcutsPage\u0060 (slice \u0027settings\u0027) depends on \u0060FIXED_KEYS\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/ShortcutsPage.tsx"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5bab06bf4b2913c43ab6bbdda7a038ce9d847a7d9b551347d065fd6d570f8f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060RecorderRefusal\u0060 (slice \u0027settings\u0027) depends on \u0060CommandSpec\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/shortcutRecorderRules.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"37509123ef938d84ecdd8fa4f84fd10afdf6b4968c10a8631681c8acebbaee47"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060interpretPress\u0060 (slice \u0027settings\u0027) depends on \u0060CommandId\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/shortcutRecorderRules.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"435533463d7e9b65d0a6cfe507e628b87bd1c3a144e38c9c7417d211b7a94997"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: settings \u2192 keyboard: \u0060interpretPress\u0060 (slice \u0027settings\u0027) depends on \u0060conflictingCommand\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/shortcutRecorderRules.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c36084799c58a06a8a8f783c08f9efcc75524dfa4c976cd45a115e2243aaf14"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: tasks \u2192 markdown: \u0060TaskDetail\u0060 (slice \u0027tasks\u0027) depends on \u0060MarkdownContent\u0060 from slice \u0027markdown\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"861bceb7076728cd911248beb666779cde0043aca6ea7d1f653ab1749886c15e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: terminal \u2192 remote-peer: \u0060listRemoteTerminals\u0060 (slice \u0027terminal\u0027) depends on \u0060requestRemotePeer\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/terminal/remoteTerminal.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead895b3c3c1f0d617dee4d2e857bafe462d9a027484d89c3d99d23d32d8386f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: terminal \u2192 keyboard: \u0060panelToggleBinding\u0060 (slice \u0027terminal\u0027) depends on \u0060resolvedBinding\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/terminal/shortcut.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"220a939913ca1843704e355d8782a36606114555a0bedf778f16f3e9dd70d313"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: terminal \u2192 keyboard: \u0060useTerminalPanel\u0060 (slice \u0027terminal\u0027) depends on \u0060useBindingLabel\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/terminal/useTerminalPanel.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b22867123e415985eface9ad3c4ce81357cd82b5ab67c6489405520d1fe408e"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060AddToVibeDialog\u0060 (slice \u0027vibe\u0027) depends on \u0060RemoteCatalog\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/AddToVibeDialog.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ebc3ee812f6ac73950e19db4b58926d941798af3079284fb3c783487613a3a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 keyboard: \u0060VibeHintBar\u0060 (slice \u0027vibe\u0027) depends on \u0060CommandId\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeHintBar.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9874bb585bf2949dd9ce4bb63027c4a924301df4bd25ab7fd4092e68dee80a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeRemoteCell\u0060 (slice \u0027vibe\u0027) depends on \u0060RemoteCatalog\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeRemoteCell.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c65a889fb2b0f45357df6da8bcae5261ad6106b5b7d9485c91aa6298834511b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeRemoteCell\u0060 (slice \u0027vibe\u0027) depends on \u0060RemotePeer\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeRemoteCell.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"6551153be3ea10f1af4a5d994597878fec5ca7bbbffdb8f6d4a717681b1fbdd1"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeRemoteCell\u0060 (slice \u0027vibe\u0027) depends on \u0060RemoteSessionRow\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeRemoteCell.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b7069ef317721e688f0a29931ebc1018cdef20a6b19e25b11cbc443a1fab7fa"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeRemoteCell\u0060 (slice \u0027vibe\u0027) depends on \u0060useRemoteTimeline\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeRemoteCell.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5527f4f65cc24371f8d098d8eef028c4a94ae5e6d3e7d13d46e32ed9efbebf7"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeRemoteCell\u0060 (slice \u0027vibe\u0027) depends on \u0060useRemoteApprovals\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeRemoteCell.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1118ac0688f9eaa8d401643cb4929fecfbdae143d2f031106eb92bd81b6cfcc0"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeRemoteCell\u0060 (slice \u0027vibe\u0027) depends on \u0060RemoteConversationView\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeRemoteCell.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"f100c89d3473dc214787b152598da01cb3ce956ade02d3fe90aa08ddf7f13d9f"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeRemoteCell\u0060 (slice \u0027vibe\u0027) depends on \u0060continueRemoteRun\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeRemoteCell.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7425be739a079686e1b42a5ae526ea3e4976ce4a34292605879f654cfa2acb94"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 agent: \u0060VibeThreadViewProps\u0060 (slice \u0027vibe\u0027) depends on \u0060SessionMentionOption\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"89510f6a35519f15195974bc4f74d8c1c1cd3a1078ce97db7119667808b1b294"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeStageProps\u0060 (slice \u0027vibe\u0027) depends on \u0060RemoteCatalog\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98f0f13e8d99f04b8fdbd0465b6ed3b1ac4f00fe801b253a1b06dc3ad0e0592"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeStageProps\u0060 (slice \u0027vibe\u0027) depends on \u0060RemotePeer\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"298b9385f839e46bec02e883ca3111884e260e1411be41339b69a0488e329a0a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 keyboard: \u0060VibeStage\u0060 (slice \u0027vibe\u0027) depends on \u0060useShortcutOverrides\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7439b6713c141dd9ac2f2fe405b828e30e1fd955256a08ef36c8367b9e99102"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 keyboard: \u0060VibeStage\u0060 (slice \u0027vibe\u0027) depends on \u0060useShortcutScope\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb64474e03e7341d72f3c99d39f048f31eecd219482ad59250239d7c9915bf32"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 keyboard: \u0060VibeStage\u0060 (slice \u0027vibe\u0027) depends on \u0060useCommand\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ade2a3f59017838585e6ed1c1e1fe328ce93be08370ae9f89cd8485f232e7c"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 agent: \u0060VibeStage\u0060 (slice \u0027vibe\u0027) depends on \u0060AgentThreadChrome\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24bb08dd81e0ea193f0cd2b4566dc5b7ac305cef812942f0bf4e47117b6a9f4"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 keyboard: \u0060VibeStage\u0060 (slice \u0027vibe\u0027) depends on \u0060bindingLabel\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a1e33afc33ff50dcdfddbb7d9ee34fa7b33c0fab53f701e943e7b7c950096b"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeStage\u0060 (slice \u0027vibe\u0027) depends on \u0060RemoteFilesPanel\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"342b99dea2201ed9ef20b96bb1004b920c2dfead8a1521969d72a671f5d8b78a"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 agent: \u0060VibeThreadView\u0060 (slice \u0027vibe\u0027) depends on \u0060ComposerSendPayload\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":1436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b72f078c5373d738ae58ba8eecc96b2f344bbed4ac4a6265e20ad9ab5b1c413"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 agent: \u0060VibeThreadView\u0060 (slice \u0027vibe\u0027) depends on \u0060AgentThread\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b99e76ffd4d6884f1de04ac66ea7be3a915519091e48d602c71be809ca4b824"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060recentChoices\u0060 (slice \u0027vibe\u0027) depends on \u0060RemoteCatalog\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/emptySlot.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"167e036fb303d35aa15079118c5fbe5f8ce6296cc455a1ca9b7eb657b457ddc6"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 keyboard: \u0060HintItem\u0060 (slice \u0027vibe\u0027) depends on \u0060CommandId\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/hints.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bea9c132131797386c4106d3d312cd1f82898e2216c8c75f611a6ffb3711ce"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 keyboard: \u0060useActiveHints\u0060 (slice \u0027vibe\u0027) depends on \u0060useShortcutOverrides\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/hints.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d1eb1ba1aeec78b49f242d14ed7436eb77ca3704791ca077c719bedfb46ad5"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 keyboard: \u0060useActiveHints\u0060 (slice \u0027vibe\u0027) depends on \u0060hasCommandHandler\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/hints.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"066db7bbc8f3fe585dff8b5e61a45a164576c8f444be9ec1cf8543ea21163bce"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 keyboard: \u0060useActiveHints\u0060 (slice \u0027vibe\u0027) depends on \u0060bindingLabel\u0060 from slice \u0027keyboard\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/hints.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"878ee735782a9611cc81dda4dccf87b878ad4094d55339490f57c36667b7d699"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060VibeCell\u0060 (slice \u0027vibe\u0027) depends on \u0060RemoteSessionRow\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/vibeCells.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b00ffc3d6e0994b8006d2cccbd5c811698ad1aa7851ad91867b706280e0ec1"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 remote-peer: \u0060vibeCellsOf\u0060 (slice \u0027vibe\u0027) depends on \u0060RemoteCatalog\u0060 from slice \u0027remote-peer\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/vibeCells.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e07b83200970001f7c21b03d06711a5323d250dd54e30f4bcabfd65143d0771"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 agent: \u0060draftIsEmpty\u0060 (slice \u0027vibe\u0027) depends on \u0060loadComposerDraft\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/vibeQueue.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"597c4bcc638634c4a9b3c1f5bfdb1d944b992930d7761e8f996596a71549da77"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: vibe \u2192 agent: \u0060returnToDraft\u0060 (slice \u0027vibe\u0027) depends on \u0060saveComposerDraft\u0060 from slice \u0027agent\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/vibeQueue.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"583398bbf7e0527a6338099e2341de00bb2fd4f247e0e79db384bcd8379fc2bc"}},{"ruleId":"AX7","level":"warning","message":{"text":"Cross-slice coupling: chat \u2192 settings: \u0060ChatScreen\u0060 (slice \u0027chat\u0027) depends on \u0060useDesktopResource\u0060 from slice \u0027settings\u0027."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d4e53118248ca8cf1802484e3b593e0418893cbe93b5bab355bb7007a0de11"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: content-security-policy: The live app\u0027s responses did not include content-security-policy (restricts the sources a page may load \u2014 mitigates XSS/injection). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b142e47096a32517bde0bb9b78f7e564119c7f87e22fba4dccc0d1e3645d74c5"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-embedder-policy: The live app\u0027s responses did not include cross-origin-embedder-policy (recommended by the OWASP Secure Headers Project (value: require-corp)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"153214bb9c80f7d66cba8eb6a7715e9609e84c3979c9b641cd6bedaa8be6930b"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-opener-policy: The live app\u0027s responses did not include cross-origin-opener-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8cdbe5cdec6a55c732bf9a9975c0e40f81ddfa4ad583a4a50bfb0895531607f7"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-resource-policy: The live app\u0027s responses did not include cross-origin-resource-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ba35c34991db9965777a53477c2d497c4c6606f78d133bbaa3bc99c71648c2a"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: permissions-policy: The live app\u0027s responses did not include permissions-policy (restricts powerful browser features (camera, geolocation, \u2026)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac8a111f0bb913829dc090833718dca5ab8e5fba7350f9dcf68f1971010745"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: referrer-policy: The live app\u0027s responses did not include referrer-policy (limits referrer leakage to third parties). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"364ee3f006b552b8fee33710a1fbfb0c4fac59e927af9c4396e51940d9069f01"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: strict-transport-security: The live app\u0027s responses did not include strict-transport-security (forces HTTPS on subsequent requests \u2014 mitigates downgrade/MITM). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"567d3eeb50a5678c0139a1d316c614c44cd4c4fb5db6fffa7795bc73d035966f"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-dns-prefetch-control: The live app\u0027s responses did not include x-dns-prefetch-control (recommended by the OWASP Secure Headers Project (value: off)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50e54b8511264dd930857e4620bda8ba4053661b439218ed047812bcab0e3a44"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-frame-options: The live app\u0027s responses did not include x-frame-options (blocks clickjacking via framing (or use CSP frame-ancestors)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0e84499d19780ca121fad65e0f3bd2fc17b1268ce3079a5f40495749c54dc87e"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-permitted-cross-domain-policies: The live app\u0027s responses did not include x-permitted-cross-domain-policies (recommended by the OWASP Secure Headers Project (value: none)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"55366a3d9fb1c5952ebc54aab272eb775bf2c1b056d6d399652365c26cc2375b"}},{"ruleId":"AXI1","level":"warning","message":{"text":"Container process runs as root: future-nats-dev: \u0027future-nats-dev\u0027 (nats:2.10-alpine) runs as uid 0 \u2014 no user was specified, or one resolving to root was. Observed on the running container, which is the only place the answer is settled: an image\u0027s own USER, a base image\u0027s inherited one and a compose override are all invisible to a Dockerfile reader. Advisory evidence for CRA Annex I (2)(b)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f8a149640efe7c4f78e8c3396d1c8b1e5c9310de958da607c7887c17cbe27c25"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 1.1.1 reproducibly failed in a rendered surface: axe-core rule(s) svg-img-alt failed on: svg. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"28f4c45779a4309ff85f9c42c060990e7e52dbdb9dbe524270a65cd1efe1ff6f"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 2.4.2 reproducibly failed in a rendered surface: axe-core rule(s) document-title failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a152f745c16f064aeb9932e5d52584f548c37c248ac45bacf96a1a6ffc2e49e7"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 3.1.1 reproducibly failed in a rendered surface: axe-core rule(s) html-has-lang, html-lang-valid failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e2d0e1d2bf07ce04d82230fe7847e003479b78cd188efe60cc79686fb8ba8420"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 1 ADR-shaped document(s) detected by content \u2014 \u0060docs/design/workspace-thread-archive-and-paging.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060docs/architecture/fusion.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060future-tasks\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/fusion.md"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc71417e9b804692f438f97394e26cdbe7863904e5d5d200e85cbb7f9fca7e41"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060docs/architecture/headless-package-development.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060future-channel\u0060, \u0060future-tui\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/headless-package-development.md"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f71ecd64e41d8f4b959d9719869931a600da2066d8470a7cc15652c76021fc9"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060docs/architecture/headless-package-development.zh-CN.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060future-channel\u0060, \u0060future-tui\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/headless-package-development.zh-CN.md"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e57d90e88766cc9074c779c1281d767f33d72f207066b33f2d84bfa2954f96"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060docs/architecture/remote-package-development.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060future-agent\u0060, \u0060future-channel\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/architecture/remote-package-development.md"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c46dd7bbfb5d69e01df0d713041d4418b0a635e6c14f040db2aec6d83caebbb"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060docs/guide/ci.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060future-fusion\u0060, \u0060future-config\u0060, \u0060future-http\u0060, \u0060future-logging\u0060, \u0060future-relay-endpoint\u0060, \u0060@future-os/git-graph\u0060, \u0060@future-os/peer-icons\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/guide/ci.md"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1233c3ad81e8cb03d9f56bd0e4c402de8830a7c49196d58ca7c7623b624c2f23"}},{"ruleId":"M2","level":"note","message":{"text":"Architecture diagram out of date: \u0060docs/guide/ci.zh-CN.md\u0060 draws the system\u0027s parts, and the drawing no longer matches the code: it leaves out \u0060future-fusion\u0060, \u0060future-config\u0060, \u0060future-http\u0060, \u0060future-logging\u0060, \u0060future-relay-endpoint\u0060, \u0060@future-os/git-graph\u0060, \u0060@future-os/peer-icons\u0060, which the repository has beside the units it does draw. A diagram of a system that no longer exists misleads the reader it was drawn for, so it is not credited as documenting the shape."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/guide/ci.zh-CN.md"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a1973a4d9453dd64e3eaa54ce647e7af9ebe4c540d4e234363ffe0cf45d388"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 6/13 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, \u0060desktop\u0060, \u0060orchestration/goal\u0060, \u0060packages/remote-server\u0060 and 2 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060desktop/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/package.json"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"109b6e49ad10c8e961005c67d0730474c09deb1b5b6fc82be1e4e21f43bbe176"}},{"ruleId":"P4","level":"note","message":{"text":"No rollback/health safety: Deployment is orchestrated by compose, but no service declares a \u0060healthcheck:\u0060 and nothing pins a previous image to fall back to \u2014 the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/release.yml"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6bab8a28a2145f47e5a4e6683cda39d2ba0296c723238e8057da979ae1c706"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::builder(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"channels/src/tls.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0a6847dd1826219b910ce7ad0c483b512b8807c1391fa0507574570a0375eb"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::builder(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/http/src/lib.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"452849224b04209db59da9eb4967d9958c138ea3b2ac7e84b0d625d9105521f2"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::blocking::Client::builder(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/http/src/lib.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e93f81b36cfc9016958dfe83f5a7186cdead60bc48cdedfd5591040c5c8512e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060runCliCase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/cli-driver.mjs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ffd2ca9b5d959a8110442ae847f6649635447c101c31533ce1b478fc27b5b7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060appendFileSync\u0060 in \u0060note\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/cli-driver.mjs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7351fae7a284f35f0e298821cc1b06597e934bc60e55226d43881f6d3f5dad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060queryDb\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/cli-driver.mjs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"afaa467347d7f6594df873fd942398b231811ab1908da5572475094da9e56099"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060runCliCase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/cli-driver.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0366594c5be93595b9e3e46018d7da0df97d0de5f01f2fe440523bcc9c36918e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060runCliCase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/cli-driver.mjs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c11a4b67cbac830959ad688a7f046698a8cd748726df56ca4d2e8ebcee12c5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060runCliCase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/cli-driver.mjs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdbd471b21c11b39d002b29c81408554e5d692a4b0c6542bc28adc61c059401"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060runCliCase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/cli-driver.mjs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"290f41c577d1999976c0339768658cbf939400ffe5d399534a94cee57e409e80"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060runCliCase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/cli-driver.mjs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3a39a585f9e932bd85194678b65a68c34ad9136bc902efe9387a2987c25685"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f496d3208daf535a64a700ccf0a221a075367cd78b848822e14d3d459c674e7e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f38121559f4ae547460d004021e3692fac83f925e8688b637e416d42c25de45"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd684fc197b2e73c3691f5aa03beee686aabfa3bcb7335efa53e3f0b87b1c5ce"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"890c8f47695a338be817c4a30982f838b81942cf7b4fb150221eee683a50c5c0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"097a30fa38fb32d05ff1f029195e972274b1169a639054246248422251bf8ed7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060execFileSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d046d9f13affcfb5b7eca1009cbb315995b43fe1373bf2dede0cfabf6a87b7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eee4a42de417ad43b55eaa589ad2056fdf06380b72c4f944648325303c8ab65"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe13dc2da463a2461cbf61a388301472b8947a4a25423b434a810953558f989"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cff846ee813ca56ab7fd34726a7bfacc4bbdad450bf21386df7e37786ad9df"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb551c44a3e9ad5a5481078b73fb140f19ca615ef92767557298985743170ee"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b98bbeeefc6362645c0ececf5d7caee28f9cd7551c0e2c9e3c986e2b13f46b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5774bd1973857f7dfb0d6bf2789f5f070f9aeb5cf79e8b71fb947f3dc6abacfc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fbc320d2b86de7a43b6311c6f5f5cc1b99ab7b39e90a8d1b55e1e0a9794caf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060cpSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"300c282c72f4f02c5ed6a5fddda28159a20bd0e00963ce0ce53e7ea032a4528b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0880904e2c7e92818c413d4a7a9440250c27abafc56d19fedb040ab472bee3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060copyFileSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cf1c60247c0fd0fd0171efafa5878e147016ddfb84695ffecb435f01d344ea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060prepare\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/data.mjs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"44086594fc8c2d87659e1b28880c3eafe45125b7fe270856bc2f18d750451837"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureDevServer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/dev-server.mjs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb2e98d5d374baf17fd4fdccf01366106d714e58eeb4e1d4d461c581fb10874"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureMobileServer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/dev-server.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"464ee52fe0c8ff5850341f357dd70876e7a4c4198ba50887f114235613a43d23"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureMobileServer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/dev-server.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a3b78acb7ccbe43cbe6de9ee7bd2cbe36be5881cf741a10ddc9382dd5dc97d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to filter\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/dev-server.mjs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ffbd4a3b798c55ecdcabf57fabd84b2727cad12ce59739624aa9c4115ea9fc7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060callback to candidates.find\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/dev-server.mjs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1135b7539c84aaa000e29d03b2cd9379c2312b790a20617126d716b2b72a1f3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060callback to createHttpServer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/dev-server.mjs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a087ef2ac85be990ded2746abbd2c9918f834c071aadbc225811a39ef79880"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060ensureTerminalServer\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/dev-server.mjs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d9098e4b40c263c7694b8b7826100b11f632ad75d96620d40b890cb257705e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060runRemoteLiveCase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/remote-live.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf12ec3a9b0f3ec9861aa4b11dacd03fe52940da850422c6fcf818e70aa96323"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060append\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/remote-live.mjs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"19935d8396adc1ce34d0536bb2ac7e0a713c474d1593f592c0017e0ecd986b4f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060readLog\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/remote-live.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79301b2b2f8b01383bfcad0dfb761920ef6ca383bf7067b44ae025c84d653bd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060readLog\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/remote-live.mjs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da73532801514b69e4fa0748c8cdd96bd2e8901a0724f52e135d24c5bb6f413"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060runRemoteLiveCase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/remote-live.mjs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"663c605b2386abf1079fad47f6b245fd08494b6b30abf33316c2a2a7ea4f8263"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060judge\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/scripts/video-judge.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"979c1ce99451e209b8e389b1928c2a3e93cce53ce097a2f1cdb9d0fe9171ea9a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.readFileSync\u0060 in \u0060judge\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/scripts/video-judge.mjs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e4db6f3521166350f8bd402b103c90aae1ca97ce41b8ad49a8ed501f8c1176"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/scripts/video-judge.mjs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc6b53d0020b82eb66c7698500e85c0f92b88f47698e5f03ec298a2cf65e15e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 5 sibling directories (73 clone groups): 73 duplicated blocks under the repository root have copies in at least two of the sibling directories desktop, harness, mobile, packages, scripts \u2014 54 of them are reported below, and 19 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 73 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 73 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 73 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6561213d011ac00262edd134838f1dce75a4cd58057d64377420c0e3d2c58b8e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 14 sibling directories (44 clone groups): 44 duplicated blocks under desktop/src/features/ have copies in at least two of the sibling directories agent, artifacts, filepreview, filetree, keyboard, markdown (\u002B8 more sibling(s) not listed) \u2014 21 of them are reported below, and 23 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 44 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 44 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 44 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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e261ff6e43fc12733234704297396ba3e01487331e20ab250823c81ffcdf69"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 9 sibling directories (39 clone groups): 39 duplicated blocks under mobile/src/ have copies in at least two of the sibling directories components, features, i18n, lib, notifications, remote (\u002B3 more sibling(s) not listed) \u2014 13 of them are reported below, and 26 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 39 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 39 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 39 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":"mobile/src/i18n/LanguageSettings.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcda25069a933f5af22c4e36ec4dd1f896662fd06208dfa74b47da0dceb3fcc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 4 sibling directories (26 clone groups): 26 duplicated blocks under desktop/src/ have copies in at least two of the sibling directories components, features, integrations, lib \u2014 13 of them are reported below, and 13 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 26 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 26 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 26 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":"desktop/src/components/layout/ArchiveGuideBubble.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fc4c00298656f3a9def0b655138532f2f038ae1cfb40714921628b7b7d924c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (147 matched lines \u00D7 2 locations): mobile/src/features/settings/DateField.tsx:10 \u00B7 mobile/src/features/settings/TimeField.tsx:10 \u2014 the two spans are one implementation copied and then locally edited \u2014 1059 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":"mobile/src/features/settings/DateField.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8a6e3292a68ce1147599b62bad30421508b89b0ae76a1f781d047a2f1fadf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (132 matched lines \u00D7 2 locations): desktop/src/features/agent/agentQueue.ts:133 \u00B7 desktop/src/features/remote-peer/remoteQueue.ts:123 \u2014 the two spans are one implementation copied and then locally edited \u2014 987 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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f74b3ab8c632f05d406a17e12a2be6b264fbe4f93d01337d7128287d6f228fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (90 matched lines \u00D7 2 locations): desktop/src/features/settings/CustomProviderDialog.tsx:130 \u00B7 mobile/src/features/settings/CustomProviderPage.tsx:176 \u2014 the two spans are one implementation copied and then locally edited \u2014 595 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"679b56b422027d2ff88b907b2d82ec437e1dc939d9a85f72941c7e9c9713b460"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (86 matched lines \u00D7 2 locations): scripts/measure/measure-sync-browser.ts:19 \u00B7 scripts/measure/measure-sync-snapshot.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 917 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/measure/measure-sync-browser.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"035a23b8b727ea0f8f560689cce34affeee8b422e5a1d5bb67c6c02081d5411b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (78 matched lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteProvidersPanel.tsx:47 \u00B7 desktop/src/features/remote-peer/RemoteWorkspacesPanel.tsx:41 \u2014 the two spans are one implementation copied and then locally edited \u2014 456 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":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"894e48044e647a11d1a9ae44a4469b38e1664e4ae21923dfba51823f0782192e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (72 matched lines \u00D7 2 locations): desktop/src/features/review/GitChangesReview.tsx:39 \u00B7 desktop/src/features/review/LastRunReview.tsx:99 \u2014 the two spans are one implementation copied and then locally edited \u2014 271 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":"desktop/src/features/review/GitChangesReview.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b790318bb2b4132818399cfc5873f244498ce7ba383509980906cd69ddf4dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (72 matched lines \u00D7 2 locations): harness/lib/remote-live.mjs:343 \u00B7 harness/lib/remote-mobile-live.mjs:275 \u2014 the two spans are one implementation copied and then locally edited \u2014 477 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":"harness/lib/remote-live.mjs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c871b5563ade8e07b11b2e80c4a7e0a8e58a8656ff48c99496747f180e24829"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 2 locations): desktop/shot/mock/data.ts:919 \u00B7 mobile/shot/mock/data.ts:363 \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":"desktop/shot/mock/data.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa4c04e9d61f8a21748ab8acf04491c08ff1acb320138c92dfffc76f355634e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (58 matched lines \u00D7 2 locations): desktop/src/components/layout/recentOrder.ts:115 \u00B7 mobile/src/screens/recentRows.ts:98 \u2014 the two spans are one implementation copied and then locally edited \u2014 399 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":"desktop/src/components/layout/recentOrder.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b681a87ee46aaacf183c2aa376558ec4e2bda4b99c223137ce31040388d42556"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (53 matched lines \u00D7 2 locations): mobile/src/features/chat/components/SendChoiceSheet.tsx:47 \u00B7 mobile/src/features/chat/components/SessionUsageSheet.tsx:75 \u2014 the two spans are one implementation copied and then locally edited \u2014 360 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":"mobile/src/features/chat/components/SendChoiceSheet.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"130f0fbd57f6dbfb262de521b7563b7243a6152d378d2435ad18de791fe50688"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (50 matched lines \u00D7 2 locations): mobile/src/features/chat/messages/ReplyBlocks.tsx:249 \u00B7 mobile/src/features/chat/messages/ReplyBlocks.tsx:376 \u2014 the two spans are one implementation copied and then locally edited \u2014 327 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":"mobile/src/features/chat/messages/ReplyBlocks.tsx"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31b2bdb0c8c58ceef69e364155398fb38c2cf6ab969bc83d5e73557e704171e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (50 matched lines \u00D7 2 locations): mobile/src/remote/pendingContinuationStorage.ts:10 \u00B7 mobile/src/remote/pendingPromptStorage.ts:26 \u2014 the two spans are one implementation copied and then locally edited \u2014 347 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":"mobile/src/remote/pendingContinuationStorage.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7798aab7595be0522ed0cee99fa68950a75a2563b54e4edcd9dbea5cfc5d3eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (48 matched lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteFilesDialog.tsx:52 \u00B7 desktop/src/features/remote-peer/useRemoteFiles.ts:120 \u2014 the two spans are one implementation copied and then locally edited \u2014 209 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":"desktop/src/features/remote-peer/RemoteFilesDialog.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e994ee52ecbe3e1d0dfae553d3d22c01515fb11483e5b853a3a9d47cbded106"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): mobile/src/i18n/LanguageSettings.tsx:17 \u00B7 mobile/src/theme/AppearanceSettings.tsx:32 \u2014 the two spans are one implementation copied and then locally edited \u2014 339 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":"mobile/src/i18n/LanguageSettings.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93661ec029d10e2f875c89c28625010dd899bdbfb4b339db5423a043e0987d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): desktop/src/features/remote-peer/remoteReasoning.ts:24 \u00B7 desktop/src/features/remote-peer/remoteToolTarget.ts:22 \u2014 the two spans are one implementation copied and then locally edited \u2014 273 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":"desktop/src/features/remote-peer/remoteReasoning.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3449bd19c015491ff510f7d2260bd35b7451869184c1cd1e4cfc6db5e000b90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): desktop/src/features/remote-peer/remoteSessionReference.ts:157 \u00B7 mobile/src/features/chat/sessionCompletion.ts:42 \u2014 the two spans are one implementation copied and then locally edited \u2014 331 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":"desktop/src/features/remote-peer/remoteSessionReference.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b651f3c499a0b645d3ce4a2f412e59761fe40b784d2ed91f5eb069b4cd8d00d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): desktop/src/features/tasks/TasksView.tsx:182 \u00B7 mobile/src/features/settings/TasksSettingsPage.tsx:335 \u2014 the two spans are one implementation copied and then locally edited \u2014 265 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e25165279865d246b8982bcb1b9b22b835820b78bb70f65a189f5abb9716fc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (37 matched lines \u00D7 2 locations): desktop/src/features/agent/composer/choiceAnswer.ts:66 \u00B7 mobile/src/features/chat/choiceAnswer.ts:41 \u2014 the two spans are one implementation copied and then locally edited \u2014 343 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":"desktop/src/features/agent/composer/choiceAnswer.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18f2d627d4a88ea14d271601a99c2c7e189a516c8c6a2e99d8c54a40613d171"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemotePeersView.tsx:601 \u00B7 desktop/src/features/remote-peer/RemoteRenameDialog.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":"desktop/src/features/remote-peer/RemotePeersView.tsx"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5441dc1474713f59231bbea8a0321d478879d077d884e50b72c580cf0c2c3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (34 matched lines \u00D7 2 locations): desktop/src/features/agent/runtime/liveRunProjection.ts:594 \u00B7 desktop/src/features/agent/runtime/liveRunProjection.ts:746 \u2014 the two spans are one implementation copied and then locally edited \u2014 219 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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a02e3bc0a104bf84b056464d5bb2625df448883c3b3383a6142e708704d12a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRailMenus.tsx:162 \u00B7 desktop/src/components/layout/ActivityRailMenus.tsx:270 \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":"desktop/src/components/layout/ActivityRailMenus.tsx"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"75017ca0398e047a112d717423c8ea8e9320eda5224ff9937a3f93ad96b4f21e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): desktop/src/features/remote-peer/peerGlyphs.ts:48 \u00B7 mobile/src/remote/peerGlyphs.ts:48 \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":"desktop/src/features/remote-peer/peerGlyphs.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3bc1e1367617ac297c2c5f1a747a0bd3f2503ba9da67a19a57f6fd3165a229"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): desktop/src/features/remote-peer/mergeConversations.ts:409 \u00B7 packages/remote-client/src/catalogDelta.ts:20 \u2014 the two spans are one implementation copied and then locally edited \u2014 165 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbe2ce641a241c7b5483d12958dcfc6de1eda853b554b5d7bfc6e30c8cc13cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): desktop/src/lib/fontSize.ts:51 \u00B7 desktop/src/lib/replyDisplay.ts:45 \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":"desktop/src/lib/fontSize.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ebd3cb885341d4086fb81c9f74ebbe73b3854339418617afe609cd12b90a02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): desktop/src/components/layout/ActivityRailMenus.tsx:219 \u00B7 desktop/src/components/layout/ActivityRailMenus.tsx:320 \u2014 the two spans are one implementation copied and then locally edited \u2014 165 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":"desktop/src/components/layout/ActivityRailMenus.tsx"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1867025d6a9834bbd04d016dc8949e505ba834185fed3b720ded586858f5757"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): desktop/src/features/agent/ThinkingBlock.tsx:53 \u00B7 mobile/src/features/chat/messages/ThinkingRow.tsx:55 \u2014 the two spans are one implementation copied and then locally edited \u2014 214 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":"desktop/src/features/agent/ThinkingBlock.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb636fb4b902dbce687079b6e22999cb8f62d5fd8a73bd04a5b9ed342039474"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): desktop/src/features/git-history/LaneGraph.tsx:58 \u00B7 mobile/src/features/chat/components/GitGraphPanel.tsx:292 \u2014 the two spans are one implementation copied and then locally edited \u2014 155 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":"desktop/src/features/git-history/LaneGraph.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"356723c08ca8bc3553600b83f8934b41a569a9949acdafce6100b84b13523926"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): mobile/src/features/chat/components/SessionPicker.tsx:49 \u00B7 mobile/src/features/chat/components/SkillPicker.tsx:70 \u2014 the two spans are one implementation copied and then locally edited \u2014 298 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":"mobile/src/features/chat/components/SessionPicker.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70cbb9935c0ed54592aae111a4609ea826ffad999432891a3e3a88152f4fe3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (29 matched lines \u00D7 2 locations): packages/markdown/src/remarkLatexMath.ts:8 \u00B7 packages/markdown/src/remarkMathFence.ts:8 \u2014 the two spans are one implementation copied and then locally edited \u2014 188 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":"packages/markdown/src/remarkLatexMath.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1ff312060b87827bb20c5cffcc1632874379981e6908f7451c5f97612311d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRail.tsx:2474 \u00B7 desktop/src/components/layout/ActivityRail.tsx:2539 \u2014 all 2 copies are in the same file, 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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e47540c38f4c0c5ed0c034638316266b95387e43eff89b9710cf545729a4e7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (27 matched lines \u00D7 2 locations): desktop/src/features/agent/composer/useComposerAttachments.ts:77 \u00B7 desktop/src/features/agent/composer/useComposerAttachments.ts:140 \u2014 the two spans are one implementation copied and then locally edited \u2014 259 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":"desktop/src/features/agent/composer/useComposerAttachments.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"796b1f59a02bf6e12812961bcec78bf5bdda3bdb7b4d4beda2b68cb8618c655a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): desktop/src/features/settings/AccountPage.tsx:139 \u00B7 desktop/src/features/settings/AccountPage.tsx:166 \u2014 all 2 copies are in the same file, 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":"desktop/src/features/settings/AccountPage.tsx"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ac8453bb2fe6525b8d5c5a8958b25a847868935b6c08b346328b3d460dad74"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): mobile/src/features/chat/composer/ComposerToolbar.tsx:58 \u00B7 mobile/src/features/chat/composer/ComposerToolbar.tsx:85 \u2014 all 2 copies are in the same file, 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":"mobile/src/features/chat/composer/ComposerToolbar.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"18991ec611a44fbee6210ddf17b285123dee1d17738d250805a5cba59e383f8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRailSelectionToolbar.tsx:52 \u00B7 desktop/src/components/layout/ActivityRailSelectionToolbar.tsx:86 \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":"desktop/src/components/layout/ActivityRailSelectionToolbar.tsx"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"92829c0bfd365d6c7497468039acb194e6c0d247a03259f4745f5207d4f45c73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): desktop/src/features/agent/agentQueue.ts:84 \u00B7 mobile/src/remote/sessionQueue.ts:96 \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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e222cd24996c3cf85afb4e05e2a824e64b3f134cff1c4e46c8b5670f2f8963"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (26 matched lines \u00D7 2 locations): desktop/src/features/agent/replyBlocks.ts:18 \u00B7 mobile/src/features/chat/messages/ReplyBlocks.tsx:135 \u2014 the two spans are one implementation copied and then locally edited \u2014 185 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":"desktop/src/features/agent/replyBlocks.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ddc0356dc4d812f9f9feb0fea6cc2243f9ebb03da6e65c1e782dcea84edb98"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2 locations): mobile/shot/mock/parserSession.ts:262 \u00B7 mobile/shot/mock/parserSession.ts:317 \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":"mobile/shot/mock/parserSession.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42140e2d0d5261b060bf784aca758dd9336da6fae13566820262e8633d726d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3 locations): desktop/src/features/agent/composer/mentionDom.ts:31 \u00B7 desktop/src/features/agent/composer/mentionDom.ts:64 \u00B7 desktop/src/features/agent/composer/mentionDom.ts:96 \u2014 all 3 copies are in the same file, 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":"desktop/src/features/agent/composer/mentionDom.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"86db203308e061ede156ea2fce2afa84aaa09a8e1797e78f5fbb9d2c8ff92708"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): desktop/src/components/layout/AppShellDialogs.tsx:304 \u00B7 desktop/src/components/layout/EntityDialogs.tsx:119 \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":"desktop/src/components/layout/AppShellDialogs.tsx"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cef3dac8ce7b502317711376a6b4a23028ef647140916a2cfba9a0a5deb0a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (24 matched lines \u00D7 2 locations): desktop/src/components/layout/AppShellDialogs.tsx:187 \u00B7 desktop/src/components/layout/WorkspaceDialogs.tsx:68 \u2014 the two spans are one implementation copied and then locally edited \u2014 169 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":"desktop/src/components/layout/AppShellDialogs.tsx"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"235ae86cbac47ce32b2c9cf38d1b13c6876528dbcffc80f4cdfd72f4ae3a511d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): desktop/src/features/remote-peer/remotePromptOutbox.ts:249 \u00B7 desktop/src/features/remote-peer/remotePromptOutbox.ts:284 \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":"desktop/src/features/remote-peer/remotePromptOutbox.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e536a28c9ebdbc0016e4a13b610f76c2b4c13bb2f3701dd8b31469d19d4a6678"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): desktop/src/features/agent/MessageBlock.tsx:96 \u00B7 mobile/src/features/chat/messages/TimelineCard.tsx:63 \u2014 the two spans are one implementation copied and then locally edited \u2014 161 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":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef216f35b4486a9cab477b743e7472f00b8cabfad88c3df2c788c70c857b435"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): desktop/src/features/agent/runtime/liveRunProjection.ts:709 \u00B7 desktop/src/features/remote-peer/remoteRunStreams.ts:371 \u2014 the two spans are one implementation copied and then locally edited \u2014 123 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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0d88c08da6cd25586436dc582d0036f11364101634133b2d89d62c1035685d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (23 matched lines \u00D7 2 locations): mobile/src/features/chat/sessionCompletion.ts:12 \u00B7 mobile/src/features/chat/skillCompletion.ts:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 264 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":"mobile/src/features/chat/sessionCompletion.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3675aafa59dd64a7667e9d241844c313075ce945c1de0c8c9f9aeefc425955"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRail.tsx:2766 \u00B7 desktop/src/components/layout/RailChrome.tsx:69 \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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":2766}}}],"partialFingerprints":{"codehealthFindingId/v1":"757e58c3015237b197f9162aba76c63b420fd52273e20e1478805b9dd1efb307"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): desktop/src/components/layout/ArchiveGuideBubble.tsx:34 \u00B7 desktop/src/features/skills/SkillIntroBubble.tsx:29 \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":"desktop/src/components/layout/ArchiveGuideBubble.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f6ffc07e8f0e5a0ad784a0a6404aed7848e95b5419cc05fac9eac5ccef4793"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteConversationMenu.tsx:195 \u00B7 desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx:217 \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":"desktop/src/features/remote-peer/RemoteConversationMenu.tsx"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de2658143da7bc8e9177fb4f2a8e6e3aeace6bf07e7cd540c8f0e51313a05b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): desktop/src/features/remote-peer/useRemoteUsage.ts:82 \u00B7 desktop/src/integrations/agent/agentStateCache.ts:183 \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":"desktop/src/features/remote-peer/useRemoteUsage.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1de6909e992beae0a33992719cb2f975802e1718d0a01f39f28b1f4171c3698"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): scripts/skill_reco/suggest.mjs:280 \u00B7 scripts/skill_reco/suggest.mjs:340 \u2014 both copies are in the same file, so extract the block 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/skill_reco/suggest.mjs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e3c1ce3602e0af51958b1e7e136be11548429bd62ffdaeec0ae13131c50041"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRailMenus.tsx:396 \u00B7 desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx:196 \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":"desktop/src/components/layout/ActivityRailMenus.tsx"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"370e6111275fd051de1386f781b3dd638aca9ea62c9abd6ead7618e89761943e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): desktop/src/features/agent/MentionEditor.tsx:806 \u00B7 desktop/src/features/agent/MentionEditor.tsx:825 \u00B7 desktop/src/features/agent/MentionEditor.tsx:844 \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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c36cbcccffb23503bb1031af918c4dada82e0e67a78eaee2bb96ee67621821"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): harness/lib/cli-driver.mjs:305 \u00B7 harness/lib/remote-driver.mjs:109 \u2014 the two spans are one implementation copied and then locally edited \u2014 115 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":"harness/lib/cli-driver.mjs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"13588980dd94bc84e5aa58a73478492ba9b12f3926fe9612738a07882d68c0bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): mobile/src/screens/archiveAction.ts:79 \u00B7 mobile/src/screens/archiveAction.ts:118 \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":"mobile/src/screens/archiveAction.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"988ff66443cb4d569159a398e931f9ee67b1a7f6ff27fd6edbad558b4bc1c00b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): packages/thread-projection/src/liveApply.ts:351 \u00B7 packages/thread-projection/src/liveApply.ts:420 \u2014 the two spans are one implementation copied and then locally edited \u2014 113 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e27fdc360d0cf07732843016dee7157187038fdbc4c5475b9918eac782a7e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRail.tsx:2168 \u00B7 desktop/src/components/layout/ActivityRail.tsx:2330 \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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":2168}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd1633bab62f50530fc835a798280dc9f64934d3ed3d2576188b74c5f710cfc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRailMenus.tsx:29 \u00B7 desktop/src/components/layout/ActivityRailMenus.tsx:95 \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":"desktop/src/components/layout/ActivityRailMenus.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"941c8070659424c05d7a8b5bbfb112d3420ffd68c9eac751fadd503968dd6505"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): desktop/src/components/layout/ConversationSearch.tsx:30 \u00B7 desktop/src/components/ui/Overlay.tsx:20 \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":"desktop/src/components/layout/ConversationSearch.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"333414b8298a7144cd161475604d485422df33aa0de976e32b7b33bc5cd0f4a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): desktop/src/components/layout/hooks/useAppStartup.ts:19 \u00B7 packages/remote-client/src/transfer.ts:98 \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":"desktop/src/components/layout/hooks/useAppStartup.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d612b08fc62df88446b01e4f178d3d320d55933c04ed325367ec59b2df2500aa"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): desktop/src/features/skills/SkillsView.tsx:407 \u00B7 desktop/src/features/skills/SkillsView.tsx:529 \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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fd383fd5145d822ac7d1870888aa16de319bf5abf019f8b3251509de6ed9a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): harness/lib/analyze.mjs:831 \u00B7 harness/lib/discovery.mjs:122 \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":"harness/lib/analyze.mjs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a9941add09c3a0252d7ae92e92c01073467dbe970131b98506c8580fa64f58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): harness/lib/relay-fixture.mjs:144 \u00B7 harness/lib/remote-live.mjs:168 \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":"harness/lib/relay-fixture.mjs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52497644e1fad58b75cdd21a6d734733418dc1b650b35785cb4c790c4572ba4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): mobile/shot/mock/parserSession.ts:241 \u00B7 mobile/shot/mock/parserSession.ts:296 \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":"mobile/shot/mock/parserSession.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"860272d76be2d4a5f4a817da0c58102eafe8833ccd4a3ab84b6277e25d253144"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): mobile/src/features/chat/components/ChoiceSheet.tsx:31 \u00B7 mobile/src/features/chat/components/SendChoiceSheet.tsx:32 \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":"mobile/src/features/chat/components/ChoiceSheet.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cb6a060d6286ef837c889ee9fa2d39bee446ef8855f5d28f4d0a9d112798b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (18 matched lines \u00D7 2 locations): mobile/src/features/settings/SkillsSettingsPage.tsx:45 \u00B7 mobile/src/features/settings/TasksSettingsPage.tsx:528 \u2014 the two spans are one implementation copied and then locally edited \u2014 77 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":"mobile/src/features/settings/SkillsSettingsPage.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8870274657f26a484ef4a82139a33b67604967c29118fba5a62bcb2859ebec71"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): desktop/src/components/layout/hooks/useApprovals.ts:41 \u00B7 desktop/src/components/layout/hooks/usePendingApprovalCounts.ts:23 \u2014 the two spans are one implementation copied and then locally edited \u2014 97 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":"desktop/src/components/layout/hooks/useApprovals.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae1b0705d4b8e857c319537518e30f6aa51118cf340c1bbaedb952af46ae358"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): desktop/src/features/remote-peer/mergeConversations.ts:968 \u00B7 mobile/src/screens/sessionTree.ts:189 \u2014 the two spans are one implementation copied and then locally edited \u2014 131 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b3a0a6060dd523cff2f4695b5a8d0e705e60dcda82902ccc4f255467c0a3e1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): mobile/src/screens/SessionList.tsx:685 \u00B7 mobile/src/screens/SessionList.tsx:750 \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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad73b0f11ec1c9e6e99d4cf613cbab210f03f996e5f67e612c3c07568c72cf9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): mobile/src/screens/SessionList.tsx:1059 \u00B7 mobile/src/screens/SessionList.tsx:1282 \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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"265052afc3c0a74e3f5949dfc3a9497cd8c5c35a1ed43cfd4630c6c75a82843e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): desktop/src/features/agent/agentQueue.ts:199 \u00B7 desktop/src/features/remote-peer/remoteQueue.ts:160 \u00B7 mobile/src/remote/sessionQueue.ts:242 \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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac4a17e88cd4fb9eaa979609a36df2655bab9dd94896ed649c02d8e95ca93eca"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): desktop/src/features/agent/composer/MentionMenus.tsx:35 \u00B7 desktop/src/features/agent/composer/MentionMenus.tsx:168 \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":"desktop/src/features/agent/composer/MentionMenus.tsx"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82e1e71bdbb88a6bcd67e2b3f4d7c36b7792894d47eb7bb7004497e4b4753b9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteConversationMenu.tsx:101 \u00B7 desktop/src/features/remote-peer/RemoteWorkspaceRenameDialog.tsx:45 \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":"desktop/src/features/remote-peer/RemoteConversationMenu.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac353a5150a12cca812a6085b8fed946c6eedcf7ff35b012a8786a7665ac0ed5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteModelsPanel.tsx:32 \u00B7 desktop/src/features/remote-peer/RemoteTasksView.tsx:35 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 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":"desktop/src/features/remote-peer/RemoteModelsPanel.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"311f22e6a98aec140f9f635d53744cb128ce94c81121ef46b1db1b7dc9a0d794"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): desktop/src/lib/date.ts:23 \u00B7 mobile/src/features/settings/TasksSettingsPage.tsx:315 \u2014 the two spans are one implementation copied and then locally edited \u2014 86 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":"desktop/src/lib/date.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e9de260927944dcb824742fb5bdee44c29c60598d05d1a3530b885fe69590e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): harness/lib/dev-server.mjs:82 \u00B7 harness/lib/relay-fixture.mjs:94 \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":"harness/lib/dev-server.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ab7c9aeb32a3f255b5319eec1b0abd237decc25894f3918412add842f738ad"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): harness/lib/relay-fixture.mjs:34 \u00B7 harness/lib/remote-live.mjs:46 \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":"harness/lib/relay-fixture.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"546452571ccf1b0479b022ff76eac6a4744b3e89237188eb5b355ee63c9aaf21"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): mobile/src/features/chat/components/GitGraphPanel.tsx:111 \u00B7 mobile/src/features/chat/components/SessionFilesPanel.tsx:55 \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":"mobile/src/features/chat/components/GitGraphPanel.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e25d831fc70945fda3836b136c8ff186597b3e8ed17258490b97e9706b56b73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (16 matched lines \u00D7 2 locations): mobile/src/features/chat/components/RenameModal.tsx:117 \u00B7 mobile/src/screens/PairingScreen.tsx:349 \u2014 the two spans are one implementation copied and then locally edited \u2014 90 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":"mobile/src/features/chat/components/RenameModal.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cfffb83c72811f0fd4ae0cc87194f42b686e4dc494e23f51bcb267ac2be432"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): packages/markdown/src/remarkAutolinkBoundary.ts:108 \u00B7 packages/markdown/src/remarkUnclosedLink.ts:55 \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":"packages/markdown/src/remarkAutolinkBoundary.ts"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"de572366b5f434fa75d98578934be2d7666d29b9417786ae8703c9213b845d20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): desktop/src/features/agent/useSendMessage.ts:73 \u00B7 desktop/src/features/agent/useSendMessage.ts:176 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"desktop/src/features/agent/useSendMessage.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3d53df7844ed138aa98ee4564259a16c08d7d591e26592b0b264c9942514ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteWorkspaceCreateDialog.tsx:85 \u00B7 desktop/src/features/remote-peer/RemoteWorkspacesPanel.tsx:137 \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":"desktop/src/features/remote-peer/RemoteWorkspaceCreateDialog.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b047fad2e8b231f9e9029c2b73059beee52fe19e59c40e3c2d027b3fcb0e33d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): desktop/src/features/settings/GeneralPage.tsx:75 \u00B7 desktop/src/features/settings/GeneralPage.tsx:98 \u00B7 desktop/src/features/settings/GeneralPage.tsx:115 \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":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e486dc0f2c98efef573cb85535a5945bf5e8ad9e5ccc33cb2638bc1fc7d4fc73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): harness/lib/relay-fixture.mjs:111 \u00B7 harness/lib/remote-live.mjs:151 \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":"harness/lib/relay-fixture.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"714f39bb78c93eb978c532e94afe3a2fdac4f4e7fca6197974e3c9b71ac40539"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): harness/lib/remote-cn.mjs:182 \u00B7 harness/lib/remote-mobile-live.mjs:348 \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":"harness/lib/remote-cn.mjs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc0830377d7ca43be8e8a3b437ccb4222b42e0aa7a7757ad2de8561439c25a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): mobile/src/features/chat/files/useChatFiles.ts:243 \u00B7 mobile/src/features/chat/files/useChatFiles.ts:575 \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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0839e460c16e61151625a528b9a25bbcedf2a22e2ba04ec5b4360283eb420a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (15 matched lines \u00D7 2 locations): packages/remote-client/src/client.ts:709 \u00B7 packages/remote-client/src/client.ts:851 \u2014 the two spans are one implementation copied and then locally edited \u2014 113 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":"packages/remote-client/src/client.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d8c04e57540ce7f4961328ce6e927cbe53c555cc541ebea52b019a50e4cb9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): desktop/src/features/agent/MentionEditor.tsx:644 \u00B7 desktop/src/features/agent/MentionEditor.tsx:674 \u2014 both copies are in the same file, so extract the block 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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"4def39db1bd245f6cbc02d5b1b29c789e5d84d32ca54ea95e05494239dc3f55b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemotePeersView.tsx:139 \u00B7 desktop/src/features/remote-peer/RemotePeersView.tsx:157 \u2014 both copies are in the same file, so extract the block 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":"desktop/src/features/remote-peer/RemotePeersView.tsx"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"273f3117c88e260b7f14fcf710942a7355e9c77d817b6b7cc11dfa074b30512b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): desktop/src/features/remote-peer/remotePromptOutbox.ts:160 \u00B7 desktop/src/features/remote-peer/remotePromptOutbox.ts:191 \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":"desktop/src/features/remote-peer/remotePromptOutbox.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b16e150465cd21c9318e8084ee10a4663ee2335af5e6833521ab878217ec4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): desktop/src/features/remote/RemoteView.tsx:384 \u00B7 desktop/src/features/remote/RemoteView.tsx:400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote/RemoteView.tsx"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24d0a7fae4c187fd4104b29f2a2a583a83df9d627e8afa4c9d1912420024119"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): desktop/src/features/settings/ProvidersPage.tsx:192 \u00B7 desktop/src/features/settings/ProvidersPage.tsx:322 \u2014 the two spans are one implementation copied and then locally edited \u2014 100 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":"desktop/src/features/settings/ProvidersPage.tsx"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f8e3670b8d7f336bfcb2e012e766c7734e6b63e04c0745798ff9fd16982086"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): harness/lib/remote-live.mjs:96 \u00B7 harness/lib/remote-mobile-live.mjs:380 \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":"harness/lib/remote-live.mjs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e982c68ae10ecde24ce4936812e140f6b9a551ef74189741a758324810c7999"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): harness/lib/remote-live.mjs:187 \u00B7 harness/lib/remote-live.mjs:313 \u2014 both copies are in the same file, so extract the block 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":"harness/lib/remote-live.mjs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"26aa6d905faa4f2dd252b43b84bd568f1c96a13a2203a8dd8bc5f6d743caadb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): mobile/src/features/settings/TimeField.tsx:62 \u00B7 mobile/src/features/settings/TimezoneField.tsx:51 \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":"mobile/src/features/settings/TimeField.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"10aad53c4481d29a6e5351a23a84acd679400298d26fe6cedbf0fbcba0a4418f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): mobile/src/remote/useSessionCatalog.ts:800 \u00B7 mobile/src/remote/useSessionCatalog.ts:820 \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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"584c8e7667892445af5435c02bfbc53d270405b0612b92e243b105afcd519004"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (14 matched lines \u00D7 2 locations): mobile/src/screens/archiveAction.ts:26 \u00B7 packages/remote-client/src/transfer.ts:159 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"mobile/src/screens/archiveAction.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d066f92d0f19923fb624ffbe952d740ff981edc8b37ab143ec7ae77f346061"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): packages/markdown/src/parseFutureMarkdown.ts:363 \u00B7 packages/markdown/src/parseFutureMarkdown.ts: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":"packages/markdown/src/parseFutureMarkdown.ts"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb184361ba9bebfe3f78f9a93112c9b9500a7ff05f91019be8ee141455bed66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/screenshots/injects/choice-card-lib.js:36 \u00B7 scripts/screenshots/injects/choice-card-mobile-lib.js:25 \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/screenshots/injects/choice-card-lib.js"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"128b7ae302e38f562ecfe9c082ffce5a9ae003fe3127511aaf28c6e86da03409"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/screenshots/injects/choice-card-lib.js:272 \u00B7 scripts/screenshots/injects/choice-card-lib.js:350 \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/screenshots/injects/choice-card-lib.js"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0be2cbc500595c3af70b364d3283db088d400f3f80dd2b5285c6a686b0e3ed3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): scripts/screenshots/injects/choice-card-v3-queue-desktop.js:69 \u00B7 scripts/screenshots/injects/choice-card-v3-queue-mobile.js:58 \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":"scripts/screenshots/injects/choice-card-v3-queue-desktop.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba48cd957974e53f21a35bb1040ab54e488681116c27942b23ba7e283c36aa6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): desktop/src/features/agent/AgentThread.tsx:311 \u00B7 desktop/src/features/remote-peer/RemoteConversationView.tsx:367 \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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc33d71525a3c663052c2452c93274a089011d7c54ccc7a7d3053bc01e4eb884"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): desktop/src/features/agent/composerDraft.ts:47 \u00B7 desktop/src/features/remote-peer/remoteComposerDraft.ts:49 \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":"desktop/src/features/agent/composerDraft.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"f035e502ecd71e0971a5df76c6d7ff825be79e1160eacd32fa528a2c864e8743"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): desktop/src/features/agent/questionNav.ts:29 \u00B7 mobile/src/features/chat/questionNav.ts:44 \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":"desktop/src/features/agent/questionNav.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f68ea25f351605bd1744c085154856b04e7279d7cdf22cdc985799bb9b801a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteFilesDialog.tsx:24 \u00B7 desktop/src/features/remote-peer/RemoteUsageDialog.tsx:18 \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":"desktop/src/features/remote-peer/RemoteFilesDialog.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db025ef8b066f6f0a864b3381d70036c4f770c7225ee8d626469a0691eb1df0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): desktop/src/features/remote-peer/mergeConversations.ts:661 \u00B7 mobile/src/remote/mergeSessions.ts:77 \u2014 the two spans are one implementation copied and then locally edited \u2014 81 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6145d7b30d217096d09747c71be1f32360e29da2b64fbdba9e165822db9ea22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): desktop/src/features/remote-peer/useRemoteApprovals.ts:153 \u00B7 desktop/src/features/remote-peer/useRemoteTimeline.ts:995 \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":"desktop/src/features/remote-peer/useRemoteApprovals.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"be062da57aef7732161ce52d93155fd1f84f3aa431d4d778c6fc55d837a0525c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): desktop/src/features/runs/toolInput.ts:11 \u00B7 packages/thread-projection/src/group.ts:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 67 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":"desktop/src/features/runs/toolInput.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f39cbd3e25384b2614388ebd0a65718d648c79e1987469e0ad6f546e29a4b8b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): desktop/src/features/vibe/AddToVibeDialog.tsx:132 \u00B7 desktop/src/features/vibe/AddToVibeDialog.tsx:152 \u2014 both copies are in the same file, so extract the block 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":"desktop/src/features/vibe/AddToVibeDialog.tsx"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"95309fbffde8ebf6c0ae3d9b324dddd4f1bcf60c8f1f50b9f80876385a320279"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3 locations): desktop/src/lib/fontSize.ts:32 \u00B7 desktop/src/lib/replyDisplay.ts:32 \u00B7 desktop/src/lib/theme.ts:72 \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":"desktop/src/lib/fontSize.ts"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30a4e7d11ef119c492ac18dcda0f963ceb05709296b3f27f342947d0d8c23c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): mobile/src/config/environment.ts:45 \u00B7 mobile/src/config/environment.ts:63 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"mobile/src/config/environment.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b349e78bf2bcadf44afb1a598e41f876381a993c6e2f89ed5c74be20d55db8f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): mobile/src/features/settings/SettingsScreen.tsx:365 \u00B7 mobile/src/screens/PairingScreen.tsx:304 \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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b76c6d7dfba1b7e98af165f850f2dda71d563d8fad0430ad1f82582c2ce410e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): mobile/src/screens/SessionList.tsx:1489 \u00B7 mobile/src/screens/SessionList.tsx:1505 \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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f798bbff04b7c1e208b4e5790851b542d13ed48d2f75bd2e7b8ee4584a7bfc20"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/components/layout/threadTree.ts:75 \u00B7 mobile/src/screens/sessionTree.ts:40 \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":"desktop/src/components/layout/threadTree.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0c33bb3074a88ed1e52d3d9bf02760318ac3544b04a70ababd8a5aa895406c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/agent/ApprovalPrompt.tsx:128 \u00B7 desktop/src/features/agent/ApprovalPrompt.tsx:148 \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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf1f40560f6e11cebd486a0615eca3866554db0cb3e6dc08ea48c24d04e5b90"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/agent/composer/ComposerControls.tsx:334 \u00B7 desktop/src/features/remote-peer/RemoteConversationSettings.tsx:146 \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":"desktop/src/features/agent/composer/ComposerControls.tsx"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3145c42edfdf01640c80d62d3ff538fd621c2e9f88ae32cb478927634120f4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/agent/composer/MentionMenus.tsx:21 \u00B7 desktop/src/features/agent/composer/MentionMenus.tsx:156 \u2014 both copies are in the same file, so extract the block 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":"desktop/src/features/agent/composer/MentionMenus.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6664695ff9424f7c4741157086502735a9fc6fadc7b3c8b55c6dba45260a0441"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): desktop/src/features/agent/sendPipeline.ts:274 \u00B7 desktop/src/features/agent/sendPipeline.ts:369 \u00B7 desktop/src/features/agent/sendPipeline.ts:411 \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":"desktop/src/features/agent/sendPipeline.ts"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e3a5c8ab88d31cba8ee2b855dd3309e1cea7e6c2ddf6455315103467ced92b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/agent/slashMenu.ts:5 \u00B7 desktop/src/features/remote-peer/remoteCommands.ts:70 \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":"desktop/src/features/agent/slashMenu.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"393182d8fa8034ca7b082b4f2e6aa39307b11ca7685615e6b21f4055eba36967"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/filepreview/JsonPreview.tsx:27 \u00B7 desktop/src/features/filepreview/MarkdownPreview.tsx:29 \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":"desktop/src/features/filepreview/JsonPreview.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b09543bc8d5c16ddf097739e99847d29adfe79dbc852cf7765e498dc969ab6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): desktop/src/features/markdown/renderers/FutureEmbed.tsx:17 \u00B7 desktop/src/features/markdown/renderers/ReferenceChip.tsx:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 65 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":"desktop/src/features/markdown/renderers/FutureEmbed.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9a439e6f248e6793b301ca459e8359a9f731b258e4ff105876ac4e211dfb00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/markdown/renderers/ObjectEmbed.tsx:57 \u00B7 desktop/src/features/markdown/renderers/RunEmbed.tsx:45 \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":"desktop/src/features/markdown/renderers/ObjectEmbed.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1722152d73f8fa0d6fa1216027313fa1bcfcc4c1090d82c5c6361af16fea6f51"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteSkillsPanel.tsx:125 \u00B7 desktop/src/features/remote-peer/RemoteSkillsPanel.tsx:144 \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":"desktop/src/features/remote-peer/RemoteSkillsPanel.tsx"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b66a27fea3a31bfaad10678b16834d8e7a8939e68cf49b0cd972f65ee0f0643"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/remote-peer/remotePeerClient.ts:862 \u00B7 packages/remote-protocol/src/types.ts:388 \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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed0f98bd13b48f6373bf5da338fdc0f80175dac0d1354ee6c514a71d59a80b8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/remote-peer/remotePeerClient.ts:1190 \u00B7 desktop/src/features/remote-peer/remotePeerClient.ts:1237 \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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec58619e1dfeb75db927df4da208d315e105e9ddbe01f0d201996b1b91a246fb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): desktop/src/features/remote/RemoteHubView.tsx:183 \u00B7 desktop/src/features/skills/SkillsView.tsx:277 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"desktop/src/features/remote/RemoteHubView.tsx"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbf3ac942de46b156aab619b64a9753a3be28ae684ffc7f33870ed965075777"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): desktop/src/features/settings/ProvidersPage.tsx:323 \u00B7 desktop/src/features/settings/ResetPage.tsx:85 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"desktop/src/features/settings/ProvidersPage.tsx"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e81992b45cfafd6b6a98ddbb4c698a4a54cde1fa6049dbaef3b245aeb3e4389"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/skills/SkillsView.tsx:198 \u00B7 desktop/src/features/skills/SkillsView.tsx:232 \u2014 both copies are in the same file, so extract the block 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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4165e5ce9e03b4837cc4f779b9a2d1380c80c57b31d4c314dc329275e0f9fa5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): desktop/src/features/tasks/TasksView.tsx:810 \u00B7 desktop/src/features/tasks/TasksView.tsx:845 \u2014 all 2 copies are in the same file, 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"6030abc843661f670ff633b9c9142ce7e5ca5ddc52ac8c3a78c1f40bfc854d6a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): mobile/src/components/SelectionSheet.tsx:49 \u00B7 mobile/src/features/chat/components/SessionUsageSheet.tsx:71 \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":"mobile/src/components/SelectionSheet.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2728d17fedfcd153aab7c7a8f53778f1cb75cc8c552c2d808035d698be9129d7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): mobile/src/components/codeHighlight.ts:243 \u00B7 mobile/src/remote/fileTypes.ts:268 \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":"mobile/src/components/codeHighlight.ts"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd505678bd029b2bf9ae438f8816001dd3c2bf95fa989bc76420ac1bf3a3e41"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): mobile/src/features/chat/components/ChoiceSheet.tsx:62 \u00B7 mobile/src/features/chat/components/SendChoiceSheet.tsx:56 \u00B7 mobile/src/features/chat/components/SessionUsageSheet.tsx:84 \u2014 the 3 copies are spread across 3 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":"mobile/src/features/chat/components/ChoiceSheet.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b26132d326932dfe119706b79e68c4ef1e262440b14d67cb7698a2381260341"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): mobile/src/features/chat/components/GitGraphPanel.tsx:208 \u00B7 mobile/src/features/chat/components/SessionFilesPanel.tsx:144 \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":"mobile/src/features/chat/components/GitGraphPanel.tsx"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"b666abcfee02ca6df264d692fa115afc42e1a5a830f17a581a0e5aa4feb728a4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): mobile/src/remote/usePromptOutbox.ts:553 \u00B7 mobile/src/remote/usePromptOutbox.ts:678 \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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86d0ca57de941cff17642e864b725585dfa0b53a63d4496c205865e0bd00489"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): packages/remote-client/src/projection.ts:846 \u00B7 packages/remote-client/src/projection.ts:1050 \u2014 all 2 copies are in the same file, 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e8a42627643cba814d01791022ee6da4b0763be61d1d2bad77affa0a63a180"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRailMenus.tsx:73 \u00B7 desktop/src/components/layout/ActivityRailMenus.tsx:120 \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":"desktop/src/components/layout/ActivityRailMenus.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c513dfd3788e88bb92f70643211610047d3f5a92f392f76877e43412f693bf11"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/components/layout/AppShell.tsx:2113 \u00B7 mobile/src/features/chat/ChatScreen.tsx:1086 \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":"desktop/src/components/layout/AppShell.tsx"},"region":{"startLine":2113}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ebb914c96a1f8ccb971894a0c7094fe8f71bcd50e85f9cf188651d29825fc4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/components/layout/ContextPanel.tsx:381 \u00B7 desktop/src/features/remote-peer/RemoteFilesPanel.tsx:348 \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":"desktop/src/components/layout/ContextPanel.tsx"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19190b012986447cc161427a2496f5f23c2a22173b9410d804c3a39e8595fb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): desktop/src/components/layout/hooks/useRemotePeers.ts:563 \u00B7 desktop/src/features/remote-peer/remoteHostCatalog.ts:176 \u00B7 desktop/src/features/remote-peer/useRemoteApprovals.ts:88 \u00B7 desktop/src/features/remote-peer/useRemoteConversationSettings.ts:339 \u2014 the 4 copies are spread across 4 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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d7cd0bebba80568418cd6a0876f8d30d12e5c63b4a2a2d6d59232468cacce8d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/components/layout/hooks/useThreadDialogs.ts:317 \u00B7 desktop/src/components/layout/hooks/useThreadDialogs.ts:365 \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":"desktop/src/components/layout/hooks/useThreadDialogs.ts"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f72075fd01deb774fd086de292965d0169a5af65601d84dec7030b0a5cab39d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/agent/AgentThread.tsx:789 \u00B7 desktop/src/features/remote-peer/RemoteComposer.tsx:1340 \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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ffe4802033671760168e576f3ff1dc63e0f3986477a4c480089a6665f71f6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/agent/Composer.tsx:571 \u00B7 desktop/src/features/agent/Composer.tsx:663 \u2014 both copies are in the same file, so extract the block 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f60ea718c9f82e8e7f9a4f94f465ea0346be43f184ba27de468ef13c8f03bf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/agent/FusionActivity.tsx:39 \u00B7 mobile/src/features/chat/messages/FusionToolRow.tsx:28 \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":"desktop/src/features/agent/FusionActivity.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c982e8b2cdfdf418ef2b6ce5468b6c4354c35f82601556c067f2c3c96be4652"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/agent/NewConversation.tsx:194 \u00B7 desktop/src/features/skills/SkillGuideStrip.tsx: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":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3600912528956c142f2496d5044e00744419ae698f2833674faa5c602f3b9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/agent/composer/MentionMenus.tsx:70 \u00B7 desktop/src/features/agent/composer/MentionMenus.tsx: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":"desktop/src/features/agent/composer/MentionMenus.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31911aaa23c971deb5c3c3f3b469a1d2ce1be24767b6a97e6b3b3ad2b7602bf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/agent/history/loadThreadHistory.ts:52 \u00B7 desktop/src/features/agent/history/loadThreadHistory.ts:71 \u2014 both copies are in the same file, so extract the block 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":"desktop/src/features/agent/history/loadThreadHistory.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f67976441ec1c7478818edda96d8a31489c687d8a04b86fb799f9aae77fa028"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/agent/sessionMention.ts:95 \u00B7 desktop/src/features/remote-peer/remoteSessionReference.ts:89 \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":"desktop/src/features/agent/sessionMention.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fceda0f334e1ddc3026af9d7b2e4387c78a3a41f7507581ce30580fc187abd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteConversationMenu.tsx:130 \u00B7 desktop/src/features/remote-peer/RemoteConversationMenu.tsx:151 \u2014 all 2 copies are in the same file, 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":"desktop/src/features/remote-peer/RemoteConversationMenu.tsx"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6feb6ff2190c5992a373f6db51a8172ae7987a8f07151ca6f9677b6946cbd9b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx:144 \u00B7 desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx:166 \u2014 all 2 copies are in the same file, 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":"desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b205a04865101167b1e178224a0a47849e62e545e569823d418e03b990ee0d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/remote-peer/remotePeerClient.ts:565 \u00B7 desktop/src/features/remote-peer/remotePeerClient.ts:622 \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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c3b332b2a75355b628bd30dbe14c71b4b69278d2a3e938c6221a30ed5a8c23"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): desktop/src/features/settings/CustomProviderDialog.tsx:702 \u00B7 desktop/src/features/settings/CustomProviderDialog.tsx:713 \u00B7 desktop/src/features/settings/CustomProviderDialog.tsx:724 \u00B7 desktop/src/features/settings/CustomProviderDialog.tsx:735 \u2014 all 4 copies are in the same file, 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"096a243d50f5b5003c8e3a50346c7a0ed3482e11ae26d005c3c5c12e44b5fdb5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): desktop/src/features/terminal/useTerminalTabs.ts:216 \u00B7 desktop/src/features/terminal/useTerminalTabs.ts:272 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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":"desktop/src/features/terminal/useTerminalTabs.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e38db14da79a089485a6398eb5c195db5cf3bcaa8413f3593f8ea142702b14c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/vibe/AddToVibeDialog.tsx:145 \u00B7 desktop/src/features/vibe/AddToVibeDialog.tsx:166 \u2014 all 2 copies are in the same file, 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":"desktop/src/features/vibe/AddToVibeDialog.tsx"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3960463e73d73903571008d80b581970fda8a3b6d612bfcee3d6a4e4a64aa8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/features/vibe/VibeStage.tsx:654 \u00B7 desktop/src/features/vibe/VibeStage.tsx:1360 \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":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54045e4c9642cbfae1bd0554b816f40cfe11e854284382c8e1350d3c70ae3d0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): desktop/src/integrations/storage/historyTransfer.ts:22 \u00B7 packages/thread-projection/src/cooperativeJson.ts:21 \u2014 the two spans are one implementation copied and then locally edited \u2014 73 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":"desktop/src/integrations/storage/historyTransfer.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f124487cf1fa468754e4c0bc90c24cf27dea9530834ba2e5dd6f81582c2e2885"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): desktop/src/lib/workspacePath.ts:28 \u00B7 packages/thread-projection/src/utils.ts:19 \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":"desktop/src/lib/workspacePath.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"94898084274c979a3a7eb7f131196eabc877cd394fab8682f7248e78ede519ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): harness/lib/dev-server.mjs:51 \u00B7 harness/lib/remote-live.mjs:33 \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":"harness/lib/dev-server.mjs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2967dec3978d55eb358536c7c31fd90ee537ae2a7ca5a863076461cb0b8a5244"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): mobile/src/components/ActionMenu.tsx:161 \u00B7 mobile/src/features/chat/components/SendChoiceSheet.tsx:89 \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":"mobile/src/components/ActionMenu.tsx"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba0a63a5a6d8e997e9e8470ef536e60bb24e4ad911bc69763a43dd3edb9cebb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): mobile/src/features/chat/messages/TimelineCard.tsx:262 \u00B7 mobile/src/features/chat/messages/TimelineCard.tsx:281 \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":"mobile/src/features/chat/messages/TimelineCard.tsx"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adcc0bd71da832427f5c4afadc420f9520cbda62ea51d7435343f910fe9ea42"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): mobile/src/remote/useConversationController.ts:494 \u00B7 mobile/src/remote/useConversationController.ts:516 \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":"mobile/src/remote/useConversationController.ts"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"95fbc86d97c2750d6c9fbcc2b986403fa978a3f99243c18e88614288cf3b405f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): mobile/src/screens/DesktopsScreen.tsx:145 \u00B7 mobile/src/screens/PairingScreen.tsx:226 \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":"mobile/src/screens/DesktopsScreen.tsx"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c386a4999e8cc10e163252b1f919d1bc4b9bf26e2661a25a0c696eb8fd3d46b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): mobile/src/theme/AppearanceSettings.tsx:46 \u00B7 mobile/src/theme/AppearanceSettings.tsx:62 \u00B7 mobile/src/theme/AppearanceSettings.tsx:85 \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":"mobile/src/theme/AppearanceSettings.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2117916af0eab6b38befc873034d49c6a6bbc6f4f2c912ccb6e868aaf2f11aa9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): desktop/shot/mock/core.ts:94 \u00B7 harness/lib/run.mjs:67 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"desktop/shot/mock/core.ts"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5cfbf7e504109746232f09b368cbb87f925260b77936e90f4a5a7183e83c80"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4 locations): desktop/src/components/layout/ActivityRailMenus.tsx:152 \u00B7 desktop/src/components/layout/ActivityRailMenus.tsx:260 \u00B7 desktop/src/components/layout/ActivityRailMenus.tsx:354 \u00B7 desktop/src/components/layout/ArchivedRows.tsx:48 \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":"desktop/src/components/layout/ActivityRailMenus.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7775d5a39bb4972c9b95e24dc81351381fa385cbc80cda61e9daddae7912c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): desktop/src/components/layout/hooks/useLeftPanelWidth.ts:41 \u00B7 desktop/src/components/layout/hooks/useRightPanelWidth.ts:81 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 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":"desktop/src/components/layout/hooks/useLeftPanelWidth.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6fceae21dca9d5657d32a94c3e236dbbb75826a815db5da3ea7fca86113f2d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): desktop/src/features/agent/NewConversation.tsx:342 \u00B7 desktop/src/features/remote-peer/RemoteDraftTargetChooser.tsx:101 \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":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d39f0b4dc2c6397c62aefc3ab0c681a9a5f5e550db8ebb1e32a109df9415ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): desktop/src/features/agent/SendQueuePanel.tsx:80 \u00B7 desktop/src/features/agent/composer/choiceAnswer.ts:93 \u00B7 mobile/src/features/chat/choiceAnswer.ts:68 \u2014 the 3 copies are spread across 3 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":"desktop/src/features/agent/SendQueuePanel.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbf3b1a39701b9a4c3aad8ac270a7d629935f46e4559af82c50ae04bdc92a8c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): desktop/src/features/agent/composer/SendChoiceMenu.tsx:45 \u00B7 desktop/src/features/vibe/VibeMenu.tsx:45 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"desktop/src/features/agent/composer/SendChoiceMenu.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54a060d8766e8c2dadf53a9baee167d9d8a0701b0acdf0d7cf8e9423a52877d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): desktop/src/features/filepreview/ImagePreview.tsx:69 \u00B7 desktop/src/features/filepreview/TextPreview.tsx:34 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"desktop/src/features/filepreview/ImagePreview.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac13e4fc9f1b7aea91981ee234f024d0106afa3e9e87317e8f65871d5ee7393b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): desktop/src/features/keyboard/useDispatcher.ts:36 \u00B7 desktop/src/features/terminal/useTerminalPanel.ts:212 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"desktop/src/features/keyboard/useDispatcher.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd1b93bcd3ee66cf33759e2b78cacb3ec02af9f5c738a238c85604c5b7e0fe3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): desktop/src/features/settings/CustomProviderDialog.tsx:609 \u00B7 desktop/src/features/settings/CustomProviderDialog.tsx:619 \u2014 all 2 copies are in the same file, 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"4261f27b9fe7139c8d43021af3149962b63626eda3a1737faee07e1b94d67993"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): desktop/src/integrations/agent/agentStateCache.ts:91 \u00B7 mobile/src/share/shareInbox.ts:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 63 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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9ad0f17db131350478f6d81bc2d59be51fbea51667d35c7ccd6258421f7d4b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): desktop/src/lib/useOperationLifetime.ts:5 \u00B7 mobile/src/features/chat/useAttachmentPicker.tsx:48 \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":"desktop/src/lib/useOperationLifetime.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3daeb4b4afe629564c3277941f33be9240eea01b7413d3070f93eadcd8dc12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): harness/lib/relay-fixture.mjs:213 \u00B7 harness/lib/remote-live.mjs:317 \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":"harness/lib/relay-fixture.mjs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"831f86458f04df8181f2360695ebbdcc444d4951f4e8efbc9f5fe7c0fed003ee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): mobile/src/components/DialogSurface.tsx:13 \u00B7 mobile/src/lib/useKeyboardHeight.ts:19 \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":"mobile/src/components/DialogSurface.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"789b33bbd776eae06e78214ee91af126e7ae0476fccf3e2f1eedcd7791a7b3f0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): mobile/src/features/chat/components/GitGraphPanel.tsx:193 \u00B7 mobile/src/features/chat/components/SessionFilesPanel.tsx:135 \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":"mobile/src/features/chat/components/GitGraphPanel.tsx"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a7749eae17a7cef35becef921a12b713b036b075e6a1837777368de94741cf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): mobile/src/features/chat/files/useChatFiles.ts:197 \u00B7 mobile/src/features/chat/files/useChatFiles.ts:297 \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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb4505894c9aef3dd0cf4b3f416ed9a5c3fb3255f89c3c5e020d17f8f2e0429"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): mobile/src/remote/useSessionCatalog.ts:756 \u00B7 mobile/src/remote/useSessionCatalog.ts:778 \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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"7967f05c224d67b029a7a03d7f9a69874ab22580dd48a93892c7f56324d3f292"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): mobile/src/screens/SessionList.tsx:665 \u00B7 mobile/src/screens/SessionList.tsx:728 \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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8827bf2afcfa81bbb3caf6c818f7820de4047adff2caf4d43c9b3ed8ae0a6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/shot/terminal-server.mjs:127 \u00B7 desktop/shot/terminal-server.mjs:148 \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":"desktop/shot/terminal-server.mjs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd2aa00600affbfd2c39f07a447404ff04379fa847e63e5bf0e926bf9cd9d3d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): desktop/src/components/layout/ActivityRail.tsx:429 \u00B7 desktop/src/components/layout/ActivityRail.tsx:499 \u00B7 desktop/src/components/layout/hooks/useCollapsedWorkspaces.ts:36 \u00B7 desktop/src/features/settings/ShortcutsPage.tsx:68 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bc90c251359703a669eb87bdfed267eeb68c9ed7bcc761aefd10d46cbd0128"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRail.tsx:544 \u00B7 desktop/src/features/agent/NewConversation.tsx:176 \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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c445286b6584bd715dbc1cd97e5cdc9baa4c14d7e7647324a2621c0cfa27385"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRail.tsx:2289 \u00B7 desktop/src/components/layout/ActivityRail.tsx:2364 \u2014 all 2 copies are in the same file, 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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c865f24a09f8fb322446157bef6fc639396ab9c36b7134dba2eaba06545988"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): desktop/src/components/layout/ConversationSearch.tsx:38 \u00B7 desktop/src/components/layout/hooks/useRailSelection.ts:141 \u2014 the two spans are one implementation copied and then locally edited \u2014 51 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":"desktop/src/components/layout/ConversationSearch.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2c43cb004f3824346d413a421dd19dd56e4e843636f0da97d2cfdbdfc9b92a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/components/layout/EntityDialogs.tsx:53 \u00B7 desktop/src/components/layout/EntityDialogs.tsx:129 \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":"desktop/src/components/layout/EntityDialogs.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af07c0e383b301261d5b3169b405ce7fb35f3cfe89a4b82200818cace8cfaf6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/components/layout/hooks/useArchiveView.ts:144 \u00B7 desktop/src/components/layout/hooks/useArchiveView.ts: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":"desktop/src/components/layout/hooks/useArchiveView.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c49aa0d6eab8eebc3608cd16c3bbb8779d1881bdcda1156f4bc51da7d8d7949"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/components/layout/hooks/useCollapsedWorkspaces.ts:37 \u00B7 mobile/src/screens/useCollapsedWorkspaces.ts:95 \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":"desktop/src/components/layout/hooks/useCollapsedWorkspaces.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"eccda9606419e923ded4eefd407dcd83e6529bf016aba0fa6cb1d90f0ea608e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): desktop/src/components/layout/hooks/useRailSelection.ts:141 \u00B7 desktop/src/components/ui/Overlay.tsx:28 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"desktop/src/components/layout/hooks/useRailSelection.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"673ff11e7b0b3afe06c078dc858533c2da40f05831bdec5b477c3680e088f438"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/components/ui/useCopyState.ts:12 \u00B7 desktop/src/features/agent/MessageList.tsx:46 \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":"desktop/src/components/ui/useCopyState.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b57cd68e249c976e4e3a3bdfd7252d2d79509744f2ab397c138e675a31a981"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/features/agent/composer/ComposerControls.tsx:53 \u00B7 desktop/src/features/remote-peer/RemoteApprovalMenu.tsx:25 \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":"desktop/src/features/agent/composer/ComposerControls.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4cb0d54ee976468d021723ab540ca8dec9f57a864d1ae88619c8c2a5ecf204"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): desktop/src/features/agent/composer/MentionMenus.tsx:17 \u00B7 desktop/src/features/agent/composer/MentionMenus.tsx:72 \u00B7 desktop/src/features/agent/composer/MentionMenus.tsx:151 \u00B7 desktop/src/features/remote-peer/RemoteSessionMenu.tsx:29 \u2014 the 4 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":"desktop/src/features/agent/composer/MentionMenus.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43c5a6205178ffa8c30ca05a7f2cdf34f0bc8029571be883fc9bdea9ccaa52c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): desktop/src/features/filepreview/imageZoom.ts:40 \u00B7 mobile/src/features/chat/components/ZoomableImage.tsx:24 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"desktop/src/features/filepreview/imageZoom.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bea2738e0cbe496ed4795bf3dfaee9e6c7ca04a65c166b5745053f332cef431"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/features/markdown/renderers/ArtifactEmbed.tsx:22 \u00B7 desktop/src/features/markdown/renderers/RunEmbed.tsx:21 \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":"desktop/src/features/markdown/renderers/ArtifactEmbed.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a32c597505efc7d1c37be72bc227fc57b7a75efd6f78bcfbcf83677c372ec2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteApprovalMenu.tsx:58 \u00B7 desktop/src/features/remote-peer/RemotePeerSettings.tsx:82 \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":"desktop/src/features/remote-peer/RemoteApprovalMenu.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a084ce360d4f6bc4f2e8da59a0066652a6691d5c15591616ce66ec70c554ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/features/remote-peer/remotePeerClient.ts:267 \u00B7 desktop/src/features/remote-peer/remotePeerClient.ts:1279 \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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4897a0022f42ba0df5f246301c918ff905c735160cd470a56902309317b13894"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/features/remote-peer/remotePeerClient.ts:922 \u00B7 desktop/src/features/remote-peer/remotePeerClient.ts:1149 \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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"117b0461c9e6fa1f797b481518e9c612a0df47d8ed8117d316df877f7c80a104"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/features/remote-peer/useRemoteApprovals.ts:53 \u00B7 desktop/src/features/remote-peer/useRemoteConversationSettings.ts:319 \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":"desktop/src/features/remote-peer/useRemoteApprovals.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c66b2e8a919e7d8da2d0585d381cc34ddcba3a93f5fb1a1c6d262e78a0019e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/features/runs/toolInput.ts:38 \u00B7 desktop/src/features/runs/toolInput.ts:50 \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":"desktop/src/features/runs/toolInput.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9cd450fd6e1484a09c9ea52f2172e528415e9bcd643fdac304cf2543228305d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/features/tasks/timezoneChoice.ts:102 \u00B7 mobile/src/features/settings/timezones.ts:39 \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":"desktop/src/features/tasks/timezoneChoice.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c465895c913e45d5556ec1809ca438fb461245eb0cc2fbd3ff25df27b268905"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/features/terminal/useTerminalPanel.ts:46 \u00B7 desktop/src/features/vibe/vibePreferences.ts:118 \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":"desktop/src/features/terminal/useTerminalPanel.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c1c667c9f1b8e226d4de9d09d8730060f4350b41097b8a76af2be74f40379a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): desktop/src/lib/format.ts:27 \u00B7 mobile/src/features/chat/utils.ts:75 \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":"desktop/src/lib/format.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0fd01cd848e2f9dc74828445125f6a1238bbcf6bbdf8127e91892b63b46aa2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (9 matched lines \u00D7 2 locations): desktop/src/lib/useOperationLifetime.ts:5 \u00B7 mobile/src/features/chat/useConversationOperation.ts:16 \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":"desktop/src/lib/useOperationLifetime.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a558560e173cdea63ae40266f120e21e7e63754dc16fdda2bb2d10ec0321f2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): harness/lib/analyze.mjs:174 \u00B7 harness/lib/analyze.mjs:193 \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":"harness/lib/analyze.mjs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8f30c765329186b2b8ec3c03687c659283d56b68ce4daf6460a986fa37c3a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): mobile/src/components/ActionMenu.tsx:74 \u00B7 mobile/src/components/SelectionSheet.tsx:49 \u00B7 mobile/src/features/chat/components/SessionUsageSheet.tsx:71 \u2014 the 3 copies are spread across 3 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":"mobile/src/components/ActionMenu.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"90f094c77a87d6e78980422509ed0d84f2227cb8241f07155394c722ccbdde66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): mobile/src/features/chat/components/GitGraphPanel.tsx:96 \u00B7 mobile/src/features/chat/components/SessionFilesPanel.tsx:31 \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":"mobile/src/features/chat/components/GitGraphPanel.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"eded24446faaa5071926da688e8465fded118713b371a98d54b89386aa2a323d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): mobile/src/features/chat/components/SendQueuePanel.tsx:313 \u00B7 mobile/src/features/chat/components/SendQueuePanel.tsx:327 \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":"mobile/src/features/chat/components/SendQueuePanel.tsx"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc5db2c038fd3e55827a64ee95580515680fa2ed0e9a358e69f36f991c33188"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4 locations): mobile/src/features/chat/messages/ReplyBlocks.tsx:226 \u00B7 mobile/src/features/chat/messages/ReplyBlocks.tsx:366 \u00B7 mobile/src/features/chat/messages/ToolRow.tsx:40 \u00B7 mobile/src/screens/DesktopPicker.tsx:73 \u2014 the 4 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":"mobile/src/features/chat/messages/ReplyBlocks.tsx"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cf5fe41f98780b9c13e59c3a6261fdb75b1264666bba9ffd85301116e38334"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): mobile/src/remote/useSessionCatalog.ts:436 \u00B7 mobile/src/remote/useSessionCatalog.ts:469 \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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"6752ef9926ba18a7d35661c5be5f23624999daeb8c0e84f1cacd9c971c40de8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): mobile/src/remote/useSessionCatalog.ts:878 \u00B7 mobile/src/remote/useSessionCatalog.ts:905 \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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe92bfaf4256b9a1ca81883e4a42f6880b36dfce1dceaccbd47a2979a4e660c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/skill_reco/probe.mjs:13 \u00B7 scripts/skill_reco/server.mjs:25 \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":"scripts/skill_reco/probe.mjs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4a8e121f3b3e8be8b56e73420db0174ec5207d4a5e4ece56239d366429f148"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): desktop/src/components/layout/ActivityRailAccountFooter.tsx:117 \u00B7 desktop/src/components/layout/ActivityRailMenus.tsx:443 \u2014 the two spans are one implementation copied and then locally edited \u2014 70 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":"desktop/src/components/layout/ActivityRailAccountFooter.tsx"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ebbf50247e8d2dddc20361234422cd24496743181cc8119b5a25ebe18f8d78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): desktop/src/components/layout/OnboardingGate.tsx:303 \u00B7 desktop/src/features/settings/GeneralPage.tsx:64 \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":"desktop/src/components/layout/OnboardingGate.tsx"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17223dbdff9cd6ae1210d5bccff659e9793905be56f1057c3e8d0d611befa0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): desktop/src/components/layout/hooks/useAppStartup.ts:19 \u00B7 packages/remote-client/src/taskScope.ts:47 \u2014 the two spans are one implementation copied and then locally edited \u2014 58 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":"desktop/src/components/layout/hooks/useAppStartup.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bf89ddcd7a0416ad520db4cff1517ae66045e75c244a2fe1e8ce10ed4ae0ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): desktop/src/features/agent/SessionUsageDialog.tsx:27 \u00B7 mobile/src/features/chat/components/SessionUsageSheet.tsx:51 \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":"desktop/src/features/agent/SessionUsageDialog.tsx"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a32cc129ed20471327baa5ef8693558c237bfdc63716eda20e2d8484427cbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): desktop/src/features/agent/agentQueue.ts:147 \u00B7 desktop/src/features/remote-peer/remoteQueue.ts:139 \u00B7 desktop/src/features/remote-peer/remoteSkillRecoSource.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"59460565961275003827a5a80c28a0f6b4a4063167713a5add43eeca75c152d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): desktop/src/features/agent/composer/MentionMenus.tsx:87 \u00B7 desktop/src/features/agent/composer/MentionMenus.tsx:161 \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":"desktop/src/features/agent/composer/MentionMenus.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e557b206a9de083e9be1732e2e02e677c7d5c3858017e992ea40d4729860111"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): desktop/src/features/git-history/GitHistoryPanel.tsx:256 \u00B7 mobile/src/features/chat/components/GitGraphPanel.tsx:369 \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":"desktop/src/features/git-history/GitHistoryPanel.tsx"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c5d78bd5e76566164610904eeb8e148bbac10ad58ba45d1f21d53cff652cb45"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): desktop/src/integrations/storage/typeGuards.ts:34 \u00B7 desktop/src/integrations/storage/typeGuards.ts:43 \u00B7 desktop/src/integrations/storage/typeGuards.ts:52 \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":"desktop/src/integrations/storage/typeGuards.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90f6481b96a16652727220bb8cfab3675091828afd80969954110f8a1472b87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): desktop/src/lib/objects.ts:7 \u00B7 packages/thread-projection/src/utils.ts:7 \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":"desktop/src/lib/objects.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57e5d3f6d6df97eb18f0833f7bc9284a303a73dd00f325a4fb28e888da75933"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): harness/lib/cli-driver.mjs:35 \u00B7 harness/lib/dev-server.mjs:64 \u00B7 harness/lib/relay-fixture.mjs:25 \u00B7 harness/lib/remote-live.mjs:37 \u2014 the 4 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 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":"harness/lib/cli-driver.mjs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c3e9153c2a305e2087e2f6508559088009abcb7746478a41b6840769bcd467"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): harness/lib/cli-driver.mjs:110 \u00B7 harness/lib/run.mjs:145 \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":"harness/lib/cli-driver.mjs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e0c323b0d2a6118d1faf360c5e421dcd90f8e9f0136e4ad97694b1422853f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): harness/lib/issues-en-run.mjs:122 \u00B7 harness/lib/issues-en.mjs:381 \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":"harness/lib/issues-en-run.mjs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c131ae99cdbc58603cd79f2cfc59b095d5200a165f8184158a02b80413a4d40"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): harness/lib/issues.mjs:116 \u00B7 harness/scripts/file-issues.mjs:25 \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":"harness/lib/issues.mjs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e38750dfd109cf37a2ea5ceef518cb7a4dcf845a9483aa356e4214e08a7892"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): harness/lib/remote-live.mjs:255 \u00B7 harness/lib/remote-live.mjs:264 \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":"harness/lib/remote-live.mjs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"80958f8c51331771578ff4330da78c52f913f2b9b49b82c58cb89bef0e8ff87f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/shot/mock/RemoteContext.tsx:840 \u00B7 mobile/src/remote/RemoteContext.tsx:1432 \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":"mobile/shot/mock/RemoteContext.tsx"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"543325fae126d808512de241ee3029456126b10ac3ae5cda3d948dc269ff6bac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): mobile/src/features/chat/components/ChatTimeline.tsx:105 \u00B7 mobile/src/features/chat/components/GitGraphPanel.tsx:193 \u00B7 mobile/src/features/chat/components/SessionFilesPanel.tsx:135 \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":"mobile/src/features/chat/components/ChatTimeline.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"249132a8247c2c6ea31184145babeb8d517df8f8d7e62467b581513b6d91d1a6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4 locations): mobile/src/features/chat/components/ChoiceSheet.tsx:66 \u00B7 mobile/src/features/chat/components/PromptReader.tsx:72 \u00B7 mobile/src/features/chat/components/SendChoiceSheet.tsx:60 \u00B7 mobile/src/features/chat/components/SessionUsageSheet.tsx:88 \u2014 the 4 copies are spread across 4 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":"mobile/src/features/chat/components/ChoiceSheet.tsx"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f905e8e36b71d37081d2fef8d33a016480f9fa8cb092292ba687c082dc05a55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/src/features/chat/useSendMessage.ts:160 \u00B7 mobile/src/features/chat/useSendMessage.ts:221 \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":"mobile/src/features/chat/useSendMessage.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bc605d460b8ce531866354612198650f7603ec18150c1d34e33a3180f0fd1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/src/features/settings/CustomProviderPage.tsx:306 \u00B7 mobile/src/features/settings/CustomProviderPage.tsx:318 \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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82fde035d70550cbc888c93eb116072090b5dc2099e99e26caca5da4b91d121"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/src/i18n/useSystemLanguage.ts:9 \u00B7 mobile/src/theme/ThemeContext.tsx:28 \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":"mobile/src/i18n/useSystemLanguage.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d605cbdced09f8dc63b3fc2666a6fa217708fdf135c50099472f131bc74a1c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/src/remote/RemoteContext.tsx:663 \u00B7 mobile/src/remote/RemoteContext.tsx:675 \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":"mobile/src/remote/RemoteContext.tsx"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bc2ff5a4e68b2c4276ca2f427346cc2c89094d49c53a3216b3bf3d91decb5f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/src/remote/asyncOperationQueue.ts:9 \u00B7 mobile/src/remote/storage.ts:36 \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":"mobile/src/remote/asyncOperationQueue.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4162663d53aee087cabd9424e36d0d9d84454a1825e70b851ac2e6702e9202d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/src/remote/useConversationController.ts:351 \u00B7 mobile/src/remote/useConversationController.ts:374 \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":"mobile/src/remote/useConversationController.ts"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f68834a17f39cc709e9d7755808575808ebc637bfc35dc3365b71f1e093098"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/src/remote/useTimelineController.ts:318 \u00B7 mobile/src/remote/useTimelineController.ts:380 \u2014 both copies are in the same file, so extract the block 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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dd4c736ab5168e69ebb85b73fc387a384ce05d7fc1f4655679d6effef23f2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/src/screens/SessionList.tsx:976 \u00B7 mobile/src/screens/SessionList.tsx:989 \u2014 both copies are in the same file, so extract the block 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b90fd2f237a78146890c82afdf0a74cbc09672d80d83b06effdfc4c3062699"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/src/screens/SessionList.tsx:1385 \u00B7 mobile/src/screens/SessionsScreen.tsx:1088 \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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"90efd161f317f86977989a5db1205c52e52f673a4b6122746c153e0e0a5cd7e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): mobile/src/screens/SessionListActions.tsx:51 \u00B7 mobile/src/screens/SessionsScreen.tsx:1161 \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":"mobile/src/screens/SessionListActions.tsx"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"04693f8fb4ca03b72d1539f82a816b16d09c66ea2001ba31aab43ea1dc79b3b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/remote-client/src/connectionState.ts:166 \u00B7 packages/remote-client/src/connectionState.ts:189 \u2014 all 2 copies are in the same file, 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":"packages/remote-client/src/connectionState.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"506e4582478f6cffd3e34d5e2d1bcb02d431e0b1dc0ca0257d120f6549fa4b1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): packages/remote-client/src/connectionState.ts:175 \u00B7 packages/remote-client/src/connectionState.ts:195 \u2014 all 2 copies are in the same file, 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":"packages/remote-client/src/connectionState.ts"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"863658c6cb082ad29465ac8b201d1a2e600f5fe783ebb9d71fd2e6242f060feb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): packages/remote-client/src/taskScope.ts:47 \u00B7 packages/remote-client/src/transfer.ts:138 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"packages/remote-client/src/taskScope.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5d75895ef36e1d9b0f1a69546cf6ee5d4aeb9f24c4434ae1fe76033a3b46db"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): desktop/src/components/layout/ActivityRail.tsx:498 \u00B7 desktop/src/components/layout/hooks/useCollapsedWorkspaces.ts:34 \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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efaf7c25d36e457aa8dee273632f22b06fb809dcf84c7b0dd377dc14aa6fb9f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): desktop/src/components/layout/ActivityRailMenus.tsx:444 \u00B7 desktop/src/features/remote-peer/DeviceChoiceDialog.tsx:117 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"desktop/src/components/layout/ActivityRailMenus.tsx"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dae6454104e46fd08e2e465a4d9ab057cce51a00eda7a393318cfc5b68fa629"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): desktop/src/components/layout/hooks/useRemotePeers.ts:885 \u00B7 mobile/src/remote/useSessionCatalog.ts:300 \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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"79127795f15a503f766d3d64c6305e40a4f75c93adc44915061405636c7a0b86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): desktop/src/features/agent/composer/ChoicePopover.tsx:59 \u00B7 desktop/src/features/settings/ShortcutRecorder.tsx:89 \u00B7 desktop/src/lib/useDismissableLayer.ts:48 \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":"desktop/src/features/agent/composer/ChoicePopover.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fc06af5f3abd74399610d1baa0ff82b4113b707b284e554f436bbbb0a16ef1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): desktop/src/features/agent/composerHistory.ts:26 \u00B7 desktop/src/features/vibe/vibePreferences.ts:61 \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":"desktop/src/features/agent/composerHistory.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b9d4195b30b194e9fd66a048b5c9f5394e8274b4bb902d2615872388a311a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): desktop/src/features/agent/replyBlocks.ts:100 \u00B7 mobile/src/features/chat/messages/ReplyBlocks.tsx:106 \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":"desktop/src/features/agent/replyBlocks.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae0e72b13c8676b773c592ed8db944acae37c3b6b617dee7d38758bdbe35b488"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): desktop/src/features/remote-peer/remoteHostCatalog.ts:152 \u00B7 desktop/src/features/remote-peer/useRemoteApprovals.ts:53 \u00B7 desktop/src/features/remote-peer/useRemoteConversationSettings.ts:319 \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":"desktop/src/features/remote-peer/remoteHostCatalog.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"9925ea5a7edeadba6eb983170ea7cacadc5f6b42fc4e2fc016faf0276acc21de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): desktop/src/features/settings/FusionSettingsPage.tsx:164 \u00B7 mobile/src/features/settings/FusionSettingsPage.tsx:37 \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":"desktop/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f499cf16b009f59fe18181b2532b471f4b13df4370dab8044c0c64934692f380"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): harness/cli.mjs:156 \u00B7 harness/cli.mjs:180 \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":"harness/cli.mjs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5785b318f8d94f4e9ff9721c9ee09e03e4f5c083cd2c96b0d2b9111051f23b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): harness/cli.mjs:230 \u00B7 harness/cli.mjs:242 \u00B7 harness/cli.mjs:251 \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":"harness/cli.mjs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8020ef80f37b16b4341b87df300e0155ed5a9a8b3941bb32f4fe9822079d521"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): harness/lib/remote-mobile-live.mjs:298 \u00B7 harness/lib/run.mjs:35 \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":"harness/lib/remote-mobile-live.mjs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b1ba898b8cee5b0c9e3ecce70539f1e24121f763c0d4ea9a3d1ad54f2a7912"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): mobile/src/features/chat/ChatScreen.tsx:498 \u00B7 mobile/src/features/chat/ChatScreen.tsx:544 \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":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"95944e1eb75401d46c3f70923acaa0069e953fc1c00a13cc0d5046aa4ade9892"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): mobile/src/features/chat/useComposerDraft.ts:90 \u00B7 mobile/src/features/chat/useComposerDraft.ts:97 \u2014 both copies are in the same file, so extract the block 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":"mobile/src/features/chat/useComposerDraft.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5bd776d790ec7fb3839c81b2940bf606146f013f086116d7c097a0b5eb5352"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): mobile/src/features/settings/SettingsScreen.tsx:193 \u00B7 mobile/src/features/settings/SettingsScreen.tsx:214 \u2014 both copies are in the same file, so extract the block 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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79e6c865d9ff256626eefc5393258c79d59ad5be365a82b809c59d39290f327"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): mobile/src/remote/RemoteContext.tsx:635 \u00B7 mobile/src/remote/RemoteContext.tsx:644 \u2014 all 2 copies are in the same file, 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":"mobile/src/remote/RemoteContext.tsx"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"893a1bb0f817ee319f117666fb70638e1ce93191d325326b1c9203e55ef45870"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): mobile/src/screens/SessionsScreen.tsx:902 \u00B7 mobile/src/screens/SessionsScreen.tsx:935 \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":"mobile/src/screens/SessionsScreen.tsx"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc02140c52d1bc84a20cce3a2ad0e4b44b6d6419a35cd49d746c531b85f17d93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): packages/thread-projection/src/approval.ts:258 \u00B7 packages/thread-projection/src/approval.ts:275 \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":"packages/thread-projection/src/approval.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db05cb7ecb76015ca03bd48fa7d2cb3e8187a1e945685594ede525390407a35"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/ci/affected.mjs:17 \u00B7 scripts/ci/remote-boundaries.mjs:32 \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/ci/affected.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"18717334110cde9febcd58a3bf45436d49726c40bec448e6c9d2abf5b39acfe3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/scripts/gen-theme-palettes.mjs:65 \u00B7 desktop/scripts/gen-theme-palettes.mjs:74 \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":"desktop/scripts/gen-theme-palettes.mjs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab2c79648a8b30386ed1061a05afd1a4470423f972228e2bd4109599a432416"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/shot/mock/backend.ts:441 \u00B7 desktop/shot/mock/backend.ts:565 \u2014 all 2 copies are in the same file, 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":"desktop/shot/mock/backend.ts"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"685dbb24ee6a1b44f0ff262f247264eedfd5511311699113ed0a2fc8da8a264f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): desktop/src/components/layout/AppShell.tsx:300 \u00B7 desktop/src/features/agent/search/ThreadSearch.tsx:43 \u00B7 mobile/src/features/settings/SkillsSettingsPage.tsx:21 \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":"desktop/src/components/layout/AppShell.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda3a2c3104d1012753f10776f848820785ff05a4b950c87d2b3fa9268065f2b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): desktop/src/components/layout/hooks/useArchiveView.ts:226 \u00B7 desktop/src/components/layout/hooks/useThreadStore.ts:889 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 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":"desktop/src/components/layout/hooks/useArchiveView.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ba232663d45276cfc5921fd14845047cc7e437ae2bd291d9abe62a3703ecbb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/src/components/layout/hooks/useContextData.ts:76 \u00B7 mobile/src/remote/useConversationController.ts:94 \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":"desktop/src/components/layout/hooks/useContextData.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"c178ec5172deffc66ba82726d0dc7e352efa5a8c532b4caed512b3d8b3f74d7c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): desktop/src/components/layout/hooks/useRemotePeers.ts:603 \u00B7 desktop/src/features/remote-peer/remoteHostCatalog.ts:191 \u00B7 desktop/src/features/remote-peer/useRemoteApprovals.ts:146 \u00B7 desktop/src/features/remote-peer/useRemoteTimeline.ts:858 \u2014 the 4 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. 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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"e186c9fe1de2259dc8e3a05c78dc3d6fd1dc8b523beb771b44e067aa42ea711a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/src/features/agent/Composer.tsx:920 \u00B7 desktop/src/features/remote-peer/RemoteComposer.tsx:1461 \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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"6022fcf3103b665f92c3d44e802af044682e6270e88114426a9471586ac23945"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/src/features/agent/useWorkspaceForm.ts:56 \u00B7 desktop/src/features/remote-peer/RemotePeersView.tsx:116 \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":"desktop/src/features/agent/useWorkspaceForm.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddd0b3e29b694c4233c88eee89a3ce4cd65882a6f2bf26337dec1e802f67c3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/src/features/filepreview/FilePreviewOverlay.tsx:116 \u00B7 mobile/src/features/chat/files/usePreviewStack.ts:21 \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":"desktop/src/features/filepreview/FilePreviewOverlay.tsx"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a148cf3a927447855d990024f3c35068cf3c19e4acb3da9f5347dd52c6d82627"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/src/features/markdown/renderers/MathBlock.tsx:7 \u00B7 desktop/src/features/markdown/renderers/MathInline.tsx:7 \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":"desktop/src/features/markdown/renderers/MathBlock.tsx"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca57edfa1d20387b80b98a7e24480e31ca6385601a44910685f03955966f19e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/src/features/markdown/streamingMarkdownBlocks.ts:135 \u00B7 packages/markdown/src/streamingMarkdown.ts:74 \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":"desktop/src/features/markdown/streamingMarkdownBlocks.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d400bc23183b4c5558ae46aa135a19ac5fec502316fca4fd84f8bbc8f130d80e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteApprovalMenu.tsx:43 \u00B7 desktop/src/features/remote-peer/RemoteFilesDialog.tsx:33 \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":"desktop/src/features/remote-peer/RemoteApprovalMenu.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76765f76059278eb769b221dd4c11ec5b4f49f2d27e3588c7cb5760af0b1c27"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/src/features/remote-peer/RemoteWorkspacesPanel.tsx:38 \u00B7 mobile/src/screens/SessionsScreen.tsx:309 \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":"desktop/src/features/remote-peer/RemoteWorkspacesPanel.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"afeb44083219f5d7c67a23f48ee7d2d8a559b78b9988084a26be91b4e11e4789"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): desktop/src/features/remote-peer/remotePeerClient.ts:703 \u00B7 desktop/src/features/remote-peer/remotePeerClient.ts:923 \u00B7 desktop/src/features/remote-peer/remotePeerClient.ts:1151 \u00B7 desktop/src/features/remote-peer/remotePeerClient.ts:1297 \u2014 all 4 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcff68f5ac0ce70228e58884a77fe27c2b5c87ff6916cfe91828668d83c4b86d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): desktop/src/features/remote-peer/remoteSessionReference.ts:72 \u00B7 mobile/src/features/chat/sessionMention.ts:58 \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":"desktop/src/features/remote-peer/remoteSessionReference.ts"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34f5f62c9667447ff0d91b47ffe1d953ab04fbe247beba58c23aeab2eb2a949"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): desktop/src/features/remote-peer/remoteSessionReference.ts:128 \u00B7 mobile/src/features/chat/sessionCompletion.ts:14 \u00B7 mobile/src/features/chat/skillCompletion.ts:9 \u2014 the 3 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. 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":"desktop/src/features/remote-peer/remoteSessionReference.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef0fde4a0477b86fe8110a53fd580a30ffaa99e49407e5f7096104033fde369"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): harness/lib/analyze.mjs:701 \u00B7 harness/lib/analyze.mjs:879 \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":"harness/lib/analyze.mjs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d07985402eeeddfd5d7854d2a3ff3b42832bc23e8262022547415dae56b96d5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): harness/lib/analyze.mjs:850 \u00B7 harness/lib/issues-en.mjs:194 \u00B7 harness/lib/issues.mjs:55 \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":"harness/lib/analyze.mjs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3dee5b3df5355f2e48b1a575bb7a8af5dcea57af7f7b576af32c43c9d5c0043"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): harness/lib/dev-server.mjs:113 \u00B7 harness/lib/dev-server.mjs:160 \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":"harness/lib/dev-server.mjs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc363a9e9fbb9b13861404c2abc85935febddd1dff7e2c9e7a83cbf40c027b5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): harness/lib/relay-fixture.mjs:204 \u00B7 harness/lib/remote-live.mjs:309 \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":"harness/lib/relay-fixture.mjs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99ad31ba9b3a11a8a0e9efb01900c3ccd6d12c3171c3b51ccd08f4f9959c76e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): harness/lib/run.mjs:335 \u00B7 harness/lib/run.mjs:342 \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":"harness/lib/run.mjs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33c22821861f27282d8f2a9fe6d141f31bcb51b46c6bbcc99f4f9d952ba6d8a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): mobile/src/features/chat/messages/ToolRow.tsx:70 \u00B7 mobile/src/features/chat/messages/ToolRow.tsx:190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/messages/ToolRow.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f578cb03f7d601617a91822241edb0842eaaaba6715642c6c994528204e80694"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): mobile/src/remote/timeline/historyPaging.ts:41 \u00B7 mobile/src/remote/useTimelineController.ts:850 \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":"mobile/src/remote/timeline/historyPaging.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"585ba1f58ed08727c75e2ca5f7caeb2b5ec068f5aa088004985080eb3f0275ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): mobile/src/remote/useSessionCatalog.ts:663 \u00B7 mobile/src/remote/useSessionCatalog.ts:772 \u00B7 mobile/src/remote/useSessionCatalog.ts:793 \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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd829f6b8d6623d634df63443515a08033754f4c3074a382716f49b4fd6432e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): mobile/src/screens/PairingScreen.tsx:244 \u00B7 mobile/src/screens/PairingScreen.tsx:295 \u2014 all 2 copies are in the same file, 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":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f5f91ae03962bda413650aa798c82305ac264e2addc32d6816d5a6e638afa3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): mobile/src/screens/SessionList.tsx:1047 \u00B7 mobile/src/screens/SessionList.tsx:1272 \u2014 all 2 copies are in the same file, 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"a205f5d3af8a45a58faa7bc7023036c57361de7335f3b08b227cfa66655647c0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/remote-client/src/client.ts:812 \u00B7 packages/remote-client/src/client.ts:1293 \u2014 both copies are in the same file, so extract the block 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":"packages/remote-client/src/client.ts"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b71a4cdf6d2a6e844ac43ca68bc470f7f95b6840c0863a26ed0729cd7a78f3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): packages/remote-client/src/client.ts:1108 \u00B7 packages/remote-client/src/client.ts:1189 \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":"packages/remote-client/src/client.ts"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"350af8fa783601d2565ee1dd35f0d5f3b842c1af099cbf297c353e55cc316924"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): scripts/measure/measure-mobile-performance.ts:89 \u00B7 scripts/measure/measure-mobile-performance.ts:183 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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/measure/measure-mobile-performance.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49c783525f557ea75e5427dc2c58f9a75001698edf633cf4fcaeccd98f8b0d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): desktop/shot/mock/backend.ts:1012 \u00B7 harness/lib/fixture-server.mjs:955 \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":"desktop/shot/mock/backend.ts"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"90edd305ad675718cd1357060a672ec5eeaa7baace31a2f6a2ea0c09bfcd19e2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): desktop/src/components/layout/OnboardingGate.tsx:325 \u00B7 desktop/src/features/settings/EnvironmentPage.tsx:79 \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":"desktop/src/components/layout/OnboardingGate.tsx"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad14bbb9eb4762cf420c823ffcdb6b932ba88357abfde4a09c0eaa24deaf30f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): desktop/src/components/layout/hooks/useThreadStore.ts:473 \u00B7 desktop/src/components/layout/hooks/useThreadStore.ts:889 \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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"a297230eafdd5be57e9397e6edd9e40e72c9e7b0a869c44d01ef0b0220ff9391"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): desktop/src/features/agent/SendQueuePanel.tsx:68 \u00B7 desktop/src/features/agent/composer/choiceAnswer.ts:70 \u00B7 mobile/src/features/chat/choiceAnswer.ts:45 \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":"desktop/src/features/agent/SendQueuePanel.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"601874675587cf4501b540d03a8dfce2300698efde82c3f2f724737396cb1d00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): desktop/src/features/agent/useWorkspaceForm.ts:55 \u00B7 desktop/src/features/settings/BuiltinProviderKeyDialog.tsx:34 \u00B7 mobile/src/screens/SessionsScreen.tsx:314 \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":"desktop/src/features/agent/useWorkspaceForm.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80da91fa244e452daff7a8cb7082e334f8a4997f79c645ef0eb320bf32cad7f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): desktop/src/features/artifacts/ArtifactsPanel.tsx:45 \u00B7 desktop/src/features/remote-peer/RemoteWorkspaceCreateDialog.tsx:31 \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":"desktop/src/features/artifacts/ArtifactsPanel.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33054db7b645e2d3f3ffefc066d1a53bcea7ea25ea9eb5e5e127db778bb18c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): desktop/src/features/filepreview/ImagePreview.tsx:172 \u00B7 desktop/src/features/filepreview/ImagePreview.tsx:179 \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":"desktop/src/features/filepreview/ImagePreview.tsx"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eaf6a1588b548b7478646e56e2ecf31c3e25b2703a084a9901075e0c9765f52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): desktop/src/features/remote-peer/remotePromptOutbox.ts:98 \u00B7 packages/remote-client/src/codec.ts:14 \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":"desktop/src/features/remote-peer/remotePromptOutbox.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ec6c146ffc099f2b00c3f5c031956f214963b9e87b06778ada34297f7c39323"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): harness/lib/analyze.mjs:55 \u00B7 harness/lib/fixture-server.mjs:107 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 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":"harness/lib/analyze.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfd835346e8621e7ee63a501a9d8df22fc80d3569e660063de1c1a334dc97e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): harness/lib/cdp.mjs:409 \u00B7 harness/lib/cdp.mjs:430 \u2014 the two spans are one implementation copied and then locally edited \u2014 66 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":"harness/lib/cdp.mjs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea8f87c83cd7f819cc13d74e8c7256a0db4ffa31ca9c3e12e1fed855b8e0cf2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): harness/lib/cli-driver.mjs:281 \u00B7 harness/lib/remote-mobile-live.mjs:230 \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":"harness/lib/cli-driver.mjs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8dce87821aadbcfcb169d6fe6feb63b0ef8b7c4d747213fca99d492eb09cb36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): harness/lib/dev-server.mjs:99 \u00B7 harness/lib/dev-server.mjs:132 \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":"harness/lib/dev-server.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"99855fc6870032d00d2c8557a177fc7fe2af04b154f8e12edce0c2b89e13441d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): harness/lib/preflight.mjs:14 \u00B7 harness/lib/tui-driver.mjs:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 54 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":"harness/lib/preflight.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7fe09e3b5561c41a91a722fadea29fce4964582d6fa1f83dd528ba82712460"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): harness/lib/relay-fixture.mjs:86 \u00B7 harness/lib/remote-live.mjs:70 \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":"harness/lib/relay-fixture.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c41668152a8dd90e258eece231135527ba15b814890deb9ce230217b80e823d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): harness/lib/remote-live.mjs:263 \u00B7 harness/lib/remote-live.mjs:272 \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":"harness/lib/remote-live.mjs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c19685188aae59b6852cdbeeeaf93184204e94ddf128dc1c2840a309abd3a0bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): mobile/src/components/MarkdownImage.tsx:175 \u00B7 mobile/src/features/chat/messages/AttachmentImage.tsx: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":"mobile/src/components/MarkdownImage.tsx"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"93648547e2d9135fea11ee97338ce71af1b52b6ccd986e47200c885eb8564b16"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): mobile/src/components/SelectionSheet.tsx:61 \u00B7 mobile/src/features/chat/components/PreviewModal.tsx:255 \u00B7 mobile/src/features/chat/components/SkillDetailsDialog.tsx:32 \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":"mobile/src/components/SelectionSheet.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d7d2afa6ba28925cff106f445e8ec15ada92f27b49b977b7b8cd8b1689896e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): mobile/src/features/chat/components/SessionPicker.tsx:71 \u00B7 mobile/src/screens/PairingScreen.tsx:245 \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":"mobile/src/features/chat/components/SessionPicker.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d6a64afa627a17f359086e4499843dee94177a64c897b8131e665c9f4972451"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): mobile/src/features/settings/CustomProviderPage.tsx:523 \u00B7 mobile/src/features/settings/CustomProviderPage.tsx:528 \u2014 all 2 copies are in the same file, 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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1de150698c879d99f42168d9b7ba46ce4505b324eabec84adf07319feae359c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): mobile/src/remote/useSessionCatalog.ts:734 \u00B7 mobile/src/remote/useSessionCatalog.ts:772 \u00B7 mobile/src/remote/useSessionCatalog.ts:793 \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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87c4c512f52cb680a445d9596444bd72da399e42beeff8338ea32c47e037f12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/markdown/src/remarkAutolinkBoundary.ts:1 \u00B7 packages/markdown/src/remarkCurrencyMath.ts:2 \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":"packages/markdown/src/remarkAutolinkBoundary.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ccfdc0321f0f1cc55c37c8a2e0e2b146187aaba0224d142b850bc38b381cf87"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): packages/remote-client/src/client.ts:1176 \u00B7 packages/remote-client/src/client.ts:1291 \u2014 both copies are in the same file, so extract the block 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba768d649db51802f59e88ba7f7f332b411a9f539776a898c131e19e60d7d92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/measure/measure-sync-snapshot.ts:27 \u00B7 scripts/measure/measure-sync-warm.ts:45 \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/measure/measure-sync-snapshot.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"04846f2800edbeb10b65d4348400a4aef9d26f2b74dde4f8fac65ba3eb41856f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: harness/mobile-client/entry.mjs:24 reaches into another package with a relative path (../../mobile/src/remote/pairing.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/mobile-client/entry.mjs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"19499ab99b58fcbc870bbc0297a75a9e4dbb89ba70c2086ae3771f9276f97698"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: harness/mobile-client/entry.mjs:25 reaches into another package with a relative path (../../mobile/src/remote/client.ts) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/mobile-client/entry.mjs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd78f25d9156aeb836e5dee7a31d05048a612945d2ee5ec9065a7776ebf6931"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:third-party-deep-import]: mobile/jest.environment.js:32 imports jest-expo/src/preset/nativeEnvironment, reaching past a declared dependency\u0027s public entry into its build output \u2014 that path is the package\u0027s toolchain layout, not its API, and a minor version bump can relocate it with no semver signal. Import from the package\u0027s documented entry point instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/jest.environment.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3f302e7188037b897ab880f47ea39b3ae2b05d5b8d0312e8505bd8a833049e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: mobile/src/components/__tests__/MarkdownText.test.ts:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../../../packages/markdown/src/parseFutureMarkdown) \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":"mobile/src/components/__tests__/MarkdownText.test.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba87834aa653a7fa25f26dd9964bfba3055c779d6de4dd17bf5f468eb6d54438"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/measure/measure-mobile-performance.ts:5 reaches into another package with a relative path (../../mobile/src/remote/types) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/measure-mobile-performance.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d205c13fd9b8d74543ca215f75321f6bd289c5939910d571d4f4a1644f58ddb4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/measure/measure-mobile-performance.ts:7 reaches into another package with a relative path (../../packages/markdown/src/types) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/measure-mobile-performance.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e8ad1d4fda3d9fb3667617035f63ea3984f178c36073d92662bacca903b573"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/measure/measure-sync-browser.ts:9 reaches into another package with a relative path (../../mobile/src/remote/client) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/measure-sync-browser.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3860f01be333f134380eadf6799ba9292be42528ed7c20b983a6b7d816f0bf11"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/measure/measure-sync-browser.ts:10 reaches into another package with a relative path (../../mobile/src/remote/types) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/measure-sync-browser.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"90da2861cc47a6dd0ce847db5c51347b6b0909b0579e89a2913cdd60c937e803"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/measure/measure-sync-snapshot.ts:7 reaches into another package with a relative path (../../mobile/src/remote/client) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/measure-sync-snapshot.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"967d6de793011998039808a2efcd252a2c9e6183f20706be5540745b05229767"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/measure/measure-sync-snapshot.ts:8 reaches into another package with a relative path (../../mobile/src/remote/types) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/measure-sync-snapshot.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca7d4adc43c2fdb8ccfdb820f552cac6fb8fefd8f6990ca7b25c4e114b446d0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/measure/measure-sync-warm.ts:10 reaches into another package with a relative path (../../mobile/src/remote/client) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/measure-sync-warm.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6013fd74490a13c3e776353613563c6bded89408d5925fcbe63217a5545ad548"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: scripts/measure/measure-sync-warm.ts:11 reaches into another package with a relative path (../../mobile/src/remote/types) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/measure/measure-sync-warm.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbef6306bb691f60049430eda3917e6276868956b29c8abfcc2ecac566f5f44"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: scripts/tests/test-mobile-ios-project.cjs:9 reaches past another workspace package\u0027s public entry into its internals with a relative path (../../mobile/plugins/withIosShareExtension) \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":"scripts/tests/test-mobile-ios-project.cjs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c66cb8081e2cbef3bbb3a1cef90eaf3a434e4ab53466ae0cb2a9628cf64f996"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCase (cyclomatic 149, cognitive 235): runCase has cyclomatic complexity 149 and cognitive complexity 235; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"harness/lib/run.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d83f6bfa781c3b533315bb061907c43f7ddbec18a2f706f19c21eb3facae9bca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processEvent (cyclomatic 127, cognitive 223): processEvent has cyclomatic complexity 127 and cognitive complexity 223; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2ae0bfc0ddf9593c367b9c0e811285fc392d1fbc4977f8976132af7e76bc07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ActivityRail (cyclomatic 124, cognitive 119): ActivityRail has cyclomatic complexity 124 and cognitive complexity 119; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd79ee30545e4ac70415e67afcedef7fb3f2c29bd15bc65976ddcecca494357"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReadyAppShell (cyclomatic 99, cognitive 89): ReadyAppShell has cyclomatic complexity 99 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"desktop/src/components/layout/AppShell.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5082cbd30cfb6c6a96b21a13030211af861ae1bda607ee06691333153699d50"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function machineSurface (cyclomatic 84, cognitive 83): machineSurface has cyclomatic complexity 84 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/src/remote/RemoteContext.tsx"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb82a2346af74675893e1abe4c6b89b0f5f3117a25255ed93951b59be53cabc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MessageBlockImpl (cyclomatic 83, cognitive 77): MessageBlockImpl has cyclomatic complexity 83 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 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":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6f6b6be8033b9a48731790cc745f12ece35bf16bfc478b2b5c25e1eca46d2a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SessionsScreen (cyclomatic 77, cognitive 72): SessionsScreen has cyclomatic complexity 77 and cognitive complexity 72; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/src/screens/SessionsScreen.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b77fe8b95cf367398bad02c5cf7d92667eca1484012e1b1b49c7963a36cfc7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runCliCase (cyclomatic 76, cognitive 131): runCliCase has cyclomatic complexity 76 and cognitive complexity 131; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"harness/lib/cli-driver.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e001c558851a8078e5eb291e652bdae393cd52887962da4644b0cd140e1fed8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TimelineCardView (cyclomatic 75, cognitive 132): TimelineCardView has cyclomatic complexity 75 and cognitive complexity 132; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/src/features/chat/messages/TimelineCard.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"798dbe0607040a76338daab35a286475de1b6c78754bbeec68dae5876a993a00"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRunReplay (cyclomatic 69, cognitive 88): readRunReplay has cyclomatic complexity 69 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/thread-projection/src/replay.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f0e8715437d46d98c790cccdcd1a5d26268664cf428dff0e1c9ab5b55838ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ChatScreen (cyclomatic 67, cognitive 56): ChatScreen has cyclomatic complexity 67 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc55214a083cd1fad1f69802714aff2d4ce7584482b2db2f13db0e94364ed5e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderRow (cyclomatic 64, cognitive 63): renderRow has cyclomatic complexity 64 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a599f8747600c9dc98446904eab2278d0a954a1684c865d6955757613c1aec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ComposerDockView (cyclomatic 60, cognitive 37): ComposerDockView has cyclomatic complexity 60 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":"mobile/src/features/chat/components/ComposerDock.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d12d1b3bed2e588b57800ef9ba158b8f8b7caeb45a2444bdf75ff281ac092a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentThread (cyclomatic 59, cognitive 55): AgentThread has cyclomatic complexity 59 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e566ee9a51b9c1e14eb824e664613a88731ec571bc3b04a1ab718e27475724f3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteComposer (cyclomatic 57, cognitive 49): RemoteComposer has cyclomatic complexity 57 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 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d132b33ee595fa9800043202b22900748dc4923010cb6616fce8f1c04bc9c0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function VibeStage (cyclomatic 56, cognitive 55): VibeStage has cyclomatic complexity 56 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7895acf69f2f0afcb5d3bf82015268678df8d48c55de0596249729de5eec00e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SessionList (cyclomatic 55, cognitive 52): SessionList has cyclomatic complexity 55 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e970d0b4cd5919b883b6e4300ac7be18c956c1f936501efc20bf0719a8dd5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function writeReport (cyclomatic 53, cognitive 91): writeReport has cyclomatic complexity 53 and cognitive complexity 91; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"harness/lib/report.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7d0a1d21499c425aa564a524865bd6b33edd9d50d9159ec420da78d8514fe4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UpdatePage (cyclomatic 53, cognitive 43): UpdatePage has cyclomatic complexity 53 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"desktop/src/features/settings/UpdatePage.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d344c91ce2e6d35ed86ceb24d71d99550c404d6f36bbd29891f74cd4e939f087"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 52, cognitive 89): main has cyclomatic complexity 52 and cognitive complexity 89; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"harness/cli.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f39374fe5906e2c7eb522623269d32fc97ed1aca4a8ee09d0065ba7581f0db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ContextPanel (cyclomatic 48, cognitive 41): ContextPanel has cyclomatic complexity 48 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":"desktop/src/components/layout/ContextPanel.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"558b7b144d65b1d8c0e8f7af204523d7ad035d1efe30aec4ba5f81ed0394ec45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ArtifactDetailPanel (cyclomatic 47, cognitive 35): ArtifactDetailPanel has cyclomatic complexity 47 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 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":"desktop/src/features/artifacts/ArtifactDetailPanel.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"237f0c241306e6bb6b7243cfdf09d905c27642a63deb63f64d4399bd599d5ada"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runReconcile (cyclomatic 46, cognitive 63): runReconcile has cyclomatic complexity 46 and cognitive complexity 63; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca89c38bda89000e199ddc9715726f6d8ee26ae76fd23ac37d7aa27401c8cd3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 46, cognitive 47): (anonymous) has cyclomatic complexity 46 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"156bbab59d9e2665a6ab577499d2093568bdbb0100b489a96f097bc5930e2b60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PendingApprovalCard (cyclomatic 45, cognitive 43): PendingApprovalCard has cyclomatic complexity 45 and cognitive complexity 43; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/src/features/chat/messages/PendingApprovalCard.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61ddf77405e68095a4824ef736271e78f0be8e45c6d236a955960babc516333"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TerminalPanelShell (cyclomatic 45, cognitive 40): TerminalPanelShell has cyclomatic complexity 45 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"desktop/src/features/terminal/TerminalPanel.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b7a15ff29535a2c14c99fc313fda4892e9191e370b9456f3c451d3fd94394c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ComposerControls (cyclomatic 45, cognitive 34): ComposerControls has cyclomatic complexity 45 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 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":"desktop/src/features/agent/composer/ComposerControls.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffccbf9af32e9025a01f00418126d55a852f50a77509a91568f481d3f448cbf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remote_peer_request (cyclomatic 45, cognitive 21): remote_peer_request has cyclomatic complexity 45 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 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":"desktop/shot/mock/backend.ts"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08485c366fea4e4c9c5abacaf98fa0bb112d975b9536605261f383b7b233f6c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runSendPipeline (cyclomatic 44, cognitive 67): runSendPipeline has cyclomatic complexity 44 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"desktop/src/features/agent/sendPipeline.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8195602fa01f2770ad6a61e86b38cec90b888dc51ed61281d73783574faac23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyEvent (cyclomatic 44, cognitive 46): applyEvent has cyclomatic complexity 44 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61d8a1e1df4af7df452ee7bc8bdadd5d445c924c200744d3df29501bcc0087b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function analyzeRun (cyclomatic 42, cognitive 57): analyzeRun has cyclomatic complexity 42 and cognitive complexity 57; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"harness/lib/analyze.mjs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a91d5b193667247c056df04ffd86d363ce571055483085dae39b987bb6d31a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TaskForm (cyclomatic 42, cognitive 41): TaskForm 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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"68602cf707edfc7c511507e9cb9a7fdeb08813975bd5938436df152da031974e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteProvider (cyclomatic 42, cognitive 40): RemoteProvider has cyclomatic complexity 42 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/shot/mock/RemoteContext.tsx"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd45344c0155954d9e876346264d2e99b2c0219dfd1ce3394e51550103170719"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyOps (cyclomatic 41, cognitive 74): applyOps has cyclomatic complexity 41 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e05bf047ad0faf68c9d7bf55f6d6f19529f01418c8073e097de14f59a09b54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeyDown (cyclomatic 41, cognitive 52): handleKeyDown has cyclomatic complexity 41 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"90afe1ded903741a5c23687658babd083ac447affe33e6437ce24a65344cbb8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deterministicFindings (cyclomatic 38, cognitive 46): deterministicFindings has cyclomatic complexity 38 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":"harness/lib/analyze.mjs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eaa3017979f6aed3f4de275a69e6c8660fc5b1882807a4970a8bcf200319789"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function turnFromAcc (cyclomatic 37, cognitive 40): turnFromAcc has cyclomatic complexity 37 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/thread-projection/src/projection.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"7068e1dfea7c0804b1304b673fa0b0a392528a619968ef78a452f2149c568bc5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function affected (cyclomatic 36, cognitive 66): affected has cyclomatic complexity 36 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":"scripts/ci/affected.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"814872a06411d2831dc8c23d2d48f21a3c3376015b6c9343ef1df7967b2d9dc4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 62): (anonymous) has cyclomatic complexity 36 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc75ba6fe5bcde4b33723c9e61321931a717a89d562babd53fbcf450bebc8bdd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AppShellDialogs (cyclomatic 36, cognitive 34): AppShellDialogs has cyclomatic complexity 36 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 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":"desktop/src/components/layout/AppShellDialogs.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdda7730eaac3398352b0745c52e6fd4514f959ff15cab029a1ee90c7d2378c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remoteAffected (cyclomatic 35, cognitive 50): remoteAffected has cyclomatic complexity 35 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":"scripts/ci/remote-affected.mjs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"995d17a720b8954638ad6ca3f63d6f961d9980b94d74c626fb4f7607b38cc891"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 35, cognitive 44): (anonymous) has cyclomatic complexity 35 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd832c9bfd17f052129e459655bca3873d4f65408badebf3a016cb7db846c8d8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MergedRows (cyclomatic 35, cognitive 34): MergedRows has cyclomatic complexity 35 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 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":"desktop/src/components/layout/MergedRows.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98d5226ab28cfc77bd7922dfade8da6bf4de150a75eba14ec599ed221944fab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function OnboardingGate (cyclomatic 34, cognitive 31): OnboardingGate has cyclomatic complexity 34 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 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":"desktop/src/components/layout/OnboardingGate.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"828ffc3d27cf85a4b0002730a7a125e331498aa399280b418c5d7e953dc93b84"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function submitValue (cyclomatic 34, cognitive 31): submitValue has cyclomatic complexity 34 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 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cb80a067dc9ad12277e160526a8fc05ade019a5514c85569479b48ab441c31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteHostSection (cyclomatic 34, cognitive 30): RemoteHostSection has cyclomatic complexity 34 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":"desktop/src/features/remote/RemoteView.tsx"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"097165bbd9fbcb779dee957a1a48065a97e240e8849eacfc343e9dcc438bb83a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SettingsScreen (cyclomatic 34, cognitive 27): SettingsScreen has cyclomatic complexity 34 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 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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"237af336796ae24336c7df3791d55361a39231d55d32f0f444f11b3ea3b8adff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupMergedRows (cyclomatic 33, cognitive 52): groupMergedRows has cyclomatic complexity 33 and cognitive complexity 52; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d9c3cfbfb91d2e06b3bf535460fc84f4988c4ce3ae963fa43155e084528ef5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function messageToItems (cyclomatic 33, cognitive 35): messageToItems has cyclomatic complexity 33 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e67f65e10f40ad9582d398a8e4ead6548d2ad7b575cc06b4c85bf9d934bf205"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadThreadHistory (cyclomatic 33, cognitive 31): loadThreadHistory has cyclomatic complexity 33 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 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":"desktop/src/features/agent/history/loadThreadHistory.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9365962ac5ce32b2bb39d07595f887bfbc2ab6bee9143b626605279066dded6e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 32, cognitive 42): (anonymous) has cyclomatic complexity 32 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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d24ee946b87b6c119c3c7230f7b60b5f6fa94ce880ae63151d308c91652d822"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAction (cyclomatic 32, cognitive 30): parseAction has cyclomatic complexity 32 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":"packages/thread-projection/src/approval.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a90a51e168ab45970f610272c402000e69d0ffe7a3d98443b802ece087d987"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderLevel (cyclomatic 32, cognitive 28): renderLevel has cyclomatic complexity 32 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 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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc19bbbdb91c573e363646777285c70797699a317f9ae247ddef826b347028e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useConnectionSummary (cyclomatic 32, cognitive 27): useConnectionSummary has cyclomatic complexity 32 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 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":"mobile/src/components/ConnectionStatus.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac89e667be9c6d28dee7206074cb29626c20854d3efa59f3b8b872f81e99d8b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 32, cognitive 24): visit has cyclomatic complexity 32 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/ci/remote-boundaries.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"606ba2610d74a192b8a76306c1588b7c44a0b48ecb9fd6aa7c73619601713b21"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleCatalog (cyclomatic 31, cognitive 40): handleCatalog has cyclomatic complexity 31 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34576705d5336de0f1b2a9fb9b20b6a327402d85cfa1b29306899b4d998d976"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectSocket (cyclomatic 31, cognitive 34): connectSocket has cyclomatic complexity 31 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":"packages/remote-client/src/client.ts"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecfbcca1c4bd7a0817e493f130a7cd3c4853d49069215da293e86ffd11c77f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drawOffsets (cyclomatic 30, cognitive 64): drawOffsets has cyclomatic complexity 30 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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/screenshots/cdp.mjs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb841f2963fa9ef504897bfa4b5792eb762c7c6953664f3dfde34fd15d81199e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 30, cognitive 46): (anonymous) has cyclomatic complexity 30 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"164cafdee8e8b679536ceb4ff4e79076f2330b07d600555218a29089cd770495"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleSubmit (cyclomatic 30, cognitive 42): handleSubmit has cyclomatic complexity 30 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"586e58947f150ff0ad5349d63a5a910f74d444e85cdd1e7d9a9b5076a46e635f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentStatusGate (cyclomatic 30, cognitive 34): AgentStatusGate has cyclomatic complexity 30 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":"desktop/src/components/layout/AgentStatusGate.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"838d774071463dbd2ccfbb70759f6b57b9adbe5b55e761f931c7188d0fe4e8c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function projectRunForLivePreview (cyclomatic 30, cognitive 32): projectRunForLivePreview has cyclomatic complexity 30 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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bae57da76198567698a8c9bfd127eef26b646f7b273669eb78cc423c2e75ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatJsonForPreview (cyclomatic 29, cognitive 50): formatJsonForPreview has cyclomatic complexity 29 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":"packages/json-preview/src/index.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bda36593eb75f09f0f4e1191ac72f10306a765dcce22368d7cc4133afd006c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function plainText (cyclomatic 29, cognitive 40): plainText has cyclomatic complexity 29 and cognitive complexity 40; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"mobile/src/features/chat/utils.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e3c109eadcf28a8839c4314d70e059e11b00869583325fd8a536e291ec1c8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AccountPage (cyclomatic 29, cognitive 28): AccountPage has cyclomatic complexity 29 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 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":"desktop/src/features/settings/AccountPage.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"061f5563d1e159d45f67ad714676b6246099bbde12aa3a792a45cb39380f917d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FileTreePanel (cyclomatic 29, cognitive 27): FileTreePanel has cyclomatic complexity 29 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 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":"desktop/src/features/filetree/FileTreePanel.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a822af083cb9f55e30a0da4ef2a9e72e9070f35509d4c72ea5341bfa68c162"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgeCase (cyclomatic 29, cognitive 27): judgeCase has cyclomatic complexity 29 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 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":"harness/lib/analyze.mjs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc848e7d24c2526f4285d756d442c1139b1c93501db3d80efb5d51613b90462"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StandardToolRow (cyclomatic 29, cognitive 22): StandardToolRow has cyclomatic complexity 29 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 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":"mobile/src/features/chat/messages/ToolRow.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4461b60963f52d940403e212b6d1e310fb8ef353eb821d5a266020a2cc480c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 49): (anonymous) has cyclomatic complexity 28 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"141cab7cddcf389e825cbfcfbb2d6327cca660c31489fe037f19f336835955d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 28, cognitive 38): main 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":"harness/scripts/visual-regression.mjs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"8811925207c335a3b5fa9a62705d008a1ed53e84cb0a8140662769bfe9c433d0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 28, cognitive 37): (anonymous) has cyclomatic complexity 28 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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4c4bbfb7eb777a83f5f97cdb1e9557bec46a108549f01d0be6c4ee67976a17"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteFilesPanel (cyclomatic 28, cognitive 28): RemoteFilesPanel has cyclomatic complexity 28 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":"desktop/src/features/remote-peer/RemoteFilesPanel.tsx"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7106e9b9b9663033d64bdf46ca190d03f525b1962901732961ba00328bd81c62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FusionDiscussionPanel (cyclomatic 28, cognitive 21): FusionDiscussionPanel has cyclomatic complexity 28 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 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":"desktop/src/features/fusion/FusionDiscussionPanel.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ebe5aa3bc2f718d6abfa2e3bca8ff2f06ce92465920538f9cdd6f618f62eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function perfValue (cyclomatic 27, cognitive 35): perfValue has cyclomatic complexity 27 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":"harness/lib/run.mjs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ce326e0d39f822c95992fef5fb28c48f4f5e9299c9a84592c3ea81a23976ac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 26): (anonymous) has cyclomatic complexity 27 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 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":"mobile/src/features/chat/composer/useComposerSubmission.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a94068f224a953c72142b2aab4b4b21578d893e748433df5e5735b5ec07f773"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRust (cyclomatic 26, cognitive 44): checkRust has cyclomatic complexity 26 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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/remote-boundaries.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"541b275a8e5d3d7fcb774640aace8df38323f5346075af912335ada0da8cb336"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 42): (anonymous) has cyclomatic complexity 26 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":"packages/markdown/src/streamingMarkdown.ts"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"79afac4c1d511b8a3b17df270fee46eea94f45fca30dbe53d9975209485f0235"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRefreshToken (cyclomatic 26, cognitive 35): runRefreshToken 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":"packages/remote-client/src/client.ts"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cad21d6dac9ef868e290f20117f4bf408e890441378bcfc199587ce4d27457"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processEvent (cyclomatic 26, cognitive 29): processEvent has cyclomatic complexity 26 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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"16898fced05097a8d20f5b12dae9a945e896ffa3d6b5168229460597351b7cea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRemoteCnCase (cyclomatic 26, cognitive 29): runRemoteCnCase has cyclomatic complexity 26 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":"harness/lib/remote-cn.mjs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"838dc84ca0d11a091ffe83ff676ccb224cb0e987ca24993a492d30ca72494544"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyStandaloneCompaction (cyclomatic 26, cognitive 23): applyStandaloneCompaction has cyclomatic complexity 26 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 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"f299d75bf26897a4c5651a273df78b3ef8c1a49369826326faf429a1bd33f4ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteConversationView (cyclomatic 26, cognitive 22): RemoteConversationView has cyclomatic complexity 26 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 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":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed945d184e5e55b40ab6be74ea30f5a48f76e768ef5239a275141ceab25f19e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyAgentError (cyclomatic 26, cognitive 20): classifyAgentError has cyclomatic complexity 26 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":"packages/thread-projection/src/format.ts"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1a19447c0580e0a268f0f08e7cf952605660716ec005aa2f306d577e7553ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function blockToFutureNode (cyclomatic 26, cognitive 14): blockToFutureNode has cyclomatic complexity 26 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":"packages/markdown/src/parseFutureMarkdown.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7a6e3c20d27cbc3b382e443b2633fed9c53b560968329348eb5112dd061a5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRemoteCases (cyclomatic 25, cognitive 37): runRemoteCases has cyclomatic complexity 25 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":"harness/lib/remote-driver.mjs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4774e4ea28f8547219b3caaae0401dcd70fd78670afc5a2967b5d06dec75c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 25, cognitive 33): handler has cyclomatic complexity 25 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":"desktop/src/features/agent/runtime/useSessionMessageEvents.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfb692352f6bd057f23a679fbd29c1f7c90261d06f95c06f000ef0d1f5d8d3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restoreServingConnection (cyclomatic 25, cognitive 21): restoreServingConnection has cyclomatic complexity 25 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 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":"packages/remote-client/src/client.ts"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee08e8f97c8ad4007716e2a9730fb9fc7280f14adc30e7498906033af67a2dd9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeConversations (cyclomatic 24, cognitive 45): mergeConversations has cyclomatic complexity 24 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e3261be0cf225acf512cd6769e9ad8869c747cb57cd25fe3c34facb9bab8c0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyContentRange (cyclomatic 24, cognitive 32): applyContentRange 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":"packages/thread-projection/src/contentRange.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d20cb6364b8705f737c797b2de6782759d7432024adeba10508bb18a0653431"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 24, cognitive 28): (anonymous) has cyclomatic complexity 24 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/skill_reco/server.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c01b812ac0df5c0a074adab952510c7331c54b182c363ab5868886e3a431ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemotePeerSettings (cyclomatic 24, cognitive 25): RemotePeerSettings has cyclomatic complexity 24 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":"desktop/src/features/remote-peer/RemotePeerSettings.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f83588ed3c19b64a77191a83a111dbda3290ffb485b2da3323c64aa06a8ba7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderBlock (cyclomatic 24, cognitive 23): renderBlock has cyclomatic complexity 24 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 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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"9414f4c5b640ebce5418cdbfebded0ab2a7820adae02e2c1ad6a33bcbd781cae"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replayInto (cyclomatic 24, cognitive 22): replayInto has cyclomatic complexity 24 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 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe15e9eb2dbe35cf6b81c04c84f1d0d60e5e685e409171e72365b9ffa985bb8a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ToolCallDetail (cyclomatic 24, cognitive 21): ToolCallDetail has cyclomatic complexity 24 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 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":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cab5d3bc2701a5f73ceee47b753279201129a096c975e0abfe8f48cb29d6a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ComposerToolbar (cyclomatic 24, cognitive 19): ComposerToolbar has cyclomatic complexity 24 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":"mobile/src/features/chat/composer/ComposerToolbar.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3956295b4bc7737fc2af6aef9ce4c8c4dc1d2b0131673413dec4adccc7490908"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 23, cognitive 33): validate has cyclomatic complexity 23 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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"6307f46e9aacf69386fe53f68e44dfe17d97925d4c71e53cc99fb74d567053d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ApprovalPrompt (cyclomatic 23, cognitive 22): ApprovalPrompt has cyclomatic complexity 23 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 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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6429086f1c457cc123cbfab26cb5797bf8a947e174dd67572cda1df13d99802"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function NewConversation (cyclomatic 23, cognitive 21): NewConversation has cyclomatic complexity 23 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 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":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4087d13adeeb0227b8e20eb5ace5260f60c4eaec568ffaf4aa02e6ab04416424"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ShareIntakeMenu (cyclomatic 23, cognitive 21): ShareIntakeMenu has cyclomatic complexity 23 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 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":"mobile/src/share/ShareIntakeMenu.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ab79a7a2857c128b430a299979318224b43677495bb48954069faaa1e250cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ImagePreview (cyclomatic 23, cognitive 19): ImagePreview has cyclomatic complexity 23 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":"desktop/src/features/filepreview/ImagePreview.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b546a00ba49fbc0ad205e21ea995e8fc7f0679b08e245945264799aa04489fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SessionFilesPanel (cyclomatic 23, cognitive 19): SessionFilesPanel has cyclomatic complexity 23 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":"mobile/src/features/chat/components/SessionFilesPanel.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b76a95fbc5bb3375898d1ab92b0d2eb2e49441e3f799fbe4842319b9b582c06"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 23, cognitive 11): (anonymous) has cyclomatic complexity 23 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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"14de3b1bc70138454eacefca6cc1d33ad8e87518470ee96f64330d406b44c4e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applySettingsEvent (cyclomatic 22, cognitive 35): applySettingsEvent has cyclomatic complexity 22 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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23fc0eb1b05636cef2e268b260712df330c23579f47975793d296a0656b2fcb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function entriesToTurns (cyclomatic 22, cognitive 35): entriesToTurns has cyclomatic complexity 22 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":"packages/thread-projection/src/projection.ts"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cf170c1bfe20a4aee4fb263de920d888aca98c1c95ca75475b46d43fcf51f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRemoteMobileCase (cyclomatic 22, cognitive 31): runRemoteMobileCase has cyclomatic complexity 22 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":"harness/lib/remote-mobile-live.mjs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb35f77c408dd353052594c2fdb406e2df73f201221da9cc2b40f01dca1a580f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visit (cyclomatic 22, cognitive 25): visit has cyclomatic complexity 22 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":"desktop/src/features/agent/composer/mentionDom.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cf1dc920c9744a85fc7f3262749872f6a73bb925c54c16ccb28791b83ac957"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chooseDestination (cyclomatic 22, cognitive 23): chooseDestination 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":"mobile/src/share/useShareIntake.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f96ddc9f2bbfe983d8552be26527228202b82de9b9a5a1fcc6c5ea8a831f974"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 21): (anonymous) has cyclomatic complexity 22 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 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":"desktop/src/features/agent/FusionActivity.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c5d1abe23c4f27ba25053d9da634b2c30ac2ff33a6d0b367ce92774a43c19b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 21): (anonymous) has cyclomatic complexity 22 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 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17d63231cb3f193e574b0cbfca26003a5481974311794892ae2bc05da03cb42"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TaskForm (cyclomatic 22, cognitive 21): TaskForm has cyclomatic complexity 22 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 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"61937d109cd98ffcd97893c740a3a8263ddac8a1fb0a43eec6c8bb6d3415e4b6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyLiveEvent (cyclomatic 22, cognitive 21): applyLiveEvent has cyclomatic complexity 22 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 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"02738dc062f885cd1a3f0c15f047bf0f9b81c99eb8cc8bb0b805add89c9366dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 20): (anonymous) has cyclomatic complexity 22 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":"mobile/src/remote/timeline/useOlderHistory.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7ea4753d97e2ac47fcc1526e59a2438ad9a2d87141bfd1cefc00758d081aa7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ComposerImpl (cyclomatic 22, cognitive 19): ComposerImpl has cyclomatic complexity 22 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11afe97e130fc767ead56b1999ab024249a65f17db281d371c195bc5996fc85"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPendingPromptDirect (cyclomatic 22, cognitive 17): loadPendingPromptDirect has cyclomatic complexity 22 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":"mobile/src/remote/pendingPromptStorage.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"70d6ea308f23425119ba9aca10f9b81f4ae4df9ad35cc76647b2a5b21f0e3fd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function UpdateRecoveryPanel (cyclomatic 22, cognitive 15): UpdateRecoveryPanel has cyclomatic complexity 22 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":"desktop/src/features/settings/UpdateRecoveryPanel.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b48fba89d343f932048acc29f96136bcaab7a1c4203e0f126d2c32a3898069"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readContentPages (cyclomatic 22, cognitive 15): readContentPages has cyclomatic complexity 22 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":"packages/thread-projection/src/contentBody.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9803932e57871ba7a23dadd0057afdcb17682b154c854d384e808b81fe7ea2fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSegments (cyclomatic 21, cognitive 51): buildSegments has cyclomatic complexity 21 and cognitive complexity 51; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6beacfaf7e46f27a419f389f95c09fcf0bf66c49d64433e673ec84d503dcd3b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compose (cyclomatic 21, cognitive 46): compose has cyclomatic complexity 21 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":"packages/thread-projection/src/cooperativeJson.ts"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e3d529c9d46e59db28fa7a96d51c863dde622e5fa736d7730e8faa8b1d87f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StepResponse (cyclomatic 21, cognitive 36): StepResponse has cyclomatic complexity 21 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 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":"desktop/src/features/fusion/FusionStepBody.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e25207e366064eecede55c02ce49f9211f620d5034266616ebfd8fe799637d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 34): (anonymous) has cyclomatic complexity 21 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":"packages/remote-client/tests/sharedCredentials.test.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ffe65f9a13c8076721e1d17ca1bb3217202aa60055b5bf3bd9aaa86b3a9f18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function judgeEvidence (cyclomatic 21, cognitive 29): judgeEvidence has cyclomatic complexity 21 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":"harness/lib/analyze.mjs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f3123e53f8df221650266f467236d31dbe40415b2bc93e0e7589971280e2bda"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runDownloadPrepared (cyclomatic 21, cognitive 24): runDownloadPrepared has cyclomatic complexity 21 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":"packages/remote-client/src/transfer.ts"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaace16ebdbb02c436c63284df6579fcc551515eb612207e7ad7c873aa75658d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 21): (anonymous) has cyclomatic complexity 21 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":"mobile/src/features/chat/useCompactContext.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1796761fcd85416f5acb50251dd529a6b8f6eada57bc21ec665d1dcf5646a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 20): (anonymous) has cyclomatic complexity 21 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":"mobile/src/features/chat/messages/FusionToolRow.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6851edbdd3e7cc9a724e4c02bc0c93897782765975837c3d533e2622375e902"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FusionActivity (cyclomatic 21, cognitive 18): FusionActivity has cyclomatic complexity 21 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":"desktop/src/features/agent/FusionActivity.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"51987d8d261bc522bcbb751929c03e94c7cf5c87541fd14f0108728ebff738ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 18): (anonymous) has cyclomatic complexity 21 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":"desktop/src/features/settings/useFutureLoginFlow.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9780adfee63ebb5aaca61e3e51514a81dcb1374143bfa251360ce92a680ad0ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ChatTimeline (cyclomatic 21, cognitive 18): ChatTimeline has cyclomatic complexity 21 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":"mobile/src/features/chat/components/ChatTimeline.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43ae1174a6ff620c5c66e53593b865e15ba740d7c153e93efc8c3a609313cb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FusionToolRow (cyclomatic 21, cognitive 17): FusionToolRow has cyclomatic complexity 21 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":"mobile/src/features/chat/messages/FusionToolRow.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3af09c8bfca44fe5625a2235980ac682711fb5260dae8c944087b3d8839639"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SkillsSettingsPage (cyclomatic 21, cognitive 15): SkillsSettingsPage 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":"mobile/src/features/settings/SkillsSettingsPage.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"883aaca982175922d275878b184bc5b3a23560fd6209487bc8507b7a932aab4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 14): (anonymous) has cyclomatic complexity 21 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":"packages/git-graph/src/index.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"324dd9794edb0ea92dd6bfd97563cdc6036adeec676b319ff56b1a470b4ddfaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inlineNode (cyclomatic 21, cognitive 9): inlineNode 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":"packages/markdown/src/htmlBlocks.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1979f552fd4fa3aeae82753062aaee0329f3ae2046c8c705e20df9ea33b57e0f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 28): (anonymous) 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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"a288ac27ee4ed925cf662b3d56400d9c7d70d0cb0c68518a7331722f69ce2e68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 28): (anonymous) 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"e918b529e46dc92d7b1b5670d9a71444718c1474fc12e75cba1a198321a2041f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ActionDetails (cyclomatic 20, cognitive 25): ActionDetails has cyclomatic complexity 20 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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb2ad53919883a8af1e83ef9190506f09ad29df11421ffd08d87758f880df08"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function bodyFor (cyclomatic 20, cognitive 22): bodyFor has cyclomatic complexity 20 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":"harness/lib/issues-en.mjs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"041267c92cf648ca1048416fa94cdf1cb7784bd6767a9764af1e5d787c1e9052"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draftIssues (cyclomatic 20, cognitive 22): draftIssues has cyclomatic complexity 20 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":"harness/lib/issues.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43f031de0b7db6c3b3967f2a1c24b3b9c5d8238b6a5eef9e78336c698e88578"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pairingErrorMessage (cyclomatic 20, cognitive 21): pairingErrorMessage 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":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f27186d4ec3688d6bda7dc92976efa92eb08940644e9aa4df9a094d8c4d5ba3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderBlock (cyclomatic 20, cognitive 20): renderBlock has cyclomatic complexity 20 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":"desktop/src/features/markdown/MarkdownContent.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"99db19500855e248e3044059518cc9269c64af4b2c84940fa99dcaa52144fdd0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remoteConnectionPresentation (cyclomatic 20, cognitive 20): remoteConnectionPresentation has cyclomatic complexity 20 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":"desktop/src/features/remote/remoteClient.ts"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25ef69314680c341c4f9192a7944c30844b25b7f013e0de5dd31c55fa3dfe01"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepareFile (cyclomatic 20, cognitive 20): prepareFile has cyclomatic complexity 20 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":"mobile/src/remote/files.ts"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d898235b438346ef08303240caa36807af4170063562572da9cb1cd33a84216"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ToolRow (cyclomatic 20, cognitive 17): ToolRow 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":"desktop/src/features/runs/RunsPanel.tsx"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9294103604e54a20f44d8a067202d1f731e60e2d649ddc950ea94b7d0313f9e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ThinkingRow (cyclomatic 20, cognitive 17): ThinkingRow 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":"mobile/src/features/chat/messages/ThinkingRow.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8759cd6a950e3afe76429fe52af31414ee0186f8b2fc4d9f43aff91891730353"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pasteFiles (cyclomatic 19, cognitive 24): pasteFiles has cyclomatic complexity 19 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0719c431a784b004c3f90f43b64798e445f845a12c8408005e092d908ac0236"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 24): (anonymous) has cyclomatic complexity 19 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b18f146596290088deef535ffbd2f5b659e8a633aee8e67e941ffbb044bd4c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function labelForActivity (cyclomatic 19, cognitive 22): labelForActivity 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":"desktop/src/features/agent/AgentActivityList.tsx"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1e82d1c9fea8636c2d17f85ea6b1c3bf7052963712489a32079c641eed0c5e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 22): (anonymous) 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":"mobile/src/features/chat/__tests__/useFileDownload.test.ts"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf6e59f24a999c3c286766b769468c0b415c246ebfe2aa9d70f220a30081633"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamShotRun (cyclomatic 19, cognitive 20): streamShotRun 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":"desktop/shot/mock/backend.ts"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80e2b57604d66276256cf73f09419ef99cc99e1d4aedc2e4d03f8561e13ca82"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyError (cyclomatic 19, cognitive 20): classifyError 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":"packages/remote-client/src/connectionState.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c595a679f787564b0688426120e0e08f4f022ebfd98b23b0570d3ab26fcbad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ProvidersPage (cyclomatic 19, cognitive 18): ProvidersPage 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":"desktop/src/features/settings/ProvidersPage.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e64d36b2513849fc5ceb8515de13af1fff00cbb18efb4ec643fbaaf7c509d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 17): (anonymous) 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":"desktop/src/components/layout/hooks/useRemoteDoneBell.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"67bbb3f3cfa90fcb3d34114cc8e292e04c17ad8814b1628a8b74b9226825f354"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dispatchShortcut (cyclomatic 19, cognitive 17): dispatchShortcut 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":"desktop/src/features/keyboard/dispatch.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe04c15d8cdc5d90e16a1f5cdce47790a6cdc79c9372e46091af408cced7268"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 16): (anonymous) has cyclomatic complexity 19 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":"desktop/src/features/agent/useThreadMessages.ts"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cbed2d6d1ba9415218280c0a85bed6eb393865e3c7e5900b6298f86577d906"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 16): (anonymous) has cyclomatic complexity 19 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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe8d617182f76aeb330e9389af76764d43dcff1a5c6e6795c819a69ab7f32a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 19, cognitive 16): (anonymous) has cyclomatic complexity 19 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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"b571d31d91a8f11b1cc56586e028e311f6603e2e2fb895c5356fe504dbab9e69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function chunkOf (cyclomatic 19, cognitive 13): chunkOf 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":"packages/remote-client/src/readPages.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72aef8869741f9688e4c80a67a96a72f6e78a3d0651367eaccee3ab56b56f92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 27): (anonymous) has cyclomatic complexity 18 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":"packages/remote-client/tests/secureClient.test.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"53cd9a19b4028fbc982a813b71e537e414167651ae9083bbf58ec46bb1181438"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function localFilePath (cyclomatic 18, cognitive 23): localFilePath has cyclomatic complexity 18 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":"packages/markdown/src/localPath.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eec59e468d78b98103e3812176cad85ac88d3b46b4c12c63606f89e7e90f53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function signal (cyclomatic 18, cognitive 22): signal 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":"packages/remote-client/src/client.ts"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87318c6c711e396874a7b1dc8e856f7575e7774b9fc933dec63739e019ff754"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tailCoversRange (cyclomatic 18, cognitive 21): tailCoversRange has cyclomatic complexity 18 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":"packages/thread-projection/src/replay.ts"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"577c0c9f04402a60b51d6f8025133e6cbff153d12c081ae1346e10bd4b8e11d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function read (cyclomatic 18, cognitive 20): read has cyclomatic complexity 18 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":"desktop/src/integrations/storage/historyTransfer.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fe17a6c4a2f634b6efcc242783ecd2e68139a95f287dbf154cd619dd35e052"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRemoteLiveCase (cyclomatic 18, cognitive 19): runRemoteLiveCase has cyclomatic complexity 18 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":"harness/lib/remote-live.mjs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"02a4a2b31cb26688bc0b9d05f6e207aa3da780aee8a14e92e31e580d2db9e480"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 18): (anonymous) 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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0ca743e54ec730aaa47af2d10b919878d0572ae8bcfb6c89f180430a36181d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkRemoteSpecifier (cyclomatic 18, cognitive 18): checkRemoteSpecifier 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":"scripts/ci/remote-boundaries.mjs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72cf7c7ef21e37e0c231ffc5919f14b8855a998a8127e9e5f02b276166dceec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function update_task (cyclomatic 18, cognitive 17): update_task 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":"desktop/shot/mock/backend.ts"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cc2cb55c55d10f7ee1ad2ecb34d00268e3ec5ffcf37232b39cb724a43e74a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) 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":"desktop/src/features/agent/composer/ComposerControls.tsx"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b493c02f9066e51551b7a5063e68459067c51a78e5160df0e6ea251a837d32f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function appendSuffixToNode (cyclomatic 18, cognitive 17): appendSuffixToNode 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":"desktop/src/features/markdown/useStreamingMarkdownBlocks.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"121ba8bf860181389760d01ab0c6b6e20e74b0966501b5a5b7813f39ef75c4bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RunInspectPanel (cyclomatic 18, cognitive 17): RunInspectPanel 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":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b2dcf51b157d43d6325cc81819d7ed27cf83048c5925a54e286a1aeb531a54"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) 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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd62340ce19dfbc46cfa270843c9d7fe20ad3362a10af77b242372691191065a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 17): (anonymous) 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":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca471c7a235f01e916185584e1c7a58bba866501cfa423947659cd45e37480e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fusionProgress (cyclomatic 18, cognitive 17): fusionProgress 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":"packages/thread-projection/src/fusion.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c97433f5446bce0b47686306f070a7641f751a8078f4630a148d5f1e6ee4f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ThreadListItemImpl (cyclomatic 18, cognitive 16): ThreadListItemImpl 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":"desktop/src/components/layout/ThreadListItem.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadc8cc09cc121cbf6e4031faded6329e2da13e70006f312883322db7b5a67e4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 16): (anonymous) 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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"b058bcddba2c04ce0dce43ab47a2042e2fd946d68b474c3689ccde642924cdbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 16): (anonymous) 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1844}}}],"partialFingerprints":{"codehealthFindingId/v1":"206c16cce530b5af956161d73bc30a938766f259e93ed9fd9a7f84c704fe02fe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GeneralPage (cyclomatic 18, cognitive 15): GeneralPage has cyclomatic complexity 18 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":"desktop/src/features/settings/GeneralPage.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"050f3de6345f85c52a16120c4f5d723daeed8036931169488e37f52f7cc53197"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Editor (cyclomatic 18, cognitive 15): Editor has cyclomatic complexity 18 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":"mobile/src/features/settings/FusionSettingsPage.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cc75d9af4f6ca1b835f960d2dd3a6306fa6917b7782c55c8a9d42d5cffb64d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarize (cyclomatic 18, cognitive 15): summarize has cyclomatic complexity 18 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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaab2514ebb751fb38f675404451b97c6484f64b66e0fd7387166b505df99c6b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 10): (anonymous) has cyclomatic complexity 18 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee65efd7e4045ca9ee9dac782cae4b8c38c70d984b0dc26890d93bc34dd96aea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function laneDrawing (cyclomatic 17, cognitive 29): laneDrawing has cyclomatic complexity 17 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":"packages/git-graph/src/index.ts"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d02d40e6ea5919a7d6ff0e09b49dff6ef8b2ab53fd9ee7b262733ae26526a60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function htmlBlockToNodes (cyclomatic 17, cognitive 27): htmlBlockToNodes has cyclomatic complexity 17 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":"packages/markdown/src/htmlBlocks.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2988d86eb1e4433c37b8cdb6597c2deb622ee736eb4d578bfa31d8aa51a57b40"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function segmentToTimeline (cyclomatic 17, cognitive 24): segmentToTimeline 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"89fa71ff5183b3c5083555f78dbbbb570f3299a1e986f96abc161673b64d0d55"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 21): (anonymous) 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":"desktop/src/features/skills/SkillsView.states.test.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"223b662c2446107fedad2130e7da2f1f8880d01555cc201d064aa17319633c63"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveVersions (cyclomatic 17, cognitive 21): resolveVersions 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":"scripts/version.mjs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1594d573a40919eca3d2b1aef8ea78cd5471b1b03fc39e60b390d64bf0b316b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remotePeerErrorKind (cyclomatic 17, cognitive 20): remotePeerErrorKind 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":"desktop/src/features/remote-peer/remotePeerError.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edf4941488b6aeb66b058835df329f3b8881c9e3d60c37535115152da76da90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 19): (anonymous) has cyclomatic complexity 17 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"df97c1554cbe8be673b8eca920f697f42989b26da0d75b32bea300350f762a11"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create_thread (cyclomatic 17, cognitive 18): create_thread has cyclomatic complexity 17 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":"harness/lib/fixture-server.mjs"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00175837b9089f16ec75e0b91d3f966e352bc324182d602baf39db1cf435683"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function get_fusion (cyclomatic 17, cognitive 17): get_fusion 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":"desktop/shot/mock/backend.ts"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"53938f0461373983fb24b647650453c16ccc956f19e475f365291ae54fd782bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) 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":"desktop/src/features/agent/ThinkingBlock.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b8eb7cc9b2e3c9033b1aa2b9fad0bd99c947218b026f8feb70fede38cb2559"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ChoiceOptionRow (cyclomatic 17, cognitive 16): ChoiceOptionRow 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":"desktop/src/features/markdown/renderers/ChoiceCard.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"7694521550e855484ef8d737d24ebe4a9c7ec2b3ba68df76a3613e3f603f2070"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function promptRemoteConversation (cyclomatic 17, cognitive 16): promptRemoteConversation 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c7638cf19f7008558a5fd51dac627864b3b538c126c8c1a7f63cd48c0f1fab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ReviewPanel (cyclomatic 17, cognitive 16): ReviewPanel 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":"desktop/src/features/review/ReviewPanel.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1826b0b1c52f2e1d3b039ab84532010ce58b3545ec5e4ef10693ae8613885c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CustomProviderPage (cyclomatic 17, cognitive 16): CustomProviderPage 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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0089ee1132a1695bf827c7482f9e5735947b20c90c84702887e97a0bb9104938"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 16): (anonymous) 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":"mobile/src/screens/DesktopsScreen.tsx"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d0fe4410afb004433ceccb4bdac5d451efb3fa5d1231ce9590c29d8c894894"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function connectionPresentation (cyclomatic 17, cognitive 15): connectionPresentation 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":"mobile/src/remote/connectionPresentation.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad6f536d6d25b72ab8531bfe71af2a646d00e198e1e035cf32c5413c86bdc7d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeTrigger (cyclomatic 17, cognitive 14): summarizeTrigger has cyclomatic complexity 17 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d1178c5cc324b7ac22e21a854506a4e2d95c305c2b4e48a863069cff453c68"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pump (cyclomatic 16, cognitive 25): pump has cyclomatic complexity 16 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":"packages/thread-projection/src/contentBody.ts"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c68932c5d6993b453fa3d5ceb70cce4560bb01fbac8ed2069bde49142a33b036"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recentHierarchy (cyclomatic 16, cognitive 24): recentHierarchy 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":"mobile/src/screens/recentRows.ts"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"74307fb506023010b3a6e8e167750c02a6ed1bf20185eb957ba1f5d853a12b18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function archivedRows (cyclomatic 16, cognitive 24): archivedRows 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"177b801597bd484b4bb10c3683853065752e67d49ff613399e2da092ad98b2ba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildTree (cyclomatic 16, cognitive 22): buildTree has cyclomatic complexity 16 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":"desktop/src/components/layout/threadTree.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"980a238f57960c6d2d130e37341b5a2016050382d024f283b92dbc16999ae5dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSessionTree (cyclomatic 16, cognitive 22): buildSessionTree has cyclomatic complexity 16 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bc1817a7f36b27ea387ccf3c9d41ce4fe5132f4d9fc93c317990d44b24f96c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleFailure (cyclomatic 16, cognitive 22): handleFailure has cyclomatic complexity 16 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":"packages/remote-client/src/client.ts"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"3483fe927cc78757da223bdbf892a43cc9c1356d7c42e6bbb042a367560ecc0d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectThinkingLevels (cyclomatic 16, cognitive 21): detectThinkingLevels 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"6023bc54cb67281582a40fc0e6bc44e429f442f7be4935c37ed40ea8bbd5b698"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function numberEnd (cyclomatic 16, cognitive 20): numberEnd 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":"packages/json-preview/src/index.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"968d75ffb42d2b7e42b2d3397341de7252cecea697cf8d1965f1f8f2a83abd77"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function foldAssistantEntry (cyclomatic 16, cognitive 20): foldAssistantEntry 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":"packages/thread-projection/src/projection.ts"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c132d5d8e6a479c72fa8eaf20bff22dacc8854a15c4cdf85888f52f6fb3b615a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FutureEmbed (cyclomatic 16, cognitive 19): FutureEmbed 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":"desktop/src/features/markdown/renderers/FutureEmbed.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ada11e4a8abc72d5129c0ff03375b862d350b137b010f4dfc77c0667e5733a9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRecovery (cyclomatic 16, cognitive 19): runRecovery 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":"packages/remote-client/src/client.ts"},"region":{"startLine":631}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14e6ee78b7739dd9c338fc36a26ae68964d34a2b6a7c6e38034925013d5d3d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function attachPastedFiles (cyclomatic 16, cognitive 18): attachPastedFiles has cyclomatic complexity 16 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":"desktop/src/features/agent/composer/useComposerAttachments.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"150e9b5dab5815de50a3111bc98a264773e6b73d394fc369ba6895858b6589e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) has cyclomatic complexity 16 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":"desktop/shot/terminal-server.mjs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"59246bedfc0c8897cb900b54af87804a4f54c3ebde6d0164aac074109e191512"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) has cyclomatic complexity 16 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":"desktop/src/components/layout/hooks/useContextData.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a16f7f9b18d96d188de3f4b2c0885279fe3cb8eccaf94dc033dce65517d481"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function entryFromEvent (cyclomatic 16, cognitive 17): entryFromEvent has cyclomatic complexity 16 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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f9ef596248b1ef75842280e67d6088d6d6c0c17876a3bad88108087a8e64f2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyQuoteGate (cyclomatic 16, cognitive 17): applyQuoteGate has cyclomatic complexity 16 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":"harness/scripts/video-judge.mjs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccf1c170a1ef6d71ebdd300fa46c6a029f855eb3d93df5843d40488e2a9f7ee"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) has cyclomatic complexity 16 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":"mobile/src/features/chat/useAttachmentPicker.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"933fc4adc4c8e84835a946795d19d1c58d4975dbd471c3bd448c271eab2e0ad4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 17): (anonymous) has cyclomatic complexity 16 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":"mobile/src/features/chat/useSendMessage.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd601b8424be54fa8d2c778a5cbfdc13809a9c7072e320f43a5819ff09f445f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function optionRow (cyclomatic 16, cognitive 16): optionRow 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":"scripts/screenshots/injects/choice-card-lib.js"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a858c059f8dbc6600c343dee7e39a41e12d7da2c8f57a23a54640a6425c3a8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 15): (anonymous) 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":"desktop/src/components/layout/MergedRows.test.tsx"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53d9d4c1e23a70368b61b011a6d5db179673e2130be66e0e336a0b8381e3c43"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function send (cyclomatic 16, cognitive 15): send 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc3b92d41121b5bf80ac0197027b372a283cc9a613be9a393508a981c42ef3e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteClientSection (cyclomatic 16, cognitive 15): RemoteClientSection 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":"desktop/src/features/remote-peer/RemotePeersView.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34931910d54887dd808a5f5be7bb74880ac00188aff81db920826f63c8ddce1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TaskDetail (cyclomatic 16, cognitive 15): TaskDetail 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9180ff744828caf4b5460aca74b61103091e7111845640cf8d44ce2a7476ff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PreviewLayer (cyclomatic 16, cognitive 15): PreviewLayer 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":"mobile/src/features/chat/components/PreviewModal.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"639384d0960a9859022bf1aaf041bf4af20ea753be40c30e73d3082a470d8c8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteDraftTargetChooser (cyclomatic 16, cognitive 14): RemoteDraftTargetChooser 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":"desktop/src/features/remote-peer/RemoteDraftTargetChooser.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f6d6ff0c5e209b3539b1280006303e75dc38e3865f7dbbbabd0f95c8be170de"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function installNextest (cyclomatic 16, cognitive 14): installNextest 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":"scripts/ci/setup-rust.mjs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccb4b400e8cc86f3c01df2860a86ab313d70beb43fea14679a6d46a277bce35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GitGraphPanel (cyclomatic 16, cognitive 13): GitGraphPanel 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":"mobile/src/features/chat/components/GitGraphPanel.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d45db8d3b1e5b823cb5a1033cb23cda361429731316141802e3de66c722109a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 13): (anonymous) 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":"mobile/src/features/chat/components/SendQueuePanel.tsx"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab96f5f69c00cee724d43b9ec560a59de21570854aaccd57b6843ccfa43472c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderMathSvg (cyclomatic 16, cognitive 12): renderMathSvg 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":"mobile/src/components/mathSvg.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3415e1387ce27534dd23ce4f9f8c24f64e9797062de7d2d669600b14a1cf9e8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isPreviewIndexEntry (cyclomatic 16, cognitive 11): isPreviewIndexEntry 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":"mobile/src/remote/files.ts"},"region":{"startLine":771}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fde13db540992184e81623f02f650915dbc349bc3a4869bee6acbfee75e30aa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function disconnectedCopy (cyclomatic 16, cognitive 10): disconnectedCopy has cyclomatic complexity 16 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":"mobile/src/remote/disconnectedCopy.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"2865d5c36873c2a7b15d67d1b1e927b50358ef79b80badc9f5d457f2f003eb78"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function contentRangeStart (cyclomatic 16, cognitive 9): contentRangeStart has cyclomatic complexity 16 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":"packages/thread-projection/src/contentRange.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac6390e3ac7d753f2629e84365bbd528ac84d0386d61b11bfd232802ca89adf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 26): (anonymous) has cyclomatic complexity 15 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":"mobile/src/features/chat/useComposerDraft.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ced997e4a5d740d31dd621687c36cc645292d0b4baec71ae8c8a3374fdf91b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenize (cyclomatic 15, cognitive 26): tokenize has cyclomatic complexity 15 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":"scripts/skill_reco/localRank.mjs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d50908fd698997e4e985557a7e8738192cc536903d825af31fcd45ae5aab23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function filterArchivedRows (cyclomatic 15, cognitive 24): filterArchivedRows has cyclomatic complexity 15 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"68aad885453b9348296db290709c8aff575bc9a45be475fff40f7c06f9865a60"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleInstall (cyclomatic 15, cognitive 23): handleInstall has cyclomatic complexity 15 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":"desktop/src/features/settings/UpdatePage.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f515f32b2be2e3e2078815f807522f55901f22fd7811d110759ab4121e5ee67"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function leanTargetForToolCall (cyclomatic 15, cognitive 22): leanTargetForToolCall 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":"mobile/shot/mock/leanRender.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cfb16fb04891512d5a39090152c71bfc32a168fb675bde4aca300dadb8dd6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collapseReplyDuplicates (cyclomatic 15, cognitive 22): collapseReplyDuplicates 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":"packages/thread-projection/src/replyDuplicates.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04ebd40b1885a73b0010faf18103555aa120f4e8933c93786680ad15e95a5a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onWheel (cyclomatic 15, cognitive 20): onWheel has cyclomatic complexity 15 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":"desktop/src/features/agent/useMessagePaging.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf802db554c98af7542441d06ad29b8704aef3f76f9e5c84582644069f77067"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function detectThinkingLevels (cyclomatic 15, cognitive 20): detectThinkingLevels has cyclomatic complexity 15 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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f80d0aca4096dfe0f734aad8d228e19bb10e78354a5ae8b3ff335eeec2356b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 20): (anonymous) has cyclomatic complexity 15 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"f272dbf69f7633990806de823ad5dda9537ba26a7dd6f418dc09587e4da156df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 20): (anonymous) has cyclomatic complexity 15 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"017e0961ee7752a80536ce68742d70f25d54873fe2f6ba763a4bfe7d7874e5e8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function findThreadTextRanges (cyclomatic 15, cognitive 18): findThreadTextRanges 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":"desktop/src/features/agent/threadSearchRanges.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af7bcdfc0acf03b8d3651b45697ef29bd49675039f10782d044fa7180bc1060"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function modelStatus (cyclomatic 15, cognitive 18): modelStatus 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":"packages/thread-projection/src/fusion.ts"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90927d80b9ab339f2b6eddc2d66519dd56b7e881749897b52bd671e6863657c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPrefs (cyclomatic 15, cognitive 17): loadPrefs has cyclomatic complexity 15 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":"desktop/src/features/terminal/useTerminalPanel.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98e9e1830ea73f1919139e4dd5e42c73c8b4f39460a28e6e4230ebc9906090c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runIssuesEn (cyclomatic 15, cognitive 15): runIssuesEn has cyclomatic complexity 15 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":"harness/lib/issues-en-run.mjs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"306ada1208424b344e8b4245298b5518499327690490fe13b22584a2e3134701"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePresence (cyclomatic 15, cognitive 14): handlePresence 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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd6f9c9582f41f08ca11d7495cd26431a8ba65e97a9170357f76dbdc25bedcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handlePaste (cyclomatic 15, cognitive 14): handlePaste 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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1af964a7e9de4e64a28919cb3d94ca1a56c8320b5274e54ddc92a2c089c595f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyRunToMessage (cyclomatic 15, cognitive 14): applyRunToMessage 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":"desktop/src/features/agent/history/runHistoryProjection.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"14db8f58f33eac17ccb2b3cc6a584588506a50f1966b141835dc2962f5fd16ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 14): (anonymous) 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd1078c91e834b679f1149a0941217b73990cd4686a5b2a31a3b724f1960eac"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SettingsDialog (cyclomatic 15, cognitive 14): SettingsDialog 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":"desktop/src/features/settings/SettingsDialog.tsx"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"308cfeba1beecf73d2a5c1e55168541a93f41a1cf65246d01864daf09fef191d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toTab (cyclomatic 15, cognitive 14): toTab 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":"desktop/src/features/terminal/tabs.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"78803c32bab4e4afadd27f33b68a702db5b50837b3ef1563f12a63c1bebb24cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PairingScreen (cyclomatic 15, cognitive 14): PairingScreen 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":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cbb35f9af16d31545bd1f5ad368e034892407ea413d9cc9a753c50f4f39a0c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fusionNotices (cyclomatic 15, cognitive 14): fusionNotices 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":"packages/thread-projection/src/fusion.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"003f3f3e8a0d3d1ae69ee1e0a6858ab52f65b597e8ec2e192a09d12cbe925b44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextEvent (cyclomatic 15, cognitive 14): nextEvent 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":"packages/thread-projection/src/runCursor.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"641019b707716954d1b3e9724598cb6e05b602f6bd3494ec2d9eeb231868a76b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteConversationRow (cyclomatic 15, cognitive 13): RemoteConversationRow has cyclomatic complexity 15 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":"desktop/src/components/layout/RemoteConversationRow.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5b43523976ad3c7bc36e2e362a9e7b0245044aa38236e8036f2e36feca98fd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AttachmentChip (cyclomatic 15, cognitive 13): AttachmentChip has cyclomatic complexity 15 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":"desktop/src/features/agent/messages/AttachmentChip.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9286e7df967fd5065df3b7f808908e5acb7fd5550d5036a8d726050bc0bc2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentActivitySingleLine (cyclomatic 15, cognitive 12): AgentActivitySingleLine 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":"desktop/src/features/agent/AgentActivityList.tsx"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"334ca822ac7ff5aa1133b8aa04b1b84506eab1335c1f6c6fd5dfd13f3bbb2100"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteConversationSettings (cyclomatic 15, cognitive 12): RemoteConversationSettings 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":"desktop/src/features/remote-peer/RemoteConversationSettings.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fb4e6881decfc2b68b66ed038843057699f7bee9a631d1255efb77b2b09303"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CompactionDivider (cyclomatic 15, cognitive 12): CompactionDivider 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":"mobile/src/features/chat/messages/MessageStatus.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"02bb2ffbe0b7fcb2c286f5040e8bbd9f2be3bddc3e87bdc125b5dfec8dcf9f76"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FusionStepBody (cyclomatic 15, cognitive 11): FusionStepBody 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":"desktop/src/features/fusion/FusionStepBody.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a91bad9a66c8b9ab1b4be7a61bd24439ea53bbb5d3041997bfbdb0baf224048"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadPendingContinuationDirect (cyclomatic 15, cognitive 9): loadPendingContinuationDirect 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":"mobile/src/remote/pendingContinuationStorage.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc93ec4e2dc7b040a7e3f259574995a17e6297383f1326f0d0f5a7a3ef29c9e3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 9): (anonymous) 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":"mobile/src/remote/useAppLifecycle.ts"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"214a444ba2cdbac1ca4f45866312fd7cc52a7e9adf392036b2a41a593f760f2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #call (cyclomatic 14, cognitive 24): #call has cyclomatic complexity 14 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":"scripts/skill_reco/jev.mjs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd317bf2c337e332fba924917c466cee3b2f26fa400c7c054d09afc4c3df8e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 22): (anonymous) has cyclomatic complexity 14 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"d010ff8f6580ef7b601a6eec5630e714f98c8c4d93d100926d8efa37018ae321"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 22): (anonymous) has cyclomatic complexity 14 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":"mobile/src/features/chat/useAttachmentPicker.tsx"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2196ed77d936cdcc6e565643791a4ee6f118afe994a63027fd2d6fccddebf83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function perfDigest (cyclomatic 14, cognitive 21): perfDigest has cyclomatic complexity 14 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":"harness/lib/analyze.mjs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d88d5faeb9e893f89c3245c68422ef17bc76e2ffd0914d787e089d24eb4e4ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectBlockReferences (cyclomatic 14, cognitive 21): collectBlockReferences has cyclomatic complexity 14 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":"packages/markdown/src/parseFutureMarkdown.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ee3e5b49d2dc59cf8391ea35d8a87e2a3e599573612ef2deb885aa31ffaa2d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function recentTree (cyclomatic 14, cognitive 20): recentTree has cyclomatic complexity 14 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":"desktop/src/components/layout/recentOrder.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb4d2adc93ca89c1ac88b44cfdf0d0963392fb1bc1a1402accafcc341fa6176"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function groupMergedRows (cyclomatic 14, cognitive 19): groupMergedRows 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"980201b4c45185286cd47c65f6eb16fda177f11d51abe9d7233a8a91ca47339d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadRoster (cyclomatic 14, cognitive 19): loadRoster 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":"scripts/skill_reco/roster.mjs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7947da4e08912fab469023d447208d7caf343c7466ff9bad2c75d49869a5af6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openAttempt (cyclomatic 14, cognitive 18): openAttempt has cyclomatic complexity 14 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":"packages/remote-client/src/client.ts"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24b2a287cdd3ba845004f3594559a994b83c4555003f6a692c2361963210c34"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function remoteErrorPresentation (cyclomatic 14, cognitive 17): remoteErrorPresentation 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":"mobile/src/remote/errorPresentation.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"576e258cb8466e00a612f345d30dab60317069243a9722e27c04db11cea35a22"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function drainShotQueue (cyclomatic 14, cognitive 16): drainShotQueue has cyclomatic complexity 14 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":"desktop/shot/mock/backend.ts"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"72aa267b51dc4ddb8042aa4c6d9131a1ffbeb2c85cec85867acdd75bae3db224"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function classifyNatsError (cyclomatic 14, cognitive 16): classifyNatsError has cyclomatic complexity 14 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":"packages/remote-client/src/natsErrors.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"702652583845bb6e82edb2987c5940e0eb184e4599dd4285e438291b785de572"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function requestRetry (cyclomatic 14, cognitive 16): requestRetry has cyclomatic complexity 14 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/measure/measure-sync-warm.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdedd81fe91ffbbc6340ad5a10a9f192b96a7421c7917a445a6d2d6159425d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function hasToolError (cyclomatic 14, cognitive 15): hasToolError 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d8339b87162c8d518acb51c411e11fb560956e91a6d6554d63ce9cfe4c70f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function notifyTaskFinished (cyclomatic 14, cognitive 14): notifyTaskFinished 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":"mobile/src/notifications/taskNotifications.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c4d4a4f739e38174d48a4facf612aa5e715354eadf9cb89c187d81f425c594"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function StepCard (cyclomatic 14, cognitive 13): StepCard 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":"desktop/src/features/fusion/FusionDiscussionPanel.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"899e07226360c1e732838703156694f898c9f6f92b239870ef69ee7a06db4b1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function GitHistoryPanel (cyclomatic 14, cognitive 13): GitHistoryPanel 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":"desktop/src/features/git-history/GitHistoryPanel.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cb2497a5e90fbdf8ed381edf35a378caaa1db727e7f708bdb6903c483809e2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function taskView (cyclomatic 14, cognitive 13): taskView 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":"desktop/src/features/remote-peer/remoteTaskBackend.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a990113e6388eaf9ff8530b28b81adaf5218818537c0a44afd5c455b997036"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function EnvironmentPage (cyclomatic 14, cognitive 13): EnvironmentPage 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":"desktop/src/features/settings/EnvironmentPage.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2319bf85b2636280328e5c024f076520c92c1b68660ec7064aa6eb98399a388c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) 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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22db5893d8f804d9f256248f700a515b3b19e337556f0caa6950823d0299c37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readInbox (cyclomatic 14, cognitive 13): readInbox 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":"mobile/src/share/useShareIntake.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a77356f374740d5de01a506330ac6b47796d81c7888a0c7cee9b698fce190db"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 13): (anonymous) 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":"packages/thread-projection/src/fusion.ts"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d512822b12213371fe15496cf6e9ba83f52a8a1577c4670fb6d200dece21cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseChoiceAnswer (cyclomatic 14, cognitive 12): parseChoiceAnswer 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":"desktop/src/features/agent/composer/choiceAnswer.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bd0418cff8c2fce9d8e8942a472233701d9517ea80ba98716a8e025c514b1b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PeerRow (cyclomatic 14, cognitive 12): PeerRow 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":"desktop/src/features/remote-peer/RemotePeersView.tsx"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad45af9c56d18031830a371f8804ae337e576e68bf5f36787447197e9e845ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updatePresentation (cyclomatic 14, cognitive 12): updatePresentation 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":"desktop/src/features/settings/updatePresentation.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ebaaaa0e36a88d7240b692eff2d30935600394903399c32ac15af8d60251cf1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendFailureText (cyclomatic 14, cognitive 12): sendFailureText 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":"mobile/src/features/chat/useSendMessage.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddf2a6df7a16f2309a4e524d4ef92aac995ebf310a81183f529ed9b0e60f8d5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPrefixDecision (cyclomatic 14, cognitive 12): runPrefixDecision 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d261b7ee8ac4a5bff50fb7bc6389440538ec47d8a2681a74987c91cc8c3ab2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendNow (cyclomatic 14, cognitive 11): sendNow 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4b723841b2759a71ddeee1548975dd98403b02ba30e39a4f61ddc2838c85b4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CompactionDivider (cyclomatic 14, cognitive 11): CompactionDivider 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":"desktop/src/features/agent/messages/MessageStatus.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6473058458fe2ffc701e405d72a5c8994a61819cb363073259dff14862f456dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeyDown (cyclomatic 14, cognitive 11): handleKeyDown 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":"desktop/src/features/remote-peer/DeviceChoiceDialog.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d44abe73fb3bf2a618f785b66d894e64a28a8e4db08f067987b4b876f84acfe"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 11): (anonymous) 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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dab33a6c8781d2acdfbc86a9dc7bee8c32a06aa4a2a660698995046560d922"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function check (cyclomatic 14, cognitive 11): check 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":"mobile/src/update/useUpdateReminder.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0dbb5f5ca35c67f59e393c7c4daeaafb43efb62aff799c2a2fcd04e353b514"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function reduceThreadRunStatus (cyclomatic 14, cognitive 10): reduceThreadRunStatus 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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50d070f0e396994fa9975747faf6a530899b5a5e6077c658f72aded1dc55450"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseAppearance (cyclomatic 14, cognitive 10): parseAppearance 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":"mobile/src/theme/preferences.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f712ca14a47ddec01aa9051fe583c6edb7f0e0998380e457ed49fbf70125ec"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 9): (anonymous) has cyclomatic complexity 14 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":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdeda631fc41c5729d0ca18302716e2f3a65d7093559a623cd14a0f42a88ef5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function append (cyclomatic 14, cognitive 9): append has cyclomatic complexity 14 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9dacb03e1554ac050861f3bb611c9ab4e1749d9a21c79cdb721082c3d7aa03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function string (cyclomatic 13, cognitive 28): string has cyclomatic complexity 13 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":"packages/thread-projection/src/cooperativeJson.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a14ca31c752d97cefe075eb7377cb7fb4f2510a5c70a5283a900618dbabb67c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkTypeScript (cyclomatic 13, cognitive 28): checkTypeScript has cyclomatic complexity 13 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/ci/remote-boundaries.mjs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"85675892d39a5782da85a8958833df0499d91fa6fc70071817076f41d908d85f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeRemoteSessionDelta (cyclomatic 13, cognitive 25): mergeRemoteSessionDelta has cyclomatic complexity 13 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"4040bc04ce71e418833f85adf4c310eaba10e8ad8ed0d16d68983f3799c3dab5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function retainedSize (cyclomatic 13, cognitive 25): retainedSize has cyclomatic complexity 13 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":"packages/remote-client/src/retainedSize.ts"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"808a8be4612ac1a1913d6d977d3e73f2f626b453adbfe187d2236b9aaec68f53"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function organize (cyclomatic 13, cognitive 19): organize has cyclomatic complexity 13 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":"desktop/src/features/settings/DatabaseOrganization.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd947b4d56d881648527fa2b18fb732a8fe23bad50fc17c1051f52d18237378"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function vibeCellsOf (cyclomatic 13, cognitive 19): vibeCellsOf has cyclomatic complexity 13 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":"desktop/src/features/vibe/vibeCells.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaeaeab2297350af5e98467a12f70c6ca86f05247145aedd2a7c61688660560"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeyDown (cyclomatic 13, cognitive 18): handleKeyDown 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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f9c7e5a8efc8960901ebd00f9de23771783cd9f77cdc4da355ecf89ae29fb4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function step (cyclomatic 13, cognitive 17): step has cyclomatic complexity 13 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dddb35a89cf80ae77eb7522944e175dc4dd00328498b69765caee31978a53d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 16): (anonymous) 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":"harness/lib/fixture-server.mjs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b78e44d6086059e6e0feaeba947231db3dde3ff304f64324a8a675d4608d2b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPresence (cyclomatic 13, cognitive 16): onPresence 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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9413b3d90bc8cef97351eb6f5c73cf54f963468810cebff06307a2562362c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function startNewConversation (cyclomatic 13, cognitive 15): startNewConversation 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":"desktop/src/components/layout/hooks/useNewConversation.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880e9934b14dc6699c38de929c1a37497fa7ad764fa857a94666c99d9cf2bfd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readFusionStep (cyclomatic 13, cognitive 15): readFusionStep 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":"desktop/src/integrations/fusion/queries.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8722d6e4ba11074e8085722db2b52f30edcf5d7fe967b12c65a5708ab631ffaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadModels (cyclomatic 13, cognitive 15): loadModels 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":"harness/lib/fixture-server.mjs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a47138b37300d74a73f97f06a43968b481106a6753429d8383a66565965b23"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function catalogRows (cyclomatic 13, cognitive 15): catalogRows 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a6ece8c8d4da72a6c64121107e7fd262465b0bc56cddfb136b903f57fe6784"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ensureMobileServer (cyclomatic 13, cognitive 14): ensureMobileServer 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":"harness/lib/dev-server.mjs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"f283061bb40b585c0ecc68efbe36aa75de03a63fa2f83ee577b6258e3086e7c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveLimit (cyclomatic 13, cognitive 14): resolveLimit 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":"harness/lib/perf.mjs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dc16dd6fb5028c8b896f853877ef927d78d58a1203fcb220728e45652a094c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runStep (cyclomatic 13, cognitive 14): runStep 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":"harness/lib/remote-driver.mjs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fa842505d2949b934eba0974d6d6ed2aaf41f2f85b5c44ad6e6002b2aa8b73e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runTuiCases (cyclomatic 13, cognitive 14): runTuiCases 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":"harness/lib/tui-driver.mjs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d2d3e0b44ca489917dd0ee55505723144c1885b4925be12aeceac7bbbfa9ff"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 14): (anonymous) 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b40a1ad53eaeadf65b079d8d72fc37c40edd37ec672f746565461ef499754d7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeHistoryAttachments (cyclomatic 13, cognitive 14): mergeHistoryAttachments 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4488fa85bf503dc706140a2ad9073d7d6baaeeb8f4c4187820c4bfa28a18a56"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyReplayEvents (cyclomatic 13, cognitive 14): applyReplayEvents 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"085fbd3555d7994e995ae60678236a2cf98d0982afdbf62779206e151222d34c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useThreadMessages (cyclomatic 13, cognitive 13): useThreadMessages 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":"desktop/src/features/agent/useThreadMessages.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c868030b2216c3300e14a3db55add36353c32be3713b22d6c136a890300ad885"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 13): (anonymous) 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":"mobile/src/remote/usePairedDesktops.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"324aab8e4df69c8a0cbfccf9f12f10bf235cdadf300d28f9877ea9a0a9618656"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function receivePresence (cyclomatic 13, cognitive 13): receivePresence 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":"packages/remote-client/src/client.ts"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"086364ef19b4cacb00cf9c98139e463bf8372e97a24d695d3b2d7abc36049000"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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":"desktop/src/features/agent/SendQueuePanel.tsx"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30de316e00149e3fe941ed5608a9190d7130e5d44764b993faf5dec2a8ae9cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function streamingBubbleBase (cyclomatic 13, cognitive 12): streamingBubbleBase 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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"75196d250e872e213a9e657c8764ab8550ea2e43034a1173f36e2a88fc8fe877"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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":"desktop/src/features/agent/search/ThreadSearch.tsx"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ce0b73ec8dd625308ee3b96d0c8a8d5215ac02a41ac44e461599bb01c67811"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b694b254b6d459af205a1f580f01b3c56437c2d5808118bf3c183f7a699097"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 12): (anonymous) 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":"desktop/src/features/settings/ProvidersPage.tsx"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8402dad588506f5deba1240c0b5f5a79d30bc95ecce95a8640082f630755c86e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TasksSettingsPage (cyclomatic 13, cognitive 12): TasksSettingsPage 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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b10953018037955cf0b9b3de3cec8c69839b95eefdad60619ed9cb29b1e9cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadTaskDraft (cyclomatic 13, cognitive 12): loadTaskDraft 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":"mobile/src/features/settings/taskDraftStorage.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b2d79ac2252356c869a7f03039c260e69f709814b0e4a40368a7417ae91a3f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildLiveAssistantItem (cyclomatic 13, cognitive 12): buildLiveAssistantItem 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ca86e445b06c524f11978786dab0c01570d60daba46b5808b487ba43e7de02"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) 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":"desktop/src/features/remote-peer/RemoteApprovalMenu.tsx"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"067a17a7aaf75ac3849b3b394eea7683b125b216888c8e4b94ec44e05443218a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseChoiceAnswer (cyclomatic 13, cognitive 11): parseChoiceAnswer 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":"mobile/src/features/chat/choiceAnswer.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3966b905bc7652dede5c6bce0ef7cdcecf5c2464a2ea9078b47cc6b1fc7b2df4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function loadSessionDraftDirect (cyclomatic 13, cognitive 11): loadSessionDraftDirect 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":"mobile/src/remote/draftStorage.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83d13817aed18e0f1e80373ebe03a444bc781934a4c9698f9c099fc998ab159"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useHasProviders (cyclomatic 13, cognitive 10): useHasProviders 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":"desktop/src/components/layout/hooks/useHasProviders.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dad339b47a5a433890cf5287a1726900faaadb9a35522978c6a17060656697"}},{"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":"desktop/src/features/agent/useThreadMessages.ts"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59181de7839688cc9f40b2ea66c7b9a077bb346e345c900cf897f40bdf5ea9c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderDeviceHome (cyclomatic 13, cognitive 10): renderDeviceHome 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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"9155af077243051a12b6dee8cafdedf49f801e9b0f7001f08a79b1ae7e728c5c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function toolFromPayload (cyclomatic 13, cognitive 10): toolFromPayload 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37cd6d229794e01199d640e2204f400887c8b34a73cb61b177c834ee481f277"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function JsonPreview (cyclomatic 13, cognitive 9): JsonPreview 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":"desktop/src/features/filepreview/JsonPreview.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"224714c1a6ecc1e6fe14cf2e705b9bf0b1b23725dfba5d808484c1b117ecf7be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function checkResult (cyclomatic 12, cognitive 20): checkResult 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":"scripts/ci/ci-result.mjs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8b7b431e60dcaad5754022fb8ef9543aa3e13d2c590ae4e73274eab0d5643a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runUploadAttachments (cyclomatic 12, cognitive 18): runUploadAttachments 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":"packages/remote-client/src/transfer.ts"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2794d4ce4f10699e8c8808e2f0c7b763e8a01b2a144e134864ac9c4de191dc58"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function codePreviewRows (cyclomatic 12, cognitive 17): codePreviewRows 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":"mobile/src/components/codePreviewRows.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6151b641b997bcf66b7da5f0dad5978ff9bebed894ca45394f7fc09725d08b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function pageArchivedRows (cyclomatic 12, cognitive 17): pageArchivedRows 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"6532105502a09763aafd13ff82a4ca747d2830cc04de92df5fde1744ed55a8cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 17): (anonymous) 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":"packages/git-graph/src/index.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b3da7a1f423ef4e001bbdc9932bb9d75b8207913287760ab425207cc7e3d8c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function tokenizeJsonLine (cyclomatic 12, cognitive 16): tokenizeJsonLine 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":"packages/json-preview/src/index.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed56b8d37bdb7085349a33b8913e4a831b38cc95b9f192699aaef229681a95e1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readRegistry (cyclomatic 12, cognitive 15): readRegistry has cyclomatic complexity 12 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":"mobile/src/remote/storage.ts"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81b33ad96fe384d81202085556420f697f91b75acad1f99d81c1d2044f7f4a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MarkdownImage (cyclomatic 12, cognitive 14): MarkdownImage 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":"mobile/src/components/MarkdownImage.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"54efe69fa18b13a96c8d931fe430d169e0ab49c2aab0ed1aa1c5a4ba26525dcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runRequestRetry (cyclomatic 12, cognitive 14): runRequestRetry 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48c7b539549c338778f990d4aa1648f915e3b6886c6e204bf1dc40ef6f02f05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function visionTargets (cyclomatic 12, cognitive 13): visionTargets 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":"harness/lib/analyze.mjs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"062322bc468dafe9f1ade58d35175ba71008ea26d83670c2f000748f0fca2b7a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fullPairing (cyclomatic 12, cognitive 13): fullPairing 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":"harness/lib/remote-cn.mjs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f945df8cf1bc50f1da150f232d3f078768d94c03d2219c7959b21beb82bf1a4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function load (cyclomatic 12, cognitive 13): load 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":"mobile/src/features/chat/messages/FusionToolRow.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7f0f095967eb051e82ed6c774bd4a78029cf72763d4bccf79b88950ae4367f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onChangeText (cyclomatic 12, cognitive 13): onChangeText 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":"mobile/src/features/chat/useComposerCompletion.ts"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28ad810a8fffcdae4a89aa80fc66cfad193b9fe8a28904ccc11d040b025c9f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onPress (cyclomatic 12, cognitive 13): onPress 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d93efecfb16f4c652366cbcf1f6561cd452fb6a3c00765a434481b1a1777a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function openNew (cyclomatic 12, cognitive 13): openNew 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":"mobile/src/screens/SessionsScreen.tsx"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"72295fb3e27eee67ac1a444e9cb019eae9ed43147fabda7b7ca28e21d2f386f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runIsolation (cyclomatic 12, cognitive 13): runIsolation 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":"tests/remote-interop/src-ts/isolation.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fb0d56381113df1b01bb671f5d828bf4e3a9afbd8d982804a30aa59b0650ce"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) 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":"desktop/src/components/layout/MergedRows.tsx"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f24179a919a4c2c09544d82331a5290ef53aa701fd166a831076287649accc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function work (cyclomatic 12, cognitive 12): work 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":"mobile/src/features/chat/useSkillRecommendation.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d25c3135fb290d94bebbabca38688d93c01a05b22d4a4bc27999a671853d6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) 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":"mobile/src/remote/useConversationController.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff83b8cf8cb79446d20bd6c684617877f73b608f5ebc3ca38a624a60ef5be288"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) 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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf0dcbcf1d360aab34492f364ba23dfe7a5956629eee43c85d057c6ca53de81e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 12): (anonymous) 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb77bbfee1c438ebb529a117b97978913c711a0592abf8b6ceae820332a92f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function create_task (cyclomatic 12, cognitive 11): create_task 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":"desktop/shot/mock/backend.ts"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2c6ab62698fe7c8725cbbafa42cecd9ffe1a6a25c2de7c7cb6232de78a9cea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MentionEditor (cyclomatic 12, cognitive 11): MentionEditor 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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa231996df16b7c6140ec2ecc431888d2a273e462d6557a286ca6a607925cf75"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FileTreeNode (cyclomatic 12, cognitive 11): FileTreeNode 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":"desktop/src/features/filetree/FileTreeNode.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"236b34ac90c0532ca8388aa4a7c80bc286a97b33f54f51f931ee727d5df1fcbd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteWorkspaceMenu (cyclomatic 12, cognitive 11): RemoteWorkspaceMenu 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":"desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"534e585cc48e87a9ed39a10d5e4299252b87def274553ab16b7186bd599a36e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DatabaseOrganization (cyclomatic 12, cognitive 11): DatabaseOrganization 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":"desktop/src/features/settings/DatabaseOrganization.tsx"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b13e395ecfd21096db1cc86b5f5fae364354eb92887c174d18727b150a3ba7c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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":"desktop/src/features/vibe/VibeStage.test.tsx"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2304a0ef7a8c7db76e123b212786b9030e02298fd07dd4a1cdae884b064e2c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function sendPromptToFutureAgent (cyclomatic 12, cognitive 11): sendPromptToFutureAgent 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":"desktop/src/integrations/agent/agentClient.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"55962d807c3eefa6acee3b6d028c220412fbdf60ddc6f4fdb81b403673cf2512"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function prepare (cyclomatic 12, cognitive 11): prepare 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":"harness/lib/data.mjs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c51b1d854ae009ea4064caf7e003bf39a5fc0ac0b06843a6f0ddd6f7e503fa5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeCase (cyclomatic 12, cognitive 11): summarizeCase 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":"harness/lib/discovery.mjs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6469e65032d1325efed4b6b7e8f044121fd8cbbefcb641aa9fea3eb2535ec8e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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":"harness/lib/fixture-server.mjs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed948cdcb41db2164e2af4d3d8e812875f6daae6b2ea83a0f55ac2bf936bb706"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assertJson (cyclomatic 12, cognitive 11): assertJson 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":"harness/lib/remote-mobile-live.mjs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf67a1dd0c115c58501d48a37847a84108c447e3b67cd2629459ecd0c0d3fcc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ChoiceCard (cyclomatic 12, cognitive 11): ChoiceCard 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":"mobile/src/components/ChoiceCard.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c30152edf2420fce31a0195fabf1d754c9056619e2dbcda85d768b8f77e58f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ProvidersSettingsPage (cyclomatic 12, cognitive 11): ProvidersSettingsPage 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":"mobile/src/features/settings/ProvidersSettingsPage.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c08e052350bdec239838942a1b6a09907103a2f69cd69fb823c92553398aa37"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mountController (cyclomatic 12, cognitive 11): mountController 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":"mobile/src/remote/__tests__/useConversationController.test.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7bc86d4a116d4fcedb651c66e7c9b6a34931d05a00bf6f162bf46d03eb4806"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compactionTerminalOf (cyclomatic 12, cognitive 11): compactionTerminalOf 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":"mobile/src/remote/timeline/useCompactionOutcomes.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3579bf891d6e66790e2a44b064826f83903c8869cef35399fa9c0425a158421"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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":"mobile/src/remote/useConversationController.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66f7ace12e3efb18a084db35bc7116a8a5e44bd22040bc273dc53b751e539f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 11): (anonymous) 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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e5eb8cb87c634f03e94adf941f8bea69a44bdbd40e72b073f93aacb3ca1b5d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DisconnectedScreen (cyclomatic 12, cognitive 11): DisconnectedScreen 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":"mobile/src/screens/DisconnectedScreen.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fba479fa3c4f826b0e97876d4d4bd80e4de296afb2635b5e6137623615fad8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function joinInlineNode (cyclomatic 12, cognitive 11): joinInlineNode 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":"packages/markdown/src/softBreaks.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"49217ea8a9bd0ddf77e3874c9515239b9234d1907d758f7f0252331b8e4283c1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeReplayEvent (cyclomatic 12, cognitive 11): normalizeReplayEvent 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":"packages/thread-projection/src/replay.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"180c7af822fbdfa51ffbbc086929758347a25817a0e6e25124820087ee5eae05"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onKeyDown (cyclomatic 12, cognitive 10): onKeyDown 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":"desktop/src/features/agent/composer/SendChoiceMenu.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a0606a2db4ed02207f5179a39388c56c5f4030967ad766a96700d40b80c534"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteFilesDialog (cyclomatic 12, cognitive 10): RemoteFilesDialog 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":"desktop/src/features/remote-peer/RemoteFilesDialog.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e0cd5e52b0a43d6c858d36e4dea968263c6c5c84ad6931fe589a36bb2cb167"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) 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":"desktop/src/features/remote-peer/useRemoteApprovals.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1881bc7c49a361fea02919761122ab634d40f091f1b0843e736545a8eea3e66a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AppContent (cyclomatic 12, cognitive 10): AppContent 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":"mobile/App.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5f95b66d62d91fe9d4cf6aa14b589b4934d2bca2266426060b8559aec3dd471"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) 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":"mobile/src/features/settings/SkillsSettingsPage.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9717334dc2273361d77c9e1fe3e54a99d8b87c7b90fb9757686be8c30d6743b8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) 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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6511aea07ce9eec72ed892956f8a195cafa5de75776f827ac622c3e59ddecee0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 10): (anonymous) 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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"0248f3b3988094485fa82cc7f1303977493deab49277c12f0d7e4a9b99862e31"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function revealCaret (cyclomatic 12, cognitive 9): revealCaret 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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d12dc87983981bc73b8836009468cb7688eacbc08cb0379fa42f55a43b14d91"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ImageView (cyclomatic 12, cognitive 9): ImageView 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":"desktop/src/features/markdown/renderers/MarkdownImageView.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d2c59eae25c1facaf4a924cbd15c5426994f7502fbb4472231d6b1b34b15e7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 25): (anonymous) has cyclomatic complexity 11 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/measure/measure-mobile-performance.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfa5cf059f1257399125b84240af2f49beea24850ad908eb1442495a870a9b9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 22): (anonymous) has cyclomatic complexity 11 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":"packages/remote-crypto/tests/secureChannel.test.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff590dd3bb6760883abd7f3aa25546772caf6628dcd6534a45eb3f3a6e498df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 20): main has cyclomatic complexity 11 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":"tests/remote-interop/src-ts/client.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc37944c617875e892b448393658ce82eea78bd4721660fefef316b4390013b0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function repairRustcInfo (cyclomatic 11, cognitive 18): repairRustcInfo 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":"scripts/dev/start-desktop-rust-cache.mjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b28dafebe26d47c4419dd63824cf449b37c6c991c25a8ef8565781192a7149b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 17): (anonymous) has cyclomatic complexity 11 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":"desktop/src/features/agent/composer/useComposerAttachments.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5234005d6b6a36649d0900976e6a8343996189fbaa95ed91e70c68e017163edc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildReplyBlocks (cyclomatic 11, cognitive 17): buildReplyBlocks has cyclomatic complexity 11 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":"mobile/src/features/chat/messages/ReplyBlocks.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5236462a5447853fc4e3804f82a51d422435eb27305ea36d68f56623254b42c5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPrepareDownload (cyclomatic 11, cognitive 17): runPrepareDownload has cyclomatic complexity 11 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":"packages/remote-client/src/transfer.ts"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"983c98456dccea8f68e6207eaf99a608d1f36243f6564ed584246c797f2cf4f4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function value (cyclomatic 11, cognitive 17): value has cyclomatic complexity 11 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":"packages/thread-projection/src/cooperativeJson.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4c83c1996af825eaad1727a6583abcdafddeef3e0d74a0160fda6aa421582e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function inlineRuns (cyclomatic 11, cognitive 16): inlineRuns 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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"04668521fa3b5efa5a6ef9caaadb82dd846ea979383419186220d2682d38eeb1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFutureMarkdown (cyclomatic 11, cognitive 16): parseFutureMarkdown 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":"packages/markdown/src/parseFutureMarkdown.ts"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc616563853e43a62146127e7f99d80ce9d5678eadad44bfa7f5a0be6aa92a1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function configureProject (cyclomatic 11, cognitive 15): configureProject 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":"mobile/plugins/withIosShareExtension.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c25f8b4c36ae1bfde686115d7ac0c85a32d5c601e887ae2b5b576a94da2e4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergedRows (cyclomatic 11, cognitive 15): mergedRows 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"565cf0122edf34d9cef0cdda88257536df0d708c93081f00698170204307592c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function event (cyclomatic 11, cognitive 15): event 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e824c950989e312271cb73d978a3d14a45087b028d65b0d63bca67e2eb45802"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function summarizeRunForPrompt (cyclomatic 11, cognitive 14): summarizeRunForPrompt 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":"desktop/src/features/agent/buildContinuePrompt.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"261234a42c656403acc14f6f997da6a1c50f87b4361f980b2cca6e722496cce4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function isAnimatedPng (cyclomatic 11, cognitive 14): isAnimatedPng 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":"mobile/src/remote/files.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaf7fc3c165efd8d246b98d85381d6ec8279e9714ef20ed4b4fad5f54dce96a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 14): (anonymous) 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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa077c45adde7e2b66c7cb59ba033ee92dc3e5290494c257b47c0e4df3ad2e9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function splitBareUrlsInText (cyclomatic 11, cognitive 14): splitBareUrlsInText 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":"packages/markdown/src/remarkAutolinkBoundary.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"2700a95442914b28706f11ba555875d248161683e68712491b09a76782339b18"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function failGeneration (cyclomatic 11, cognitive 14): failGeneration 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":"packages/remote-client/src/client.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd2095b5e03e875a5642c866ea7b3038ea85ca3978c2e9af257c29083667f4c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function askForEnglish (cyclomatic 11, cognitive 13): askForEnglish 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":"harness/lib/issues-en.mjs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d7be0478e25996de94dbd33974045e8c95e71f9b799d7d8e52dc765c649a45"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function collectInlineReferences (cyclomatic 11, cognitive 13): collectInlineReferences 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":"packages/markdown/src/parseFutureMarkdown.ts"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"3233f4ff189c334e8c35155fd138337dffd0e7f67ade97ba32c3aa23eff05594"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseFrontmatter (cyclomatic 11, cognitive 13): parseFrontmatter 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/skill_reco/roster.mjs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d42748ea5fbf041b3705c29a009a4dd77d0b4582ae4b14a485e20503b7009d1a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseMentionSegments (cyclomatic 11, cognitive 12): parseMentionSegments 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":"desktop/src/features/agent/mentionMarkdown.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"576b91f6b8f22dfd4a786618772d5e298cc8d7765b106e0d1be3521eccc59776"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function project (cyclomatic 11, cognitive 12): project 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":"desktop/src/features/markdown/streamingMarkdownBlocks.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c232d91f3e1c11f49a387589bb0918a98b78a471771ff07c54552bdf80f7448b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parseRefs (cyclomatic 11, cognitive 12): parseRefs 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":"mobile/src/remote/draftStorage.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02170a077c1a7d9708a1d6dbde91a138e2c8151e13f1ece9cb8f0cf5677e387"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fileSha256 (cyclomatic 11, cognitive 12): fileSha256 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":"mobile/src/remote/files.ts"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d13d9da9820846dd91610158cba0a8f090cc892ce24226d7ea0ec0843c5a8b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function onConnectionState (cyclomatic 11, cognitive 12): onConnectionState 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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"8667ddd5b0fe05fcc90a3f1bca78a32332ee919ffb305d7e1e7cbec47b5a8593"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 11, cognitive 12): (anonymous) 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":"packages/remote-client/tests/sharedRequests.test.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"854cf30e8ccf652b90f4309484e287a8a3dceabd40861dc67ff078ded2892bcd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runJobs (cyclomatic 11, cognitive 12): runJobs 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/ci/ci-result.mjs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4afbd71250d4e1bde4c79000396f54226973aac258ec0c0141835561583f6f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function replacementAfterRemoval (cyclomatic 11, cognitive 11): replacementAfterRemoval 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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2a8eeca06055b5c02050df298e800cd9ca10f311a328ec5908d9ff1edb41ea"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mergeRemoteCatalogWindow (cyclomatic 11, cognitive 11): mergeRemoteCatalogWindow 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f317af139e9a3e9729a8ec62b191b53c8bb270a104b0ed48430b48ee35fef07"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function open (cyclomatic 11, cognitive 11): open 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":"desktop/src/features/terminal/TerminalView.tsx"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bca3a0dc08ad5f4fac4139352e84c5ea71d4c1d7c9f71e1eb7d880d0c9b9b90"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function moveInGrid (cyclomatic 11, cognitive 11): moveInGrid 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":"desktop/src/features/vibe/layout.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"667c82f65fdbbb293419e46cc0e60ab9a713904cd8fd28104fb7447b5d2bdcba"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runPrompt (cyclomatic 11, cognitive 11): runPrompt 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":"harness/lib/analyze.mjs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d3e1501dccf6456b7fe2572b81ddf1846483430b0452ef08c42b1b69a3a187"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function waitFor (cyclomatic 11, cognitive 11): waitFor 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":"harness/lib/remote-live.mjs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8475b28bbdd821f9d05578ddd33354221b998083dec0f149425ef301e21b536"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function matches (cyclomatic 11, cognitive 11): matches 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":"harness/lib/remote-mobile-live.mjs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c91684f0b83b232aceefac9a928d5e99d35e67e55731105bbb0979fcab5fcd"}},{"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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff50ea7031ff44a600f8388fab22d26e9ccaa0a4f51094e1536d603ca008a569"}},{"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":"mobile/src/remote/useConversationController.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd44e24bbc68824927a54aaa6b5326ae98b0198285001a3754d2ef4bcd006dd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function deliverPendingPrompt (cyclomatic 11, cognitive 11): deliverPendingPrompt 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"878d571106281c070eacb286db464164b178e534425558cb937a2a44ab5e85a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetchReplay (cyclomatic 11, cognitive 11): fetchReplay 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":"packages/remote-client/tests/syncEngine.test.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54eb0af0a1cd1929ae1938ac2a56786f65854459da1366bede50058aff2e77b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 11): (top-level) 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":"scripts/screenshots/injects/qn-nav-a-stacked.js"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"998b3772a842d7453edb13b90fa3c52a82a7c327f545e6d96cd44847efa7d8a0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function NavButton (cyclomatic 11, cognitive 10): NavButton 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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":2793}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dab6fd5d0f57393d3291266cb87fd21abdef36c6ff909bf47dda0e55b88086d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function asAttachment (cyclomatic 11, cognitive 10): asAttachment 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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"896c5d351db04f121022e90e4ade2dcf05b6208401a49115778a4401bac44608"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function asRow (cyclomatic 11, cognitive 10): asRow 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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"946bcf98beeda733d7ac397df2a85f3da60b051d0cf8d7f1c97eb9397f8d7f1b"}},{"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":"desktop/src/features/agent/composer/MentionMenus.tsx"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9916eb2a2e31b60b6f1fcb886841cbf8d3f0d26233f0d57bc982568f1b496f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ArtifactCard (cyclomatic 11, cognitive 10): ArtifactCard 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":"desktop/src/features/artifacts/ArtifactsPanel.tsx"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dad72fc80a4cbec617eac69eeff4f2d0ccaa1d0e23818a3c1465595139069e6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useFileTree (cyclomatic 11, cognitive 10): useFileTree 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":"desktop/src/features/filetree/useFileTree.ts"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"072c6d2c622711d99a7f701a9a046d64abc53ce93971f58574e1cc90db7941be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ChoiceCard (cyclomatic 11, cognitive 10): ChoiceCard 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":"desktop/src/features/markdown/renderers/ChoiceCard.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01600d15953d9c4dd6545546faf8ae68567269a042704c98491cfb2f110be2b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function FileLink (cyclomatic 11, cognitive 10): FileLink 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":"desktop/src/features/markdown/renderers/FileLink.tsx"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1ed27628e42618b01b1ed2abadb4507c15a5329e70c8f979d7b02ed69194fc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteConversationMenu (cyclomatic 11, cognitive 10): RemoteConversationMenu 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":"desktop/src/features/remote-peer/RemoteConversationMenu.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f73c5ead0b616ecb09e11b99f6a70f75fb71220dd785379bf515560dee86b92"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function RemoteProvidersPanel (cyclomatic 11, cognitive 10): RemoteProvidersPanel 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":"desktop/src/features/remote-peer/RemoteProvidersPanel.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec45e11b614178dbddadc91b71803537749cdcb5af1a38a076ee9c2290d12f3"}},{"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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"8556153b6b91f7aaebe0703536b0e7bc5bae9ef4a0a9988b47479bab3b3c0619"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function asAttachment (cyclomatic 11, cognitive 10): asAttachment 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":"desktop/src/features/remote-peer/remoteQueue.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec80fb44e81f83593c8d82b84b04fd559ee0895168f5cceb341b2857601934e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function asRow (cyclomatic 11, cognitive 10): asRow 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":"desktop/src/features/remote-peer/remoteQueue.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b36188d705521df7d978d257816715f4d3a8aa9b96415f8ebae4ef54e4af8c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function restore (cyclomatic 11, cognitive 10): restore 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":"desktop/src/features/remote-peer/remoteRunStreams.ts"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a8a7f0351e7543ec16ac5e6cce90f3606d970b3cf5628c14631395e69a2d8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function runView (cyclomatic 11, cognitive 10): runView 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":"desktop/src/features/remote-peer/remoteTaskBackend.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6266ba9c8c7a7e0bd069b9d007d5f55a62089058c58eeda64a015d08d49b663"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function BuiltinProviderKeyDialog (cyclomatic 11, cognitive 10): BuiltinProviderKeyDialog 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":"desktop/src/features/settings/BuiltinProviderKeyDialog.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"427b806419a360395ab63ce51403eb59f05885e09df09926dd879467dad8e24c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ResetPage (cyclomatic 11, cognitive 10): ResetPage 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":"desktop/src/features/settings/ResetPage.tsx"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e4a0e43db4276b0f48e0622203eeadbc11dc95279fe07c598aca0aaab7bbc1"}},{"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":"desktop/src/features/settings/SettingsDialog.test.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74e42b0eeed42e2bff108650881ef9bcb8484bbb96770deafc80c31abc17160"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readDevice (cyclomatic 11, cognitive 10): readDevice 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":"desktop/src/features/vibe/vibePreferences.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d890da3f311e85dca0d9c89ee386afe387a05d1ca553e0983c4befe0a4195a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function applyTaskPayload (cyclomatic 11, cognitive 10): applyTaskPayload 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":"mobile/shot/mock/RemoteContext.tsx"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e266b059877f84890f7f166c61dea75fd15ee6d9b00a793262550c9da8d1f021"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ActionMenu (cyclomatic 11, cognitive 10): ActionMenu 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":"mobile/src/components/ActionMenu.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84b67dd983de8d2bccbc1ce1356455f5f1c0901ec3733144765a1bfe95be799"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CodeSource (cyclomatic 11, cognitive 10): CodeSource 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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec41bcc6a3706f34fa6d94f3278d02590d241e56b2fc169665b55bc84925e73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ModelsSettingsPage (cyclomatic 11, cognitive 10): ModelsSettingsPage 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":"mobile/src/features/settings/ModelsSettingsPage.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e486594810d99b0656eb8dc41256d012062f27e2daa359fcda4b50773776ef83"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draftProblem (cyclomatic 11, cognitive 10): draftProblem 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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d1dc2dd68d5be317bb69ae5659de576cfda0410a9798ddc18a4a3c4125f9ad"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function asAttachment (cyclomatic 11, cognitive 10): asAttachment 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":"mobile/src/remote/sessionQueue.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1247bb95e8f4095ba01543fca48c682886d9ef98b1155c7c4295c3d7fab3f57"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function asRow (cyclomatic 11, cognitive 10): asRow 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":"mobile/src/remote/sessionQueue.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"634ce6cfc7c765c7dfea89e4e826c9a947a8e388b2aa77c049a1f606c482c8b3"}},{"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":"mobile/src/remote/useConversationController.ts"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f934133f9d30104e2037ff30d7174023557d214192792cdb27b3d246dcfd6a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function useTimelineController (cyclomatic 11, cognitive 10): useTimelineController 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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2617352905efb3bcc267ea7c53be0978ae44368c0fc976ae3842409f75617221"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function errorWithContext (cyclomatic 11, cognitive 10): errorWithContext 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1921}}}],"partialFingerprints":{"codehealthFindingId/v1":"207f1941059bd9c40bbc4f24602d9d0a7a595d80c0e203fb7a5aaa3846a89eaa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function dividerMessage (cyclomatic 11, cognitive 10): dividerMessage 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":"packages/thread-projection/src/projection.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab8ba46b8693f8413e8da42f77007b4a8dce4f84117c3a11ab15befa4bfee98"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 11, cognitive 10): main 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":"scripts/release/updater-signature.mjs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0622d3dd4950016c50bdbca0417e9319595c2322502adf64651d3ed99e3e62b5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderGate (cyclomatic 11, cognitive 10): renderGate 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":"scripts/skill_reco/public/app.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0693dacd5f3c5f3202bc92810b31baeb431112d872d6e350c9badf65d88db424"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function #routeTypesafe (cyclomatic 11, cognitive 10): #routeTypesafe 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":"scripts/skill_reco/suggest.mjs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"791a9b9f5f5d547150fe6a0a4abc6266d81cb51e4381117edef3350d12518cec"}},{"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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"b949cb52d4234a7b611185da47da59bbc3ab670b45724e9ab244296828297f62"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AlbumPickerModal (cyclomatic 11, cognitive 9): AlbumPickerModal 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":"mobile/src/features/chat/components/AlbumPickerModal.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d49e2f78d12061792612db99851ee290eb3edf0ceda1bb826fbcd6241841b44"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function probe (cyclomatic 11, cognitive 9): probe 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":"mobile/src/remote/timeline/useCompactionOutcomes.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb27d9c8630d7c2f4fb64b53d9d1ee29f018ac83a2f1945bdfb8e31836dde7c6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parsePairingInvitation (cyclomatic 11, cognitive 9): parsePairingInvitation 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":"packages/remote-protocol/src/codec.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3002e24a86f428db775c71ecbc147feed4525a070725def3b8312e0584e8a0"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/components/layout/ActivityRail.tsx: 2780 lines of code: desktop/src/components/layout/ActivityRail.tsx has 2780 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":"desktop/src/components/layout/ActivityRail.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c30bfdf0601ac460e09f48262ab311a9d848348de4f486a7af50da17a6444d"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/components/layout/AppShell.tsx: 2462 lines of code: desktop/src/components/layout/AppShell.tsx has 2462 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":"desktop/src/components/layout/AppShell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a78739c661bd99206d9a99c4e46f4d5b03b859f2c3a243967b233aa7c9b0d3"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/shot/mock/data.ts: 2054 lines of code: desktop/shot/mock/data.ts has 2054 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":"desktop/shot/mock/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4d3894bcaacadd93db6d0965af83828968ba226ea6dd959d03061d7c9eae4f"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/screens/SessionList.tsx: 1863 lines of code: mobile/src/screens/SessionList.tsx has 1863 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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b68fa3ce5090a2e120b4d55290a0113b25174c2f4c65a386f7dc7368b0cdd81"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/remote-client/src/client.ts: 1852 lines of code: packages/remote-client/src/client.ts has 1852 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":"packages/remote-client/src/client.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5e6a2051e6dfaee07406184fc4c64408bc94135045176ddaee82acf3e7b3cc"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/shot/mock/backend.ts: 1695 lines of code: desktop/shot/mock/backend.ts has 1695 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":"desktop/shot/mock/backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83968de623f420f906e118e6631c4f758a143b15ac706d34f81dd8edbb4b5be"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/remote-peer/RemoteComposer.tsx: 1661 lines of code: desktop/src/features/remote-peer/RemoteComposer.tsx has 1661 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":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4139eaff0c0ecb02384d2710f298685acc6e5b155ce1d5114727a1865b2b2689"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/screens/SessionsScreen.tsx: 1580 lines of code: mobile/src/screens/SessionsScreen.tsx has 1580 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":"mobile/src/screens/SessionsScreen.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"488c08d904ff583c002195372dc5fd345aad7f0d2f247f95e599d46f922fb5ca"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/vibe/VibeStage.tsx: 1450 lines of code: desktop/src/features/vibe/VibeStage.tsx has 1450 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":"desktop/src/features/vibe/VibeStage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a23baa0e5e246f9299133661a6bd0f86eada01a25eadc344a97eceb17087b2"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/remote-peer/remotePeerClient.ts: 1448 lines of code: desktop/src/features/remote-peer/remotePeerClient.ts has 1448 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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"618ccea35d225587176e923d8a06422db5e5e1b95a3df20735630ad9bbac2699"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/remote/RemoteContext.tsx: 1401 lines of code: mobile/src/remote/RemoteContext.tsx has 1401 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":"mobile/src/remote/RemoteContext.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29364d894815efa7408a92d32e39de71c76cd9d6e6904096dee25e55ec51931"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/remote-client/src/syncEngine.ts: 1321 lines of code: packages/remote-client/src/syncEngine.ts has 1321 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":"packages/remote-client/src/syncEngine.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a860f345c6f3008acd7976e86e0e8eeea44fcc2e6622098ada1095374811d273"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/remote-client/src/projection.ts: 1205 lines of code: packages/remote-client/src/projection.ts has 1205 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":"packages/remote-client/src/projection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4bc8302611b0c2799af05f38c7aeef0702a609f28d31cf37a5042bf07c3c66"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/settings/TasksSettingsPage.tsx: 1204 lines of code: mobile/src/features/settings/TasksSettingsPage.tsx has 1204 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":"mobile/src/features/settings/TasksSettingsPage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f91f80e36c34b71186e08b1abc252b0af286536552467172d2e075e9794670"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/chat/ChatScreen.tsx: 1186 lines of code: mobile/src/features/chat/ChatScreen.tsx has 1186 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":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"192a6c3f14fdd77cba6ff94d955e4d816b4394830f27c2fa9c79facfd5059ba6"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/lib/fixture-server.mjs: 1127 lines of code: harness/lib/fixture-server.mjs has 1127 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":"harness/lib/fixture-server.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31676bb13f0087335e38c8650f99963f9e50ddac11173a360338a0e8621e8f4e"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/AgentThread.tsx: 1116 lines of code: desktop/src/features/agent/AgentThread.tsx has 1116 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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a585bbb2c7e05cbff77deea117423b6c9d867d0401328917c926d23619f95550"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/remote-peer/mergeConversations.ts: 1059 lines of code: desktop/src/features/remote-peer/mergeConversations.ts has 1059 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":"desktop/src/features/remote-peer/mergeConversations.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79bf2f2c9e85dceee0eb62fc2aff5e8e43b9708c2b57f397add5bbbdd85ad565"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/tasks/TasksView.tsx: 1056 lines of code: desktop/src/features/tasks/TasksView.tsx has 1056 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":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d374a585014b50c09a0f18e82bcc3dff0f4f4ad6a1ee6142f69b53989835be79"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/remote/files.ts: 1047 lines of code: mobile/src/remote/files.ts has 1047 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":"mobile/src/remote/files.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e4177982dba90cd9944929e5ed681be19a64337471eef0e6f617b4fa82f535"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/MentionEditor.tsx: 1045 lines of code: desktop/src/features/agent/MentionEditor.tsx has 1045 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":"desktop/src/features/agent/MentionEditor.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"813f4fa5aa946601467cab102c463d4f7cc5dfa77ac66aaaae89fdde14fe241a"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/lib/analyze.mjs: 1036 lines of code: harness/lib/analyze.mjs has 1036 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":"harness/lib/analyze.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3f09e596077dbc77037137a988d1ea14364ba8d7019a45015af4fa7079144b"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/components/layout/hooks/useThreadStore.ts: 1008 lines of code: desktop/src/components/layout/hooks/useThreadStore.ts has 1008 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":"desktop/src/components/layout/hooks/useThreadStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3c029dc21e07c1245cc7818761315bf4e8de10893e4ec7f018dc00a1c06774"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/shot/mock/data.ts: 989 lines of code: mobile/shot/mock/data.ts has 989 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":"mobile/shot/mock/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4225940dc012c90dea46b7429b2e687d472f0746a556224a418feef01de868bb"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/Composer.tsx: 979 lines of code: desktop/src/features/agent/Composer.tsx has 979 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":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9704910189ea10aa498fe1753aac2aa2cbb48714f2e87d6f8316f7f29676d4f8"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/components/layout/hooks/useRemotePeers.ts: 975 lines of code: desktop/src/components/layout/hooks/useRemotePeers.ts has 975 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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87ee67028fec643f95ee45a826430868e28ce092d3b951795b1533387f779a1"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/remote-peer/useRemoteTimeline.ts: 974 lines of code: desktop/src/features/remote-peer/useRemoteTimeline.ts has 974 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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d3c9cb5650b54615de004c7728017704c3d3576bc7df5478e08e6750b261ae"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/remote/useTimelineController.ts: 961 lines of code: mobile/src/remote/useTimelineController.ts has 961 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":"mobile/src/remote/useTimelineController.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db39cf576e87bb49737c8216cb6ea7ff11cbd2397e8a53107a2701e11e271e4"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/thread-projection/src/liveApply.ts: 958 lines of code: packages/thread-projection/src/liveApply.ts has 958 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":"packages/thread-projection/src/liveApply.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2fabdd113c5220fc7f74aeb9be57365d6186b09f30acc57eb69d5f0f0b77aa2"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/remote/useSessionCatalog.ts: 918 lines of code: mobile/src/remote/useSessionCatalog.ts has 918 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":"mobile/src/remote/useSessionCatalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dec92d5b82c10f4ebed2db2b249a339f81b3bca87d339e258258d7910a602aa"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/remote/useDesktopConnection.ts: 877 lines of code: mobile/src/remote/useDesktopConnection.ts has 877 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":"mobile/src/remote/useDesktopConnection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f8f6a4eeb0217df1d72946e60f51ac4d5af2848b27d61e8e6f1bdd05969cf3"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/shot/mock/RemoteContext.tsx: 821 lines of code: mobile/shot/mock/RemoteContext.tsx has 821 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":"mobile/shot/mock/RemoteContext.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa624dc84b1d5190ad045e379b1115726f78c5124e91af19e158eaae9f5f557a"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/markdown/src/parseFutureMarkdown.ts: 812 lines of code: packages/markdown/src/parseFutureMarkdown.ts has 812 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":"packages/markdown/src/parseFutureMarkdown.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29a290ecf77d39e4b8dad9bc9df2b12df95efe1154aee422d8dd51e2948b1a1"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/remote-peer/RemoteConversationView.tsx: 792 lines of code: desktop/src/features/remote-peer/RemoteConversationView.tsx has 792 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":"desktop/src/features/remote-peer/RemoteConversationView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d484309a3b77a283d5f52c3f8a78cac93c05b656422653589dd4e9695a01718"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/skills/SkillsView.tsx: 763 lines of code: desktop/src/features/skills/SkillsView.tsx has 763 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":"desktop/src/features/skills/SkillsView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"571ad953a3145227bb0208d48dad70147ed759050211e531a073491adf521f02"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/runtime/liveRunProjection.ts: 758 lines of code: desktop/src/features/agent/runtime/liveRunProjection.ts has 758 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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f42c41b01906fe8b9ef9dc3c69e0f26829c94672a7f1454dd8db1a8a56656f1"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/components/MarkdownText.tsx: 755 lines of code: mobile/src/components/MarkdownText.tsx has 755 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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb0a721dc2741582f74246ba35b0885dc314d1872797ce1e08ddf11690bd444"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/settings/CustomProviderDialog.tsx: 742 lines of code: desktop/src/features/settings/CustomProviderDialog.tsx has 742 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":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32c4e85aba994e170e109203a843f54737274ffe90e7f042b216160822014d3"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/runs/RunInspectPanel.tsx: 719 lines of code: desktop/src/features/runs/RunInspectPanel.tsx has 719 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":"desktop/src/features/runs/RunInspectPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"269f64491ce13ad681c0f755e0a71dafe83ef02ff03163ea5399aaac7ccbfdcb"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/remote/RemoteView.tsx: 708 lines of code: desktop/src/features/remote/RemoteView.tsx has 708 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":"desktop/src/features/remote/RemoteView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aca72fb9de654578bccf8822f4dbc831d5e952e80db9e726dbf8dee40fd6c46"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/remote/usePromptOutbox.ts: 705 lines of code: mobile/src/remote/usePromptOutbox.ts has 705 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":"mobile/src/remote/usePromptOutbox.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5122d7242d921fc7e35f9c70d56391daebc1e69ccc2a6e739959d8ea52373c48"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/chat/components/ComposerDock.tsx: 702 lines of code: mobile/src/features/chat/components/ComposerDock.tsx has 702 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":"mobile/src/features/chat/components/ComposerDock.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5f8602631ba5172a08343e6c6baf7bde637ba033b53f4d222cbda19d961ab7"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/remote-protocol/src/types.ts: 692 lines of code: packages/remote-protocol/src/types.ts has 692 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":"packages/remote-protocol/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fcada9d225a2836ba4fe108a90396b61fa3eb9740a5572d45cfa0c034eb4b3"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/screens/sessionTree.ts: 675 lines of code: mobile/src/screens/sessionTree.ts has 675 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":"mobile/src/screens/sessionTree.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e895008c99c8e98c2923c49f270fe0b890934467692e93c224c32db1a5175851"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/components/layout/MergedRows.tsx: 668 lines of code: desktop/src/components/layout/MergedRows.tsx has 668 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":"desktop/src/components/layout/MergedRows.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd02571c9aea48e9ca5106fb42a9f7765f92b2a0bc0882bfaead322ecacb655"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/remote-peer/RemotePeersView.tsx: 635 lines of code: desktop/src/features/remote-peer/RemotePeersView.tsx has 635 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":"desktop/src/features/remote-peer/RemotePeersView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"027e72bd49536c4328ae61644c9468464540615c80640ac3014cf81b6af7606f"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/lib/run.mjs: 634 lines of code: harness/lib/run.mjs has 634 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":"harness/lib/run.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b122972ee21eb138edd8233cf85482573fdd3c271f5f57f30d23a65e787b8d92"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/chat/files/useChatFiles.ts: 634 lines of code: mobile/src/features/chat/files/useChatFiles.ts has 634 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":"mobile/src/features/chat/files/useChatFiles.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4832a68662d36a7ef81a8233b3b02fa2a9840fdf4121b98dcf781372a1f70ba2"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/remote/useConversationController.ts: 627 lines of code: mobile/src/remote/useConversationController.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":"mobile/src/remote/useConversationController.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f13988ddab18d43c6b03def2e2804d3d505675107298884ad0dcedcebb3052b"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/settings/CustomProviderPage.tsx: 616 lines of code: mobile/src/features/settings/CustomProviderPage.tsx has 616 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":"mobile/src/features/settings/CustomProviderPage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28b08df13df881a6fcc994f37c00d9cf1a6bd1746f525d25fde227ce45f0412"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/chat/components/SendQueuePanel.tsx: 582 lines of code: mobile/src/features/chat/components/SendQueuePanel.tsx 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":"mobile/src/features/chat/components/SendQueuePanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6be3724851644a9fa614970618b632c6e505f13cbfb10b3a9139c9a25cf847"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/chat/components/GitGraphPanel.tsx: 547 lines of code: mobile/src/features/chat/components/GitGraphPanel.tsx has 547 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":"mobile/src/features/chat/components/GitGraphPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"257b5e53a099aa44110fad1513dd0660aa9114f728f8b70e502b58902d5704cc"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/MessageBlock.tsx: 539 lines of code: desktop/src/features/agent/MessageBlock.tsx has 539 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":"desktop/src/features/agent/MessageBlock.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0f7e81755db6a1691c2d3a16e52d3fdc28c666b58e6ddb93aa6ca395c344aa"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/settings/SettingsScreen.tsx: 517 lines of code: mobile/src/features/settings/SettingsScreen.tsx has 517 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":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03cf91807350b85418bbd5cc31af463459952e4ac7578eb9b429a4e077a0df5"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/components/layout/ContextPanel.tsx: 514 lines of code: desktop/src/components/layout/ContextPanel.tsx has 514 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":"desktop/src/components/layout/ContextPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8551543b9eeb3419f41fd3ffab305f60beef44621e8e17447fe8ab517fb6e6bf"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/integrations/agent/agentStateCache.ts: 512 lines of code: desktop/src/integrations/agent/agentStateCache.ts has 512 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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2591911686fa87906b819200559e28f020695ba625261731b0db7c776c7756"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/terminal/TerminalPanel.tsx: 510 lines of code: desktop/src/features/terminal/TerminalPanel.tsx has 510 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":"desktop/src/features/terminal/TerminalPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9df4d61b2950b9bf71a71d018d613e02f6db85c1823ec14f3f318197597b1d"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/lib/cdp.mjs: 502 lines of code: harness/lib/cdp.mjs has 502 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":"harness/lib/cdp.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf197a189972c528e7504a927472893db766ef9e6ef6ddbf9e9fb2bff6b0f5c7"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/keyboard/catalog.ts: 497 lines of code: desktop/src/features/keyboard/catalog.ts has 497 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":"desktop/src/features/keyboard/catalog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae528dfc6663cdc0194a77a4c73e1cf074eef92ae23b01978767c064f61f102"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/SendQueuePanel.tsx: 494 lines of code: desktop/src/features/agent/SendQueuePanel.tsx has 494 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":"desktop/src/features/agent/SendQueuePanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5117f7fef677f0fa7730bbe727b3b1eef852249aa0e4c8cfa5411dce4daa81a6"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/remote/useDesktopRuntime.ts: 493 lines of code: mobile/src/remote/useDesktopRuntime.ts has 493 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":"mobile/src/remote/useDesktopRuntime.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fb349345d5a44565ca784335e4b815eec245d414372abb37017686366e8aa1"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/ApprovalPrompt.tsx: 486 lines of code: desktop/src/features/agent/ApprovalPrompt.tsx has 486 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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c275e90aad4f17541aad156b6c0ccb98c31d0378196c4dad432e1e68d89510f"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/sendPipeline.ts: 486 lines of code: desktop/src/features/agent/sendPipeline.ts has 486 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":"desktop/src/features/agent/sendPipeline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb150e0dd255667a8fd4a0a411e6e0e037cb578ef851f8e7a28823b1432e1e70"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/runs/RunsPanel.tsx: 486 lines of code: desktop/src/features/runs/RunsPanel.tsx has 486 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":"desktop/src/features/runs/RunsPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc741d53c18ef1f320f7e8bf1a3a1079301a59be8a4947bd06c1037dca725420"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/components/layout/hooks/useThreadDialogs.ts: 485 lines of code: desktop/src/components/layout/hooks/useThreadDialogs.ts has 485 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":"desktop/src/components/layout/hooks/useThreadDialogs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54a36698e1a75548437c8aae9ea4bd0875a43e938e3ac2e42c373b969df8ffa"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/thread-projection/src/projection.ts: 484 lines of code: packages/thread-projection/src/projection.ts has 484 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":"packages/thread-projection/src/projection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2bceb2db84bc04dce29778803e5277d7db8320e5ad05c061c19b22bf23e9af0"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/screens/PairingScreen.tsx: 480 lines of code: mobile/src/screens/PairingScreen.tsx has 480 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":"mobile/src/screens/PairingScreen.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"011676fad2a264aec0fa8ec19fd04f851127a2f55d9bc29f5d1a92bacff4bc17"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/git-graph/src/index.ts: 464 lines of code: packages/git-graph/src/index.ts has 464 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":"packages/git-graph/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6a4f0c5ee5a1ee3db5e9e5f19db2bb7bf5dc987498ed17e4a1950429d1b134"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/chat/messages/ReplyBlocks.tsx: 462 lines of code: mobile/src/features/chat/messages/ReplyBlocks.tsx has 462 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":"mobile/src/features/chat/messages/ReplyBlocks.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c643e9a69fa54db1e1d2a5c79ffdd7a689865a03570b41482ca807eb68401c25"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/useMessagePaging.ts: 455 lines of code: desktop/src/features/agent/useMessagePaging.ts has 455 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":"desktop/src/features/agent/useMessagePaging.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc41de8b3e11174f7141599f5777b520e20da50e0c2fb80a00c8c990f58cf66b"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/integrations/agent/agentClient.ts: 449 lines of code: desktop/src/integrations/agent/agentClient.ts has 449 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":"desktop/src/integrations/agent/agentClient.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b918e030a3b225dba81f2451b8ba6c53ee17ad3a7f9a3f5395066076ba936d8"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/remote-peer/useRemoteConversationSettings.ts: 447 lines of code: desktop/src/features/remote-peer/useRemoteConversationSettings.ts has 447 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":"desktop/src/features/remote-peer/useRemoteConversationSettings.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc073350a11ee3fb5b01fcd54516726e1c2212bb8e03d9fed4a0eecf3b5dd19"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/filepreview/ImagePreview.tsx: 446 lines of code: desktop/src/features/filepreview/ImagePreview.tsx has 446 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":"desktop/src/features/filepreview/ImagePreview.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a4b090809444c805ba6df1183c2103b7ca1934981d5fbd1560965bdb95e392"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/remote/sessionQueue.ts: 446 lines of code: mobile/src/remote/sessionQueue.ts has 446 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":"mobile/src/remote/sessionQueue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f5f4050e693826a79e98c5bca72632b929fcd001f68ce7fdfb61d2dc5400f1"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/components/layout/ActivityRailMenus.tsx: 445 lines of code: desktop/src/components/layout/ActivityRailMenus.tsx has 445 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":"desktop/src/components/layout/ActivityRailMenus.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8ee582f702a2e185b0003911b4efbb69be326eedd2717f2300904248e7b79f"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/composer/ComposerControls.tsx: 445 lines of code: desktop/src/features/agent/composer/ComposerControls.tsx has 445 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":"desktop/src/features/agent/composer/ComposerControls.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67a25075df7ba4ebad68d1b49d9664e7b1a38331494ce20588460d330efafa5"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/NewConversation.tsx: 444 lines of code: desktop/src/features/agent/NewConversation.tsx has 444 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":"desktop/src/features/agent/NewConversation.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f3b61fbaa98858be9f3b7dc46bf00e6558c3724026809a1efa0ed98cd04ec1"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/useThreadMessages.ts: 444 lines of code: desktop/src/features/agent/useThreadMessages.ts has 444 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":"desktop/src/features/agent/useThreadMessages.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"447df37e52126ac248393782cba2fb8c268f1c523eca87a9f827c0da8056b382"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/chat/useQuestionNav.ts: 439 lines of code: mobile/src/features/chat/useQuestionNav.ts has 439 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":"mobile/src/features/chat/useQuestionNav.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"554c467bd13b257d25aa8b33d74504bf28959208ad894ed425d59a54bb04b54c"}},{"ruleId":"R3","level":"warning","message":{"text":"harness/lib/remote-live.mjs: 435 lines of code: harness/lib/remote-live.mjs has 435 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":"harness/lib/remote-live.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"48531be912888f8b87ea633df4a35542ae8668ce89498ac02c78d0789adde375"}},{"ruleId":"R3","level":"warning","message":{"text":"mobile/src/features/chat/messages/TimelineCard.tsx: 435 lines of code: mobile/src/features/chat/messages/TimelineCard.tsx has 435 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":"mobile/src/features/chat/messages/TimelineCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaeee64724f4d6d65cd3b9f4579136c327b08fa896b335e08e05d189f24480b"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/terminal/TerminalView.tsx: 431 lines of code: desktop/src/features/terminal/TerminalView.tsx has 431 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":"desktop/src/features/terminal/TerminalView.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4caa71c293ee5c9940c5108e9fd2bc1dac9dae3ac2e492937fd95b1624bd1675"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/components/layout/OnboardingGate.tsx: 426 lines of code: desktop/src/components/layout/OnboardingGate.tsx has 426 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":"desktop/src/components/layout/OnboardingGate.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0986f690e86f5ab59958542d1570a2b164e9bb631701fa79ae2c2f2fbbf21e"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/terminal/remoteTerminal.ts: 423 lines of code: desktop/src/features/terminal/remoteTerminal.ts has 423 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":"desktop/src/features/terminal/remoteTerminal.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ef813294f69c0b31b389e5cc931cce508366bd20f0f17af965b1de252d8440"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/markdown/MarkdownContent.tsx: 420 lines of code: desktop/src/features/markdown/MarkdownContent.tsx has 420 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":"desktop/src/features/markdown/MarkdownContent.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7ccb0f66202bf400d2569e20105156eb565b545da2c2948bcc8e156289efc5"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/remote-peer/remoteRunStreams.ts: 419 lines of code: desktop/src/features/remote-peer/remoteRunStreams.ts has 419 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":"desktop/src/features/remote-peer/remoteRunStreams.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc08a95bebc41edb194d2d4e224b52499ccd2e572a4a305f4a596c628fa7acbd"}},{"ruleId":"R3","level":"warning","message":{"text":"packages/thread-projection/src/replay.ts: 416 lines of code: packages/thread-projection/src/replay.ts has 416 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":"packages/thread-projection/src/replay.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"567c89831dd5aee1dafd8c8e46ac72d4f46b32a85cc235958a10a5f7d5d9754a"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/agentQueue.ts: 412 lines of code: desktop/src/features/agent/agentQueue.ts has 412 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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60a7c46da84b6c81aae25e1e5d7f5d3ea3ab938d886744ad309fcdb9e726cc9"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/components/layout/AppShellDialogs.tsx: 406 lines of code: desktop/src/components/layout/AppShellDialogs.tsx 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":"desktop/src/components/layout/AppShellDialogs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5b4346151f0867526ff62dc9fba128bf73b9d1f7ebaa2b049f8bda9945d051"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/artifacts/ArtifactDetailPanel.tsx: 405 lines of code: desktop/src/features/artifacts/ArtifactDetailPanel.tsx has 405 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":"desktop/src/features/artifacts/ArtifactDetailPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec89f1eb8ec796ca0312dcadca32bd7668990926cca7fec7b78fa6e3a665411"}},{"ruleId":"R3","level":"warning","message":{"text":"desktop/src/features/agent/useQuestionNav.ts: 402 lines of code: desktop/src/features/agent/useQuestionNav.ts has 402 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":"desktop/src/features/agent/useQuestionNav.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8470a4f4c3880131888f309b766a66b369f721eda64e2e0e3d5c6100dfdacdf"}},{"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":"desktop/shot/mock/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4217334e85f00e81279c64747edea29e79f1f7de094bafa98028ed68ce3e1b88"}},{"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":"desktop/shot/mock/backend.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7851e08d5d0f06426a07b22b2d9aa02809a2a3210b43b0d58997a8ec72a97da0"}},{"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":"mobile/shot/mock/data.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1914191b7fab9b98de0390ab346fc5217fc35e996c3b2b4cfffe356a39a39dcd"}},{"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":"mobile/shot/mock/RemoteContext.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba19138d5660bbe0509cce1d67cc304dd37e2a184672c276a12826579d18e6e"}},{"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":"desktop/shot/mock/remoteStream.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1caa59a44f8d8abca6e835af8657199fbc852847ed89fd288327946ba5476d"}},{"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":"harness/cli.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67db7a6c8700fd59145dd1587386c52c0b7061871ce61651c6b3661c3562095"}},{"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":"mobile/shot/mock/parserSession.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"461896a70dce6f3f0fe45bc072c034f64aaae7d742d7fe9c02e8364e88b3d82c"}},{"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":"harness/mobile-client/entry.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d3efa1c591fede1821a02a7b93cf820a74f736b7a3085e63c933e87a84fb62"}},{"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":"harness/scripts/visual-regression.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0b20f569f52c735ca9a0166ef3c8f6ba2db7735da325b9c3b382625ca56e6d"}},{"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":"desktop/shot/terminal-server.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12c2f34ce166c3d6b61f8f914df0d1234447dec49edbafdb7a39e8d58385ec8"}},{"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":"harness/scripts/som-element-picker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d990bb524bfd1b0e7df1ed618d50c1e7038e692820f15230f6a6b74ee9c285"}},{"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":"desktop/shot/main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1088aebc96833d39934eaff48b936c83c83a8911f2c188e706f902f8e73af80a"}},{"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":"desktop/shot/mock/core.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"677810946248cc7f230d90019d403c3560fe0b0c0073a3f1fd593a2096784095"}},{"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":"mobile/shot/mock/leanRender.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"962b41bbd91491ee15d874425d4eecdbed05828ad2c65a0943bfcf2cb11cec2d"}},{"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":"desktop/scripts/profile-streaming-worker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"154b2a1e9f1413414cd753ff09b9337e161c63f281ce4e4ead911d832b9d45cf"}},{"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":"desktop/scripts/stabilize-dist-mtimes.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"726777a0396d8544d71d1ddbb75e7c424b93f52c18e59dc94dbb91af2064e3b0"}},{"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":"mobile/jest.environment.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b22c32d1a0a7b6083e5808ca8e49f66324b5a000f3282fe9b631f45edd70fa6"}},{"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":"harness/scripts/assert-no-pollution.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"178fed0bdfeb848cf6f9987c74ac3742249fd63464256f74fb0b50088ec10302"}},{"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":"mobile/shot/mock/smallestType.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f960716618d72ad367c4b9306ce04408b2d9f61fa09662df606dc2ec3f16f2"}},{"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":"mobile/plugins/withFrameRateCap.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8f1ff1eb2ad49fcc5a910968cee740a028d61e82e85ad993c3cbe17d8b6821"}},{"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":"desktop/shot/prefs.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2009824d80ae842009529a60e17ce7684802d4f1c7a0d4a6014c177f47db055"}},{"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":"desktop/shot/mock/event.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef8396f04d045959a7efb0c993267f0d32d038999fd98f3c173ac6700efaff5"}},{"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":"mobile/shot/mock/shareIntent.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"196aee25a923c3bde1d82ffa7095df4130362361468d332218404c3395391f44"}},{"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":"harness/mobile-client/build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8448b1efe80fbf14b6d107f01638b64181afc095846e2e64fca87a9ab0d39c5d"}},{"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":"desktop/scripts/check-streaming-worker.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"219024969c1171ee7401481e9c72d8375d14cd6a9c7820ca28e698feb4952fcd"}},{"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":"desktop/shot/mock/window.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9ee9ecde328e85744e62996572128bfde46b1c3054f6b73a3054ed0c0ea3af"}},{"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":"harness/scripts/file-issues.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fc75c22365c13664fb4889a840d35d3d68bc3041cbe1aa9207165344aeb130"}},{"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":"desktop/shot/mock/dialog.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fc9045749c461d66f465d4e41fc9e6ba1618a7d31c64c3de18032ac452bb85"}},{"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":"desktop/shot/mock/webview.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7cae47bd62a77dec3a7c8f097482a4fe68d8ac58cfcc547014fb09d9b7be14b"}},{"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":"mobile/shot/mock/fileHandler.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28ddc57a86870d90d45eb95b9fe8843a120bf5848055a7341236292313909f6"}},{"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":"harness/mobile-client/shims/expo-secure-store.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5484f2b56023bc6d3d824aa3e60f038e8f0ad210445ca984b8ae1f814f1a8e8e"}},{"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":"mobile/jest.setup.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde2824ebf1b3d5a2c7deee6e237425ca9743681dd961f6734c82309d6756161"}},{"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":"mobile/plugins/withLocalNotificationsOnly.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca000e3a1d749eb61ebd58aa77f32aa791088a1234e55b8eab976ae3019dfa47"}},{"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":"harness/mobile-client/shims/expo-device.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bd900dafb44314a43e9bd935546b0bd4360e9f7d11995c53cd4391e38882c2"}},{"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":"harness/mobile-client/shims/react-native.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb0d27f280243266bf3ddcf29c5bbee0beb533085f5ad27fc6d363cc5216a4"}},{"ruleId":"R6","level":"warning","message":{"text":"This package\u0027s lint script runs in no CI job: The package in \u0060desktop\u0060 declares the lint script \u0060lint\u0060 (\u0060eslint \u0022src/**/*.{ts,tsx}\u0022 \u0022shot/**/*.{ts,tsx}\u0022 \u0022vite.shot.config.ts\u0022 \u0026\u0026 npm run typecheck\u0060), but no step of this repository\u0027s CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs \u0060npm run lint\u0060 in \u0060desktop\u0060 (or the workspace\u0027s task runner)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/package.json"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"111ca2dd5cd535b7b1b7b4ec397fa1c69c71839b0e8ade3367ba574eeedf40b1"}},{"ruleId":"R6","level":"warning","message":{"text":"This package\u0027s lint script runs in no CI job: The package in \u0060mobile\u0060 declares the lint script \u0060lint\u0060 (\u0060eslint .\u0060), but no step of this repository\u0027s CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs \u0060npm run lint\u0060 in \u0060mobile\u0060 (or the workspace\u0027s task runner)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/package.json"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80f58b3b74f4e788efa8b9d9e4dc5f57c630c80f8b5975d8b61014e3b437a2f"}},{"ruleId":"R6","level":"warning","message":{"text":"This package\u0027s lint script runs in no CI job: The package in \u0060packages/remote-client\u0060 declares the lint script \u0060lint\u0060 (\u0060eslint src tests\u0060), but no step of this repository\u0027s CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs \u0060npm run lint\u0060 in \u0060packages/remote-client\u0060 (or the workspace\u0027s task runner)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-client/package.json"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"173b5269a85ae7f9b6c2345e37844c389278d685b9041fde1d18d740ccb6a293"}},{"ruleId":"R6","level":"warning","message":{"text":"This package\u0027s lint script runs in no CI job: The package in \u0060packages/remote-crypto\u0060 declares the lint script \u0060lint\u0060 (\u0060eslint src tests vitest.config.ts\u0060), but no step of this repository\u0027s CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs \u0060npm run lint\u0060 in \u0060packages/remote-crypto\u0060 (or the workspace\u0027s task runner)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-crypto/package.json"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceca1e1c52951f639cd90e49b7a75d9197f64ae8a2c2df7b0f4cba7af834ddcd"}},{"ruleId":"R6","level":"warning","message":{"text":"This package\u0027s lint script runs in no CI job: The package in \u0060packages/remote-protocol\u0060 declares the lint script \u0060lint\u0060 (\u0060eslint src tests vitest.config.ts\u0060), but no step of this repository\u0027s CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs \u0060npm run lint\u0060 in \u0060packages/remote-protocol\u0060 (or the workspace\u0027s task runner)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"packages/remote-protocol/package.json"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cea9cd9b96bf7fa3cc0b56f3713159fcda9d9a7f1660e32220091d6ea79f0d"}},{"ruleId":"R6","level":"warning","message":{"text":"This package\u0027s lint script runs in no CI job: The package in \u0060tests/remote-interop\u0060 declares the lint script \u0060lint\u0060 (\u0060eslint src-ts scripts\u0060), but no step of this repository\u0027s CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs \u0060npm run lint\u0060 in \u0060tests/remote-interop\u0060 (or the workspace\u0027s task runner)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/remote-interop/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"591b2757e972d2c1679dc72bd97ea62dbf5cd6c7b3af2e7c0e009c63e43e0354"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~439 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-lib.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"399b4dd3917e03a38edb60806fee7dae58df3028157a5bb6722ad6137027657a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~234 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-mobile-lib.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9481bfb1490489547ff50b83ede1c635fb55237d9f686b0973c073c59ac99bd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~96 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-v3-queue-desktop.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec15fcd1922bc1c3249e8ca803b56e831f60c12c4cadfabfc27844f63c42e442"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~88 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-v3-queue-mobile.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"699aaa966ffb499872011f40bcd19e65dbe4c01b2f52fda0a91c39cdf0a09ca4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~34 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"harness/scripts/file-issues.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"523810a9f8fb22b9afc15bfd5e9510c199c4393bb49a4b884f34c37cd707960c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/qn-nav-c-counter.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9f0c450c0bed77928d3524cecc54de07f9f794fc611013391f059f1b1a3c56"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~25 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/qn-nav-b-latest.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecece4771c7c7ee709b07b6f1448fa46d78a160d0a8f16f0d9ac5d90a1dc10d9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/qn-nav-a-stacked.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2915619fb50e6b1fc91d94344f2f8037e8629aff176d20a4589ffb8e71a5c8"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~20 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"harness/mobile-client/shims/expo-secure-store.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e803af775cfdc66b44863ca92f26ccbaa1cc93a7ffbb0731c76b2986ace8e057"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~18 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/user-bubble-border-off.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdabe9e3d8a53374a7d77db24f2698214bda1a07c4d4d52d97e9122b71d6b0bf"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~12 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/qn-state-idle.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43ce96b111678d91586e6d5b5d9bde63561b98440ef4fea7308c0c31ca7bdf9"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-v2-pill-text.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef67257afa0fa941485ff7bc7ca0b5be1988c50ceb6dde785355f0322f66924"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-v2-popover.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d5c7a525b99dac951af87c6c507facbb8de98f47bd8f1fb7ca609a66cabe48"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/running-dot.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c01de670d277250b1f101f0f04764d1949ec90293fba564b6005d788d7cee7e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/running-ring.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9581b0119272dcf19a35aa35b72fc2050dd49a58b89107fc509bbeec04b197"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/running-spinner.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ce24b2ae11094869bfbc7afe2cdd0eb1d2ec57a48083d1dae97069bc993077"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-r-chosen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b10c454aba2e476483d45f211095c934c2368e13ea1153a30ad9c7ab475369"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/qn-state-down.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1c8bfaa104fc4ebda9ecd4528516858efb6ff7cb02d46ef903965bfbaadbd5"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/qn-state-up.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a861b87fad4e354937c3009384ba934711fdaa9356f27a824a28f9145c15d2fc"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~10 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/user-bubble-border-on.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70519c6647a8f20bd888e4fd0246cf173963d51794137f93771b82cba5de4016"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~7 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-a-chosen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1da6cdd78b4b0411e1f921963bb48dc25a02816420fe50d42c1fa85c0ebd87e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"harness/mobile-client/shims/expo-device.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce45d24cd76cf65584a8f4747e1c2e3d341a0c86e9b65b1dc6d6def1e134847"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-a-free-row.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2f452235ba42b6f2a73fadc399a106a94b5e32d91172fcac9cf62f1fe6ddd4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-a-numbers.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bc91687469cd1dccf0acbccbebf318faae97302db46294a8c1e3693be91ca3"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~6 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-c-pills.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cb8c3f48ab5743a57f43f4e667a5b99a2b2ae1804cec467d9efffa75c4fe33"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-a-empty.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd31c954f4b1564ae31656e8ec80b5967736ebd3c93366b2a4b0c0bee9d16f85"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-b-compact.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6e2e2858dd2abf48228f396485eff85d24038a0eb5e4e0350aa91ff115fe89"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~5 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-m-sheet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c486c01817adb33f556ea3ccd2413ac381e0ce74c1c1901441d15f2b0d771c1e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"harness/mobile-client/shims/react-native.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08a2331bb92d227c08a207bbddf669adec213072b39ad2e209e2c6fd50758e1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~3 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-m-chosen.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"000181f2a87ed79724dba79a9b130999582e928ff340847741c462b942ed38ab"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~2 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"scripts/screenshots/injects/choice-card-m-empty.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eaf44888d91231cb2c0abe44fa5e80466df3210f17b750d7d15f542d7f9e274"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (389 application, 57 tooling, 702 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":"desktop/src/features/markdown/localPath.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3384645930197552cf6015ed682686947133466c063badc2bc7162af27928954"}},{"ruleId":"R7","level":"warning","message":{"text":"Benchmark script nothing runs (~139 LoC): This script imports the product (\u0027../roster.mjs\u0027), so it is an authored benchmark, not measurement input \u2014 but nothing invokes it: no package.json script, no CI workflow or build recipe, no Dockerfile, no other file under scripts/skill_reco/bench/, and no in-repo reference to its name at all. It runs only if someone remembers to type \u0060node scripts/skill_reco/bench/check-parity.mjs\u0060, and it silently rots against the API it measures. Wire it into a script or workflow the way its wired siblings are, or delete it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/skill_reco/bench/check-parity.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd305a1d31c84a951a7278080ce36bec6c75695d0334b8dcf78dbafa4f701351"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027RemotePromptOutbox\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/remotePromptOutbox.ts"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2487671511db905db25443c194fa0e43c599cdc0606c66af49a0d7b12329da25"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027KEY_PROBE_GESTURE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/vibe/keyProbe.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd58ca54c7ce9e6ee75710ddfe8c29d23ddd2a6aaefe4fb6b17703511a58f14"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027NEW_CONVERSATION_DRAFT_KEY\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/remote/draftStorage.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0a778003382240d12ab602759c5f00d732027cb3593a4a3bf6c71aa0865ef5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027mergeByModel\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":"harness/lib/issues-en-run.mjs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead7088bbcf8c1f9916277b5b7d40200d35cae29202417a03e070feb4cad209c"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@expo/plist\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tests/test-mobile-ios-project.cjs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b08746deb51241be5c1f874c3e91405413cc09da61b23ee55ed5d5055596359"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@tauri-apps/cli\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/release/updater-signature.mjs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6b1442d6a90b97c07c47ca0c818b421cc06c5bcaf067ec13c34d4d7f71549ac"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027esbuild\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/mobile-client/build.mjs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc64a14f8a406c8e5bb53d9766225f1137ca10ec2c1d6dfdec55dbcf89a22bb"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027typescript\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/remote-boundaries.mjs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b8ebc32f8a6001ee71b6ff821ecdadcda04c34e86a38db1c4b8d7665251e13"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027ws\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"harness/lib/cdp.mjs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"87af5cd0243fd850a9359517d5257afcad6f7ff32042a0c723e3ffa163125186"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027xcode\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/tests/test-mobile-ios-project.cjs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f74db4ff35e354e86d206df1f80eca2130f9f556b7dc4a4e0b5bad08418e867"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027ws\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/shot/terminal-server.mjs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd1b9a33f46346e70449cc91cda74a22f0890a879aaa65adb86b260fdcc3991"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@expo/config-plugins\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/plugins/withFrameRateCap.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"945d68054653e8f3d19ba1031ee3b365ea11ad24ac63b1fd9f476506de42bbe8"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027@expo/plist\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/plugins/withIosShareExtension.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6777557bc0d4782b7adf51d753011f781b94b0d8acb3196bdf1a17b5ffd6d1d"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027expo-modules-core\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/modules/future-file-handler/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdb904137d7d32b470ad59122062e32a704794681ee22322875c5ebe4f3990b"}},{"ruleId":"R8","level":"error","message":{"text":"Unlisted import \u0027expo-modules-core\u0027: Imported but not declared in any reachable package.json \u2014 installs work only by hoisting accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/modules/future-share-intent/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69ca130ac7b3cf51b1e3cb534f683640e2869b98422f18369a7f09c307fbb11"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027expo-system-ui\u0027: Declared in mobile/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":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/package.json"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f6f76fb08350f50a0727264c2a6b66b7a46fdc98484e318fae94182f04d2ab"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027fflate\u0027: Declared in mobile/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":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/package.json"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab16cc50d3c3b4a59ddb78ab8694ecbb08ad3a076853590296e606b037e66fe4"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (4 files): desktop/src/features/filepreview/FilePreviewOverlay.tsx \u2192 desktop/src/features/filepreview/MarkdownPreview.tsx \u2192 desktop/src/features/markdown/MarkdownContent.tsx \u2192 desktop/src/features/markdown/renderers/FileLink.tsx \u2192 desktop/src/features/filepreview/FilePreviewOverlay.tsx (one verified cycle inside a mutually-dependent group of 6 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/filepreview/FilePreviewOverlay.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee01d4b7039b7e1e130ae35a4272b9368434a83a7d70f4c9ab1e836bcc29bcea"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: mobile/modules/future-file-handler/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":"mobile/modules/future-file-handler/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"390363ba4991fe5c1300a5dcc8a211e9b66394d513a3afeac5feae1764e512d1"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: mobile/modules/future-share-intent/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":"mobile/modules/future-share-intent/package.json"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72b7925dbe9bbabad399b183879c0d6c16ae7328460ca750bba17372aab5e02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!Array.isArray(options) || options.length === 0 || !Array.isArray(selectedIds)\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/composer/choiceAnswer.ts, mobile/src/features/chat/choiceAnswer.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":"desktop/src/features/agent/composer/choiceAnswer.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5841e422d518d4affe32a3be1437b565d9d493edfddcb0551cf0e7e5db35f64e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!deleteDialog || deleteDialog.submitting\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/hooks/useThreadDialogs.ts, desktop/src/components/layout/hooks/useWorkspaceDialogs.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":"desktop/src/components/layout/hooks/useThreadDialogs.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3f00485a3f7d8ee6cb3ff08a80f7e33e177beb74afa24c0eb3b633f501bd0e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!parsed || typeof parsed !== \u0022object\u0022 || parsed.version !== DRAFT_VERSION\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/composerDraft.ts, desktop/src/features/remote-peer/remoteComposerDraft.ts, mobile/src/remote/draftStorage.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":"desktop/src/features/agent/composerDraft.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6443d63f72943a3924e104ad42777002f837f617a090cfb0c4be8eea6a81471"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!projection.content.trim() \u0026\u0026 projection.activityItems.length === 0 \u0026\u0026 projection.segments.length === 0 \u0026\u0026 !projection.reconnecting\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/runtime/liveRunProjection.ts, desktop/src/features/remote-peer/remoteRunStreams.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":"desktop/src/features/agent/runtime/liveRunProjection.ts"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"6657a853fdee25dd7ae0a8f87faed297574650915258261d6a85a8239f688274"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!taken[base] || taken[base]!.sessionId === target.sessionId\u0060 appears character-identically in 2 files \u2014 desktop/src/features/remote-peer/remoteSessionReference.ts, mobile/src/features/chat/sessionCompletion.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":"desktop/src/features/remote-peer/remoteSessionReference.ts"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea7f802f621b78c38d43e2260ad90aee672a4d2070cc0ccb5812815a9b20a1fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!text.trim() \u0026\u0026 attachments.length === 0\u0060 appears character-identically in 3 files \u2014 mobile/src/features/chat/ChatScreen.tsx, mobile/src/remote/usePromptOutbox.ts, packages/remote-client/src/projection.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":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ada23991a13153659fdf22c6c938d68f4282fde9320267d0f1c183cc6bf9a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(event.metaKey || event.ctrlKey) \u0026\u0026 event.key === \u0022Enter\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/ApprovalPrompt.tsx, scripts/skill_reco/public/app.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":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"9961cdf87d627874e86fec5de8ddc441cd4ec88ab1b06b3bc1b6f0952ccb9130"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Array.isArray(model.modalities) \u0026\u0026 model.modalities.includes(\u0022image\u0022)\u0060 appears character-identically in 2 files \u2014 harness/lib/analyze.mjs, harness/lib/fixture-server.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":"harness/lib/analyze.mjs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"983668c6ba333eb297604c388457b6f3c9d931e3f57fea8a26b3e0fced799213"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060Platform.OS === \u0022android\u0022 \u0026\u0026 keyboardHeight \u003E 0\u0060 appears character-identically in 2 files \u2014 mobile/src/features/chat/ChatScreen.tsx, mobile/src/features/settings/SettingsScreen.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/ChatScreen.tsx"},"region":{"startLine":988}}}],"partialFingerprints":{"codehealthFindingId/v1":"6733f369df77186385e433f7079b413eb28eddfd657d5575527abe9cec9ad292"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060String(text).replace(/[^\\w\\u4e00-\\u9fa5-]\u002B/g, \u0022-\u0022).replace(/^-\u002B|-\u002B$/g, \u0022\u0022).slice(0, 40) || \u0022case\u0022\u0060 appears character-identically in 3 files \u2014 harness/lib/remote-cn.mjs, harness/lib/remote-live.mjs, harness/lib/remote-mobile-live.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":"harness/lib/remote-cn.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fec917882db97d77a073da5bf3fefa3fff1625e840dfb92fb3effd80d758f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060action?.category === \u0022windows_write_capability\u0022 || action?.category === \u0022file_permissions\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/ApprovalPrompt.tsx, mobile/src/features/chat/messages/PendingApprovalCard.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/ApprovalPrompt.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcab7158b0d47a39efb8ccc5b2ed24fcac6b6a570ef9b15fb90376d6930d7f74"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060activeId === \u0022test\u0022 || activeId === \u0022production\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/OnboardingGate.tsx, desktop/src/features/settings/EnvironmentPage.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/OnboardingGate.tsx"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c005e32c700ccc26d78f9ff9b44a9e6adbd8531b4130c7aedef5f60b35dd65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060at === undefined || session.lastMessageAt === at\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/hooks/useRemotePeers.ts, mobile/src/remote/useSessionCatalog.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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"8078be788d4324f0f76a4b7773e178b8672ec569c4b5ecee5b2816fdfeb75f95"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attachment.kind === \u0022image\u0022 \u0026\u0026 !supportsImages\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/Composer.tsx, mobile/src/features/chat/components/ComposerDock.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1e740d1103a135320451ff5a58a433fcbda6b0e5eec33e38b3bd38eac4033d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attachment.path.split(/[\\\\/]/).pop() || attachment.path\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/agentQueue.ts, desktop/src/features/remote-peer/remoteQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"85020af67005abdfe9fc2cdf74e5d75c95f54c8ba93213b0e370f1089828b210"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.kind === \u0022segment\u0022 \u0026\u0026 block.segment.kind === \u0022text\u0022\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/replyBlocks.ts, mobile/src/features/chat/messages/ReplyBlocks.tsx, mobile/src/features/chat/messages/TimelineCard.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/replyBlocks.ts"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18b8237bd68f09039c77a2433ee20a7260e06f7ce6df89336da3da5d60ec131"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060block.kind === \u0022segment\u0022 \u0026\u0026 block.segment.kind === \u0022text\u0022 \u0026\u0026 block.segment.text.trim().length \u003E 0\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/replyBlocks.ts, mobile/src/features/chat/messages/ReplyBlocks.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/replyBlocks.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e9140266bd143db4ee3a4a7469397c358d4d058347717cc1d6d4d3e21156d9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060build.data?.isRelease === false \u0026\u0026 fusionAvailable\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/Composer.tsx, desktop/src/features/remote-peer/RemoteComposer.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/Composer.tsx"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"439c67a85adb3a58475a34bcd8a85668b67d87fdef467d0210047e3a43ddde0a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cancelled || threadRef.current !== threadId\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/agentQueue.ts, desktop/src/features/terminal/useTerminalTabs.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff2970eca95a154d8590736b9ba04f02e1d40894654964bffc73f158d429d28"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060code === -5 || code === -4 || code === -3\u0060 appears character-identically in 2 files \u2014 packages/markdown/src/remarkLatexMath.ts, packages/markdown/src/remarkMathFence.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":"packages/markdown/src/remarkLatexMath.ts"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6302086765db9e3f8c8aa404505de025bd1171ac2540d340b4e7735980d02f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060code === 32 || code === -2 || code === -1\u0060 appears character-identically in 2 files \u2014 packages/markdown/src/remarkLatexMath.ts, packages/markdown/src/remarkMathFence.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":"packages/markdown/src/remarkLatexMath.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"de67bd65da2488729b30f08b8b27b10bdeca5af66ebe1171e79252f5ba57dad9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current \u0026\u0026 (key === undefined || current.key === key)\u0060 appears character-identically in 2 files \u2014 desktop/src/features/settings/CustomProviderDialog.tsx, mobile/src/features/settings/CustomProviderPage.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/settings/CustomProviderDialog.tsx"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"afdacd61d308499d63cbb232784360f376c0da5d0fd02362536fe8b654bebea3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060current === null || current === undefined\u0060 appears character-identically in 2 files \u2014 harness/lib/remote-live.mjs, harness/lib/remote-mobile-live.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":"harness/lib/remote-live.mjs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b6a2be24dfc608a4c76c219161c862bb7823e275263251cc1817931f5f280b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cursor !== end || cursor \u003C 0 || cursor \u003E text.length\u0060 appears character-identically in 2 files \u2014 mobile/src/features/chat/sessionCompletion.ts, mobile/src/features/chat/skillCompletion.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":"mobile/src/features/chat/sessionCompletion.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f76a7be5813a6b1d682f48728a67e7f310d21390035e76531052f829b75c267"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060disabled \u0026\u0026 \u0022cursor-not-allowed opacity-50\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/features/remote-peer/RemoteConversationMenu.tsx, desktop/src/features/remote-peer/RemoteWorkspaceMenu.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteConversationMenu.tsx"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1162fab03b8afa7c9bd926595e72c57869faf26c547d55020c7078bea0d73d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060disabled || writing.current || !active.current\u0060 appears character-identically in 2 files \u2014 mobile/src/features/settings/SettingsScreen.tsx, mobile/src/features/settings/SkillsSettingsPage.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/settings/SettingsScreen.tsx"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"a039011da9f917e0471ff23a19d736957c5608c015108f5a730f2178bddee5e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof Error \u0026\u0026 error.message === \u0022desktop_unavailable\u0022\u0060 appears character-identically in 3 files \u2014 mobile/src/screens/SessionList.tsx, mobile/src/screens/SessionsScreen.tsx, mobile/src/share/useShareIntake.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":"mobile/src/screens/SessionList.tsx"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e3b32c10f4ff39162c76aac63fe143a519fcb2c34fcf5a1db8adf70f690b9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error instanceof HistoryPageHiddenError \u0026\u0026 isCurrent()\u0060 appears character-identically in 2 files \u2014 mobile/src/remote/timeline/useOlderHistory.ts, mobile/src/remote/useTimelineController.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":"mobile/src/remote/timeline/useOlderHistory.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"861a704de4e5a973574f0c80063e6741bdf20a21233455d10561fd9e483bbd39"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.key !== \u0022ArrowDown\u0022 \u0026\u0026 event.key !== \u0022ArrowUp\u0022 \u0026\u0026 event.key !== \u0022Home\u0022 \u0026\u0026 event.key !== \u0022End\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/ActivityRailMenus.tsx, desktop/src/features/remote-peer/DeviceChoiceDialog.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/ActivityRailMenus.tsx"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"78263d031fa047987d7b68ba67c4366a1585b5d1f2707ed6254f018c56192b1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.key === \u0022ArrowDown\u0022 || event.key === \u0022ArrowUp\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/ActivityRailAccountFooter.tsx, desktop/src/features/palette/CommandPalette.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/ActivityRailAccountFooter.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5889347e148a403768f4ab8cf1981ac10b0482aaf7fe0fbc3560b6ff511ca4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.key === \u0022Home\u0022 || event.key === \u0022End\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/ActivityRailAccountFooter.tsx, desktop/src/components/layout/ActivityRailMenus.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/ActivityRailAccountFooter.tsx"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7619e95c0a0dfd6f60988dd82867a883ca77ec4f8ed268c5b33c14fd8fe82c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.metaKey || event.ctrlKey || event.altKey || event.shiftKey\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/composer/SendChoiceMenu.tsx, desktop/src/features/filepreview/ImagePreview.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/composer/SendChoiceMenu.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"358119b22415e5227ed68580df909ac170610350cbc60bd5a3274f1388ecd0c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.type === \u0022provider_config_changed\u0022 || event.type === \u0022model_visibility_changed\u0022\u0060 appears character-identically in 2 files \u2014 mobile/src/remote/useDesktopRuntime.ts, mobile/src/remote/useTimelineController.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":"mobile/src/remote/useDesktopRuntime.ts"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"19736c9ada5a39b72ee3c1a24c11bca9d94d389f16e6c3470dd45d5624f8a19b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filter.kind === \u0022all\u0022 || filter.desktopId === null\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/MergedRows.tsx, desktop/src/features/remote-peer/mergeConversations.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":"desktop/src/components/layout/MergedRows.tsx"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0e456ec6318c3b1c2899202e941fd3076e7cc512bed2a071afca572d0e2ff9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.kind !== \u0022message\u0022 || item.role !== \u0022assistant\u0022\u0060 appears character-identically in 2 files \u2014 mobile/src/features/chat/useSendMessage.ts, packages/remote-client/src/projection.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":"mobile/src/features/chat/useSendMessage.ts"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2106bb6ff365f5fc3581231d8a760e2529645546250fe41e25623e5a5b465a91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.kind === \u0022message\u0022 \u0026\u0026 item.role === \u0022user\u0022\u0060 appears character-identically in 2 files \u2014 mobile/src/features/chat/questionNav.ts, packages/remote-client/src/projection.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":"mobile/src/features/chat/questionNav.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"accd7d34bebcdac8208f7abeebf7af225cf34743d005406960369a135bd6994b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item?.kind !== \u0022message\u0022 || item.role !== \u0022user\u0022\u0060 appears character-identically in 2 files \u2014 mobile/src/remote/timeline/historyPaging.ts, mobile/src/remote/useTimelineController.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":"mobile/src/remote/timeline/historyPaging.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"28daad9bbee921bf3cc376f6e1c6c31b97f80ecae9e69636168ce02ba9a957bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060kind !== \u0022event\u0022 || source !== desktopId\u0060 appears character-identically in 3 files \u2014 desktop/src/features/remote-peer/useRemoteApprovals.ts, desktop/src/features/remote-peer/useRemoteConversationSettings.ts, desktop/src/features/remote-peer/useRemoteTimeline.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":"desktop/src/features/remote-peer/useRemoteApprovals.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1bfad6f8ae6269e73daa0bb68f1a67a6fe4e090a85959afd43a1c4356df9c4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lifetime !== null \u0026\u0026 lifetimeRef.current === lifetime\u0060 appears character-identically in 2 files \u2014 desktop/src/lib/useOperationLifetime.ts, mobile/src/features/chat/useConversationOperation.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":"desktop/src/lib/useOperationLifetime.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"0035af7363bb64125d35b718b0dc6a11e588910ba3f495e9c3bf3876b7ff805c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060machine.status === \u0022connected\u0022 \u0026\u0026 machine.control !== \u0022standby\u0022\u0060 appears character-identically in 2 files \u2014 mobile/src/remote/desktopStatus.ts, mobile/src/share/shareDevices.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":"mobile/src/remote/desktopStatus.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50c2ef9e9fe4688f18eca6fab71dd3406dc31f8beb178abfa3476126c0e6cd2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060machine?.status === \u0022connected\u0022 \u0026\u0026 machine.control === \u0022standby\u0022\u0060 appears character-identically in 2 files \u2014 mobile/src/screens/DesktopPicker.tsx, mobile/src/screens/DesktopsScreen.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/screens/DesktopPicker.tsx"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9c4405a920d48bc5b876bb20f6366d407cf6cb55629e0792a17bc09f838e12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message.role === \u0022assistant\u0022 \u0026\u0026 message.status === \u0022streaming\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/AgentThread.tsx, desktop/src/features/agent/useAgentThreadState.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":"desktop/src/features/agent/AgentThread.tsx"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"11eab8fbdc99af6433b717bb129dec89f5e0ee70ba35022e7b6838ec908634f2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060minutes \u003E 0 \u0026\u0026 minutes % (24 * 60) === 0\u0060 appears character-identically in 2 files \u2014 desktop/src/features/tasks/TasksView.tsx, mobile/src/features/settings/TasksSettingsPage.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"189ed67ca01b9aae32b94494bd97a5970aafe61366f6d73c19c656e9e3a1b398"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060mode === \u0022once\u0022 || mode === \u0022daily\u0022 || mode === \u0022weekly\u0022 || mode === \u0022monthly\u0022 || mode === \u0022yearly\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/features/tasks/TasksView.tsx, mobile/src/features/settings/TasksSettingsPage.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/tasks/TasksView.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"5879e59a11bf1e75cb7e9b5d15fc5b3caed3656d285d74062e1396a1bbf9144d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.reference.label || basename(node.reference.targetId)\u0060 appears character-identically in 2 files \u2014 mobile/src/components/MarkdownText.tsx, mobile/src/components/markdownTableWidths.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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b4526308a3e6b6af6d9d234463ae71272769e68158a1418edb457a27866765"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0022definition\u0022 || node.type === \u0022footnoteDefinition\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/features/markdown/streamingMarkdownBlocks.ts, packages/markdown/src/streamingMarkdown.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":"desktop/src/features/markdown/streamingMarkdownBlocks.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"074a1d189ec9ab8d11f5b227658dc305c08587c43034b203113296d3e61e44ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.type === \u0022paragraph\u0022 || node.type === \u0022heading\u0022\u0060 appears character-identically in 2 files \u2014 mobile/src/components/MarkdownText.tsx, packages/markdown/src/parseFutureMarkdown.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":"mobile/src/components/MarkdownText.tsx"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b5e903c63326a7d64889c16a5631ce651605557d32ca0874da2dde12d20330"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060option \u0026\u0026 typeof option.id === \u0022string\u0022 \u0026\u0026 typeof option.label === \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/composer/choiceAnswer.ts, mobile/src/features/chat/choiceAnswer.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":"desktop/src/features/agent/composer/choiceAnswer.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c72f16f5c4b2c3bf6c67ad7f6bbce994df29ad7682095acafaa24a8e2f3a66"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed \u0026\u0026 Array.isArray(parsed.findings)\u0060 appears character-identically in 2 files \u2014 harness/lib/analyze.mjs, harness/lib/discovery.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":"harness/lib/analyze.mjs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"d08dd733d94062f175cc290059e1815f79791f49ddadb4665f5ef74f533092dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previous \u0026\u0026 text.startsWith(previous.text)\u0060 appears character-identically in 2 files \u2014 desktop/src/features/markdown/streamingMarkdownBlocks.ts, packages/markdown/src/streamingMarkdown.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":"desktop/src/features/markdown/streamingMarkdownBlocks.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a9ecab571d259ad79501a8a25c5fa000d5ba109122a9ed0031c9dc70cad1c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolved?.status === \u0022resolved\u0022 \u0026\u0026 resolved.targetType === \u0022file\u0022 \u0026\u0026 isStoredFile(resolved.data)\u0060 appears character-identically in 2 files \u2014 desktop/src/features/markdown/renderers/MarkdownImage.tsx, desktop/src/features/markdown/renderers/fileReference.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/markdown/renderers/MarkdownImage.tsx"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0484c39fc3f54ff78888f8b879b253c8f31db5c351f54f603058d19b6dbfe7cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060right.at - left.at || compareText(left.option.sessionId, right.option.sessionId)\u0060 appears character-identically in 2 files \u2014 desktop/src/features/remote-peer/remoteSessionReference.ts, mobile/src/features/chat/sessionMention.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":"desktop/src/features/remote-peer/remoteSessionReference.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef78efb47d0b769d8daf7955d548eb7219a104c53483b86e7e9d472b52c8c25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rows.length === 1 \u0026\u0026 Object.keys(rows[0]).length === 1\u0060 appears character-identically in 3 files \u2014 harness/lib/cli-driver.mjs, harness/lib/remote-live-db.mjs, harness/lib/run.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":"harness/lib/cli-driver.mjs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7895a7a0508a10d96cfedf408a0f7f2e41146587577275eb4b1d6e9bca8fbee7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060segment.kind === \u0022compaction\u0022 \u0026\u0026 !!segment.checkpointId \u0026\u0026 liveCheckpoints.has(segment.checkpointId)\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/messages/compactionMarkers.ts, packages/remote-client/src/projection.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":"desktop/src/features/agent/messages/compactionMarkers.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0db372df79b689f2a578b00c74cfa1196f468be6fce742ac5ad9e7edad9963"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060segment.kind === \u0022compaction\u0022 \u0026\u0026 segment.checkpointId\u0060 appears character-identically in 3 files \u2014 desktop/src/features/remote-peer/remoteLiveReplies.ts, packages/remote-client/src/projection.ts, packages/thread-projection/src/compaction.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":"desktop/src/features/remote-peer/remoteLiveReplies.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64e3eecd8eaff830198c2b6fe1380fba4caf8310e85b9e9f62a94db36789ebe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session.sessionId !== \u0022\u0022 \u0026\u0026 session.sessionId !== currentSessionId\u0060 appears character-identically in 2 files \u2014 desktop/src/features/remote-peer/remoteSessionReference.ts, mobile/src/features/chat/sessionMention.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":"desktop/src/features/remote-peer/remoteSessionReference.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"78803271fdf870ba0bb8233696b85d26592733f27541d7a909b2c6237285b9bd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060session.title.trim() || t(\u0022sessions.unnamed\u0022)\u0060 appears character-identically in 2 files \u2014 mobile/src/features/chat/components/SessionPicker.tsx, mobile/src/share/ShareIntakeMenu.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/features/chat/components/SessionPicker.tsx"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb7fcb7bae5512f1dd2328884fac5511b869e76f845145dd7b3ad1040ec0a02"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sessionStatus === \u0022authenticated\u0022 || sessionStatus === \u0022unavailable\u0022\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/useSkillRecommendation.ts, desktop/src/features/settings/AccountPage.tsx, desktop/src/integrations/agent/automaticApproval.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":"desktop/src/features/agent/useSkillRecommendation.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3708beee94dbda883dcbb9fc1041878df8e8e53cdf2ad34269719b65ee940d21"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060skill.descriptionZh || skill.description\u0060 appears character-identically in 5 files \u2014 desktop/src/features/remote-peer/RemoteComposer.tsx, desktop/src/features/remote-peer/remotePeerClient.ts, desktop/src/features/skills/SkillsView.tsx, mobile/src/features/chat/components/SkillDetailsDialog.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/remote-peer/RemoteComposer.tsx"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"088cb6575ff7cc8c746beee1aa971f9fea5955f3b02529349b809f430927d3d4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060source \u0026\u0026 source.width \u003E 0 \u0026\u0026 source.height \u003E 0 \u0026\u0026 Number.isFinite(source.width / source.height)\u0060 appears character-identically in 2 files \u2014 mobile/src/components/MarkdownImage.tsx, mobile/src/features/chat/messages/AttachmentImage.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mobile/src/components/MarkdownImage.tsx"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0866ec1625b8b260bcf141b9e34ef3df3f84636b4cde18991a580b06d0dec6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status === \u0022queued\u0022 || status === \u0022running\u0022 || status === \u0022waiting_approval\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/RailRow.tsx, desktop/src/features/vibe/vibeQueue.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":"desktop/src/components/layout/RailRow.tsx"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f2cc89d85c910cfb1598e50b7a50dce6efcfd356e9d4c6390dfe8b5ac1542a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060status === \u0022running\u0022 || status === \u0022queued\u0022\u0060 appears character-identically in 3 files \u2014 desktop/src/components/layout/recentOrder.ts, mobile/src/remote/sessionStatus.ts, mobile/src/screens/SessionList.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/recentOrder.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1de39ba1d618351314c4d148a42bfb9fe285134f56b95c033b0583eb79bb33b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060step.status === \u0022completed\u0022 \u0026\u0026 step.report_quality\u0060 appears character-identically in 2 files \u2014 desktop/src/features/fusion/FusionDiscussionPanel.tsx, packages/thread-projection/src/fusion.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":"desktop/src/features/fusion/FusionDiscussionPanel.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"88806cbd5e16a69b5ab9fd8ddd2da78386a6bdaede99dc43c209d01c682e612c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060surface === \u0022mobile\u0022 || surface === \u0022remote\u0022\u0060 appears character-identically in 2 files \u2014 harness/lib/discovery.mjs, harness/lib/provenance.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":"harness/lib/discovery.mjs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9f4b1630cb732d5c7b89302627262b71362d928d7d8570a7a9a082ac2d6499"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tab.title || defaultTitle(tab.titleNumber || 1)\u0060 appears character-identically in 2 files \u2014 desktop/src/features/terminal/TerminalPanel.tsx, desktop/src/features/terminal/useTerminalTabs.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":"desktop/src/features/terminal/TerminalPanel.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c35fd3357c230303655464f2a9d33e2c9482719fa0479898df09667dd3bf5d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060target.title.trim().replace(/\\s\u002B/g, \u0022 \u0022) || target.sessionId.slice(-5)\u0060 appears character-identically in 2 files \u2014 desktop/src/features/remote-peer/remoteSessionReference.ts, mobile/src/features/chat/sessionCompletion.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":"desktop/src/features/remote-peer/remoteSessionReference.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7e3bace0f57ec15e8bfe9cd195f6304886fa14314e28704eb801a74861a0af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060thread.status === \u0022active\u0022 \u0026\u0026 !thread.pinned\u0060 appears character-identically in 2 files \u2014 desktop/src/features/vibe/AddToVibeDialog.tsx, desktop/src/features/vibe/emptySlot.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":"desktop/src/features/vibe/AddToVibeDialog.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"726e90cde0eb62e0b97c14881934fba38689fd5d4cdbfea8cbcc3fee901b241e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060tokensBefore \u0026\u0026 tokensBefore \u003E 0 \u0026\u0026 tokensAfter \u0026\u0026 tokensAfter \u003E 0\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/messages/MessageStatus.tsx, mobile/src/features/chat/messages/MessageStatus.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/features/agent/messages/MessageStatus.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55c37e1e9c35d698d5543bbf62ab94f66a5411e9a93540ef49dc73e27f76e67"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof ack.reason !== \u0022string\u0022 || !ack.reason\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/agentQueue.ts, desktop/src/features/remote-peer/remoteQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3bd6d199cfb62fb09834ea66ce04a96c5e9abc84efbcfdc5d7be76d54e3a93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof ack.runId !== \u0022string\u0022 || !ack.runId\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/agentQueue.ts, desktop/src/features/remote-peer/remoteQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ccb8f93bf104758258268a03389c92de29eebce69e18d3b6c19cd208ee6e874"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof ack.state === \u0022string\u0022 \u0026\u0026 ack.state\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/agentQueue.ts, desktop/src/features/remote-peer/remoteQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0fa4fa48d59e3d25b4ff42aaa5b453f96b9983d26c941e3dc30d0c0b7df69c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof actual === \u0022string\u0022 \u0026\u0026 actual.includes(spec.contains)\u0060 appears character-identically in 2 files \u2014 harness/lib/remote-live.mjs, harness/lib/remote-mobile-live.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":"harness/lib/remote-live.mjs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0040851c26c90b2b707d05b1c034bc0daa082570d6bb41486c36eab8e251bd4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof attachment.name === \u0022string\u0022 \u0026\u0026 attachment.name\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/agentQueue.ts, desktop/src/features/remote-peer/remoteQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88478c3dc91e0744f778388cfd5d0bcaf6aa50fdd3c8dbbd37818274851ba79"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof attachment.path !== \u0022string\u0022 || !attachment.path\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/agentQueue.ts, desktop/src/features/remote-peer/remoteQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c55a0f1f14044c415e3ce650fcbe61f3aaaf24efe13efa57bcaa7969a05c3a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof attachment.size === \u0022number\u0022 \u0026\u0026 attachment.size \u003E 0\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/agentQueue.ts, desktop/src/features/remote-peer/remoteQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"234f531bb54885ec06a29518626328762faccc5a963050ebe49d8fea64c91411"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof choice.title !== \u0022string\u0022 || !choice.title.trim()\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/agentQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"10eaad11ae4986294aec7ebb5ad32d3b79ae8bac941172387bbaa7385ec129f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof entry !== \u0022object\u0022 || entry === null\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/hooks/useRemotePeers.ts, desktop/src/features/remote-peer/remotePeerClient.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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73bb16b378d44e2c393df928c834966cc3423444dcf0bddf9aea6a8393f1bff"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof field === \u0022number\u0022 \u0026\u0026 Number.isFinite(field)\u0060 appears character-identically in 4 files \u2014 desktop/src/features/remote-peer/useRemoteTimeline.ts, desktop/src/features/remote-peer/useRemoteUsage.ts, desktop/src/features/runs/toolInput.ts, desktop/src/integrations/agent/agentStateCache.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":"desktop/src/features/remote-peer/useRemoteTimeline.ts"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca1090ff523df9682ff7f26dc1af6fa5fa803a04d53a876b93f1ba6b89d75d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof id === \u0022string\u0022 \u0026\u0026 typeof label === \u0022string\u0022\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/agentQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad8cf5004f3030515de5c8c92f4d046a818267fc4c7703d4ac4c5d7935e96ff6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof parsed !== \u0022object\u0022 || parsed === null\u0060 appears character-identically in 4 files \u2014 desktop/src/components/layout/hooks/newConversationTarget.ts, desktop/src/features/terminal/useTerminalPanel.ts, desktop/src/features/vibe/vibePreferences.ts, mobile/src/features/chat/skillRecoBudget.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":"desktop/src/components/layout/hooks/newConversationTarget.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d40d7aa419aa9851f9aabf136c6cfb8d23ca022b6218a00498ff362230250a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof payload !== \u0022object\u0022 || payload === null\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/hooks/useRemotePeers.ts, desktop/src/features/remote-peer/useRemoteConversationSettings.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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3b14be881200b3936747ad7caf2cba0da4760c4f8d069d284d4ba1c8dac633"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof row.name !== \u0022string\u0022 || !row.name\u0060 appears character-identically in 2 files \u2014 desktop/src/features/remote-peer/remotePeerClient.ts, desktop/src/features/remote-peer/remoteSkillRecoSource.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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5317cdc6e4af5a4349a2635e33f93e05846952f202771485ead04367e51911e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof row.runId !== \u0022string\u0022 || !row.runId\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/agentQueue.ts, desktop/src/features/remote-peer/remoteQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"2072da71b22dd89f4ef56e937ebcca3d08cefbc3488dd030ced953bb25fad8fc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof row.state === \u0022string\u0022 \u0026\u0026 row.state\u0060 appears character-identically in 3 files \u2014 desktop/src/features/agent/agentQueue.ts, desktop/src/features/remote-peer/remoteQueue.ts, mobile/src/remote/sessionQueue.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":"desktop/src/features/agent/agentQueue.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c120587ecf08f174440759496c7e292b95e8ffbb9dda8f4ad76926f7c555dacd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof sessionId !== \u0022string\u0022 || !sessionId\u0060 appears character-identically in 2 files \u2014 desktop/src/features/remote-peer/remotePeerClient.ts, mobile/src/notifications/taskNotifications.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":"desktop/src/features/remote-peer/remotePeerClient.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2861673eb621fc0796a4fdc94335fefc588ced3e116ec2305bde7f513b6ae8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof title !== \u0022string\u0022 || !title.trim()\u0060 appears character-identically in 2 files \u2014 desktop/src/features/agent/composer/choiceAnswer.ts, mobile/src/features/chat/choiceAnswer.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":"desktop/src/features/agent/composer/choiceAnswer.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdfb0f5eb3225c85450500b21b8b0e829138930338a072f1f5b55e289a64142"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value !== \u0022object\u0022 || value === null\u0060 appears character-identically in 5 files \u2014 desktop/src/components/layout/hooks/useRemotePeers.ts, desktop/src/features/remote-peer/mergeConversations.ts, desktop/src/features/remote-peer/remoteHostCatalog.ts, desktop/src/features/remote-peer/useRemoteApprovals.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":"desktop/src/components/layout/hooks/useRemotePeers.ts"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"da49667198c817234506bd6932b068e3be1b88063d4c200140df1097003c7177"}},{"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 desktop/src/features/terminal/tabs.ts, packages/thread-projection/src/liveApply.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":"desktop/src/features/terminal/tabs.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e9b30dac6bb9d9a378df502578926f4ecb4a271cbeeb2a5e50949700f964f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof value === \u0022number\u0022 \u0026\u0026 Number.isFinite(value) \u0026\u0026 value \u003E= 0\u0060 appears character-identically in 2 files \u2014 packages/remote-client/src/projection.ts, packages/thread-projection/src/shellResult.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":"packages/remote-client/src/projection.ts"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"689267742aaa9f9b0a09e0d1531c7b170adf253773d24f947afcc037eae46129"}},{"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 3 files \u2014 desktop/src/features/terminal/tabs.ts, desktop/src/lib/objects.ts, packages/thread-projection/src/utils.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":"desktop/src/features/terminal/tabs.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eb846408440dfb4c3e4b57405c1f764cf19c389a53fcc91ded37fefcba1da4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unread \u0026\u0026 (status === \u0022completed\u0022 || status === \u0022failed\u0022)\u0060 appears character-identically in 2 files \u2014 desktop/src/components/layout/RailRow.tsx, mobile/src/screens/SessionList.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"desktop/src/components/layout/RailRow.tsx"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e7af2f924cd4dbc8db382be16baa591bbf47f2ec0ba6926f73fcca2af962bc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value)\u0060 appears character-identically in 2 files \u2014 harness/lib/fixture-server.mjs, scripts/measure/measure-mobile-performance.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":"harness/lib/fixture-server.mjs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f540ad27b56ea68005ed079e723b15716eaeab68bb60ccc670ebffa20bb4161b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p[\u0022input_sha256\u0022] != sha(d[\u0022records\u0022][:end]) or p[\u0022previous_sha256\u0022] != sha(states[arm])\u0060 appears character-identically in 2 files \u2014 scripts/compaction_experiment/harness.py, scripts/compaction_experiment/run_closed_book.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/compaction_experiment/harness.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b233c137b37e243a5b9f534cea18b5011654c578252af405befe312c998fb9c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.is_file() and os.access(path, os.X_OK)\u0060 appears character-identically in 4 files \u2014 scripts/measure/audit-lean-page.py, scripts/measure/measure-catalog-activity.py, scripts/measure/measure-lean-history.py, scripts/measure/measure-live-lane.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/measure/audit-lean-page.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a238f44b265637df4497e58537c7f8b1c96eab4e64ffb559ad3978e58fd355d3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!addr.trim().is_empty() \u0026\u0026 !addr .trim() .eq_ignore_ascii_case(future_rpc::transport::AUTO_ENDPOINT)\u0060 appears character-identically in 2 files \u2014 agent/src/service/mod.rs, agent/src/service/startup.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":"agent/src/service/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e72f157c722472593223759a5a4bb699e7a6c2931e14042c4e462642d8dba3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!level.is_empty() \u0026\u0026 level != crate::llm::schema::DEFAULT_THINKING_LEVEL \u0026\u0026 level != \u0022off\u0022\u0060 appears character-identically in 2 files \u2014 agent/src/llm/adapters/anthropic.rs, agent/src/llm/adapters/openai_responses.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":"agent/src/llm/adapters/anthropic.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba0fa947f783cfe6e9af833d36de491f161c5da558c19ff4cd263e21cd41369"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!line.contains(\u0027\\n\u0027) \u0026\u0026 !line.contains(\u0027\\r\u0027)\u0060 appears character-identically in 2 files \u2014 channels/src/providers/email.rs, channels/src/providers/irc.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":"channels/src/providers/email.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f09093fee940c7a711d7847c2997acac58d3be1e0ff6be33df6d12e4aed797"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!manager.enabled \u0026\u0026 trigger == CompactionTrigger::Automatic\u0060 appears character-identically in 2 files \u2014 agent/src/compaction/durable.rs, agent/src/compaction/semantic.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/compaction/durable.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecaa086f1490bfe3344caa5200108785c5e2a1f6b4d1d3cc11314c076b465f65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!manager.enabled \u0026\u0026 trigger == CompactionTrigger::ModelContextDownshift\u0060 appears character-identically in 2 files \u2014 agent/src/compaction/durable.rs, agent/src/compaction/semantic.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"agent/src/compaction/durable.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f6d64c9c7c2746e0592342d67cf552df03ff74b4b6acd9f1ad5380e3fdb4ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes[i \u002B 2] == b\u00270\u0027 \u0026\u0026 i \u002B 3 \u003C bytes.len() \u0026\u0026 bytes[i \u002B 3] == b\u0027m\u0027\u0060 appears character-identically in 2 files \u2014 tui/src/utils.rs, tui/src/workbench/run.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":"tui/src/utils.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ef6280be8e248b2be6c02d3c016481952d0a528c46fb68ce4042005ba95a30"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bytes[i] == 0x1b \u0026\u0026 i \u002B 2 \u003C bytes.len() \u0026\u0026 bytes[i \u002B 1] == b\u0027[\u0027\u0060 appears character-identically in 2 files \u2014 tui/src/utils.rs, tui/src/workbench/run.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":"tui/src/utils.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c49e6ac86571cff1f3b7dab0d0db404f3b2c6eb7ac0662438185e7966c5794"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060command.contains([\u0027|\u0027, \u0027\u0026\u0027, \u0027;\u0027, \u0027\\n\u0027, \u0027\u0060\u0027, \u0027\u003C\u0027, \u0027\u003E\u0027]) || command.contains(\u0022$(\u0022)\u0060 appears character-identically in 2 files \u2014 host/src/agent_bridge/persist.rs, host/src/store/runs.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":"host/src/agent_bridge/persist.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33b03325c5282b5e476e63e2280df2628fe058463f4551f4d0877870f20ea71"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060event.run_id.is_empty() \u0026\u0026 event.session_idx \u003E= 0\u0060 appears character-identically in 2 files \u2014 agent/src/session/legacy_import.rs, host/src/agent_bridge/stream.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":"agent/src/session/legacy_import.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b6d8bb75b4b31b8b5b4cf0a806b3add62d06f13b49b1ffaf2224cefe8f55f4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060file_args.is_empty() \u0026\u0026 messages.is_empty()\u0060 appears character-identically in 2 files \u2014 cli/src/commands/run.rs, tui/src/index.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":"cli/src/commands/run.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ebe256a3fe2f0526487f24d530550e706623f7b1f52a266ebf826d5b8a6805"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lanes[*column].is_none() || closed.contains(column)\u0060 appears character-identically in 2 files \u2014 host/src/git_history.rs, tui/src/workbench/git_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":"host/src/git_history.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2c2a48f51a78f8320463407b2ad693cff505900d4297eb05d4cf656220b764"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060level.is_empty() || level == DEFAULT_THINKING_LEVEL\u0060 appears character-identically in 2 files \u2014 agent/src/llm/schema.rs, host/src/agent_providers/validate.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":"agent/src/llm/schema.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"597f20ba88d237825b38457bfbbb9baf1119ca742de0a8e90e1a8c792059c40a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lower.contains(\u0022timed out\u0022) || lower.contains(\u0022timeout\u0022)\u0060 appears character-identically in 2 files \u2014 host/src/run_error.rs, orchestration/fusion/src/resilience.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":"host/src/run_error.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2cf6c1bd14e83ba7839c7c6787ca240eef80b8c8cf2f5ae1a3ca87d2fa6324"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060model.context_window \u003C= 0 || model.max_tokens \u003C= 0\u0060 appears character-identically in 3 files \u2014 agent/src/config/providers.rs, host/src/agent_providers/validate.rs, tui/src/rpc/provider_types.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":"agent/src/config/providers.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8308ccbf3df1f22d3e0b028f8201641baefed1dfb0d6073c24773685efe88a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized.starts_with(\u0022http://\u0022) || normalized.starts_with(\u0022https://\u0022) || normalized.starts_with(\u0022mailto:\u0022)\u0060 appears character-identically in 2 files \u2014 desktop/src-tauri/src/commands/files.rs, desktop/src-tauri/src/commands/remote.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":"desktop/src-tauri/src/commands/files.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba1e59c7982dbcb82fe9794cefdc4e42ace440af63cf615c169be36a032fe7c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060offset \u003E= snapshot.bytes.len() || !offset.is_multiple_of(CHUNK_BYTES)\u0060 appears character-identically in 2 files \u2014 desktop/src-tauri/src/commands/history_transfer.rs, host/src/remote_host/read_pages.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":"desktop/src-tauri/src/commands/history_transfer.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c29583fe374b5d3b968a8804c57a36c32eb77de65f6e691e94eae1a0a2f1f00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060request .system_prompt .contains(\u0022context summarization agent\u0022) || summary_instruction.contains(\u0022handoff summary for another agent\u0022)\u0060 appears character-identically in 2 files \u2014 agent/src/agent/run_loop.rs, agent/src/rpc/session_prompt/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":"agent/src/agent/run_loop.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"518256323beee8e36dfb3d11a0b01ff47eda636c280bb09c6faf63676af29bcb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolved \u003E taken \u0026\u0026 resolved \u003C taken \u002B 50\u0060 appears character-identically in 2 files \u2014 cli/src/browser/chromium/chromium_manager.rs, cli/src/browser/safari/safari_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":"cli/src/browser/chromium/chromium_manager.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef1dff5b6d957ea4ea2d9eeb29793c21e44880a8325a6d411b2a4167d4c40f7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060response.status().is_success() || response.status() == reqwest::StatusCode::NOT_FOUND\u0060 appears character-identically in 3 files \u2014 cli/src/commands/remote.rs, host/src/remote/relay.rs, host/src/remote_host/pairing.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":"cli/src/commands/remote.rs"},"region":{"startLine":2505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90ba79e20a061568654c449c0a3f2c0d6a1ddfd1975d321381a50b39e608466"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rid.is_empty() || rid == expected_run_id\u0060 appears character-identically in 2 files \u2014 channels/src/dingtalk/bridge.rs, channels/src/feishu/prompt_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":"channels/src/dingtalk/bridge.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bca277b170ac1048d206adeeed9f8d10c066a070626b17dc350338913db9dd3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.input == 0.0 \u0026\u0026 self.output == 0.0 \u0026\u0026 self.cache_read == 0.0 \u0026\u0026 self.cache_write == 0.0\u0060 appears character-identically in 4 files \u2014 agent/src/config/providers.rs, agent/src/models/mod.rs, cli/src/commands/configure.rs, host/src/agent_providers/validate.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":"agent/src/config/providers.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b754599a4682770abc1fbca96c62f6ec0878f8f0af67a1cd53d2dc6882ec1d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060spec.api_key.is_some() || spec.clear_api_key\u0060 appears character-identically in 2 files \u2014 agent/src/config/providers.rs, agent/src/rpc/commands/providers.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":"agent/src/config/providers.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03a30844fa174121c95359c4a6468a07b8f6db2b4a20f34d58954848acc3342"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stem.starts_with(\u0022COM\u0022) || stem.starts_with(\u0022LPT\u0022)\u0060 appears character-identically in 2 files \u2014 cli/src/commands/skills.rs, tui/src/skills_cli.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":"cli/src/commands/skills.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb251599574015a29e954257768f961a51c8d3a889f08ac31f1dfb5bed114bfa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060text.trim().is_empty() \u0026\u0026 media.is_empty()\u0060 appears character-identically in 2 files \u2014 channels/src/providers/linq.rs, channels/src/providers/whatsapp.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":"channels/src/providers/linq.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"499cc151711fbeb9958a35ac4c14c72f781d939036ac02befd9cb8297e07aeba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060url.starts_with(\u0022http://\u0022) || url.starts_with(\u0022https://\u0022)\u0060 appears character-identically in 3 files \u2014 agent/src/rpc/export_html.rs, cli/src/commands/mcp_http.rs, cli/src/commands/mcp_servers.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":"agent/src/rpc/export_html.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa13c80e4f123f82d419d7a7a49e24599c26481be1a2d82d9697e4c8166476e"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/1 NRT-eligible project(s) enable \u003CNullable\u003Eenable\u003C/Nullable\u003E (projects targeting a pre-C#-8 framework are excluded \u2014 NRTs aren\u0027t available there). NRTs catch a whole class of null-deref bugs at compile time."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"80b24de9378624a0ce4846d60457395befcaec8e109ea81d289a370c9f7bfd5d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060strip_repeated_tool_arguments\u0060 turns every \u0060Err\u0060 into \u0060true\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":"agent/src/rpc/run_snapshot.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7123e04017652d32a65890298ab4b3af5b7ad5cb15dd73b86fcdc4cc0ac61497"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load_offset\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":"channels/src/providers/telegram.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57f38731f767b162d169daeaaa766d0a3b35ac67cbfd93f812976b5eb2a2e95"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060evaluate_expression\u0060 turns every \u0060Err\u0060 into \u0060T::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":"cli/src/browser/chromium/chromium_session.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b17e6dc5db3a29a4a158e3d4fe8d2fd73c538ef9a1e1c99377074db60ecfe2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060evaluate\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\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":"cli/src/browser/chromium/chromium_session.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5d63466aa6d69f623f4c8f35a7012572f54ab3c418b3e6f408ddce6b52dca7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060bin_path\u0060 turns every \u0060Err\u0060 into \u0060\u0022future\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":"cli/src/axi.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"172c185be7357cad879ed4f4d9031ffb1bdea7d4ce46337e2c2dbc8f7c406eee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060streaming_thread_ids\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":"cli/src/commands/archive.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"26fea195fc4c405ef479e5884286519b8114590fe420c8f78283d414535e21e0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060tasks_line\u0060 turns every \u0060Err\u0060 into \u0060\u0022none \u2014 Run \u0060future task add\u0060\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":"cli/src/commands/home.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"12e578a5d5c49910545c3ae34d66c848c97ed6f8f9bbad00a89e963d0c7eff97"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060number\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":"cli/src/commands/session_journal.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c13591f967a44cfb1e9fbb32732d987ef025a745395bd6f8a0379f2f337e1cc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060number\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":"cli/src/commands/session_status.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e47e8274f5e091f22bb48565eb830d9290c9e51713c3882608a7cf48ab8ba1e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060example_flags\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":"cli/src/commands/tools.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"3705f4b7f721e69557efaf6c1eb10c1abc93a87c6fbaa04fe87a828008b157a0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060reconcile_streaming_observers\u0060 turns every \u0060Err\u0060 into \u0060Ok(Vec::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":"host/src/agent_bridge/observer.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"893224f5f675db0d82b9d3d46b8c5842fabcc991393c2b269a60b7cd4f210dd8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060launch_mode\u0060 turns every \u0060Err\u0060 into \u0060\u0022auto\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":"host/src/agent_host.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cadd50375564e7fac513e0c20af4d1d19981946e9673df0d7071e674d91ef61"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060requests\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":"host/src/remote/control.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf6cd19a69ce02e17a7d9a237673e0ca91a8cf8fcb7ea1cf33f49273bb77c6a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_events_from_disk\u0060 turns every \u0060Err\u0060 into \u0060vec![]\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":"host/src/store/runs.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"10700d951305054ba687c879afdd3a1ec2d9338cb5c6aa3140660d0002a4e188"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060session_members_via_ps\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":"host/src/terminal/pty.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a10cb2a78add1b6c89070ce5847c66e6440edc187a4bc791f53db9971cd199"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060backups\u0060 turns every \u0060Err\u0060 into \u0060vec![]\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":"orchestration/goal/src/store.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7ae3d955fb952ffe6ce65424a85707eee748377e46744d411c70142fd72bae"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060worker_stop_requested\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":"orchestration/goal/src/console.rs"},"region":{"startLine":6729}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c4714818fbe3a7d42f151f1e7aef283e02f5bdd8ac0e4cebaa6bf30a3007ac0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan_worker_sessions\u0060 turns every \u0060Err\u0060 into \u0060vec![]\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":"orchestration/goal/src/console.rs"},"region":{"startLine":7834}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38b90245987962886f7f2f6707cc770d3b42c5c7f778a16ea4f9913e2a64a65"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scan_active_runs\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":"orchestration/goal/src/webui/api.rs"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f42e59aa29755353921961c65878e1abd419f8e7b41ae6df4ab946dfd7be25"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060hosts_due_for_rotation\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":"packages/remote-client/src/runtime.rs"},"region":{"startLine":2266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64ef65c95a35b69b4f73579dcc58069ce2da12ddcb542d4dbd2fb4682b2e8dd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060approval_card_to_proto\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\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":"packages/rpc/src/encode.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fbd000b4b7ed25b75666470a367b9ee00e68bef59d7f8fc628e1e41b6db2e3c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060load\u0060 turns every \u0060Err\u0060 into \u0060Self::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tui/src/workbench/preferences.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7d841358e55e8d047daaff0662764852c8e58b854fd77889220c2c2e25ba4b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sweep_stale_clipboard_files\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":"tui/src/paste.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b9d1c36821f5b11302d4f0bb6e20488a21afa59d45b73ba5c61e81521715377"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_head\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":"tui/src/workbench/files.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ab1c76bba73b287fd86d4f57ee7746d8ce38f5d25faed431b01267da55c8f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readState\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":"desktop/scripts/stabilize-dist-mtimes.mjs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a3146a7b47bf01e4d1d13d4e0a3b422392c01aa8a01a3e6bea2a29cc70dcd9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060read\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":"desktop/src/features/keyboard/shortcuts.ts"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"879959e2d226b49c418dde5c38d774de3372891eeb57e7670de58bc3ec3201cd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060publicAnswer\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":"desktop/src/features/fusion/FusionStepBody.tsx"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"99666a696b1469f253a3878b94f0490d52a5a5c10c65628a2746aee36e6f43e8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060listStreamingThreadIds\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":"desktop/src/integrations/agent/agentStateCache.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f7f68d668c721f959d80fb6acd486e4166e130cc0f22f9c292f6ceabd43a945"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060safeListRunEvents\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":"desktop/src/features/agent/runtime/runProjectionUtils.ts"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfb03cddd2f5bfa97906f06f5bea691700e178cee7bc83170886024a2690d13"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060buildReferenceContext\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":"desktop/src/features/agent/buildReferencePrompt.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c4ec405fee91eb23a6d655efe5516964a99c6f09e5a700778268b20444eea9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readOrder\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":"desktop/src/features/vibe/vibePreferences.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5ac2bb5d9ce8e9d736f0adf9adb8313f476a5b16c067fa87cc388f0fddeb29"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060readPanelMap\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":"desktop/src/features/vibe/vibePreferences.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e6cea29d02448db1b3b4d3e88641668e2e8415ab1b59bb21b965fc1683b93b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060timezoneOffsetMinutes\u0060 swallows every exception into \u0060return 0\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":"desktop/src/features/tasks/timezoneChoice.ts"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceca039ba7a5a4adb7d45e1b4bcb043bc80de72cc66650992cc8949aa2b8ceb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060loadPrefs\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":"desktop/src/features/terminal/useTerminalPanel.ts"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b143eab5346b1ef2ba6aa10c41b648ff059717597895f64363d17910e83b98"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060runningMembers\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":"desktop/src/components/layout/hooks/useThreadDialogs.ts"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"0debef50639665b25cdca0d5c1f1b1369bd68b25312711f95da7518d7b603dca"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060runningInTrees\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":"desktop/src/components/layout/hooks/useThreadDialogs.ts"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd14ad5e41f574adaf2fb03b39c2426f052f0edc3775123b8b054095c1667a7f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060discoverCase\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":"harness/lib/analyze.mjs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f5af0f783710fd18516ffc6d2e169bc76aac24f59400296db17d32c5dae56d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060gitShortHash\u0060 swallows every exception into \u0060return \u0022unknown\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":"scripts/version.mjs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6882c8baccae899b33351b690d1a7d133b1eb332eeca0f917476cc34ff870c7"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060line.starts_with(\u0022@@ \u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060line.starts_with(\u0022@@ \u0022)\u0060 also satisfies \u0060line.starts_with(\u0022@@\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":"tui/src/components/chat_area.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc059078df85cc40e09ae918677d435517c34a930bb3cec46f56b0f6090f1212"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.startsWith(\u0022[next]\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.startsWith(\u0022[next]\u0022)\u0060 also satisfies \u0060text.startsWith(\u0022[\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":"scripts/screenshots/injects/choice-card-v3-queue-mobile.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"35daf8d2483ca3818c808ac9bc781792c5f2aee65c602e39a4398bea4d83b682"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060text.startsWith(\u0022[future-goal]\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060text.startsWith(\u0022[future-goal]\u0022)\u0060 also satisfies \u0060text.startsWith(\u0022[\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":"scripts/screenshots/injects/choice-card-v3-queue-mobile.js"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f986450ff2e991ac07aa25fba335009a20fe19ee13eaa3e943aa232b5a3d7b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022msedge\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022msedge\u0022)\u0060 also satisfies \u0060lower.contains(\u0022edge\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":"cli/src/browser/discovery.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"75408a26a6a8f75642d54ef770c5ea357d9838e5c9cf82dc001fce3b08cea17c"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060lower.contains(\u0022allow remote automation\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060lower.contains(\u0022allow remote automation\u0022)\u0060 also satisfies \u0060lower.contains(\u0022remote automation\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":"cli/src/browser/safari/safari_manager.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda382ca464abf011c3db70b2f19d2e8abb9c786a70415e617100daeb2c9ac49"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060browser.contains(\u0022edge\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060browser.contains(\u0022edge\u0022)\u0060 also satisfies \u0060browser.contains(\u0022edg\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":"cli/src/browser/chromium/chromium_endpoint.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"322aa2ac5778e01b138ac03d13104b42d66d71285000b7c2179954f1d666e318"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060error.contains(\u0022Agent failed to stop\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060error.contains(\u0022Agent failed to stop\u0022)\u0060 also satisfies \u0060error.contains(\u0022failed to stop\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":"agent/tests/service_startup.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e80852bf0bca7b0bc5e53f115a4e99ea49fbd1df11e46a7486cfec5932d245"}}],"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-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-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-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.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-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-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.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":"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":"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-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-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"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":161,"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."]}]}